A Variable Neighborhood-Based Heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Salhi, Said (2008) A Variable Neighborhood-Based Heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Working paper. University of Kent Canterbury, Canterbury 10.1016/j.ejor.2008.07.022 . (Full text available)

PDF
Download (242kB)
[img]
Preview
Official URL
http://www.kent.ac.uk/kbs/research/working-papers....

Abstract

The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the 2-opt. Our VNS algorithm uses several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. Two VNS variants, which differ in the order the diversification and Dijkstra's algorithm are used, are implemented. Both variants appear to be competitive and produce new best results when tested on the data sets from the literature. We also constructed larger data sets for which benchmarking results are provided for future comparison.

Item Type: Monograph (Working paper)
Additional information: Working Paper Number 180
Uncontrolled keywords: Meta-heuristic Routing Heterogeneous fleet Variable neighborhood
Subjects: H Social Sciences > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Jennifer Knapp
Date Deposited: 08 Sep 2010 11:55
Last Modified: 04 Jun 2014 13:50
Resource URI: http://kar.kent.ac.uk/id/eprint/25482 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year