Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21751
Title: | Pickup and delivery selection with a fixed vehicle cost | Authors: | RAMAEKERS, Katrien JANSSENS, Gerrit K. MAES, Tabitha CARIS, An |
Issue Date: | 2015 | Publisher: | Eurosis | Source: | Al-Akaidi, M.; Ayesh, A. (Ed.). Proceedings of the 2015 European Simulation and Modelling Conference (ESM’2015), p. 428-432 | Abstract: | A pickup and delivery problem is a special case of the vehicle routing problem in which goods at customer sites are either picked up or delivered. A carrier has only a limited capacity within his own vehicle fleet. Therefore the carrier can only serve a selection of customers. Transport requests of clients are accepted only if they contribute to a higher total profit. A paired pickup and delivery selection problem is hardly investigated in literature. In case the carrier has a fixed fleet with a set of drivers, it is realistic that drivers have to be paid whether the truck is used or not. This leads to a fixed cost per vehicle in the decision problem. This practical aspect is modeled with the Pickup and Delivery with selection of customers. A mixed-integer programming formulation is given. A meta-heuristic method, more specifically a tabu-embedded simulated annealing algorithm, is developed to solve the problem in an efficient way. The heuristic is explained in detail. | Keywords: | vehicle routing; pickup and delivery problem; metaheuristics; optimization | Document URI: | http://hdl.handle.net/1942/21751 | ISBN: | 9789077381908 | Rights: | © 2015 EUROSIS-ETI | Category: | C1 | Type: | Proceedings Paper | Validations: | vabb 2019 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ESM2015.pdf Restricted Access | Published version | 5.57 MB | Adobe PDF | View/Open Request a copy |
Page view(s)
20
checked on Sep 7, 2022
Download(s)
6
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.