Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 313767, 11 pages
http://dx.doi.org/10.1155/2014/313767
Research Article

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of Korea

Received 9 November 2013; Accepted 30 December 2013; Published 17 February 2014

Academic Editors: Z. Cui and X. Yang

Copyright © 2014 Jinmo Sung and Bongju Jeong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. Reinelt, “TSPLIB. A traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Google Scholar · View at Scopus
  2. C. L. P. Chen, “AND/OR precedence constraint traveling salesman problem and its application to assembly schedule generation,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 560–562, November 1990. View at Scopus
  3. W. He and A. Kusiak, “Scheduling manufacturing systems,” Computers in Industry, vol. 20, no. 2, pp. 163–175, 1992. View at Google Scholar · View at Scopus
  4. Q. Su, “Applying case-based reasoning in assembly sequence planning,” International Journal of Production Research, vol. 45, no. 1, pp. 29–47, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. D.-H. Lee, D. Kiritsis, and P. Xirouchakis, “Iterative approach to operation selection and sequencing in process planning,” International Journal of Production Research, vol. 42, no. 22, pp. 4745–4766, 2004. View at Publisher · View at Google Scholar · View at Scopus
  6. A. J. D. Lambert, “Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs,” Omega, vol. 34, no. 6, pp. 538–549, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. A. J. D. Lambert, “Optimizing disassembly processes subjected to sequence-dependent cost,” Computers and Operations Research, vol. 34, no. 2, pp. 536–551, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Mingozzi, L. Bianco, and S. Ricciardelli, “Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints,” Operations Research, vol. 45, no. 3, pp. 365–377, 1997. View at Google Scholar · View at Scopus
  9. N. Ascheuer, M. Jünger, and G. Reinelt, “Branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints,” Computational Optimization and Applications, vol. 17, no. 1, pp. 61–84, 2000. View at Publisher · View at Google Scholar · View at Scopus
  10. G. K. Jati and S. Suyanto, “Evolutionary discrete firefly algorithm for travelling salesman problem,” in Adaptive and Intelligent Systems, vol. 6943 of Lecture Notes in Computer Science, pp. 393–403, Springer, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Ouaarab, B. Ahiod, and X. S. Yang, “Discrete cuckoo search algorithm for the travelling salesman problem,” Neural Computing and Applications, 2013. View at Google Scholar
  12. S. Zeng, Z. Liu, C. Li, Q. Zhang, and W. Wang, “An evolutionary algorithm and its application in antenna design,” Journal of Bioinformatics and Intelligent Control, vol. 1, no. 2, pp. 129–137, 2012. View at Google Scholar
  13. M. P. Poland, C. D. Nugent, H. Wang, and L. M. Chen, “Genetic algorithm and pure random search for exosensor distribution optimisation,” International Journal of Bio-Inspired Computation, vol. 4, no. 6, pp. 359–372, 2012. View at Google Scholar
  14. J.-Y. Potvin, “Genetic algorithms for the traveling salesman problem,” Annals of Operations Research, vol. 63, pp. 339–370, 1996. View at Google Scholar · View at Scopus
  15. Z. Michalewicz and D. Fogel, How to Solve It: Modern Heuristics, Springer, New York, NY, USA, 2004.
  16. Z. Ghazalli and A. Murata, “An integrated TSP-GA with EOL cost model for selecting the best EOL option,” International Journal of Industrial Engineering Computations, vol. 2, no. 4, pp. 775–792, 2011. View at Google Scholar
  17. C. Moon, J. Kim, G. Choi, and Y. Seo, “An efficient genetic algorithm for the traveling salesman problem with precedence constraints,” European Journal of Operational Research, vol. 140, no. 3, pp. 606–617, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. C. Moon, M. Lee, Y. Seo, and Y. H. Lee, “Integrated machine tool selection and operation sequencing with capacity and precedence constraints using genetic algorithm,” Computers and Industrial Engineering, vol. 43, no. 3, pp. 605–621, 2002. View at Publisher · View at Google Scholar · View at Scopus
  19. C. Moon, Y. Yun, and C. Leem, “Evolutionary algorithm based on topological sort for precedence constrained sequencing,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 1325–1332, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Yun and C. Moon, “Genetic algorithm approach for precedence-constrained sequencing problems,” Journal of Intelligent Manufacturing, vol. 22, no. 3, pp. 379–388, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C, Silicon Press Summit, Summit, NJ, USA, 2nd edition, 2007.
  22. Z. Michalewicz, Genetic Algorithms + Data Structures, Springer, New York, NY, USA, 1996.
  23. IBM, “IBM ILOG Optimization and Analytical Decision Support Solutions,” http://www.ilog.com/products/optimization/.