The paired many-to-many pickup and delivery problem: an application

TOP

Volumn 23, Issue 1, 2015, Pages 220-243

  Chen, Huey Kuo ^a   Chou, Huey Wen ^a   Hsueh, Che Fu ^b   Yu, Yen Ju ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b CHING YUN UNIVERSITY   (Taiwan)

Author keywords

Logistics; Paired demands; Transportation; Vehicle routing

Indexed keywords

EID: 84939887038     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-014-0335-y     Document Type: Article

References (48)

1. Agee J, Naper S (2007) Off-site storage: an analysis. Collect Build 26(1):20–25
2. Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36:1693–1702
3. Alvarado-Iniesta A, Garcia-Alcaraz JL, Rodriguez-Borbon MI, Maldonado A (2013) Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Syst Appl 40:4785–4790
4. Apte UM, Mason FM (2006) Analysis and improvement of delivery operations at the San Francisco public library. J Oper Manag 24:325–346
5. Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30:377–387
6. Ben-Akiva M, Lerman S (1985) Discrete choice analysis: theory and application to travel demand. MIT Press, Cambridge
7. Berbeglia G, Cordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202:8–15
8. Berry JN III (2005) The library Haines built. Libr J 130(1):38–41
9. Bhagade AS, Puranik PV (2012) Artificial bee colony (ABC) algorithm for vehicle routing optimization problem. Int J Soft Comput Eng 2:329–333
10. Brajevic I (2011) Artificial bee colony algorithm for the capacitated vehicle routing problem. In: Proceeding ECC’11 proceedings of the 5th European conference on European computing conference, pp 239–244
11. Chen HY (2009) Library vehicle routing problem. Master Thesis, Department of Civil Engineering, National Central University, Chung-Li (in Chinese)
12. Cordeau JF, Laporte G (2003) A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37:579–594
13. Cordeau JF, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153(1):29–46
14. Cordeau JF, Laporte G, Ropke S (2008) Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem. Springer, LLC, New York, pp 327–358
15. Cree CL, Yoon M (2005) Public library circulation decreases, expenditures rise. Am Libr 36(9):57–58
16. Dubberly R (1977) Options to improve delivery. Libr J 102:170–171
17. Fisher M, Jaikumar R (1981) A generalized assignment heuristics for vehicle routing. Networks 11:109–124
18. Fu L (2002) Scheduling dial-a-ride paratransit under time-varying stochastic congestion. Transp Res Part B 36:485–506
19. Fu L (2003) Analytical model for paratransit capacity and quality-of-service analysis. Transp Res Rec 1841:81–89
20. Gajpal Y, Abad P (2009) An ant colony system for vehicle routing problem with simultaneous delivery and pickup. Comput Oper Res 36:3215–3223
21. Gribkovskaia I, Halskau Q, Laporte G, Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Oper Res 180:568–584
22. Hersey DP (2004) The future of access services: should there be one? J Access Serv 2(3):1–6
23. Huesmann J, Downing D (1996) Extending access and delivery (far) beyond the library walls (cover story). Comput Libr 16(4):28–31
24. Ji P, Wu Y (2011) An improved artificial bee colony algorithm for the capacitated vehicle routing problem with time-dependent travel times. In: The 10th international symposium on operations research and its applications (ISORA 2011), Dunhuang, pp 75–82
25. Jorgensen RM, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58:1321–1331
26. Jun Y, Kim BI (2012) New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Syst Appl 39:5641–5648
27. Little JDC, Murty KG, Sweeney DW, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11:972–989
28. Lučić P, Teodorović D (2001) Bee system: modeling combinatorial optimization transportation engineering problems by swarm intelligence. Preprints of the TRISTAN IV triennial symposium on transportation analysis. Sao Miguel, Azores Islands, pp 441–445
29. Lučić P, Teodorović D (2003a) Computing with bees: attacking complex transportation engineering problems. Int J Artif Intell Tools 12:375–394
30. Lučić P, Teodorović D (2003b) Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach. In: Verdegay JL (ed) Fuzzy sets optimization. Springer-Verlag, Heidelberg, pp 67–82
31. Lučić P, Teodorović D (2002) Transportation modeling: an artificial life approach. In: Proceedings of the 14th IEEE international conference on tools with artificial intelligence, Washington, pp 216–223
32. Luo Y, Schonfeld P (2007) A rejected-reinsertion heuristic for the static dial-a-ride problem. Transp Res Part B 41:736–755
33. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res Part A 23:377–386
34. Monroe W (2005) Libraries return on investment study. Libr Mosaics 16(5):12–13
35. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems, Part II: transportation between pickup and delivery locations. J Betr 58:81–117
36. Parragh SN, Doerner KF, Hartl RF (2010) Variable neighborhood search for the dial-a-ride problem. Comput Oper Res 37:1129–1138
37. Parragh S, Schmid V (2013) Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput Oper Res 40(1):490–497
38. Ryder J (2004) Can’t get to the library? Then we will come to you. A survey of library services to people in their own homes in the United Kingdom. Health Inf Libr J 21:5–13
39. Şahin M, Aksu DT, Çavuşlar G, Öncan T, Şahin G (2012) An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads. Transp Res Part C 27:169–178
40. Shi YJ, Meng FW, Shen GJ (2012) A modified artificial bee colony algorithm for vehicle routing problems with time windows. Inf Technol J 11:1490–1495
41. Stephens C, Franklin P (2005) To circulate or not to circulate: that is the question!. School Libr Media Act Mon 22(1):43–44
42. Subramanian A, Uchoa E, Pessoa AA, Ochi LS (2011) Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper Res Lett 39:338–341
43. Szeto WY, Wu Y, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215:126–135
44. Teodorovi D, Lučić P, Marković G, Dell’Orco M (2006) Bee colony optimization: principles and applications. In: Reljin B, Stankovic’ S (eds) Proceedings of the eighth seminar on neural network applications in electrical engineering—NEUREL 2006. University of Belgrade, Belgrade, pp 151–156
45. Teodorovi D (2008) Swarm intelligence systems for transportation engineering: principles and applications. Transp Res Part C 16:651–667
46. Wright LA (2001) Public library circulation and spending increase. Am Libr 32(9):64–65
47. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2010) An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. Eur J Oper Res 202:401–411
48. Zhang NZ, Sun GH, Wu YH and Geng FH (2009) A modified particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. In: Proceedings of the 7th Asian control conference, pp 1679–1684