Two novel sweep-based heuristics for the vehicle routing problem
by Abdesslem Layeb; Salim Chikhi
International Journal of Computer Applications in Technology (IJCAT), Vol. 49, No. 3/4, 2014

Abstract: The vehicle routing problem (VRP) is a well-known complex problem and widely used in supply chains. The objective is to construct an optimal set of routes serving a number of customers under some constraints. The purpose of this study is to present two novel heuristics based on a new density distance which uses the polar coordinates of the sweep algorithm and the customer demand. The proposed algorithms use the ratio between the customer demands and the polar coordinates as ordering criteria. The proposed heuristics are based on three steps. In the first step, a giant tour is constructed by using two new ordering criteria. Next, the split procedure is applied to get feasible routes subject to the vehicles' capacities. Finally, each route of the constructed solution is improved by the application of the nearest neighbour heuristic. The results of the experiment indicate that the proposed heuristics are encouraging.

Online publication date: Mon, 02-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com