Abstract
In this research we present the design and implementation of heuristics for solving split-delivery pickup and delivery time window problems with transfer (SDPDTWP) of shipments between vehicles for both static and real-time data sets. In the SDPDTWP each shipment is constrained with the earliest possible pickup time from the origin and the latest acceptable delivery time to a destination. Split-deliveries occur when two or more vehicles service the same origin or destination. The proposed heuristics were applied to both static and real-time data sets. The heuristics computed a solution, in a few seconds, for a static problem from the literature, achieving an improvement of 60% in distance in comparison to the published solution. In the real-time SDPDTWP problems, requests for pickup and delivery of a package, breakdown of a truck or insertion of a truck can occur after the vehicle has left the origin and is enroute to service the customers. Thirty data sets, each consisting of one to seven real-time customer or truck events, were used to test the efficiency of the heuristics. The heuristics obtained solutions to real-time data sets in under five seconds of CPU time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bodin L, Golden BL and Assad AA (1983). The state of the art in the routing and scheduling of vehicles and crews. Comput Oper Res 10: 63–211
Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2002a) The VRP with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. Society for Industrial and Applied Mathematics, pp 157–193
Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002b). A guide to vehicle routing heuristics. J Oper Res Soc 53: 512–522
Cordeau J-F, Laporte G (2003) The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Belgian, French and Italian). 4OR Q J Oper Res Soc 1:89–101
Frederickson GN, Hecht MS and Kim CE (1978). Approximation algorithms for some routing problems. SIAM J Comput 7: 178–193
Garey MR, Johnson DS (1976) Approximation algorithms for combinatorial problems: an annotated bibliography. In: Traub JF (ed) Algorithms and complexity: recent result and new directions. Academic, London, pp 41–52
Gendreau M, Guertin F, Potvin J-Y and Taillard E (1999). Parallel Tabu search for real-time vehicle routing and dispatching. Transp Sci 33: 381–390
Jaw JW, Odoni OR, Psaraftis P and Wilson NH (1986). A heuristic algorithm for multiple-vehicle advance request dial-a-ride problem with time windows. Transp Res 20: 243–257
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher WM (eds) Complexity of computer computations. Plenum Press, New York, pp 85–104
Laporte G (1992a). The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59: 231–247
Laporte G (1992b). The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59: 345–358
Laporte G and Osman IH (1995). Routing problems: a bibliography. Ann Oper Res 61: 227–262
Lenstra J and Rinnooy Kan AHG (1981). Complexity of the vehicle routing and scheduling problems. Networks 11: 221–228
Potvin J-Y, Thangiah SR (1999) Vehicle routing through simulation of natural processes. In: Jain LC, Martin NM (eds) Fusion of neural networks, fuzzy sets and genetic algorithm. CRC Press, pp 143–165
Psaraftis HN (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 2: 130–150
Psaraftis HN (1983a). An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 3: 351–357
Psaraftis HN (1983b). Analysis of O(N2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem. Transp Res B 17: 133–145
Psaraftis HN (1988) Dynamic vehicle routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North Holland, Amsterdam, pp 223–248
Savelsbergh MWP and Sol M (1995). The general pickup and delivery problem. Transp Sci 29: 17–29
Shang JS and Cuff CK (1996). Multicriteria pickup and delivery problem with transfer opportunity. J Comput Ind Eng 30: 631–645
Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254–265
Thangiah SR, Petrovic P (1998) Introduction to genetic heuristics and vehicle routing problems with complex constraints. In: Woodruff D (ed) Advances in computational and stochastic optimization, logic programming, and heuristic search. Kluwer, pp 253–286
Wilson NHM, Colvin NH (1977) Computer control of Rochester dial-a-ride system. Report R77-30, Department of Civil Engineering, MIT, Cambridge
Wilson NHM, Sussman JM (1971) Scheduling algorithms for dial-a-ride systems. Urban Systems Laboratory report USL TR-70-13. MIT, Cambridge
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Thangiah, S.R., Fergany, A. & Awan, S. Real-time split-delivery pickup and delivery time window problems with transfers. cent.eur.j.oper.res. 15, 329–349 (2007). https://doi.org/10.1007/s10100-007-0035-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-007-0035-x