Please use this identifier to cite or link to this item:
|Title:||Using genetic algorithm in implementing capacitated vehicle routing problem||Authors:||Mohammed, M.A.
|Keywords:||Capacitated Vehicle Routing Problem
Vehicle Routing Problem
|Issue Date:||2012||Conference:||2012 International Conference on Computer and Information Science||Abstract:||Vehicle Routing Problem (VRP) has been considered as a significant segment in logistic handling. Thus, a proper selection of vehicle routes plays a very important part to ameliorate the economic benefits of logistic operations. In this paper, we consider the application of a Genetic Algorithm (GA) to a Capacitated Vehicle Routing Problem (CVRP) in which a set of vehicles with limits on capacity and travel time are available to service a set of customers and constrained by earliest and latest time for serving. The results of our test show that GA is able to determine the optimum route for the vehicles while maintaining their constraints of capacity and travel time. © 2012 IEEE.||URI:||https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867954555&doi=10.1109%2fICCISci.2012.6297250&partnerID=40&md5=6e4cd28f948014242567fba5a1f7bce7
|Appears in Collections:||CSIT Scholarly Publication|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.