loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ismail M. Ali ; Daryl Essam and Kathryn Kasmarik

Affiliation: School of Engineering and Information Technology, University of New South Wales, Canberra and Australia

Keyword(s): Traveling Salesman Problem, Genetic Algorithm, Differential Evolution, Clustering Method, Evolutionary Algorithms.

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

Abstract: The traveling salesman problem is a well-known combinatorial optimization problem with permutation-based variables, which has been proven to be an NP-complete problem. Over the last few decades, many evolutionary algorithms have been developed for solving it. In this study, a new design that uses the k-means clustering method, is proposed to be used as a repairing method for the individuals in the initial population. In addition, a new crossover operator is introduced to improve the evolving process of an evolutionary algorithm and hence its performance. To investigate the performance of the proposed mechanism, two popular evolutionary algorithms (genetic algorithm and differential evolution) have been implemented for solving 18 instances of traveling salesman problems and the results have been compared with those obtained from standard versions of GA and DE, and 3 other state-of-the-art algorithms. Results show that the proposed components can significantly improve the performance o f EAs while solving TSPs with small, medium and large-sized problems. (More)

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 34.203.221.104

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:
Ali, I.; Essam, D. and Kasmarik, K. (2019). New Designs of k-means Clustering and Crossover Operator for Solving Traveling Salesman Problems using Evolutionary Algorithms. In Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA; ISBN 978-989-758-384-1; ISSN 2184-3236, SciTePress, pages 123-130. DOI: 10.5220/0007940001230130

@conference{ecta19,
author={Ismail M. Ali. and Daryl Essam. and Kathryn Kasmarik.},
title={New Designs of k-means Clustering and Crossover Operator for Solving Traveling Salesman Problems using Evolutionary Algorithms},
booktitle={Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA},
year={2019},
pages={123-130},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007940001230130},
isbn={978-989-758-384-1},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA
TI - New Designs of k-means Clustering and Crossover Operator for Solving Traveling Salesman Problems using Evolutionary Algorithms
SN - 978-989-758-384-1
IS - 2184-3236
AU - Ali, I.
AU - Essam, D.
AU - Kasmarik, K.
PY - 2019
SP - 123
EP - 130
DO - 10.5220/0007940001230130
PB - SciTePress