Pickup and Delivery Selection: Problem Formulation and Extension to Problem Variants

Ramaekers Katrien (), Caris An (), Maes Tabitha () and Janssens Gerrit K. ()
Additional contact information
Janssens Gerrit K.: Hasselt University

Information Technology and Management Science, 2015, vol. 18, issue 1, 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.

Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/itms-2015-0013 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrs:itmasc:v:18:y:2015:i:1:p:84-90:n:13

DOI: 10.1515/itms-2015-0013

Access Statistics for this article

Information Technology and Management Science is currently edited by J. Merkurjevs

More articles in Information Technology and Management Science from Sciendo
Bibliographic data for series maintained by Peter Golla ().