Abstract
In shipping services, the goal is to propose cyclical routes which ensure transport of required goods among the main centers of the regions. It is classified as a pickup and delivery problem with split demand and reloading. The objective is to minimize total shipping costs, or the total length of all cyclical routes. The optimum solution gives a number of vehicles going on arcs of the communication network and the amount of goods being transported on the arcs. Consequently, cyclical routes and depots are proposed for all vehicles. First, the multi-graph, in which each directed arc corresponds to exactly one vehicle, is generated. The multi-graph satisfies the condition that the number of arcs entering each node equals the number of arcs exiting the node. The heuristic method of loading goods onto a vehicle in the pickup node and to transport it to the delivery node without reloading onto another vehicle is proposed. The method is verified in the case study carried out on the DHL company.
Similar content being viewed by others
References
Archeti C, Mansini R, Speranza MG (2005) Complexity and reducibility of the skip delivery problem. Transp Sci 39(2): 182–187
Berbeglia G, Cordeau J, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.7359
Bodin L, Mingozzi A, Baldacci R, Ball M (2000) The rollon–rolloff vehicle routing problem. Transp Sci 34(3): 271–288
Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems. Oper Res 43(2): 231–242
Hang X, Zhi-Long CH, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transp Sci 37(3): 347–364
Nowak M, Ergun O, White C III (2008) Pickup and delivery with split loads. Transp Sci 42(1): 32–43
Psaraftis HN (2011) A multi-comodity, capacitated pickup and ndelivery problem: the single and two-vehicle cases. Eur J Oper Res 215(3): 572–580
Saliba S (2006) Heuristics for the lexicographic max-ordering vehicle routing problem. Cent Eur J Oper Res 14(3): 313–336
Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transp Res 29: 17–29
Thangiah SR, Fergany A, Salman A (2007) Real-time split-delivery and delivery time window problems with transfers. Cent Eur J Oper Res 15(4): 329–349
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pelikán, J., Fábry, J. Heuristics for routes generation in pickup and delivery problem. Cent Eur J Oper Res 20, 463–472 (2012). https://doi.org/10.1007/s10100-012-0239-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-012-0239-6