The potential of optimization in communal routing problems: case studies from Finland

Journal of Transport Geography

Volumn 17, Issue 6, 2009, Pages 484-490

  Bräysy, Olli ^a   Dullaert, Wout ^b,c   Nakari, Pentti ^a  

^a UNIVERSITY OF JYVÄSKYLÄ   (Finland)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c ANTWERP MARITIME ACADEMY   (Belgium)

Author keywords

Case study; City logistics; Optimization; Vehicle routing

Indexed keywords

LOGISTICS; NUMERICAL MODEL; OPTIMIZATION; PLANNING METHOD; ROUTING; TRANSPORTATION PLANNING; URBAN TRANSPORT;

EURASIA; EUROPE; FINLAND; NORTHERN EUROPE; SCANDINAVIA;

EID: 69449105622     PISSN: 09666923     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jtrangeo.2008.10.003     Document Type: Article

References (29)

1. Begur S.V., Miller D.M., and Weaver J.R. An integrated spatial DSS for scheduling and routing home health care nurses. Interfaces 27 (1997) 35-48
2. Bertels S., and Fahle T. A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers and Operations Research 33 (2006) 2866-2890
3. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 (2005) 104-118
4. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science 39 (2005) 119-139
5. Bräysy, O., Nakari, P., Dullaert, W., Neittaanmäki, P., accepted for publication. An optimization approach for communal home meal delivery service: a case study. Journal of Computational and Applied Mathematics. doi:10.1016/j.cam.2008.10.038.
6. Campbell A.M., and Savelsbergh M. Incentive schemes for attended home delivery services. Transportation Science 40 (2006) 327-341
7. Cheng, E., Rich, J.L., 1998. A Home Health Care Routing and Scheduling Problem, Technical Report, CAAM TR98-04, Rice University.
8. Crainic T.G., Malucelli F., and Nonato M. Meta-heuristics for a class of demand-responsive transit systems. INFORMS Journal on Computing 17 1 (2005) 10-24
9. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 (1959) 80-91
10. De Causmaecker, P., Demeester, P., De Pauw-Waterschoot, P., Vanden Berghe, G. 2001. Sympathetic agents assist in route planning. In: Proceedings of AGENTS'01 Conference, Montreal, Canada, May 28-June 1, 2001.
11. Dror M. Arc Routing: Theory Solutions and Applications (2000), Kluwer, Boston
12. Eveborn P., Flisberg P., and Rönnqvist M. Laps Care - an operational system for staff planning of home care. European Journal of Operational Research 171 (2006) 962-976
13. Eveborn P., and Rönnqvist M. Scheduler - a system for staff planning. Annals of Operations Research 128 (2004) 21-45
14. Fu L.P., and Ishkhanov G. Fleet size and mix optimization for paratransit services. Transportation Research Record 1884 (2004) 39-46
15. Haughton M.A. Assigning delivery routed to drivers under variable customer demands. Transportation Research Part E 43 (2007) 157-172
16. Hertz A. Recent trends in arc routing. In: Hartman I., and Golumbic M. (Eds). Graph Theory, Combinatorics and Algorithmics: Interdisciplinary Applications (2005), Kluwer, Boston 215-236
17. Hindle T., Hindle A., and Spollent M. Resource allocation modelling for home-based health and social care services in areas having differential population density levels: a case study in Northern Ireland. Health Services Management Research 13 (2000) 164-169
18. Horn M.E.T. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research, Part C 10 (2002) 35-63
19. Kara I., and Bektas T. Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research 174 (2006) 1449-1458
20. Kytöjoki J., Nuortio T., Bräysy O., and Gendreau M. An efficient variable neighbourhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research 34 (2007) 2743-2757
21. Laporte G., Gendreau M., Potvin J.-Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operations Research 7 (2000) 285-300
22. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985), John Wiley and Sons, Chichester
23. Lenstra J.K., and Rinnooy Kan A.H.G. Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
24. Melachrinoudis E., Ilhan A.B., and Min H. A dial-a-ride problem for client transportation in a health-care organization. Computers and Operations Research 34 (2007) 742-759
25. Potvin J.-Y., Xu Y., and Benyahia I. Vehicle routing and scheduling with dynamic travel times. Computers and Operations Research 33 (2006) 1129-1137
26. Rekiek B., Delchambre A., and Saleh H.A. Handicapped person transportation: an application of the grouping genetic algorithms. Engineering Applications of Artificial Intelligence 19 (2006) 511-520
27. Renard A., Krajecki M., and Bui A. On-request urban transport parallel optimization. Lecture Notes in Computer Science 3473 (2004) 266-275
28. Svestka J.A., and Huckfeldt V.E. Computational experience with an m-salesman travelling salesman algorithm. Management Science 19 (1973) 790-799
29. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (2001), SIAM, Philadelphia