Skip to main content

The Vehicle Routing Problem with Divisible Deliveries and Pickups

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) (KAR id:49081)

PDF Publisher pdf
Language: English

Creative Commons Licence
This work is licensed under a Creative Commons Attribution 4.0 International License.
Download (380kB) Preview
Official URL


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: 06 Feb 2020 04:12 UTC
Resource URI: (The current URI for this page, for reference purposes)
Nagy, Gábor:
Wassan, Niaz A.:
  • Depositors only (login required):


Downloads per month over past year