A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem

We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed...

Full description

Saved in:
Bibliographic Details
Published in:TheScientificWorld 2013-01, Vol.2013 (2013), p.1-11
Main Authors: Pichpibul, Tantikorn, Kawtummachai, Ruengsak
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Computer applications
Cost control
Customers
Engineering research
Genetic algorithms
Heuristic
Heuristic methods
Heuristic programming
Mathematical research
Mobile communication systems
Monte Carlo simulation
Researchers
Route planning
Routing
Traveling salesman problem
Vehicle routing
Vehicles
Wireless communication systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62).
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2013/874349