Heuristics for routes generation in pickup and delivery problem

Central European Journal of Operations Research

Volumn 20, Issue 3, 2012, Pages 463-472

  Pelikán, Jan ^a   Fábry, Jan ^a  

^a UNIVERSITY OF ECONOMICS   (Czech Republic)

Author keywords

Heuristic method; Integer programming; Pickup and delivery problem

Indexed keywords

EID: 84864418418     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-012-0239-6     Document Type: Article

References (10)

1. Archeti C, Mansini R, Speranza MG (2005) Complexity and reducibility of the skip delivery problem. Transp Sci 39(2): 182-187.
2. 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.
3. Bodin L, Mingozzi A, Baldacci R, Ball M (2000) The rollon-rolloff vehicle routing problem. Transp Sci 34(3): 271-288.
4. Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems. Oper Res 43(2): 231-242.
5. Hang X, Zhi-Long CH, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transp Sci 37(3): 347-364.
6. Nowak M, Ergun O, White C III (2008) Pickup and delivery with split loads. Transp Sci 42(1): 32-43.
7. 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.
8. Saliba S (2006) Heuristics for the lexicographic max-ordering vehicle routing problem. Cent Eur J Oper Res 14(3): 313-336.
9. Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transp Res 29: 17-29.
10. 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.