Food rescue and delivery: Heuristic algorithm for periodic unpaired pickup and delivery vehicle routing problem

Transportation Research Record

Volumn 2548, Issue , 2016, Pages 81-89

  Nair, Divya Jayakumar ^a   Grzybowska, Hanna ^a   Rey, David ^a   Dixit, Vinayak ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CONSTRAINT SATISFACTION PROBLEMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMAL SYSTEMS; PICKUPS; PROBLEM SOLVING; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

DELIVERY VEHICLE; HEURISTICS ALGORITHM; MULTIPLE DELIVERIES; NON NEGATIVES; OPTIMAL SOLUTIONS; PERIODIC VEHICLE ROUTING PROBLEM; PICKUP AND DELIVERY; SINGLE PRODUCT; SOLUTION APPROACH; VEHICLE ROUTING PROBLEMS;

HEURISTIC ALGORITHMS;

EID: 84988458253     PISSN: 03611981     EISSN: 21694052     Source Type: Journal    
DOI: 10.3141/2548-10     Document Type: Article

References (39)

1. Beltrami, E. J., and L. D. Bodin. Networks and Vehicle Routing for Municipal Waste Collection. Networks, Vol. 4, No. 1, 1974, pp. 65-94.
2. Francis, P., K. Smilowitz, and M. Tzur. The Period Vehicle Routing Problem with Service Choice. Transportation Science, Vol. 40, No. 4, 2006, pp. 439-454.
3. Alegre, J., M. Laguna, and J. Pacheco. Optimizing the Periodic Pick-Up of Raw Materials for a Manufacturer of Auto Parts. European Journal of Operational Research, Vol. 179, No. 3, 2007, pp. 736-746.
4. Davis, L. B., I. Sengul, J. S. Ivy, L. G. Brock III, and L. Miles. Scheduling Food Bank Collections and Deliveries to Ensure Food Safety and Improve Access. Socio-Economic Planning Sciences, Vol. 48, No. 3, 2014, pp. 175-188.
5. Tzoreff, T. E., D. Granot, F. Granot, and G. Sosic. The Vehicle Routing Problem with Pickups and Deliveries on Some Special Graphs. Discrete Applied Mathematics, Vol. 116, No. 3, 2002, pp. 193-229.
6. Li, H., and A. Lim. A Metaheuristic for the Pickup and Delivery Problem with Time Windows. In Proceedings of the 13th International Conference on Tools with Artificial Intelligence, 2001.
7. Nanry, W. P., and J. W. Barnes. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search. Transportation Research Part B: Methodological, Vol. 34, No. 2, 2000, pp. 107-121.
8. Hernández-Pérez, H., I. Rodríguez-Martín, and J.-J. Salazar-González. A Hybrid GRASP/VND Heuristic for the One-Commodity Pickupand-Delivery Traveling Salesman Problem. Computers and Operations Research, Vol. 36, No. 5, 2009, pp. 1639-1645.
9. Hernández-Pérez, H., and J.-J. Salazar-González. A Branch-and-Cut Algorithm for a Traveling Salesman Problem with Pickup and Delivery. Discrete Applied Mathematics, Vol. 145, No. 1, 2004, pp. 126-139.
10. Hernández-Pérez, H., and J.-J. Salazar-González. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Transportation Science, Vol. 38, No. 2, 2004, pp. 245-255.
11. End Hunger Report. Foodbank. http://www.foodbank.org.au/wp-content /uploads/2014/10/Foodbank-Hunger-Report2014.pdf.
12. Nair, D. J., D. Rey, and V. Dixit. Models for Food Rescue and Delivery: Routing and Resource Allocation Problem. Presented at 95th Annual Meeting of the Transportation Research Board, Washington, D.C., 2016.
13. Balcik, B., S. Iravani, and K. Smilowitz. Multi-Vehicle Sequential Resource Allocation for a Nonprofit Distribution System. IIE Transactions, Vol. 46, No. 12, 2014, pp. 1279-1297.
14. Lien, R. W., S. M. R. Iravani, and K. R. Smilowitz. Sequential Resource Allocation for Nonprofit Operations. Operations Research, Vol. 62, No. 2, 2014, pp. 301-317.
15. Campbell, A. M., D. Vandenbussche, and W. Hermann. Routing for Relief Efforts. Transportation Science, Vol. 42, No. 2, 2008, pp. 127-145.
16. Russell, R., and W. Igo. An Assignment Routing Problem. Networks, Vol. 9, No. 1, 1979, pp. 1-17.
17. Christofides, N., and J. E. Beasley. The Period Routing Problem. Networks, Vol. 14, No. 2, 1984, pp. 237-256.
18. Tan, C. C. R., and J. E. Beasley. A Heuristic Algorithm for the Period Vehicle Routing Problem. Omega, Vol. 12, No. 5, 1984, pp. 497-504.
19. Russell, R. A., and D. Gribbin. A Multiphase Approach to the Period Routing Problem. Networks, Vol. 21, No. 7, 1991, pp. 747-765.
20. Chao, I.-M., B. L. Golden, and E. Wasil. An Improved Heuristic for the Period Vehicle Routing Problem. Networks, Vol. 26, No. 1, 1995, pp. 25-44.
21. Cordeau, J.-F., M. Gendreau, and G. Laporte. A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks, Vol. 30, No. 2, 1997, pp. 105-119.
22. Drummond, L. M. A., L. S. Ochi, and D. S. Vianna. An Asynchronous Parallel Metaheuristic for the Period Vehicle Routing Problem. Future Generation Computer Systems, Vol. 17, No. 4, 2001, pp. 379-386.
23. Hemmelmayr, V. C., K. F. Doerner, and R. F. Hartl. A Variable Neighborhood Search Heuristic for Periodic Routing Problems. European Journal of Operational Research, Vol. 195, No. 3, 2009, pp. 791-802.
24. Matos, A. C., and R. C. Oliveira. An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem. In Ant Colony Optimization and Swarm Intelligence (M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, eds.), Springer, Berlin, 2004, pp. 286-293.
25. Martinovic, G., I. Aleksi, and A. Baumgartner. Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service. Mathematical Problems in Engineering, Vol. 2008, 2009, e697981.
26. Mladenovic, N., D. Urosevic, S. Hanafi, and A. Ilic. A General Variable Neighborhood Search for the One-Commodity Pickup-and-Delivery Travelling Salesman Problem. European Journal of Operational Research, Vol. 220, No. 1, 2012, pp. 270-285.
27. Zhao, F., S. Li, J. Sun, and D. Mei. Genetic Algorithm for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Computers and Industrial Engineering, Vol. 56, No. 4, 2009, pp. 1642-1648.
28. Chen, Q., K. Li, and Z. Liu. Model and Algorithm for an Unpaired Pickup and Delivery Vehicle Routing Problem with Split Loads. Transportation Research Part E: Logistics and Transportation Review, Vol. 69, 2014, pp. 218-235.
29. Gillett, B. E., and L. R. Miller. A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations Research, Vol. 22, No. 2, 1974, pp. 340-349.
30. Bartholdi, J. J., L. K. Platzman, R. L. Collins, and W. H. Warden. A Minimal Technology Routing System for Meals on Wheels. Interfaces, Vol. 13, No. 3, 1983, pp. 1-8.
31. Yildiz, H., M. P. Johnson, and S. Roehrig. Planning for Meals-on-Wheels: Algorithms and Application. Journal of the Operational Research Society, Vol. 64, No. 10, 2013, pp. 1540-1550.
32. Wong, D. W. S., and J. W. Meyer. A Spatial Decision Support System Approach to Evaluate the Efficiency of a Meals-on-Wheels Program. Professional Geographer, Vol. 45, No. 3, 1993, pp. 332-341.
33. Gorr, W., M. Johnson, and S. Roehrig. Spatial Decision Support System for Home-Delivered Services. Journal of Geographical Systems, Vol. 3, No. 2, 2001, pp. 181-197.
34. Yildiz, H., M. Johnson, and S. Roehrig. A Genetic Algorithm for the Home-Delivered Meals Location-Routing Problem. Heinz College Research, Carnegie Mellon University, Pittsburgh, Pa., 2005.
35. Solak, S., C. Scherrer, and A. Ghoniem. The Stop-and-Drop Problem in Nonprofit Food Distribution Networks. Annals of Operations Research, Vol. 221, No. 1, 2012, pp. 407-426.
36. Miller, C. E., A. W. Tucker, and R. A. Zemlin. Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM, Vol. 7, No. 4, 1960, pp. 326-329.
37. IBM ILOG CPLEX Optimization Studio V12.6.1 Documentation. http://www-01.ibm.com/support/knowledgecenter/api/content/nl /en-us/SSSA5P-12.6.1/ilog.odms.studio.help/Optimization-Studio /topics/COS-home.html. Accessed Oct. 24, 2015.
38. Gay, D. M., and B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Cengage Learning, Independence, Ky., 2002.
39. Solomon, M. M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, Vol. 35, No. 2, 1987, pp. 254-265.