Skip to main content
SpringerLink
Log in

The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

Abstract

This paper addresses an extension of the TSP where a vehicle with a limited capacity must transport certain commodities from their origins to their destinations. Each commodity has a weight, and the objective is to find a minimum length Hamiltonian tour satisfying all the transportation requests without ever violating the capacity constraint. We propose for this problem a heuristic approach that combines mathematical programming and metaheuristic techniques. The method is able to improve the best known solutions for a set of instances from the literature in a reasonable amount of computation time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ascheuer, N., Jünger, M., Reinelt, G.: A branch & cut algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Computational Optimization and Applications 17, 61–84 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static Pickup and Delivery Problems: A Classification Scheme and Survey. TOP 15, 1–31 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming A 102, 71–90 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming B 98, 23–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gambardella, L.M., Dorigo, M.: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem. INFORMS Journal on Computing 13, 237–255 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gouveia, L., Pesneau, P.: On extended formulations for the Precedence Constrained Asymmetric Traveling Salesman Problem. Networks 48, 77–89 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hernández-Pérez, H., Salazar-González, J.J.: A branch-and-cut algorithm for a Traveling Salesman Problem with Pickup and Delivery. Discrete Applied Mathematics 145, 126–139 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hernández-Pérez, H., Salazar-González, J.J.: Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Transportation Science 38, 245–255 (2004)

    Article  Google Scholar 

  9. Hernández-Pérez, H., Salazar-González, J.J.: The multi-commodity one-to-one Pickup-and-Delivery Traveling Salesman Problem. Europoean Journal of Operational Research 196, 987–995 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems. Springer, Heidelberg (2009)

    Google Scholar 

  11. Mosheiov, G.: The traveling salesman problem with pickup and delivery. European Journal of Operational Research 79, 299–310 (1994)

    Article  MATH  Google Scholar 

  12. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal für Betriebswirtschaft 58, 21–51 (2008)

    Article  Google Scholar 

  13. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58, 81–117 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIOC, Universidad de La Laguna, Spain

    I. Rodríguez-Martín & Juan José Salazar-González

Authors
  1. I. Rodríguez-Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan José Salazar-González
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Julia Pahl  & Stefan Voß  & 

  2. School of Information Systems, Curtin University, 6845, Perth, WA, Australia

    Torsten Reiners

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodríguez-Martín, I., Salazar-González, J.J. (2011). The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21526-1

  • Online ISBN: 978-3-642-21527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation