Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/59097
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDrexl, Michaelen_US
dc.date.accessioned2011-01-23en_US
dc.date.accessioned2012-06-20T10:01:39Z-
dc.date.available2012-06-20T10:01:39Z-
dc.date.issued2011en_US
dc.identifier.citation|aRevista de Métodos Cuantitativos para la Economía y la Empresa |c1886-516X |v12 |y2011 |p5-38en_US
dc.identifier.urihttp://hdl.handle.net/10419/59097-
dc.description.abstractThe generalized truck-and-trailer routing problem (GTTRP) constitutes a uni¯ed model for vehicle routing problems with trailers and a fixed lorry-trailer assignment. The GTTRP is a generalization of the truck-and-trailer routing problem (TTRP), which itself is an extension of the well-known vehicle routing problem (VRP). In the GTTRP, the vehicle fleet consists of single lorries and lorry-trailer combinations. Some customers may be visited only by a single lorry or by a lorry without its trailer, some may also be visited by a lorry-trailer combination. In addition to the customer locations, there is another relevant type of location, called transshipment location, where trailers can be parked and where a load transfer from a lorry to its trailer can be performed. In this paper, two mixed-integer programming (MIP) formulations for the GTTRP are presented. Moreover, an exact solution procedure for the problem, a branch-and-price algorithm, and heuristic variants of this algorithm are described. Computational experiments with the algorithms are presented and discussed. The experiments are performed on randomly generated instances structured to resemble real-world situations and on TTRP benchmark instances from the literature. The results of the experiments show that instances of realistic structure and size can be solved in short time and with high solution quality by a heuristic algorithm based on column generation.en_US
dc.language.isoengen_US
dc.publisher|aUniversidad Pablo de Olavide |cSevillaen_US
dc.subject.jelC61en_US
dc.subject.ddc330en_US
dc.subject.keywordvehicle routingen_US
dc.subject.keywordtransshipmenten_US
dc.subject.keywordfleet planningen_US
dc.subject.keywordelementary shortest path problem with resource constraintsen_US
dc.titleBranch-and-price and heuristic column generation for the generalized truck-and-trailer routing problemen_US
dc.typeArticleen_US
dc.identifier.ppn683955098en_US
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungenen_US

Files in This Item:
File
Size
474.98 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.