Scheduling and routing models for food rescue and delivery operations

Socio-Economic Planning Sciences

Volumn 63, Issue , 2018, Pages 18-32

  Nair, D J ^a   Grzybowska, H ^a   Fu, Y ^a   Dixit, V V ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Food rescue and delivery; Periodic vehicle routing problem; Tabu search; Unpaired pickup and delivery vehicle routing problem

Indexed keywords

ALGORITHM; FOOD AID; FOOD SUPPLY; HEURISTICS; HUNGER; LINEAR PROGRAMING; NONPROFIT ORGANIZATION; PLANNING METHOD; RESOURCE ALLOCATION; ROUTING; TRANSPORTATION SYSTEM; WELFARE PROVISION;

AUSTRALIA; NEW SOUTH WALES; SYDNEY [NEW SOUTH WALES];

EID: 85020492314     PISSN: 00380121     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.seps.2017.06.003     Document Type: Article

References (48)

1. Nair, D.J., Rashidi, T.H., Dixit, V.V., Estimating surplus food supply for food rescue and delivery operations. Socio-Econ Plan Sci 57 (2017), 73–83.
2. Nair, D.J., Grzybowska, H., Rey, D., Dixit, V., Food rescue and delivery. Transp Res Rec J Transp Res Board 2548 (2016), 81–89, 10.3141/2548-10.
3. Glover, Fred, Tabu Search—Part I. ORSA J Comput 1 (1989), 190–206, 10.1287/ijoc.1.3.190.
4. Nair, D.J., Rey, D., Dixit, V., Valenta, T., Models for food rescue and delivery: routing and resource allocation problem. Transportation research board 95th annual meeting, 2016 (No. 16–2584).
5. Bartholdi, John J., Platzman, Loren K., Collins, R. Lee, Warden, William H., A minimal Technology routing system for meals on wheels. Interfaces 13:3 (1983), 1–8, 10.1287/inte.13.3.1.
6. Yildiz, H., Johnson, M., Roehrig, S., A genetic algorithm for the home-delivered meals location-routing problem. Heinz Coll Res, 2005.
7. Wong, David W.S., Meyer, Judith W., A spatial decision support system approach to evaluate the efficiency of a meals-on-wheels Program∗. Prof Geogr 45:3 (1993), 332–341, 10.1111/j.0033-0124.1993.00332.x.
8. Yildiz, H., Johnson, M.P., Roehrig, S., Planning for meals-on-wheels: algorithms and application. J Oper Res Soc 64:10 (2013), 1540–1550, 10.1057/jors.2012.129.
9. Gorr, Wilpen, Johnson, Michael, Roehrig, Stephen, Spatial decision support system for home-delivered services. J Geogr Syst 3:2 (2001), 181–197, 10.1007/pl00011474.
10. Balcik, Burcu, Beamon, Benita, Smilowitz, Karen, Last mile distribution in humanitarian relief. J Intell Transp Syst 12:2 (2008), 51–63, 10.1080/15472450802023329.
11. Balcik, Burcu, Iravani, Seyed, Smilowitz, Karen, Multi-vehicle sequential resource allocation for a nonprofit distribution system. IIE Trans 46:12 (2014), 1279–1297, 10.1080/0740817x.2013.876240.
12. Davis, Lauren B., Sengul, Irem, Ivy, Julie S., Brock, Luther G., Miles, Lastella, Scheduling food bank collections and deliveries to ensure food safety and improve access. Socio-Econ Plan Sci 48:3 (2014), 175–188, 10.1016/j.seps.2014.04.001.
13. Lien, Robert W., Iravani, Seyed M.R., Smilowitz, Karen R., Sequential resource allocation for nonprofit operations. Oper Res 62:2 (2014), 301–317, 10.1287/opre.2013.1244.
14. Solak, S., Scherrer, C., Ghoniem, A., The stop-and-drop problem in nonprofit food distribution networks. Ann Oper Res 221 (2012), 407–426, 10.1007/s10479-012-1068-7.
15. Gunes, C., Hoeve, W-J van, Tayur, S., Vehicle routing for food rescue programs: a comparison of different approaches. Lodi, A., Milano, M., Toth, P., (eds.) Integr. AI Tech. Constraint program. Comb. Optim. Probl., 2010, Springer Berlin Heidelberg, 176–180.
16. Orgut, I.S., Ivy, J., Uzsoy, R., Wilson, J.R., Modeling for the equitable and effective distribution of donated food under capacity constraints. IIE Trans, 2015, 10.1080/0740817X.2015.1063792 0:00–00.
17. Brock, Luther G., Davis, Lauren B., Estimating available supermarket commodities for food bank collection in the absence of information. Expert Syst Appl 42:7 (2015), 3450–3461, 10.1016/j.eswa.2014.11.068.
18. Phillips, C., Hoenigman, R., Higbee, B., Reed, T., Understanding the sustainability of retail food recovery. PLoS One, 8, 2013, e75530, 10.1371/journal.pone.0075530.
19. Alegre, Jesús, Laguna, Manuel, Pacheco, Joaquín, Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur J Oper Res 179:3 (2007), 736–746, 10.1016/j.ejor.2005.03.063.
20. Beltrami, E.J., Bodin, L.D., Networks and vehicle routing for municipal waste collection. Networks 4 (1974), 65–94, 10.1002/net.3230040106.
21. Francis, Peter, Smilowitz, Karen, Tzur, Michal, The period vehicle routing problem with service choice. Transp Sci 40:4 (2006), 439–454, 10.1287/trsc.1050.0140.
22. Russell, R., Igo, W., An assignment routing problem. Networks 9:1 (1979), 1–17, 10.1002/net.3230090102.
23. Christofides, N., Beasley, J.E., The period routing problem. Networks 14:2 (1984), 237–256, 10.1002/net.3230140205.
24. Tan, C.C.R., Beasley, J.E., A heuristic algorithm for the period vehicle routing problem. Omega 12:5 (1984), 497–504, 10.1016/0305-0483(84)90050-1.
25. Russell, Robert A., Gribbin, Dave, A multiphase approach to the period routing problem. Networks 21:7 (1991), 747–765, 10.1002/net.3230210704.
26. Cordeau, J.-F., Gendreau, M., Laporte, G., A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 (1997), 105–119, 10.1002/(SICI)1097-0037(199709)30 2<105::AID-NET5>3.0.CO;2-G.
27. Drummond, Lúcia M.A., Ochi, Luiz S., Vianna, Dalessandro S., An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Gener Comput Syst 17:4 (2001), 379–386, 10.1016/s0167-739x(99)00118-1.
28. Hemmelmayr, Vera C., Doerner, Karl F., Hartl, Richard F., A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195:3 (2009), 791–802, 10.1016/j.ejor.2007.08.048.
29. Matos, A.C., Oliveira, R.C., An experimental study of the ant colony system for the period vehicle routing problem. Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T., (eds.) Ant colony optim. Swarm intell, 2004, Springer Berlin Heidelberg, 286–293.
30. Eilam Tzoreff, Tali, Granot, Daniel, Granot, Frieda, Sošić, Greys, The vehicle routing problem with pickups and deliveries on some special graphs. Discret Appl Math 116:3 (2002), 193–229, 10.1016/s0166-218x(00)00283-3.
31. Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows. Proc. 13th Int. Conf. Tools Artif. Intell, 2001, p. 160–167. doi:10.1109/ICTAI.2001.974461.
32. Nanry, William P., Wesley Barnes, J., Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res Part B Methodol 34:2 (2000), 107–121, 10.1016/s0191-2615(99)00016-8.
33. Hernández-Pérez, Hipólito, Rodríguez-Martín, Inmaculada, Salazar-González, Juan José, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput Oper Res 36:5 (2009), 1639–1645, 10.1016/j.cor.2008.03.008.
34. Hernández-Pérez, Hipólito, Salazar-González, Juan-José, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discret Appl Math 145:1 (2004), 126–139, 10.1016/j.dam.2003.09.013.
35. Hernández-Pérez, Hipólito, Salazar-González, Juan-José, Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transp Sci 38:2 (2004), 245–255, 10.1287/trsc.1030.0086.
36. Hernández-Pérez, Hipólito, Salazar-González, Juan-José, The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 50:4 (2007), 258–272.
37. Zhao, Fanggeng, Li, Sujian, Sun, Jiangsheng, Mei, Dong, Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput Ind Eng 56:4 (2009), 1642–1648, 10.1016/j.cie.2008.10.014.
38. Martinovic, Goran, Aleksi, Ivan, Baumgartner, Alfonzo, Single-commodity vehicle routing problem with pickup and delivery service. Math Probl Eng 2008 (2008), 1–17, 10.1155/2008/697981.
39. Mladenović, N., Urošević, D., Hanafi, S., Ilić, A., A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur J Oper Res 220 (2012), 270–285, 10.1016/j.ejor.2012.01.036.
40. Miller, C.E., AWT. Integer programming formulations and traveling salesman problems. J ACM 7 (1960), 326–329, 10.1145/321043.321046 J ACM 7, 326-329.
41. Cordeau, J.-F., Laporte, G., Mercier, A., A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:8 (2001), 928–936.
42. Moccia, L., Cordeau, J.F., Laporte, G., An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. 2012, Social Science Research Network, Rochester, NY.
43. Rochat, Y., Taillard, R.D., Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1 (1995), 147–167.
44. Osman, I.H., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41 (1993), 421–451.
45. Gendreau, M., Alain, H., Gilbert, L., A tabu search heuristic for the vehicle routing problem. Manag Sci 40 (1994), 1276–1290, 10.1287/mnsc.40.10.1276.
46. Gillett, Billy E., Miller, Leland R., A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22:2 (1974), 340–349, 10.1287/opre.22.2.340.
47. Croes, G.A., A method for solving traveling-salesman problems. Oper Res 6:6 (1958), 791–812.
48. Nair, D.J., Rey, D., Dixit, V., Clustering Models for Food Rescue and Delivery Problem. 2015.