A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem

10/19/2019
by   Mehdi El Krari, et al.
0

The Travelling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions. One of the variants of the TSP is the Generalized TSP (GTSP), where the TSP is considered as a special case which makes the GTSP harder to solve. We propose in this paper a new memetic algorithm based on the well-known Breakout Local Search (BLS) metaheuristic to provide good solutions for GTSP instances. Our approach is competitive compared to other recent memetic algorithms proposed for the GTSP and gives at the same time some improvements to BLS to reduce its runtime.

READ FULL TEXT
research
06/27/2022

Learning to Control Local Search for Combinatorial Optimization

Combinatorial optimization problems are encountered in many practical co...
research
12/18/2014

Stochastic Local Search for Pattern Set Mining

Local search methods can quickly find good quality solutions in cases wh...
research
09/22/2017

EB-GLS: An Improved Guided Local Search Based on the Big Valley Structure

Local search is a basic building block in memetic algorithms. Guided Loc...
research
12/22/2018

Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application

In this paper, we present a method using AI techniques to solve a case o...
research
04/11/2023

RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization

Combinatorial optimization (CO) aims to efficiently find the best soluti...
research
01/28/2023

DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization

Local search is an effective method for solving large-scale combinatoria...
research
11/05/2019

A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem

TSP (Traveling Salesman Problem), a classic NP-complete problem in combi...

Please sign up or login with your details

Forgot password? Click here to reset