VEHICLE ROUTING OF PARCEL POST DISTRIBUTION IN NONTHABURI USING PARTICLE SWARM OPTIMIZATION
Keywords:
Particle Swarm Optimization, Traveling Salesman Problem, Benchmark Problem, Parcel Post Distribution, Thailand PostAbstract
The research applied the Particle Swarm Optimization along with Local Search including Swap and 2-opt to plan the route arrangement of parcel post distribution of Thailand Post in Nonthaburi. The research tested appropriate parameters for the proposed algorithm including acceleration factor for local best position equal to 2, acceleration factors for global best position equal to 4 and inertia weight equal to 0.9. The results showed that the proposed algorithm could calculate shortest route is equal to 76.1 kilometers using 2.20 seconds. In addition, the research also tested the performance of algorithm which was proposed with 10 benchmark problems which was travelling salesman problem and compared the solutions including the research problem, ulysses16 and ulysses22 with the Nearest Neighbor Algorithm. It appeared that the algorithm which was proposed could search solutions all benchmark problems. The eil51 problem had the highest error deviation equal to 2.34 percent and could search all solutions better than Nearest Neighbor Algorithm
Downloads
References
Electronic Transactions Development Agency. (2018). ETDA reveals that the value of Thai e-Commerce has grown consistently Shoots up to 3.2 trillion baht in 2018. Retrieved February 2, 2019, from https://www.etda.or.th/content/etda (in Thai).
Dyfed Loesche. (2018). Mobile E-Commerce is up and Poised for Further Growth. Statista. Retrieved Mar 20, 2019, from https://www.statista.com/chart/13139/estimated-worldwide-mobile-e-commerce-sales/
Nathachit. (2019). How is the Thai E-Commerce going?. Marketeer. from https://marketeeronline.co/archives/66618 (in Thai).
Atiwat Boonmee, Woraya Neungmatcha, and Ampika Boonmee. (2017, January-June). The improvement of ice transportation routing for minimizing the transportation cost by particle swarm optimization. Thai Industrial Engineering Network Journal, 1, 17-24. (in Thai).
Xuesong Yan, Can Zhang, Wenjing Luo, Wei Li, Wei Chen, and Hanmin Liu. (2012, November). Solve Travelling Salesmans Problem Using Particle Swarm Optimization Algorithm. International Journal of Computer Science Issues. 9, 6(2), 264-271.
X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and Q. X. Wang. (2007, August 31). Particle Swarm Optimization–based algorithm for TSP and generalized TSP. Information Processing Letters, 103(5), 169-176.
Thirachit Saenphon. (2018, October). Enhancing Particle Swarm Optimization Using Opposite Gradient Search for Travelling Salesman Problem. International Journal of Computer and Communication Engineering, 7(4), 167-177.
Prasit Sukserm, and Deacha Puangdownreong. (2013, September-December). Model Identification of DC Generator using Particle Swarm Optimization. The Journal of Industrial Technology, 9(3), 139-150. (in Thai).
Chanwit Boonchuay, Mathee Chaiaroon, and Sompol Boonyasuwanno. (2012). Development of Computational Intelligent Unit for Optimal Generation Scheduring. (Electrical Engineering Technology). Nakornpathom: Rajamangala University of Technology Rattanakosin. (in Thai).
Kairat Jaroenrat. (2015, January-June). Particle Swarm Optimization for Open Shortest Path First Network’s Traffic Engineering. Information Technology Journal, 11(1), 43-52. (in Thai).
Rapeepan Pitakaso. (2016). Evolutionary methods using variances to solve logistics transportation problems. 1st ed, Ubonratchathani: Department of Industrial Engineering Ubonratchathani University. (in Thai).
Parames Chutima. (2002). Design of Engineering Experiment. Bangkok: Chulalongkorn University. (in Thai).
Booncharoen Sirinaovakul. (2012). Artificial Intelligence : Swarm Intelligence. Bangkok: Top. (in Thai).
Gerhard Reinelt. (1991). TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing, 3(4), 376-384.
Downloads
Published
How to Cite
Issue
Section
License
Srinakharinwirot University Journal of Sciences and Technology is licensed Under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International (CC-BY-NC-ND 4.0) License, Unless Otherwise Stated. Please Read Journal Policies Page for More Information on Open Access, Copyright and Permissions.
