Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/57207
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTeerapun Saeheawen_US
dc.contributor.authorNivit Charoenchaien_US
dc.date.accessioned2018-09-05T03:36:29Z-
dc.date.available2018-09-05T03:36:29Z-
dc.date.issued2017-07-03en_US
dc.identifier.issn14498596en_US
dc.identifier.other2-s2.0-85002489596en_US
dc.identifier.other10.1080/14498596.2016.1256237en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85002489596&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/57207-
dc.description.abstract© 2016 Mapping Sciences Institute, Australia and Surveying and Spatial Sciences Institute. This paper introduces meta-heuristics and its application to an employee transportation problem for a case study of a hard disk drive company. The objective of the development is to demonstrate improved route planning and fleet assignment to serve all employees in terms of cost savings. A GIS-based employee transportation system is created to design the shortest routes with feasible fleet allocation. The proposed meta-heuristics–central force optimization (CFO), chemical reaction optimization (CRO), and a parallel CFO-CRO–are compared with cuckoo search to validate the performance. The proposed algorithms can effectively determine the most feasible routes. The system is easy to use and capable of handling complex vehicle routing problems.en_US
dc.subjectEarth and Planetary Sciencesen_US
dc.subjectEnergyen_US
dc.subjectSocial Sciencesen_US
dc.titleIntegration of geographical information systems, meta-heuristics and optimization models for the employee transportation problemen_US
dc.typeJournalen_US
article.title.sourcetitleJournal of Spatial Scienceen_US
article.volume62en_US
article.stream.affiliationsChiang Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

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


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