The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search

Wassan, Naveed A. and Wassan, Niaz A. and Nagy, Gábor and Salhi, Said (2017) The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search. Computers & Operations Research, 78 . pp. 454-467. ISSN 0305-0548. (doi:https://doi.org/10.1016/j.cor.2015.12.017) (Full text available)

PDF - Author's Accepted Manuscript
Download (623kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1016/j.cor.2015.12.017

Abstract

In this paper a new VRP variant the Multiple Trip Vehicle Routing Problem with Backhauls (MT-VRPB) is investigated. The classical MT-VRP model is extended by including the backhauling aspect. An ILP formulation of the MT-VRPB is first presented and CPLEX results for small and medium size instances are reported. For large instances of the MT-VRPB a Two-Level VNS algorithm is developed. To gain a continuous balanced intensification and diversification during the search process VNS is embedded with the sequential VND and a multi-layer local search approach. The algorithm is tested on a set of new MT-VRPB data instances which we generated. Interesting computational results are presented. The Two-Level VNS produced excellent results when tested on the special variant of the VRPB.

Item Type: Article
Uncontrolled keywords: Routing; Multiple trips; Backhauling; VNS; Meta-heuristics
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: 08 Feb 2016 15:58 UTC
Last Modified: 07 Aug 2018 11:12 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/54046 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year