Intelligence Online System for Automatic Route Planning by Using Genetic Algorithm
Main Article Content
Abstract
This research proposes the application of genetic algorithms to create online automated routes by using the distributer staff’s routes to analyze and improve the distribution routes in the transportation system in Udon Thani province in Thailand in order to determine the best and shortest routes, the lowest cost, and the shortest and most convenient period of time in order to serve the customer needs by using minimal resources. The distributor staff will define a delivery destinations according to the number of packages. Then the system’s process begins to find the best routes to travel to all of the desired destinations by using a genetic algorithm. The research effectiveness was tested by comparing the algorithm’s search with the Greedy Best First Search, the A*search and the manual search by the distributer staff who are experts in delivery. The results revealed that the method proposed can handle the deliveries better than the other methods both in terms of the distance and time. The user satisfaction test result was at the good level. The tests indicated that the proposed method is able to determine the proper route effectively and is a suitable tool for helping the distributor staff to work more efficiently.
Article Details
The articles published are the opinion of the author only. The author is responsible for any legal consequences. That may arise from that article.
References
[2] M. Baker and M. A. Ayechew, “A genetic algorithm for the vehicle routing problem,” Computers & Operations Research, vol. 5, pp. 787–800, 2003.
[3] K. C. Tan, L. H. Lee, and K. Ou, “Artificial intelligence heuristics in solving vehicle routing problems with time window constraints,” Engineering Applications of Artificial Intelligence, vol. 14, pp. 825–837, 2001.
[4] V. Cerny, “Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm,” Journal of Optimization Theory and Applications, vol. 45, pp. 41–55, 1985.
[5] J. A. A. Van der Veen, “Solvable cases of the traveling salesman problem with various objective function,” Ph.D. thesis, University of Groningen, Groningen, 1992.
[6] D. S. Johnson and L. A. McGeoch, “The traveling salesman problem: A case study in local optimization,” Local search in combinatorial optimization, 1997.
[7] M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer, “Data structures for traveling salesmen,” Journal of Algorithms, vol. 18, no. 3, pp. 432–479, 1995.
[8] J. Carlier and P. Villon, “A new heuristic for the traveling salesman problem,” Recherche Operationelle/Operations Research, vol. 24, no. 3, pp. 245–253, 1999.
[9] G. A. CROES, “A method for solving traveling salesman problems,” Operations Research, vol. 6, no. 6, pp. 791–812, 1958.
[10] S. Singh and E.A. Lodhi, “Study of variation in TSP using genetic algorithm and its operator comparison,” International Journal of Soft Computing and Engineering, vol. 3, no. 2, pp. 264–267, 2013.
[11] S. Han, “The normality analysis of test score,” presented at the International Conference on Control, Automation and Systems Engineering (CASE), Singapore, Singapore, Jul. 30–31, 2011.
[12] Y. Yi and Q. Fang, “The improved hybrid genetic algorithm for solving TSP based on Handel-C,” presented at the 3rd International Conference on Advanced Computer Theory and Engineering, Chengdu, China, Aug. 20–22, 2010.
[13] Z. Wang, H. Duan, and X. Zhang, “An improved greedy genetic algorithm for solving travelling salesman problem,” presented at the Fifth International Conference on Natural Computation, Tianjin, China, Aug. 14–16, 2009.
[14] D. E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine Learning.” Massachusetts: Addison-Wesley Publishing Company, Inc. 1989.
[15] J. H. Holland, “Genetic algorithm and the Optimal Allocation of Trials,” SIAM Journal of Computing, vol. 2, no. 2, pp. 88–105, 1973.
[16] D. Xiaoyu and L. Yunhao, “Research and implementation of Web-Online english testing system,” in Proceedings Fourth International Symposium on Information Science and Engineering, 2010, pp. 430–433.
[17] S. Ghoshray and K. K. Yen, “More efficient genetic algorithm for solving optimization problems,” in Proceedings IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, vol. 5, pp. 4515–4520, 1995.
[18] B. Bonet and H. Geffner, “Planning as heuristic search,” Artificial Intelligence, vol. 129, pp. 5–33, 2001.
[19] M. Jose, “A heuristic for the traveling salesman problem based on a continuous approximation,” Transportation Research Part B33, pp.123–152, 1999.
