The split-demand one-commodity pickup-and-delivery travelling salesman problem

Salazar-Gonzalez, Juan-Jose and Santos-Hernandez, Beatriz (2015) The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transportation Research Part B: Methodological, 75. pp. 58-73. ISSN 0191-2615

Full text not available from this repository.

Abstract

This paper introduces a new vehicle routing problem transferring one commodity between customers with a capacitated vehicle that can visit a customer more than once, although a maximum number of visits must be respected. It generalizes the capacitated vehicle routing problem with split demands and some other variants recently addressed in the literature. We model the problem with a single commodity flow formulation and design a branch-and-cut approach to solve it. We make use of Benders Decomposition to project out the flow variables from the formulation. Inequalities to strengthen the linear programming relaxation are also presented and separated within the approach. Extensive computational results illustrate the performance of the approach on benchmark instances from the literature. (C) 2015 Elsevier Ltd. All rights reserved.

Item Type:
Journal Article
Journal or Publication Title:
Transportation Research Part B: Methodological
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/3300/3313
Subjects:
ID Code:
126522
Deposited By:
Deposited On:
25 Jul 2018 08:26
Refereed?:
Yes
Published?:
Published
Last Modified:
05 Aug 2020 06:26