Differential evolution algorithm with local search for capacitated vehicle routing problem
by Boon Ean Teoh; S.G. Ponnambalam; G. Kanagaraj
International Journal of Bio-Inspired Computation (IJBIC), Vol. 7, No. 5, 2015

Abstract: This paper presents an improved differential evolution algorithm with local search (DELS) for solving the capacitated vehicle routing problem (CVRP). The CVRP is a classical vehicle routing problem with additional constraint where the capacity of the vehicle travelling on a specific route cannot exceed the maximum vehicle capacity. Local search procedures help to explore new search areas and refine the solutions found. The proposed algorithm is tested on CVRP instances described by Augerat et al. and Christofides and Eilon. The proposed DELS approach generate quality solutions for the benchmark problems tested and are comparable to the algorithms reported in the literature.

Online publication date: Wed, 07-Oct-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 Bio-Inspired Computation (IJBIC):
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