IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v4y2013i2p31-43.html
   My bibliography  Save this article

Models and Solutions for Truck and Trailer Routing Problems: An Overview

Author

Listed:
  • Isis Torres Pérez

    (Department of Software Engineering, Polytechnic University José Antonio Echeverría (ISPJAE), Havana, Cuba)

  • José Luis Verdegay

    (Department of Computer Science and Artificial Intelligence (DECSAI), University of Granada (UGR), Granada, Spain)

  • Carlos Cruz Corona

    (Department of Computer Science and Artificial Intelligence (DECSAI), University of Granada (UGR), Granada, Spain)

  • Alejandro Rosete Suárez

    (Department of Artificial Intelligence and Computer Systems (DIAISI), Polytechnic University José Antonio Echeverría (ISPJAE), Havana, Cuba)

Abstract

This paper is a survey about of the Truck and Trailer Routing Problem. The Truck and Trailer Routing Problem is an extension of the well-known Vehicle Routing Problem. Defined recently, this problem consists in designing the optimal set of routes for fleet of vehicles (trucks and trailers) in order to serve a given set of geographically dispersed customers. Since TTRP itself is a very difficult combinatorial optimization problem are usually tackled by metaheuristics. The interest in Truck and Trailer Routing Problem is motivated by its practical relevance as well as by its considerable difficulty. The goal of this paper is to show a study on the TTRP and the metaheuristics used for to solve it.

Suggested Citation

  • Isis Torres Pérez & José Luis Verdegay & Carlos Cruz Corona & Alejandro Rosete Suárez, 2013. "Models and Solutions for Truck and Trailer Routing Problems: An Overview," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 4(2), pages 31-43, April.
    • Handle: RePEc:igg:jamc00:v:4:y:2013:i:2:p:31-43
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2013040103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:4:y:2013:i:2:p:31-43. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.