Location-Routing Problems with Distance Constraints

References

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