IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i4p639-641.html
   My bibliography  Save this article

An Approximation Algorithm for the Traveling Salesman Problem with Backhauls

Author

Listed:
  • Michel Gendreau

    (Université Montréal, Montréal, Canada)

  • Gilbert Laporte

    (Université Montréal, Montréal, Canada)

  • Alain Hertz

    (Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland)

Abstract

The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G = ( V , E ). The vertex set is partitioned into V = ({ v 1 }, L , B ), where v 1 is a depot, L is a set of linehaul customers, and B is a set of backhaul customers. A cost matrix satisfying the triangle inequality is defined on the edge set E . The TSPB consists of determining a least-cost Hamiltonian cycle on G such that all vertices of L are visited contiguously after v 1 , followed by all vertices of B . Following a result by Christofides for the Traveling Salesman Problem, we propose an approximation algorithm with worst-case performance ratio of 3/2 for the TSPB.

Suggested Citation

  • Michel Gendreau & Gilbert Laporte & Alain Hertz, 1997. "An Approximation Algorithm for the Traveling Salesman Problem with Backhauls," Operations Research, INFORMS, vol. 45(4), pages 639-641, August.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:639-641
    DOI: 10.1287/opre.45.4.639
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.4.639
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.4.639?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
    ---><---

    Citations

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


    Cited by:

    1. Ganesh, K. & Narendran, T.T., 2007. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up," European Journal of Operational Research, Elsevier, vol. 178(3), pages 699-717, May.
    2. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    3. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    4. Hipólito Hernández-Pérez & Juan-José Salazar-González, 2004. "Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem," Transportation Science, INFORMS, vol. 38(2), pages 245-255, May.
    5. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    6. 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.
    7. Mathias Weller & Annie Chateau & Rodolphe Giroudeau & Jean-Claude König & Valentin Pollet, 2018. "On residual approximation in solution extension problems," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1195-1220, November.

    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:inm:oropre:v:45:y:1997:i:4:p:639-641. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.