Location-routing problems with distance constraints

Transportation Science

Volumn 41, Issue 1, 2007, Pages 29-43

  Berger, Rosemary T ^a   Coullard, Collette R ^b   Daskin, Mark S ^c  

^a Lehigh University   (United States)

^b LAKE SUPERIOR STATE UNIVERSITY   (United States)

^c Northwestern University   (United States)

Author keywords

Branch and price; Column generation; Location routing

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DISTANCE MEASUREMENT; INFORMATION SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COLUMN GENERATION; DISTANCE CONSTRAINTS; LOCATION ROUTING;

CONSTRAINED OPTIMIZATION;

EID: 34247476119     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1060.0156     Document Type: Article

References (35)

1. Ahuja, R., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vancc. 1998. Branch and price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
3. Berger, R. T. 1997. Location-routing models for distribution system design. Ph.D. thesis, Northwestern University, Evanston, IL.
4. Burlett, L. 2002. Regional operating expenses: A case study. Southern Business Development, http://www.sb-d.com/issues/ winter2002/features/save. asp.
5. Carpaneto, G., P. Toth. 1980. Some new branching and bounding criteria for the asymmetric traveling salesman problem. Management Sci. 26 736-743.
6. Christofides, N., S. Eilon. 1969. Expected distances in distribution problems. Oper. Res. Quart. 20 437-443.
7. Cornuejols, G., G. L. Nemhauser, L. A. Wolsey. 1990. The uncapacitated facility location problem. P. Mirchandani, R. L. Francis, eds. Discrete Location Theory. Wiley, New York, 119-171.
8. Desrochers, M., F. Soumis. 1989. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. 23 1-13.
9. Desrochers, M., J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time win- dows. Oper. Res. 40 342-354.
10. Desrosiers, J., F. Soumis, M. Desrochers. 1984. Routing with time windows by column generation. Networks 14 545-565.
11. Dumas, Y., J. Desrosiers, F. Soumis. 1991. The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54 7-22.
12. Feillet, D., P. Dejax, M. Gendreau, C. Gueguen. 2004. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 216-229.
13. Gelinas, S., M. Desrochers, J. Desrosiers, M. M. Solomon. 1995. A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. 61 91-109.
14. Gorr, W. P., M. P. Johnson, S. Roehrig. 2001. Facility location model for home-delivered services: Application to the Meals on Wheels program. J. Geographic Systems 3 181-197.
15. Hoffman, K. L., M. Padberg. 1993. Solving airline crew scheduling problems by branch-and-cut. Management Sci. 39 657-682.
16. Irnich, S., D. Villeneuve. 2006. The shortest path problem with resource constraints and k-cycle elimination for k≥ 3. INFORMS J. Comput. Forthcoming.
17. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33 101-116.
18. Laporte, G. 1986. Generalized subtour elimination constraints and connectivity constraints. J. Oper. Res. Soc. 37 509-514.
19. Laporte, G. 1988. Location-routing problems. B. L. Golden, A. A. Assad, eds. Vehicle Routing: Methods and Studies. North Holland, Amsterdam, The Netherlands, 163-198.
20. Laporte, G., Y. Nobert. 1981. An exact algorithm for minimizing routing and operating costs in depot location. Eur. J. Oper. Res. 6 224-226.
21. Laporte, G., Y. Nobert, D. Arpin. 1986. An exact algorithm for solving a capacitated location-routing problem. Ann. Oper. Res. 6 293-310.
22. Laporte, G., Y. Nobert, P. Pelletier. 1983. Hamiltonian location problems. Eur. J. Oper. Res. 12 82-89.
23. Laporte, G., Y. Nobert, S. Taillefer. 1988. Solving a family of multidepot vehicle routing and location-routing problems. Transportation Sci. 22 161-172.
24. Miliotis, P. 1976. Integer programming approaches to the travelling salesman problem. Math. Programming 10 367-378.
25. Miliotis, P. 1978. Using cutting planes to solve the symmetric travelling salesman problem. Math. Programming 15 177-188.
26. Min, H., V. Jayaraman, R. Srivastava. 1998. Combined locationrouting problems: A synthesis and future research directions. Eur. J. Oper. Res. 108 1-15.
27. Paltrow, S. J. 2003. Selling strategies - Profiting from impatience. Wall Street J. http://www.ensenda.com/about/gfx/pr_25.pdf
28. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. North Holland, Amsterdam, The Netherlands, 269-280.
29. Savelsbergh, M. 1997. A branch and price algorithm for the generalized assignment problem. Oper. Res. 45 831-841.
30. Savelsbergh, M. W. P., G. L. Nemhauser. 1996. Functional description of MINTO, a Mixed INTeger Optimizer. Technical report, Georgia Institute of Technology, Atlanta, GA.
31. Savelsbergh, M., M. Sol. 1998. Drive: Dynamic routing of independent vehicles. Oper. Res. 46 474-490.
32. Solomon, M. M. 1987. Algorithm for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35 254-265.
33. Srivastava, R., W. C. Benton. 1990. The location-routing problem: Considerations in physical distribution system design. Comput. Oper. Res. 17 427-435.
34. Vance, P. H. 1993. Crew scheduling, cutting stock and column generation: Solving huge integer programs. Ph.D. thesis, Georgia Institute of Technology, Atlanta, GA.
35. Webb, M. H. J. 1968. Cost functions in the location of depots for multiple-delivery journeys. Oper. Res. Quart.19 311-320.