Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/19058
Title: | Pickup and delivery selection with compulsory requests | Authors: | RAMAEKERS, Katrien CARIS, An JANSSENS, Gerrit K. MAES, Tabitha |
Issue Date: | 2015 | Source: | Sequeria Goncalves, P.J. (Ed.). Proceedings of the 21st European Concurrent Engineering Conference/11th Future Business Technology Conference/19th Annual Euromedia Conference, p. 28-33 | Abstract: | The operational planning decisions of a carrier consist of accepting transport requests of customers and constructing daily vehicle routes. Several customers may have less-than-truckload requests to be transported between two specified locations: these customers are consolidated into vehicle tours by the carrier. However, a carrier has only a limited capacity within his own vehicle fleet. Therefore he can only serve a selection of clients. Transport requests of clients are only accepted if they contribute to a higher total profit. A paired pickup and delivery selection problem is hardly investigated in literature. Due to long term contract or for other commercial reasons, some of the requests cannot be neglected, even if they do not contribute fully to profit. This practical aspect is modeled 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. | Keywords: | vehicle routing; pickup and delivery problem; metaheuristics; optimisation | Document URI: | http://hdl.handle.net/1942/19058 | ISBN: | 978-90-77381-88-5 | Rights: | © 2015 EUROSIS-ETI | Category: | C1 | Type: | Proceedings Paper | Validations: | vabb 2018 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FUBUTEC2015 (1).pdf | 6.36 MB | Adobe PDF | View/Open |
Page view(s)
60
checked on Aug 25, 2023
Download(s)
22
checked on Aug 25, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.