Capacitated vehicle routing problem using genetic algorithm: a case of cement distribution Online publication date: Tue, 18-Dec-2018
by Tanzila Azad; M. Ahsan Akhtar Hasin
International Journal of Logistics Systems and Management (IJLSM), Vol. 32, No. 1, 2019
Abstract: Vehicle routing problem is a multi-objective problem. The problem involves optimising a fleet of vehicles that are to serve a number of customers from a central depot. Each vehicle has limited capacity and each customer has a certain demand. A procedure is introduced for the optimisation of a customer order service management system with a structured distribution network of a cement company of Bangladesh. The goal of the research is to find a solution of vehicle routing problem using genetic algorithm. It generates feasible clusters of resellers or distributors and determines delivery sequence and an optimal distribution network to meet demands by travelling minimum distance. The results of the study show that genetic algorithm provides a search technique used in computing to find true or approximate solution of search problems. The technique is able to determine the optimum route for the vehicles, while maintaining their constraints to get an optimal distribution network that minimises the total travelling distance.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook