A tabu search with vocabulary building approach for the vehicle routing problem with split demands
by Rafael E. Aleman, Raymond R. Hill
International Journal of Metaheuristics (IJMHEUR), Vol. 1, No. 1, 2010

Abstract: In the vehicle routing problem (VRP) a fleet of vehicles with limited capacity is utilised to supply the demand of a set of customers located around a unique depot while minimising the total travelled distance. All customer demands are supplied and customers are visited by exactly one vehicle. In the split delivery vehicle routing problem (SDVRP), customers can be visited by more than one vehicle meaning their demands can be split among multiple vehicles. This paper presents a learning procedure, called tabu search with vocabulary building approach (TSVBA) for solving the SDVRP. TSVBA is a population-based search approach that uses a set of solutions to find attractive solution attributes with which to construct new solutions. As the search progresses, the solution set evolves; better solutions move into the set while bad solutions are removed. The proposed learning procedure was tested on benchmark instances and performed well when its solutions are compared to those reported in the literature. New best solutions are obtained on some benchmark problems available.

Online publication date: Sat, 08-May-2010

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 Metaheuristics (IJMHEUR):
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