Planning for meals-on-wheels: Algorithms and application

Journal of the Operational Research Society

Volumn 64, Issue 10, 2013, Pages 1540-1550

  Yildiz, H ^a   Johnson, M P ^b   Roehrig, S ^c  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

heuristics; location; multi objective; vehicle routing

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; LOCATION; VEHICLE ROUTING; WHEELS;

DELIVERY ROUTES; FACILITY LOCATIONS; HEURISTICS; LOCATION ROUTING PROBLEM; MEMETIC ALGORITHMS; MULTI OBJECTIVE; PLANNING MODELS; TRADE-OFF CURVES;

DECISION MAKING;

EID: 84884579654     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.129     Document Type: Article

References (51)

1. Albareda-Sambola M, Diaz J and Fernández E (2005). A compact model and tight bounds for a combined locationrouting problem. Computers and Operations Research 32(3): 407-428.
2. Barreto S, Ferreira C, Paixao J and Santos B (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research 179(3): 968-977. (Pubitemid 46038597)
3. Bartholdi J, Platzman L, Collins R and Warden W (1983). A minimal technology routing system for meals on wheels. Interfaces 13(3): 1-8. (Pubitemid 14606292)
4. Berger R (1997). Location-routing models for distribution system design. Unpublished Dissertation, Northwestern University, Department of Industrial Engineering and Management Sciences, Evanston, IL, USA.
5. Bookbinder J and Reece K (1988). Vehicle routing considerations in distribution system design. European Journal of Operational Research 37(2): 204-213.
6. Bruns A and Klose A (1995). An iterative heuristic for locationrouting problems based on clustering. In: Proceedings of the Second International Workshop on Distribution Logistics, The Netherlands, pp 1-6.
7. Bruns A and Klose A (1997). A 'locate first-route second' heuristic for a combined location-routing problem. In: Zimmermann U, Derings U, Gaul W, Mö hring RH and Schuster KP (eds). Operations Research Proceedings 1996.
8. Caballero R, Gonzalez M, Guerrero F, Molina J and Paralera C (2007). Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. European Journal of Operational Research 177(3): 1751-1763. (Pubitemid 44709438)
9. Chan Y, Carter W and Burnes M (2001). A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers and Operations Research 28(8): 803-826. (Pubitemid 32473738)
10. Coello C (1999). A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information systems 1(3): 129-156.
11. Coello C and Romero C (2002). Evolutionary algorithms and multiple objective optimization. In: Ehrgott M and Gandibleux X (eds). Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. Kluwer Academic Publishers: New York.
12. Coello Coello C and Lamont G (2005). An introduction to multi-objective evolutionary algorithms and their applications. In: Coello Coello CA and Lamont GB (eds). Applications of Multi-Objective Evolutionary Algorithms. World Scientific Publishing: Singapore, pp 1-28.
13. Cornuejols G, Fisher M and Nemhauser G (1977). Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23(8): 789-810.
14. Deb K (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley: New York.
15. Deb K, Pratap A, Agarwal S and Meyarivan T (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2): 182-197. (Pubitemid 34555372)
16. Dunn K (2008). Euclidian traveling salesman problem solver. http://fly.hiwaay.net:8000/Bkdunn/problems/tsp.shtml.
17. Gorr W, Johnson M,Roehrig S (2001). Spatial decision support system for home-delivered services. Journal of Geographic Systems 3(2): 181-197. (Pubitemid 33725653)
18. Gunes C, van Hoeve W and Tayur S (2010). Vehicle routing for food rescue programs: A comparison of different approaches. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 6140:176-180.
19. Hansen P, Hegedahl B, Hjortkjaer S and Obel B (1994). A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research 76(1): 111-127.
20. Johnson M, Gorr W and Roehrig S (2002). Location/allocation/routing for home-delivered meals provision: Models & solution approaches. International Journal of Industrial Engineering 9(1): 45-56. (Pubitemid 34434070)
21. Jones D, Mirrazavi S and Tamiz M (2002). Multi-objective metaheuristics: An overview of the current state-of-the-art. European Journal of Operational Research 137(1): 1-9. (Pubitemid 33126005)
22. Karp RM (1972). Reducibility among combinatorial problems. In: Miller RE and Thatcher JW (eds). Complexity of Computer Computations: Proceeding of a Symposium on the Complexity of Computer Computations, The IBM Research Symposia Series, Plenum Press: New York, NY, pp. 85-103.
23. Knowles J and Corne D (1999). The Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimisation. In: Evolutionary Computation, 1999 CEC 99. Proceedings of the 1999 Congress on. Vol. 1, pp 98-105.
24. Knowles J and Corne D (2000). Approximating the nondominated front using the Pareto Archived Evolution Strategy. Evolutionary Computation 8(2): 149-172.
25. Laporte G and Dejax P (1989). Dynamic location-routeing problems. Journal of the Operational Research Society 40(5): 471-482.
26. Laporte G and Nobert Y (1981). Exact algorithm for minimizing routing and operating costs in depot location. European Journal of Operational Research 6(2): 224-226. (Pubitemid 11466204)
27. Laporte G, Nobert Y and Pelletier P (1983). Hamiltonian location problems. European Journal of Operational Research 12(1): 82-89.
28. Laporte G, Nobert Y and Arpin D (1986). An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research 6(9): 291-310.
29. Laporte G, Nobert Y and Taillefer S (1988). Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22(3): 161-172. (Pubitemid 18654114)
30. Laporte G, Louveaux F and Mercure H (1989). Models and exact solutions for a class of stochastic location-routing problems. European Journal of Operational Research 39(1): 71-78.
31. Lenstra J and Kan AR (1981). Complexity of vehicle routing and scheduling problems. Networks 11(2): 221-227. (Pubitemid 13506973)
32. Lin C and Kwok R (2006). Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. European Journal of Operational Research 175(3): 1833-1849. (Pubitemid 44436758)
33. Lin C, Chow C and Chen A (2002). A location-routing-loading problem for bill delivery services. Computers & Industrial Engineering 43(1-2): 5-25. (Pubitemid 34551900)
34. Lin S (1965). Computer solutions of the traveling salesman. Bell System Technical Journal 44(10): 2245-2269.
35. Lopes R, Barreto S, Ferreira C and Santos B (2008). A decisionsupport tool for a capacitated location-routing problem. Decision Support Systems 46(1): 366-375.
36. Madsen O (1983). Methods for solving combined two level location-routing problems of realistic dimensions. European Journal of Operational Research 12(3): 295-301.
37. Medaglia A, Villegas J and Rodrguez-Coca D (2009). Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network. Journal of Heuristics 15(2): 153-176.
38. Michalewicz Z (1996). Genetic Algorithms+Data Structures=Evolution Programs. Springer: New York.
39. Nagy G and Salhi S (1996). Nested heuristic methods for the location-routeing problem. Journal of the Operational Research Society 47(9): 1166-1174. (Pubitemid 126605013)
40. Nagy G and Salhi S (2007). Location-routing: Issues, models and methods. European Journal of Operational Research 177(2): 649-672. (Pubitemid 44647670)
41. Or I and Pierskalla W (1979). A transportation location-allocation model for regional blood banking. IIE Transactions 11(2): 86-95. (Pubitemid 9470786)
42. Pariazar M, Sir MY and Root S (2012). Robust supply chain design considering correlated failures and inspection. University of Missouri-Columbia: Columbia, MO, Working Paper.
43. Perl J and Daskin M (1985). A warehouse location-routing problem. Transportation Research 19(5): 381-396.
44. Prins C, Prodhon C and Calvo R (2006a). A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Jens G and Gü nther R (eds). Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006: Proceedings. Springer: New York.
45. Prins C, Prodhon C and Calvo R (2006b). Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research 4(3): 47-64. (Pubitemid 44369502)
46. Prins C, Prodhon C, Ruiz A, Soriano P and Wolfler Calvo R (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41(4): 470.
47. Renaud J, Laporte G and Boctor F (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research 23(3): 229-235.
48. Solak S, Scherrer C and Ghoniem A (2012). The stop-and-drop problem in nonprofit food distribution networks. Annals of Operations Research: doi: 10.1007/s10479-012-1068-7.
49. Tuzun D and Burke L (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116(1): 87-99.
50. Wong D and Meyer J (1993). A spatial decision support system approach to evaluate the efficiency of a meals-on-wheels program. The Professional Geographer 45(3): 332-341.
51. Wu T, Low C and Bai J (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research 29(10): 1393-1415. (Pubitemid 34409654)