Memetic framework with adaptive meme pool for the travelling salesman problem
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem. As the number of cities increases, traditional algorithms become less effective in finding the optimal solution in the vast search space of TSP, and it is also difficult to achieve good sub-optimal solutions....
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis-Master by Coursework |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/164088 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-164088 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1640882023-07-04T17:45:43Z Memetic framework with adaptive meme pool for the travelling salesman problem Zeng, Yuntao Meng-Hiot Lim School of Electrical and Electronic Engineering EMHLIM@ntu.edu.sg Engineering::Electrical and electronic engineering The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem. As the number of cities increases, traditional algorithms become less effective in finding the optimal solution in the vast search space of TSP, and it is also difficult to achieve good sub-optimal solutions. The design of a performance-efficient approximate solution algorithm has been the focus of many researchers. Memetic Algorithms (MAs) is a class of evolutionary algorithms for such complex optimization problems, using a global search to locate a good region and a local search, otherwise known as meme to locate the optimal solution. The key to memetic algorithms is the incorporation of one or more memes in the search algorithm. This work focuses on COPs and investigates the use of a memetic framework for solving the classical combinatorial optimization problem TSP. With the solution landscape unknown, it is likely that the over reliance of a single meme may not deliver good performance, as with the case of classical memetic algorithm. We explore a Memetic Framework with Adaptive Meme Pool (MF-AMP), consisting of k-opt operators, the swap operator, and the Tabu Algorithm adaptive local search operators. The set of operators mentioned above is combined with GA in order to derive a time-efficient search algorithm. The performance measurement and algorithm validation are conducted by performing experiments on instances of varying complexity in the benchmark dataset TSPLIB. The corresponding experiment results are given for analysis and discussion. Our approach is compared with other algorithms proposed in recent years according to the results, which demonstrate the effectiveness and superiority of search algorithm enhanced with adaptive memes within in the meme pool. Master of Science (Computer Control and Automation) 2023-01-04T08:46:58Z 2023-01-04T08:46:58Z 2022 Thesis-Master by Coursework Zeng, Y. (2022). Memetic framework with adaptive meme pool for the travelling salesman problem. Master's thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/164088 https://hdl.handle.net/10356/164088 en application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering |
spellingShingle |
Engineering::Electrical and electronic engineering Zeng, Yuntao Memetic framework with adaptive meme pool for the travelling salesman problem |
description |
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem. As the number of cities increases, traditional algorithms become less effective in finding the optimal solution in the vast search space of TSP, and it is also difficult to achieve good sub-optimal solutions. The design of a performance-efficient approximate solution algorithm has been the focus of many researchers.
Memetic Algorithms (MAs) is a class of evolutionary algorithms for such complex optimization problems, using a global search to locate a good region and a local search, otherwise known as meme to locate the optimal solution. The key to memetic algorithms is the incorporation of one or more memes in the search algorithm. This work focuses on COPs and investigates the use of a memetic framework for solving the classical combinatorial optimization problem TSP.
With the solution landscape unknown, it is likely that the over reliance of a single meme may not deliver good performance, as with the case of classical memetic algorithm. We explore a Memetic Framework with Adaptive Meme Pool (MF-AMP), consisting of k-opt operators, the swap operator, and the Tabu Algorithm adaptive local search operators. The set of operators mentioned above is combined with GA in order to derive a time-efficient search algorithm. The performance measurement and algorithm validation are conducted by performing experiments on instances of varying complexity in the benchmark dataset TSPLIB. The corresponding experiment results are given for analysis and discussion. Our approach is compared with other algorithms proposed in recent years according to the results, which demonstrate the effectiveness and superiority of search algorithm enhanced with adaptive memes within in the meme pool. |
author2 |
Meng-Hiot Lim |
author_facet |
Meng-Hiot Lim Zeng, Yuntao |
format |
Thesis-Master by Coursework |
author |
Zeng, Yuntao |
author_sort |
Zeng, Yuntao |
title |
Memetic framework with adaptive meme pool for the travelling salesman problem |
title_short |
Memetic framework with adaptive meme pool for the travelling salesman problem |
title_full |
Memetic framework with adaptive meme pool for the travelling salesman problem |
title_fullStr |
Memetic framework with adaptive meme pool for the travelling salesman problem |
title_full_unstemmed |
Memetic framework with adaptive meme pool for the travelling salesman problem |
title_sort |
memetic framework with adaptive meme pool for the travelling salesman problem |
publisher |
Nanyang Technological University |
publishDate |
2023 |
url |
https://hdl.handle.net/10356/164088 |
_version_ |
1772827770197377024 |