Abstract
Transport problems are generally rather complex. The number of temporal, material, social and economic constraints makes it difficult to solved it both in theory (the problem is NP-complet) and in practice.
This paper presents a pick-up and delivery transportation problem with time window and heterogeneous fleet of vehicles. Its objective is to provide an efficient schedule for drivers and the best service for users with the lower cost. This paper will explain the methodology used to compute and optimise the driver schedule. The goal is to assign more than eight hundreds fares to about forty drivers using thirty vehicles.
Constraints programming approach makes it possible to treat instantaneously the local insertion of one journey in an optimised way. This local insertion was simply solved by an engine of constraints resolution in 1996 [MS88]. In addition, this method allows also the local insertion of several transports which was used to implement a total optimization of the schedule as a multitude of local displacements of few transports.
This method becomes too slow when it moves more and more transport to improve quality of the solution. In this paper, a parallel solution, based on PVM, is introduced and some interesting results are provided. It is now possible to manage the collaboration of independent optimization engines working with different parameters. Experimentally, this robust solution is most of the time able to provide the best known sequential result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajili, F., Castro, C., Domenjoud, E., Kirchner, C.: Rapport de fin de pré-étude du problème d’affectation des courses pour le GIHPChampagne. Rapport de fin de contrat (November 1996)
Bessiere, C., Cordier, M.-O.: Arc-consistency and arcconsitency again. In: Meyer, M. (ed.) Proceedings ECAI 1994 Workshop on Constraint Processing, Amsterdam (1994)
Bachelet, V., Hafidi, Z., Preux, P., Talbi, E.-G.: Vers la coopération des métaheuristiques. Calculateurs parallèles, réseaux et systèmes répartis, 9(2) (1998) (in french)
Baptiste, P., Le Pape, C., Kluwer, W.N.: constraint based scheduling: applying constraint programming to scheduling problems. International Series in Operations Research and Management Sciences, vol. 39 (2001)
Cung, V.-D., Martins, S.L., Robeiro, C.C., Roucairol, C.: Strategies for the parallel implementation of metaheuristics. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, Kluwer, Dordrecht (2001)
Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems (1997)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Domenjoud, E., Kirchner, C., Zhou, J.: Generating Feasible Schedules for a Pick-Up and Delivery Problem. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 467. Springer, Heidelberg (1998)
Domenjoud, E., Kirchner, C., Zhou, J.: Le manuel de ROUTER. LORIA (October 1998)
Domenjoud, E., Kirchner, C., Zhou, J.: The ROUTER transport scheduling system. Technical report, LORIA (October 1998)
Dréo, J., Pétrowski, A., Siarry, P., Taillard, E.: Métaheuristiques pour l’optimisation difficile. Eyrolles, French book (2003)
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: Pvm 3 user’s guide and reference manual. Technical report, Oak Ridge National Laboratory (September 1994)
Holland, J.H.: Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975)
Marriott, K., Stuckey, P.J.: Programming with constraints: an introduction. MIT Press, Cambridge (1988)
Osman, I., Laporte, G.: Metaheuristics in combinatorial optimization (1996)
Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9, 268–299 (1993)
Rossi, F.: Constraint logic programming (2000)
Zhou, J.: A Unified Framework for Solving Boolean, Integer and Set Constraints. In: Third International Conference on Systems Science and Systems Engineering, Beijing, China, August 1998, pp. 205–210. Scientific and Technical Documents Publishing House (1998)
Zhou, J.: The Manual of NCL - Version 1.2. Loria, Campus Scientifique - BP 239, 54506, Vandoeuvre-les-Nancy, France (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Renard, A., Krajecki, M., Bui, A. (2006). On-Request Urban Transport Parallel Optimization. In: Böhme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds) Innovative Internet Community Systems. IICS 2004. Lecture Notes in Computer Science, vol 3473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553762_25
Download citation
DOI: https://doi.org/10.1007/11553762_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28880-0
Online ISBN: 978-3-540-33995-3
eBook Packages: Computer ScienceComputer Science (R0)