Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/65437
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWarisa Wisittipanichen_US
dc.contributor.authorKritsada Ananthapanyasuten_US
dc.date.accessioned2019-08-05T04:33:24Z-
dc.date.available2019-08-05T04:33:24Z-
dc.date.issued2019-01-01en_US
dc.identifier.issn21698767en_US
dc.identifier.other2-s2.0-85067249898en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85067249898&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/65437-
dc.description.abstract© IEOM Society International. Nowadays, in spite of advanced communication technology, the post box collection activity is still operating by the agents of a country's postal service. Thus, this activity needs to be operated at minimum cost with smart decision making. The aim of this study is to find the optimal routing in post box collection activity with an objective to minimize the total traveling time. To deal with large-scale problem in the real-world practice, particle swarm optimization (PSO) algorithm are applied to solve the complexity of the problem. The experiments are executed using the case study of post box collection in Chiang Mai city, Thailand. The results showed that the proposed PSO can effectively find the new routing which helps to reduce the total travelling time by 11.14%, the total travelling distance by 7.11%, and the total cost by 13.86%.en_US
dc.subjectBusiness, Management and Accountingen_US
dc.subjectDecision Sciencesen_US
dc.subjectEngineeringen_US
dc.titleParticle swarm optimization for post box collection routing problemen_US
dc.typeConference Proceedingen_US
article.title.sourcetitleProceedings of the International Conference on Industrial Engineering and Operations Managementen_US
article.volume2019en_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.