Abstract
The Dial–A–Ride Problem (DARP) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. This paper addresses a variant of the DARP where requests can change of vehicle during their trip. This transshipment is made on specific locations called “transfer points”. The corresponding problem is called the Dial–A–Ride Problem with Transfers (DARPT). Solving the DARPT yields modeling and algorithmic difficulties. In this paper, we focus on efficiently checking the feasibility of routes with regards to the problem temporal constraints in a Large Neighborhood Search. This feasibility problem is a Simple Temporal Problem, well studied in particular in Artificial Intelligence [8]. We propose necessary and sufficient conditions to fasten the detection of unfeasible or feasible routes.
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
Berbeglia, G., Cordeau, J.-F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1), 8–15 (2010)
Berbeglia, G., Pesant, G., Rousseau, L.-M.: Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming. Transportation Science 45(3), 399–412 (2011)
Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: 17th National Conference on Artificial Intelligence, AAAI/IAAI, pp. 742–747 (2000)
Cherkassky, B.V., Georgiadis, L., Goldberg, A.V., Tarjan, R.E., Werneck, R.F.F.: Shortest Path Feasibility Algorithms: An Experimental Evaluation. In: ALENEX, pp. 118–132 (2008)
Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological 37(6), 579–594 (2003)
Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153, 29–46 (2007)
Cortés, C.E., Matamala, M., Contardo, C.: The pickup and delivery problem with transfers: Formulation and a Branch-and-Cut Solution Method. European Journal of Operational Research 200(3), 711–724 (2010)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49(1-3), 61–95 (1991)
Drexl, M.: Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints. Tech. Rep. LM-2011-02, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz (2011)
Jain, S., Van Hentenryck, P.: Large Neighborhood Search for Dial-a-Ride Problems. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 400–413. Springer, Heidelberg (2011)
Masson, R., Lehuédé, F., Péton, O.: An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers. Submitted to Transportation Science (2011)
Masson, R., Lehuédé, F., Péton, O.: A tabu search algorithm for the Dial-a-Ride Problem with Transfers. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, pp. 1224–1232 (2011)
Mitrović-Minić, S., Laporte, G.: The pickup and delivery problem with time windows and transshipment. INFOR 44(3), 217–228 (2006)
Neumann, K., Schwindt, C., Zimmermann, J.: Resource-Constrained Project Scheduling with Time Windows. In: Józefowska, J., Weglarz, J. (eds.) Perspectives in Modern Project Scheduling. International Series in Operations Research & Management Science, pp. 375–407 (2006)
Paquette, J., Cordeau, J.-F., Laporte, G.: Quality of service in dial-a-ride operations. Computers & Industrial Engineering 56, 1721–1734 (2008)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 37, 1129–1138 (2010)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34(8), 2403–2435 (2007)
Ropke, S., Pisinger, D.: An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science 40(4), 455–472 (2006)
Savelsbergh, M.W.P.: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration. ORSA Journal on Computing 2(4), 146–154 (1992)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Shostak, R.: Deciding Linear Inequalities by Computing Loop Residues. Journal of the Association for Computing Machinery 28(4), 769–779 (1981)
Tarjan, R.E.: Shortest-Paths. Tech. rep., AT&T Bell Laboratories, Murray Hill, NJ (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masson, R., Lehuédé, F., Péton, O. (2012). Simple Temporal Problems in Route Scheduling for the Dial–a–Ride Problem with Transfers. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds) Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. CPAIOR 2012. Lecture Notes in Computer Science, vol 7298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29828-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-29828-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29827-1
Online ISBN: 978-3-642-29828-8
eBook Packages: Computer ScienceComputer Science (R0)