Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleA genetic search algorithm for a vehicle routing problem with time windows
dc.contributor.authorWang, Y.F.
dc.contributor.authorZhang, Y.F.
dc.contributor.authorFuh, J.Y.H.
dc.identifier.citationWang, Y.F.,Zhang, Y.F.,Fuh, J.Y.H. (2010). A genetic search algorithm for a vehicle routing problem with time windows. Proceedings - 2010 International Conference on Manufacturing Automation, ICMA 2010 : 172-177. ScholarBank@NUS Repository. <a href="" target="_blank"></a>
dc.description.abstractThis paper models a vehicle routing problem applied in Singapore transportation situation. It is close to the classical vehicle routing problem with time windows, but with two special characteristics. Firstly, the routes are designed for vehicles to serve the customers in a practical map modeled with a set of roads and junctions. Secondly, in order to manage the traffic conditions, the special Electronic Road Pricing (ERP) systems of Singapore applied in some roads are taken into consideration, which would affect the route cost for serving the customers. The overall objective of this problem is to obtain a set of routes with lowest cost to serve customers. This is a combinatorial optimization problem and difficult to find a good solution in a reasonable amount of time. To this end, a genetic search algorithm is developed to find a solution with high quality. An application example is demonstrated to verify its effectiveness. © 2010 IEEE.
dc.subjectGenetic algorithm
dc.subjectSingapore transportation
dc.subjectVehicle routing problem with time windows
dc.typeConference Paper
dc.contributor.departmentMECHANICAL ENGINEERING
dc.description.sourcetitleProceedings - 2010 International Conference on Manufacturing Automation, ICMA 2010
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Sep 23, 2021

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.