Genetic Algorithm based approach for Vehicle Routing Problem with Time Windows
by M. Rajmohan, P. Shahabudeen
International Journal of Logistics Systems and Management (IJLSM), Vol. 4, No. 3, 2008

Abstract: Logistics and supply chain management deals with managing the flow of goods from suppliers, through its facilities, and onto its customers. It is of critical importance in establishing a competitive advantage. Proper performance of the logistics functions can contribute to both lower costs and to enhance customer service. To reduce transportation costs and also to improve customer service, finding the best paths for vehicles that will minimise time or distance is frequent decision problem and this is commonly known as the Vehicle Routing Problem (VRP). In this paper, Genetic Algorithm (GA) based heuristic is proposed to solve Vehicle Routing Problem with Time Windows. The initial population of the GA is generated using Greedy Randomised Adaptive Search Procedure. The proposed algorithm is tested with bench mark instances and is found to be better solutions than published results.

Online publication date: Wed, 12-Mar-2008

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 Logistics Systems and Management (IJLSM):
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