Advanced search
Publication Cover
American Journal of Mathematical and Management Sciences Volume 7, 1987 - Issue 1-2
Submit an article Journal homepage
102
Views
44
CrossRef citations to date
0
Altmetric
Original Articles

Integrated Facility Location and Vehicle Routing Models: Recent Work and Future Prospects

Anantaram BalakrishnanKrannert Graduate School of Management, Purdue UniversityWest Lafayette, Indiana47907
,
James E. WardKrannert Graduate School of Management, Purdue UniversityWest Lafayette, Indiana47907
&
Richard T. WongKrannert Graduate School of Management, Purdue UniversityWest Lafayette, Indiana47907
Pages 35-61 | Published online: 14 Aug 2013

  • AndersonJ.A. and ChelstK. (1984). Computer graphics and optimal location: A dynamic duo. Presented at TIMS XXVI International Meeting, Copenhagen, Denmark, June 1984.
  • BeardwoodJ., HaltonJ.H. and HammersleyJ.M. (1959). The shortest path through many points. Proceedings of the Cambridge Philosophical Society, 55, 229–327.
  • BlumenfeldD.E., BurnsL.D., DiltzJ.D. and DaganzoC.F.(1985). Analyzing tradeoffs between transportation, inventory and production costs on freight networks. Transportation Research, 19B, 361–380.
  • BodinL., GoldenB.L., AssadA. and BallM.O. (1983). Routing and scheduling of vehicles and crews. Computers and Operations Research, 10, 62–212.
  • BrandeauM.L. and ChiuS.S. (1985). A survey of 50 representative problems in location research distinguished by a natural taxonomy. Working paper, Engineering-Economic Systems Department, Stanford University, StanfordCalifornia.
  • BurnessR.C. and WhiteJ.A. (1976). The traveling salesman location problem. Transportation Science, 10, 348–360.
  • BurnsL.D., HallR.W., BlumenfeldD.E. and DaganzoC.F. (1985). Distribution strategies that minimize transportation and inventory costs. Operations Research, 33, 469–490.
  • ChristofidesN. (1985). Vehicle routing. In Combinatorial Optimization: Annotated Bibliographies (O'hEigeartaighM., LenstraJ.K. and Rinnooy KanA., eds.), New York, John Wiley & Sons, 148–163.
  • ChristofidesN. and EilonS. (1969). Expected distances in distribution problems. Operational Research Quarterly, 20, 437–443.
  • CornuejolsG., FisherM.L. and NemhauserG. (1977). Location of bank accounts to maximize float. Management Science, 23, 789–810.
  • CrowderH. and PadbergM.W. (1980). Solving large-scale symmetric traveling salesman problems to optimality. Management Science, 26, 495–509.
  • DaganzoC.F. (1984a). The length of tours in zones of different shapes. Transportation Research, 18B, 135–145.
  • DaganzoC.F. (1984b). The distance traveled to visit N points with a maximum of C stops per vehicle: An analytical model and an application. Transportation Science, 18, 331–350.
  • DaskinM.S. (1985). Logistics: An overview of the state of the art and perspectives on future research. Transportation Research, 19A, 383–398.
  • DempsterM.A.H., FisherM.L., JansenL., LagewegB.J., LenstraJ.K. and Rinnooy KanA.H.G. (1981). Analytical evaluation of hierarchical planning systems. Operations Research, 29, 707–717.
  • DomschkeW. and DrexlA. (1985). Location and Layout Planning: An International Bibliography. Springer-Verlag, Berlin.
  • EilonS., Watson-GandyC.D.T. and ChristofidesN. (1971). Distribution Management: Mathematical Modeling and Practical Analysis. Hafner Publishing Company, New York.
  • ErlenkotterD. (1981). A comparative study of approaches to dynamic location problems. European Journal of Operational Research, 6, 133–143.
  • FrancaP.M. and LunaH.P.L. (1982). Solving stochastic transportation-location problems by generalized Benders decomposition. Transportation Science, 16, 113–126.
  • GareyM.R. and JohnsonD.S. (1979). Computers and Interact-ability: A Guide to the Theory of NP Completeness. W. H. Freeman, San Francisco.
  • GarfinkelR. and NemhauserG. (1972). Integer Programming. John Wiley & Sons, New York.
  • GoldenB.L., GheysensF.J. and AssadA.A. (1984). On solving the vehicle fleet size and mix problem. Operational Research 1984 (BransJ.P., ed.), Elsevier Science Publishers B.V., North HollandAmsterdam.
  • HaimovichM. and Rinnooy KanA.H.G. (1985). Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research, 10, 527–542.
  • HandlerG. and MirchandaniP.B. (1979). Location on Networks: Theory and Algorithms. M.I.T. Press, CambridgeMassachusetts.
  • HausmanW.H. and GilmourP. (1967). A multi-period truck delivery problem, Transportation Research, 1, 349–357.
  • JacobsenS.K. and MadsenO.B.G. (1980). A comparative study of heuristics for a two-level location-routing problem. European Journal of Operational Research, 5, 378–387.
  • KrarupJ. and PruzanP.M. (1983). The simple plant location problem: Survey and synthesis. European Journal of Operational Research, 12, 36–81.
  • LaporteG. and NobertY. (1981). An exact algorithm for minimizing routing and operating costs in depot location. European Journal of Operational Research, 6, 224–226.
  • LaporteG., NobertY. and ArpinD. (1984). Capacitated location-routing problems. Paper presented at The Third International Symposium on Locational Decisions, Boston, Massachusetts.
  • LaporteG., NobertY. and PelletierP. (1983). Hamiltonian location problems. European Journal of Operational Research, 12, 80–87.
  • MadsenO.B.G. (1981). A survey of methods for solving combined location routing problems. Paper presented at the Second International Symposium on Locational Decisions, Skodsburg, Denmark, 373–386.
  • MadsenO.B.G. (1983). Methods for solving combined two level location-routing problems of realistic dimensions. European Journal of Operational Research, 12, 295–301.
  • MagnantiT.L. (1981). Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks, 11, 179–213.
  • MoleR.H. and JamesonS.R. (1976). A sequential route building algorithm employing a generalized savings criterion. Operations Research Quarterly, 21, 503–511.
  • OrI. and PierskallaW.P. (1979). A transportation location-allocation model for regional blood banking. AIIE Transactions, 11, 86–95.
  • PatelN. (1979). Locating rural social service centers in India. Management Science, 25, 22–30.
  • PerlJ. (1983). A unified warehouse location-routing analysis. Ph.D. Dissertation, Department of Civil Engineering, Northwestern University, EvanstonIllinois.
  • PerlJ. and DaskinM.S. (1984). A warehouse location-routing methodology. Journal of Business Logistics, 5, 92–111.
  • PerlJ. and DaskinM.S. (1985). A warehouse location-routing problem. Transportation Research-B, 19B, 381–396.
  • PlaneD. and HendrickT. (1977). Mathematical programming and the location of fire companies for the Denver Fire Department. Operations Research, 25, 563–578.
  • RoodmanG.M. and SchwarzL.B. (1977). Extensions of the multiperiod phase-out model: New procedures and applications to a phase in/phase out problem. AIIE Transactions, 9, 103–107.
  • SpaccamelaA.M., Rinnooy KanA.H.G. and StougieL. (1982). Hierarchical vehicle routing problems. Mathematisch Centrum Report BW 168/82, Amsterdam.
  • SteinD.M. (1978a). An asymptotic probabilistic analysis of a routing problem. Mathematics of Operations Research, 3, 89–101.
  • SteinD.M. (1978b). Scheduling dial-a-ride transportation systems. Transportation Science, 12, 232–249.
  • U.S. Bureau of the Census (1985). Statistical Abstract of the United States: 1986. 106th edition, WashingtonD.C.
  • Van RoyT.J. and ErlenkotterD. (1982). A dual-based procedure for dynamic facility location. Management Science, 28, 1091–1105.
  • Watson-GandyC.T.D. and DohrnP.J. (1973). Depot location with van salesman - a practical approach. Omega, 1, 321–329.
  • WebbM.H.J. (1968). Cost functions in the location of depots for multi-delivery journeys. Operational Research Quarterly, 19, 311–328.
  • WongR.T. (1985). Location and network design. In Combinatorial Optimization: Annotated Bibliographies (O'hEigeartaighM., LenstraJ.K. and Rinnooy KanA., eds.), John Wiley & Sons, New York, 129–147.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.