Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21984
Title: Pickup and delivery selection: problem formulation and extension to problem variants
Authors: RAMAEKERS, Katrien 
CARIS, An 
MAES, Tabitha 
JANSSENS, Gerrit 
Issue Date: 2015
Source: Information Technology and Management Science, 2015(18), p. 84-90
Abstract: Operational planning decisions of a carrier consist of accepting transport requests and constructing vehicle routes. However, a carrier has only a limited capacity within his own vehicle fleet and can only serve a selection of clients. Transport requests are accepted only if they contribute to a higher total profit. This practical aspect is modelled with the Pickup and Delivery with selection of customers. A mixed-integer programming formulation is given. It is indicated how the problem is solved by means of a meta-heuristic, more specifically a tabu-embedded simulated annealing algorithm. A number of alternative settings may appear in practice. They are discussed in this article.
Keywords: heursistic algorithms; operations research; optimisation; vehicle routing
Document URI: http://hdl.handle.net/1942/21984
ISSN: 2255-9094
DOI: 10.1515/itms-2015-0013
Rights: © 2015 Katrien Ramaekers, An Caris, Tabitha Maes and Gerrit K. Janssens. This is an open access article licensed under the Creative Commons Attribution-NonCommercial-NoDerivs License (http://creativecommons.org/licenses/by/4.0), in the manner agreed with De Gruyter Open.
Category: A1
Type: Journal Contribution
Validations: vabb 2018
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
RTU_Information Technology and Management Science.pdfPublished version1.24 MBAdobe PDFView/Open
Show full item record

Page view(s)

100
checked on May 20, 2022

Download(s)

408
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


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