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

The Multi-Depot Routing Allocation Problem

Jossef PerlDepartment of Civil Engineering, University of Maryland, College Park, MD20742
Pages 7-34 | Published online: 14 Aug 2013

  • BodinL.D. and KurshS.J. (1978). A computer-assisted system for the routing and scheduling of street sweepers. Operations Research, 26 525–537.
  • BodinL., GoldenB., AssadA. and BallM. (1983). Routing and scheduling of vehicles and crews; The state of the art. Computers and Operations Research, 10, 63–211.
  • CassidyP.J. and BennettH.S. (1972). TRAMP - A multi-depot vehicle scheduling system. Operational Research Quarterly, 23, 157–163.
  • ChristofidesN. and EilonS. (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309–318.
  • ClarkeG. and WrightJ.W. (1964). Scheduling vehicles from a central depot to a number of delivery points. Operations Research, 12, 568–581.
  • EilonS., Watson-GandyC.D.T. and ChristofidesN. (1971). Distribution Management: Mathematical Modelling and Practical Analysis. Hafner Publishing Company, New York.
  • FedergruenA. and LagawegB.J. (1980). Hierarchical distribution modelling with routing costs. Working Paper 314A, Graduate School of Business, Columbia University, New York.
  • FisherL.M. and JaikumarR. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11, 109–124.
  • GillettB.D. and MillerL.R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22, 340–349.
  • GillettB.D. and JohnsonJ.G. (1976). Multi terminal vehicle dispatch algorithm. OMEGA, 4, 711–718.
  • GillettB.D. and JohnsonJ.G. (1974). Sweep algorithm for the multiple depot vehicle dispatch problem. 46th National Meeting of ORSA, San Juan, Puerto Rico.
  • GoldenB.L., MagnantiT.L., and NguyenH.A. (1977). Implementing vehicle routing algorithms. Networks, 7, 113–148.
  • LinS. (1965). Computer solutions of the Travelling Salesman Problem. Bell System Technical Journal, 44, 2245–2269.
  • MoleR.H. and JamesonS. (1976). A sequential route building algorithm employing a generalized savings criterion. Operational Research Quarterly, 21, 503–511.
  • OrI. (1976). Traveling Salesman-Type Combinatorial Problems and Their Relationship to the Logistics of Regional Blood Banking. Ph.D. Dissertation, Department of Industrial Engineering and Management Science, Northwestern University, EvanstonIllinois.
  • PerlJ. (1983). A Unified Warehouse Location-Routing Analysis. Ph.D. Dissertation, Department of Civil Engineering, Northwestern University, EvanstonIllinois.
  • TillmanF. and CainT. (1972). An upper bound algorithm for the single and multiple terminal delivery problem. Management Science, 18, 664–682.
  • Watson-GandyC.D.T. and DohrnP.J. (1973). Depot location with van salesmen – 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.
  • WrenA. and HollidayA. (1972). Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly, 23, 333–344.

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.