Skip navigation
Run Run Shaw Library City University of Hong KongRun Run Shaw Library

Please use this identifier to cite or link to this item: http://dspace.cityu.edu.hk/handle/2031/8961
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNg, Ho Tungen_US
dc.date.accessioned2018-12-24T06:40:22Z
dc.date.accessioned2019-02-12T07:36:27Z-
dc.date.available2018-12-24T06:40:22Z
dc.date.available2019-02-12T07:36:27Z-
dc.date.issued2018en_US
dc.identifier.other2018eenht555en_US
dc.identifier.urihttp://144.214.8.231/handle/2031/8961-
dc.description.abstractFor the sake of efficiency and cost reduction, it is important to find optimal routes for vehicles in the logistics industry. Moreover, electric vehicles are an emerging trend and their usage in logistics has aroused a lot of interest. In this project, it is assumed that there are multiple depots, and electric vehicles are assigned to deliver goods to customers under the load constraints. The duration of delivering all goods is taken as a measure to reflect the goodness of the routes, so as to ensure the quality of the delivery service. The situation where the electric vehicles run out of battery and need to look for a charge point is also considered. The optimization problem is solved by designing and implementing an evolutionary algorithm in software. The effectiveness of the design is verified based on some benchmark problem sets and real-time traffic condition obtained by the Google API. Lastly, the impacts of operational parameters on the searching ability of the designed algorithm are investigated.en_US
dc.titleOptimization of multi-depot electric vehicle routingen_US
dc.contributor.departmentDepartment of Electronic Engineeringen_US
dc.description.supervisorSupervisor: Dr. Tang, Wallace K S; Assessor: Prof. Chow, Tommy W Sen_US
Appears in Collections:Electrical Engineering - Undergraduate Final Year Projects 

Files in This Item:
File SizeFormat 
fulltext.html148 BHTMLView/Open
Show simple item record


Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.

Send feedback to Library Systems
Privacy Policy | Copyright | Disclaimer