Solving Traveling Transportation Problems using Adaptive Current Search

Article Sidebar

pdf
Published: Apr 11, 2016
Keywords:
Traveling transportation problem Adaptive current search Metaheuristic optimization

Main Article Content

Supaporn Suwannarongsri
Department of Materials Handling and Logistics Engineering,Faculty of Engineering, King Mongkut’s University of Technology North Bangkok

Abstract

This paper proposes the application of the adaptive current search (ACS) to solve the traveling
transportation problems (TTP) optimally. The TTP problem is considered as a class of NP-complete problems which can be solve by only efficient method or metaheuristic approach. The ACS is one of the most efficient metaheuristic optimization techniques. In this paper, the ACS is applied to solve six provincially TTP problems in Thailand as a case study. Solutions obtained by the ACS will be compared with those obtained by the genetic algorithm (GA) and tabu search (TS). As results, it was found that the ACS can provide better solutions than the GA and TS significantly.

Article Details

How to Cite
Suwannarongsri, S. (2016). Solving Traveling Transportation Problems using Adaptive Current Search. Thai Industrial Engineering Network Journal, 2(2), 1–7. Retrieved from https://ph02.tci-thaijo.org/index.php/ienj/article/view/179512
Issue
Vol. 2 No. 2 (2016): Apr-Jun 2016
Section
Research and Review Article

บทความ ข้อมูล เนื้อหา รูปภาพ ฯลฯ ที่ได้รับการตีพิมพ์ในวารสารฯ ถือเป็นลิขสิทธิ์ของวารสารฯ หากบุคคลหรือหน่วยงานใดต้องการนำทั้งหมดหรือส่วนหนึ่งส่วนใดไปเผยแพร่ต่อหรือเพื่อกระทำการใดๆ จะได้รับอนุญาต แต่ห้ามนำไปใช้เพื่่อประโยชน์ทางธุรกิจ และห้ามดัดแปลง

References

[1] S. Kikuchi and P. Chakroborty, “Place of possibility theory in transportation analysis,”
Transportation Research, Part B, vol.40, pp.595 – 615, 2006.
[2] G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, 1994.
[3] M. Held and R. Karp, “A dynamic programming approach to sequencing problems,” SIAM J, vol.1, pp.196 – 210, 1962.
[4] J. Little, K. Murty, D. Sweeney and C. Karel, “An algorithm for the traveling salesman problem,”
Operation Research, vol.12, pp.972 – 989, 1963.
[5] G. B. Dantzig, D. R. Fulkerson, and S. M. Johnson, “Solution of a large scale traveling salesman problem,” Operation Research, vol.2, pp.393 – 410, 1954.
[6] E. H. L. Aarts, J. H. M. Korst and P. J. M. Laarhoven, “A quantitative analysis of the simulated annealing algorithm: a case study for the traveling salesman problem,” J. of Stats Phys, vol.50, pp.189 – 206, 1988.
[7] C. N. Fiechter, “A parallel tabu search algorithm for large scale traveling salesman problems,” Discrete Applied Mathematics, vol. 51(3), pp. 243 – 267, 1994.
[8] J. V. Potvin, “Genetic algorithms for the traveling salesman problem,” Annuals of Operation Research, vol.63, pp.339 – 370, 1996.
[9] S. Suwannarongsri, T. Bunnag and W. Klinbun, “Energy resource management of assembly line balancing problem using modified current search method,” International Journal of Intelligent Systems and Applications, vol.6, no.3, pp. 1 – 11, 2014.
[10] S. Suwannarongsri, T. Bunnag and W. Klinbun, “Optimization of energy resource management for assembly line balancing using adaptive current search,” American Journal of Operations Research, vol.4, no.1, pp. 8 – 21, 2014.
[11] S. Suwannarongsri, T. Bunnag and W. Klinbun, “Traveling transportation problem optimization by adaptive current search method,” International Journal of Modern Education and Computer Science, vol.6, no.5, pp. 33 – 45, 2014.
[12] M. Bellmore and G. L. Nemhauser, “The traveling salesman problem: a survey,” Operation Research, vol.16, pp.538 – 558, 1986.