Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/59097 
Kompletter Metadatensatz
DublinCore-FeldWertSprache
dc.contributor.authorDrexl, Michaelen
dc.date.accessioned2011-01-23-
dc.date.accessioned2012-06-20T10:01:39Z-
dc.date.available2012-06-20T10:01:39Z-
dc.date.issued2011-
dc.identifier.citation|aRevista de Métodos Cuantitativos para la Economía y la Empresa|c1886-516X|v12|nUniversidad Pablo de Olavide|lSevilla|y2011|p5-38en
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
dc.language.isoengen
dc.publisher|aUniversidad Pablo de Olavide |cSevillaen
dc.subject.jelC61en
dc.subject.ddc330en
dc.subject.keywordvehicle routingen
dc.subject.keywordtransshipmenten
dc.subject.keywordfleet planningen
dc.subject.keywordelementary shortest path problem with resource constraintsen
dc.titleBranch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem-
dc.typeArticleen
dc.identifier.ppn683955098en
dc.rights.licensehttp://creativecommons.org/licenses/by-sa/3.0/es/en
econstor.citation.journaltitleRevista de Métodos Cuantitativos para la Economía y la Empresaen
econstor.citation.issn1886-516Xen
econstor.citation.volume12en
econstor.citation.publisherUniversidad Pablo de Olavideen
econstor.citation.publisherplaceSevillaen
econstor.citation.year2011en
econstor.citation.startpage5en
econstor.citation.endpage38en

Datei(en):
Datei
Größe
474.98 kB





Publikationen in EconStor sind urheberrechtlich geschützt.