IDEAS home Printed from https://ideas.repec.org/p/ags/eureia/272191.html
   My bibliography  Save this paper

Complexity Of Vehicle Routing And Scheduling Problems

Author

Listed:
  • Lenstra, J. K.
  • Rinnooy Kan, A. H. G.

Abstract

The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park from June 4 to June 6, 1979.

Suggested Citation

  • Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Of Vehicle Routing And Scheduling Problems," Econometric Institute Archives 272191, Erasmus University Rotterdam.
    • Handle: RePEc:ags:eureia:272191
    DOI: 10.22004/ag.econ.272191
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/272191/files/erasmus119.pdf
    Download Restriction: no
    File URL: https://ageconsearch.umn.edu/record/272191/files/erasmus119.pdf?subformat=pdfa
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.272191?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. CORNUEJOLS, Gérard & NEMHAUSER, George L., 1978. "Tight bounds for Christofides' traveling salesman heuristic," LIDAM Reprints CORE 327, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    3. C. H. Papadimitriou & K. Steiglitz, 1978. "Some Examples of Difficult Traveling Salesman Problems," Operations Research, INFORMS, vol. 26(3), pages 434-443, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Keyju Lee & Junjae Chae & Jinwoo Kim, 2019. "A Courier Service with Electric Bicycles in an Urban Area: The Case in Seoul," Sustainability, MDPI, vol. 11(5), pages 1-19, February.
    2. Stern, Victor, 1979. "Minimization By The Method Of Conjugate Gradients," Econometric Institute Archives 272193, Erasmus University Rotterdam.
    3. Wang, Minxi & Wang, Yajie & Liu, Wei & Ma, Yu & Xiang, Longtao & Yang, Yunqi & Li, Xin, 2021. "How to achieve a win–win scenario between cost and customer satisfaction for cold chain logistics?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
    2. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    3. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    4. Carlos F. Daganzo & Karen R. Smilowitz, 2004. "Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems," Transportation Science, INFORMS, vol. 38(3), pages 343-356, August.
    5. Hirofumi Matsuo, 1990. "Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 679-694, October.
    6. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    7. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    8. Zachariasen, Martin, 1999. "Local search for the Steiner tree problem in the Euclidean plane," European Journal of Operational Research, Elsevier, vol. 119(2), pages 282-300, December.
    9. Demange, Marc & Paschos, Vangelis Th., 2005. "Polynomial approximation algorithms with performance guarantees: An introduction-by-example," European Journal of Operational Research, Elsevier, vol. 165(3), pages 555-568, September.
    10. Daganzo, Carlos F. & Smilowitz, Karen R., 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dn2j66w, Institute of Transportation Studies, UC Berkeley.
    11. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    12. Paul Sutcliffe & Andrew Solomon & Jenny Edwards, 2012. "Computing the variance of tour costs over the solution space of the TSP in polynomial time," Computational Optimization and Applications, Springer, vol. 53(3), pages 711-728, December.
    13. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    14. Tatarakis, A. & Minis, I., 2009. "Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns," European Journal of Operational Research, Elsevier, vol. 197(2), pages 557-571, September.
    15. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    16. Orlin, James B., 1953-. & Ahuja, Ravindra K., 1956-., 1988. "New scaling algorithms for the assignment and minimum cycle mean problems," Working papers 2019-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    17. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    18. Shoshana Anily & Julien Bramel, 2004. "A probabilistic analysis of a fixed partition policy for the inventory‐routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 925-948, October.
    19. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    20. Carlos Daganzo & Karen Smilowitz, 2006. "A note on asymptotic formulae for one-dimensional network flow problems," Annals of Operations Research, Springer, vol. 144(1), pages 153-160, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ags:eureia:272191. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: AgEcon Search (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.