The selective pickup and delivery problem: Formulation and a memetic algorithm

International Journal of Production Economics

Volumn 141, Issue 1, 2013, Pages 199-211

  Ting, Chuan Kang ^a   Liao, Xin Lan ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Evolutionary computation; Logistics; Memetic algorithm; Pickup and delivery

Indexed keywords

CANDIDATE SOLUTION; CONVERGENCE SPEED; LOCAL SEARCH; LOGISTIC INDUSTRY; MEMETIC ALGORITHMS; NP-HARD; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEMS; PROBLEM FORMULATION; REAL-WORLD APPLICATION; ROUTE LENGTH; SOLUTION QUALITY; TEST INSTANCES; TRANSPORTATION COST; VEHICLE ROUTING PROBLEMS;

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; PICKUPS; TABU SEARCH;

LOGISTICS;

EID: 84869489220     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2012.06.009     Document Type: Article

References (67)

1. T. Ai, and V. Kachitvichyanukul A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery Computers & Operations Research 36 5 2009 1693 1702
2. S. Anily, and J. Bramel Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries Naval Research Logistics 46 6 1999 654 670
3. S. Anily, M. Gendreau, and G. Laporte The preemptive swapping problem on a tree Networks 58 2 2011 83 94
4. S. Anily, and R. Hassin The swapping problem Networks 22 4 1992 419 433
5. T. Bäck, D.B. Fogel, and Z. Michalewicz Handbook of Evolutionary Computation 1997 Institute of Physics Publishing and Oxford University Press
6. R. Baldacci, E. Bartolini, and A. Mingozzi An exact algorithm for the pickup and delivery problem with time windows Operations Research 59 2 2011 414 426
7. G. Berbeglia, J.F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 2007 1 31
8. G. Berbeglia, and G. Hahn Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #p-complete Discrete Applied Mathematics 157 11 2009 2541 2547
9. C. Bordenave, M. Gendreau, and G. Laporte A branch-and-cut algorithm for the nonpreemptive swapping problem Naval Research Logistics 56 5 2009 478 486
10. C. Bordenave, M. Gendreau, and G. Laporte Heuristics for the mixed swapping problem Computers & Operations Research 37 1 2010 108 114
11. B. Çatay A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery Expert Systems with Applications 37 10 2010 6809 6817
12. P. Chalasani, and R. Motwani Approximating capacitated routing and delivery problems SIAM Journal on Computing 28 6 1999 2133 2149
13. B.-S. Cheung, K. Choy, C.-L. Li, W. Shi, and J. Tang Dynamic routing model and solution methods for fleet management with mobile technologies International Journal of Production Economics 113 2 2008 694 705
14. J.-F. Cordeau, M. Dell'Amico, and M. Iori Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading Computers & Operations Research 37 5 2010 970 980
15. J.-F. Cordeau, M. Iori, G. Laporte, and J. Salazar-González A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading Networks 55 1 2010 46 59
16. J.-F. Cordeau, G. Laporte, and S. Ropke Recent models and algorithms for one-to-one pickup and delivery problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series vol. 43 2008 Springer 327 357
17. C. Cortés, M. Matamala, and C. Contardo The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method European Journal of Operational Research 200 3 2010 711 724
18. Davis, L.; 1985. Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 162-164.
19. K. Deb An efficient constraint handling method for genetic algorithms Computer Methods in Applied Mechanics and Engineering 186 2-4 2000 311 338
20. C. Duhamel, J. Potvin, and J. Rousseau A tabu search heuristic for the vehicle routing problem with backhauls and time windows Transportation Science 31 1 1997 49 59
21. I. Dumitrescu, S. Ropke, J.-F. Cordeau, and G. Laporte The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm Mathematical Programming 121 2010 269 305
22. A.E. Eiben, and J.E. Smith Introduction to Evolutionary Computing. Natural Computing 2003 Springer
23. G. Erdoǧan, J.-F. Cordeau, and G. Laporte The pickup and delivery traveling salesman problem with first-in-first-out loading Computers & Operations Research 36 6 2009 1800 1808
24. G. Erdoǧan, J.-F. Cordeau, and G. Laporte A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem Discrete Applied Mathematics 158 15 2010 1599 1614
25. Falcon, R.; Li, X.; Nayak, A.; Stojmenovic, I.; 2010. The one-commodity traveling salesman problem with selective pickup and delivery: an ant colony approach. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC2010), pp. 4326-4333.
26. A. Garcia-Najera The vehicle routing problem with backhauls: a multi-objective evolutionary approach J.-K. Hao, M. Middendorf, Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science vol. 7245 2012 Springer 255 266
27. M. Gendreau, A. Hertz, and G. Laporte The traveling salesman problem with backhauls Computers & Operations Research 23 5 1996 501 508
28. M. Gendreau, G. Laporte, and D. Vigo Heuristics for the traveling salesman problem with pickup and delivery Computers & Operations Research 26 7 1999 699 714
29. Goksal, F.; Karaoglan, I.; Altiparmak, F. A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers & Industrial Engineering, http://dx.doi.org/10.1016/j. cie.2012.01.00, in press.
30. P. Gonzalez-Torre, B. Adenso-Diaz, and H. Artiba Environmental and reverse logistics policies in European bottling and packaging firms International Journal of Production Economics 88 1 2004 95 104
31. I. Gribkovskaia, O. Halskau, G. Laporte, and M. Vlček General solutions to the single vehicle routing problem with pickups and deliveries European Journal of Operational Research 180 2 2007 568 584
32. Gribkovskaia, I.; Halskau, O.; Myklebost, K.; 2001. Models for pick-up and deliveries from depots with lasso solutions. In: Stefansson, G.; Tilanus, B. (Eds.), Proceedings of the 13th Annual Conference on Logistics Research - NOFOMA 2001 Collaboration in Logistics: Connecting Islands of Technology, pp. 279-293.
33. I. Gribkovskaia, and G. Laporte One-to-many-to-one single vehicle pickup and delivery problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series vol. 43 2008 Springer 359 377
34. I. Gribkovskaia, G. Laporte, and A. Shyshou The single vehicle routing problem with deliveries and selective pickups Computers & Operations Research 35 9 2008 2908 2924
35. G. Gutiérrez-Jarpa, G. Desaulniers, G. Laporte, and V. Marianov A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows European Journal of Operational Research 206 2 2010 341 349
36. Hart, W.E.; Krasnogor, N.; Smith, J.E. (Eds.), 2004. Recent Advances in Memetic Algorithms. Springer.
37. G. Heilporn, J.-F. Cordeau, and G. Laporte An integer L-shaped algorithm for the dial-a-ride problem with stochastic customer delays Discrete Applied Mathematics 159 9 2011 883 895
38. H. Hernández-Pérez, I. Rodríguez-Martín, and J. Salazar-González A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem Computers & Operations Research 36 5 2009 1639 1645
39. H. Hernández-Pérez, and J. Salazar-González The one-commodity pickup-and-delivery travelling salesman problem M. Jünger, G. Reinelt, G. Rinaldi, Combinatorial Optimization - Eureka, You Shrink!, Lecture Notes in Computer Science vol. 2570 2003 Springer 89 104
40. H. Hernández-Pérez, and J. Salazar-González A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Discrete Applied Mathematics 145 1 2004 126 139
41. H. Hernández-Pérez, and J. Salazar-González Heuristics for the one-commodity pickup-and-delivery traveling salesman problem Transportation Science 38 2 2004 245 255
42. H. Hernández-Pérez, and J. Salazar-González The multi-commodity one-to-one pickup-and-delivery traveling salesman problem European Journal of Operational Research 196 3 2009 987 995
43. A. Hoff, I. Gribkovskaia, G. Laporte, and A. Lokketangen Lasso solution strategies for the vehicle routing problem with pickups and deliveries European Journal of Operational Research 192 3 2009 755 766
44. M.N. Le, Y.S. Ong, Y. Jin, and B. Sendhoff Lamarckian memetic algorithms: local optimum and connectivity structure analysis Memetic Computing Journal 1 3 2009 175 190
45. F. Louveaux, and J. Salazar-González On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands Mathematical Programming 119 1 2009 169 194
46. R. Meuth, M.H. Lim, Y.S. Ong, and D.C. Wunsch A proposition on memes and meta-memes in computing for higher-order learning Memetic Computing Journal 1 2 2009 85 100
47. A. Mutha, and S. Pokharel Strategic network design for reverse logistics and remanufacturing using new and old product modules Computers & Industrial Engineering 56 1 2009 334 346
48. Y.S. Ong, N. Krasnogor, and H. Ishibuchi Special issue on memetic algorithms IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 37 1 2007 2 5
49. Y.S. Ong, M.H. Lim, and X.S. Chen Research frontier: memetic computation - past, present & future IEEE Computational Intelligence Magazine 5 2 2010 24 36
50. Y.S. Ong, M.H. Lim, N. Zhu, and K.W. Wong Classification of adaptive memetic algorithms: a comparative study IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 36 1 2006 141 152
51. K. Pang, Z. Xu, and C. Li Ship routing problem with berthing time clash avoidance constraints International Journal of Production Economics 131 2 2011 752 762
52. S. Parragh, K. Doerner, and R. Hartl A survey on pickup and delivery problems - part i: transportation between customers and depot Journal für Betriebswirtschaft 58 2008 21 51
53. S. Parragh, K. Doerner, and R. Hartl A survey on pickup and delivery problems - part ii: transportation between pickup and delivery locations Journal für Betriebswirtschaft 58 2008 81 117
54. H. Psaraftis A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases European Journal of Operational Research 215 2011 572 580
55. J. Renaud, F. Boctor, and G. Laporte Perturbation heuristics for the pickup and delivery traveling salesman problem Computers & Operations Research 29 9 2002 1129 1141
56. J. Renaud, F. Boctor, and J. Ouenniche A heuristic for the pickup and delivery traveling salesman problem Computers & Operations Research 27 9 2000 905 916
57. S. Ropke, and J.-F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
58. J. Shang, and C. Cuff Multicriteria pickup and delivery problem with transfer opportunity Computers & Industrial Engineering 30 4 1996 631 645
59. A. Sinha, Y.-P. Chen, and D.E. Goldberg Designing efficient genetic and evolutionary algorithm hybrids W.E. Hart, N. Krasnogor, J. Smith, Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing vol. 166 2004 Springer 259 288
60. A. Subramanian, L. Drummond, C. Bentes, L. Ochi, and R. Farias A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery Computers & Operations Research 37 11 2010 1899 1911
61. A. Subramanian, E. Uchoa, A. Pessoa, and L. Ochi Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery Operations Research Letters 39 2011 338 341
62. P. Toth, and D. Vigo An exact algorithm for the vehicle routing problem with backhauls Transportation Science 31 4 1997 372 385
63. Tu, D.; Guo, S.; Qin, H.; Oon, W.; Lim, A.; 2010. The tree representation of feasible solutions for the TSP with pickup and delivery and LIFO loading. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI2010), pp. 191-196.
64. Wang, H.; Chen, Y. A coevolutionary algorithm for the flexible delivery and pickup problem with time windows. International Journal of Production Economics, http://dx.doi.org/10.1016/j.ijpe.2012.04.011, in press.
65. R. Zhang, W. Yun, and I. Moon A reactive tabu search algorithm for the multi-depot container truck transportation problem Transportation Research Part E: Logistics and Transportation Review 45 6 2009 904 914
66. R. Zhang, W. Yun, and I. Moon Modeling and optimization of a container drayage problem with resource constraints International Journal of Production Economics 133 1 2011 351 359
67. F. Zhao, S. Li, J. Sun, and D. Mei Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem Computers & Industrial Engineering 56 4 2009 1642 1648