Article

Free access

Solving large vehicle routing and scheduling problems in small core

Author:

Lawrence BodinAuthors Info & Claims

ACM '83: Proceedings of the 1983 annual conference on Computers : Extending the human resource

Pages 27 - 37

https://doi.org/10.1145/800173.809693

Published: 01 January 1983 Publication History

PDF eReader

Abstract

In this paper, an efficient implementation of the Clarke and Wright algorithm for solving the single depot vehicle routing and scheduling problem is presented. With this implementation, a 900 customer problem can be solved approximately in less than 9 seconds of CPU time and less than 128K bytes of storage on an IBM 3033 computer.

References

[1]

Bodin, L., B. Golden, A. Assad and M. Ball, "Routing and Scheduling of Vehicles and Crews - The State of the Art", Computers and Opertions Research, Special Issue, Vol. 10, No. 2, pp. 63-212 (June, 1983).

Crossref

Google Scholar

[2]

Clarke, G. and J. Wright, "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research, Vol. 12, pp 568-581 (1964).

Digital Library

Google Scholar

[3]

Eilon, S., C. Watson-Gandy and N. Christofides, Distribution Management: Mathematical Modelling and Practical Analysis, Hafner Publications (1971).

Google Scholar

[4]

Golden, B., T. Magnanti and H. Nguyen, "Implementing Vehicle Routing Algorithms", Networks, Vol. 7, pp 113-148 (1977).

Crossref

Google Scholar

[5]

Yellow, P., "A Computational Modification to the Savings Method of Vehicle Scheduling", Operational Research Quarterly, Vol. 21, pp 281-283 (1970).

Crossref

Google Scholar

Cited By

View all

Manoharam GIsmail MAbir IMajahar Ali M(2021)Efficient Solid Waste Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem AlgorithmsPertanika Journal of Science and Technology10.47836/pjst.29.3.0229:3Online publication date: 19-Jul-2021
https://doi.org/10.47836/pjst.29.3.02
Van Breedam A(2002)A parametric analysis of heuristics for the vehicle routing problem with side-constraintsEuropean Journal of Operational Research10.1016/S0377-2217(01)00150-3137:2(348-370)Online publication date: Mar-2002
https://doi.org/10.1016/S0377-2217(01)00150-3

Index Terms

Solving large vehicle routing and scheduling problems in small core
1. Computing methodologies
  1. Artificial intelligence
    1. Control methods
    2. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

On the Reformulation of Vehicle Routing Problems and Scheduling Problems
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation

We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two ...
A road timetable^TM to aid vehicle routing and scheduling

Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant ...
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
Abstract
In this paper, we address the constrained parallel-machine scheduling problem with divisible processing times and penalties (the CPS-DTP problem), which is a further generalization of the parallel-machine scheduling problem with divisible ... $^{}$

Comments

Information & Contributors

Information

Published In

ACM '83: Proceedings of the 1983 annual conference on Computers : Extending the human resource

January 1983

278 pages

ISBN:0897911202

DOI:10.1145/800173

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
590
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)6

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Manoharam GIsmail MAbir IMajahar Ali M(2021)Efficient Solid Waste Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem AlgorithmsPertanika Journal of Science and Technology10.47836/pjst.29.3.0229:3Online publication date: 19-Jul-2021
https://doi.org/10.47836/pjst.29.3.02
Van Breedam A(2002)A parametric analysis of heuristics for the vehicle routing problem with side-constraintsEuropean Journal of Operational Research10.1016/S0377-2217(01)00150-3137:2(348-370)Online publication date: Mar-2002
https://doi.org/10.1016/S0377-2217(01)00150-3

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

On the Reformulation of Vehicle Routing Problems and Scheduling Problems

A road timetableTM to aid vehicle routing and scheduling

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations

A road timetable^TM to aid vehicle routing and scheduling