Nagy, Gábor, Wassan, Niaz A., Speranza, M. Grazia, Archetti, Claudia (2013) The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science, 49 (2). pp. 271-294. ISSN 0041-1655. E-ISSN 1526-5447. (doi:10.1287/trsc.2013.0501)
PDF
- Publisher pdf
 This work is licensed under a Creative Commons Attribution 4.0 International License. |
||
|
Download (380kB)
Preview
|
|
|
| Official URL http://dx.doi.org/10.1287/trsc.2013.0501 |
||
Abstract
The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within
capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits.
linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup
simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem
quantities separately.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1287/trsc.2013.0501 |
| Uncontrolled keywords: | vehicle routing; divisible deliveries and pickups; metaheuristics; tabu search |
| Subjects: | Q Science > Operations Research - Theory |
| Divisions: |
Faculties > Social Sciences > Kent Business School > Management Science Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO) |
| Depositing User: | Gabor Nagy |
| Date Deposited: | 18 Jun 2015 21:09 UTC |
| Last Modified: | 18 Dec 2019 09:42 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/49081 (The current URI for this page, for reference purposes) |
| Wassan, Niaz A.: |  https://orcid.org/0000-0003-0153-7646 |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric