loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Montazeri Mitra 1 ; Abbas Bahrololoum 1 ; Hossein Nezamabadi-pour 1 ; Mahdieh Soleymani Baghshah 1 and Mahdieh Montazeri 2

Affiliations: 1 Shahid Bahonar University, Iran, Islamic Republic of ; 2 Kerman Medical University, Iran, Islamic Republic of

Keyword(s): Meta-heuristic algorithm, Hyper-heuristic algorithm, Traveling Salesman Problem.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolution Strategies ; Evolutionary Computing ; Genetic Algorithms ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.139.97.157

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 (IJCCI 2011) - ECTA; ISBN 978-989-8425-83-6, SciTePress, pages 329-332. DOI: 10.5220/0003675103290332

@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 (IJCCI 2011) - ECTA},
year={2011},
pages={329-332},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003675103290332},
isbn={978-989-8425-83-6},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications (IJCCI 2011) - ECTA
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
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic