COOPERATING OF LOCAL SEARCHES BASED HYPERHEURISTIC APPROACH FOR SOLVING TRAVELING SALESMAN PROBLEM

Montazeri Mitra, Abbas Bahrololoum, Hossein Nezamabadi-pour, Mahdieh Soleymani Baghshah, Mahdieh Montazeri

Abstract

Until now various heuristic optimization methods have been developed for solving NP-Hard problems. These methods by trading off between exploration and exploitation attempt to find an optimum solution. In this paper, we introduce a new optimization algorithm based on hyper-heuristic for solving TSP. A hyper-heuristic approach has two layers. In low level, we have six local searches and in high level we use Genetic Algorithm. Genetic Algorithm corporate local searches efficiency. The proposed method has high ability to searching in solution space and explores and exploit appropriately. This method exploits space depended on characteristics of the region of the solution space that is currently under exploration and also the performance history of local searches. The proposed method is used to solve TSP and compared with well-known methods. The experimental results confirm the efficiency of the proposed method.

References

  1. Neapolitan, R., Naimpour, K., 2004. Foundation of Application Using C++ Pseudo Code, third Edition, Jones and Bartlett Publishers.
  2. Ozaglam, M. Y., and Cunkas, M., 2008. Particle swarm optimization algorithm for solving optimization problems. Polytechnic 11: 193-198.
  3. Dorigo M., Gambardella L. M., 2008. Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transaction on Evolutionary Computation, 1, 53-66.
  4. Wolpert, D. and MacReady W. G. 1997. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1:67 82.
  5. Ang, J. H., Tan K. C., A. A. Mamun 2010. An evolutionary memetic algorithm for rule extraction Expert Systems with Applications 37 1302-1315.
  6. Ong Y. S., Keane A. J. 2004. Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2), 99-110.
  7. Merz, P., Freisleben, B. 1999. A comparison of memetic algorithms, Tabu search, and ant colonies for the quadratic assignment problem. In Proceedings of the congress on evolutionary computation (Vol. 1, pp. 2063-2070).
  8. Cowling P., Kendall G. Soubeiga E. 2001. A ParameterFree Hyperheuristic for Scheduling a Sales Summit. In proceedings of 4th Metahuristics International Conference (MIC 2001), Porto Portugal, 16-20, pp 127-131.
  9. Keller R. E. Poli R., 2008. Self-adaptive Hyperheuristic and Greedy Search, IEEE computer and information science.
  10. Nilsson Ch., 2003. Heuristics for the Traveling Salesman Problem, International conference on heuristic.
  11. Davis L., 1991. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
  12. Banzhaf W., 1990. The molecular traveling salesman, Biological Cybernetics, vol. 64, pp. 7-14.
  13. Cowling P., Kendall G., Han L., 2002. An Investigation of a Hyperheuristic Genetic Algorithm Applied to a Trainer Scheduling Problem. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), Pages 1185-1190, Hilton Hawaiian Vilage Hotel, Honolulu, Hawaii, 12-17.
  14. Ozcan E., Erenturk M., 2004. A brief review of memetic algorithms for solving Euclidean 2D traveling salesrep problem. Proc. of the 13th Turkish Symposium on Artificial Intelligence and Neural Networks 99-108.
  15. Çunka, M., Özsalam M. Y., 2009. A comparative study on particle swarm optimization and genetic algorithm for traveling salesmen problem, Taylor & Francis, Cybernetics and Systems.
  16. Lau, H. C., Xiao, F., 2008. The oil drilling model and iterative deepening genetic annealing algorithm for the TSP, In A. Fink and F. Rothlauf (eds), Advanced in Computational Intelligence in Transportation and Logistics, Studies in Computational Intelligence. Springer, 169-184.
Download


Paper Citation


in Harvard Style

Mitra M., Bahrololoum A., Nezamabadi-pour H., Soleymani Baghshah M. and Montazeri M. (2011). COOPERATING OF LOCAL SEARCHES BASED HYPERHEURISTIC APPROACH FOR SOLVING TRAVELING SALESMAN PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 329-332. DOI: 10.5220/0003675103290332


in Bibtex Style

@conference{ecta11,
author={Montazeri Mitra and Abbas Bahrololoum and Hossein Nezamabadi-pour and Mahdieh Soleymani Baghshah and Mahdieh Montazeri},
title={COOPERATING OF LOCAL SEARCHES BASED HYPERHEURISTIC APPROACH FOR SOLVING TRAVELING SALESMAN PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={329-332},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003675103290332},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - COOPERATING OF LOCAL SEARCHES BASED HYPERHEURISTIC APPROACH FOR SOLVING TRAVELING SALESMAN PROBLEM
SN - 978-989-8425-83-6
AU - Mitra M.
AU - Bahrololoum A.
AU - Nezamabadi-pour H.
AU - Soleymani Baghshah M.
AU - Montazeri M.
PY - 2011
SP - 329
EP - 332
DO - 10.5220/0003675103290332