Advertisement

A Discrete Binary Version of the Electromagnetism-Like Heuristic for Solving Traveling Salesman Problem

  • Nikbakhsh Javadian
  • Mohsen Gol Alikhani
  • Reza Tavakkoli-Moghaddam
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5227)

Abstract

The electromagnetism-like method (EM) is a meta-heuristic algorithm utilizing an attraction-repulsion mechanism to move sample points (i.e., our solutions) towards the optimality. In general, the EM method has been initially used for solving continuous optimization problems and could not be applied on combinatorial optimization ones. This paper proposes a discrete binary version of the electromagnetism-like method (EM) for solving the combinatorial optimization problems. To show the efficiency of our proposed EM, we use it for solving the traveling salesman problem and compare our computational results with those reported in the literature. Finally we conclude that our method is capable of solving such well-known problems more efficiently than the previous works.

Keywords

Electromagnetism-like method Traveling salesman problems  Evolutionary computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Birbil, S.I., Fang, S.C.: An Electromagnetism-like Mechanism for Global Optimization. Journal of Global Optimization 25(3), 263–282 (2002)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Cowan, E.W.: Basic Electromagnetism. Academic Press, New York (1968)Google Scholar
  3. 3.
    Birbil, S.I., Fang, S.C., Sheu, R.L.: On the Convergence of a Population-Based Global Optimization Algorithm. Journal of Global Optimization 30, 301–318 (2005)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Changa, P.C., Chenb, S.H., Fan, C.Y.: A Hybrid Electromagnetism-like Algorithm for Single Machine Scheduling Problem. Expert Systems with Applications (in press)Google Scholar
  5. 5.
    Maenhout, B., Vanhoucke, M.: An Electromagnetic Meta-heuristic for the Nurse Scheduling Problem. Journal of Heuristics 13(4), 359–385 (2007)CrossRefGoogle Scholar
  6. 6.
    Debelsa, D., Reyckb, B., Leusc, R., Vanhoucke, M.: A Hybrid Scatter Search/ Electromagnetism Meta-Heuristic for Project Scheduling. European Journal of Operational Research 169(2), 638–653 (2006)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Wu, P., Chiang, H.C.: The Application of Electromagnetism-like Mechanism for Solving the Traveling Salesman Problems. In: Proceeding of 2005 Chinese Institute of Industrial Engineers Annual Meeting, Taiwan, R.O.C (2005)Google Scholar
  8. 8.
    Wu, P., Wei, N.C., Fang, H.C.: Revised Electromagnetism-like Mechanism for the Traveling Salesman Problem. In: Proceeding of the 36th Int. Conf. on Computers and Industrial Engineering, Taipei, Taiwan, pp. 1–9 (2006)Google Scholar
  9. 9.
    Kennedy, J., Eberhart, R.C.: A Discrete Binary Version of the Particle Swarm Algorithm. In: Proceedings of the World Multi Conference on Systemic, Cybernetics and Informatics, Piscatawary, NJ, pp. 4104–4109 (1997)Google Scholar
  10. 10.
    Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proceedings of the 6th Int. Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  11. 11.
    Liao, C., Tseng, C., Luarn, P.: A Discrete Version of Particle Swarm Optimization for Flowshop Scheduling Problems. Computers & Operations Research, pp. 3099–3111 (2007)Google Scholar
  12. 12.
    Tseng, C.T., Liao, C.J.: A Discrete Particle Swarm Optimization for Lot-Streaming Flowshop Scheduling Problem. European Journal of Operational Research (2007) doi:10.1016/j.ejor.2007.08.030Google Scholar
  13. 13.
    Li, X., Tian, P., Hua, J., Zhong, N.: A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem. In: Wang, T.-D., Li, X.-D., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 181–188. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Yin, P.Y.: A Discrete Particle Swarm Algorithm for Optimal Polygonal Approximation of Digital Curves. Journal of Visual Communication and Image Representation 15, 241–260 (2004)CrossRefGoogle Scholar
  15. 15.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Nikbakhsh Javadian
    • 1
  • Mohsen Gol Alikhani
    • 1
  • Reza Tavakkoli-Moghaddam
    • 2
  1. 1.Department of Industrial EngineeringMazandaran University of Science, and TechnologyBabolIran
  2. 2.Department of Industrial Engineering, Faculty of EngineeringUniversity of TehranTehranIran

Personalised recommendations