Using Genetic Algorithm with Combinational Crossover to Solve Travelling Salesman Problem

Ammar Al-Dallal

2015

Abstract

This paper proposes a new solution for Traveling Salesman Problem (TSP) using genetic algorithm. A combinational crossover technique is employed in the search for optimal or near-optimal TSP solutions. It is based upon chromosomes that utilise the concept of heritable building blocks. Moreover, generation of a single offspring, rather than two, per pair of parents, allows the system to generate high performance chromosomes. This solution is compared with the well performing Ordered Crossover (OX). Experimental results demonstrate that, due to the well structured crossover technique, has enhanced performance.

Paper Citation

in Harvard Style

Al-Dallal A. (2015). Using Genetic Algorithm with Combinational Crossover to Solve Travelling Salesman Problem . In Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA, ISBN 978-989-758-157-1, pages 149-156. DOI: 10.5220/0005590201490156

in Bibtex Style

@conference{ecta15,
author={Ammar Al-Dallal},
title={Using Genetic Algorithm with Combinational Crossover to Solve Travelling Salesman Problem},
booktitle={Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,},
year={2015},
pages={149-156},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005590201490156},
isbn={978-989-758-157-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,
TI - Using Genetic Algorithm with Combinational Crossover to Solve Travelling Salesman Problem
SN - 978-989-758-157-1
AU - Al-Dallal A.
PY - 2015
SP - 149
EP - 156
DO - 10.5220/0005590201490156