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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Logistics Systems and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
