A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection

Sousa, Marques Moreira de; González, Pedro Henrique; Ochi, Luiz Satoru; Martins, Simone L.

doi:10.1016/j.cor.2021.105229

Cited by 12 publications

(3 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In fact, the iterated algorithms were widely used in literature. e author [24] implemented the variable neighbourhood descent with an iterated local search algorithm in order to solve the TSP with hotel selection. e author [25] also optimized the weighted vertex colouring problem using an iterated local search algorithm with two new neighbour structures.…”

Section: The Proposed Metaheuristic: Dhouib-matrix-3 (Dm3)mentioning

confidence: 99%

Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

Dhouib

2021

Applied Computational Intelligence and Soft Computing

View full text Add to dashboard Cite

This paper presents a new metaheuristic named Dhouib-Matrix-3 (DM3) inspired by our recently developed constructive stochastic heuristic Dhouib-Matrix-TSP2 (DM-TSP2) and characterized by only one parameter: the number of iterations. The proposed metaheuristic DM3 is an iterative algorithm in which every iteration is based on two relay hybridization techniques. At first, the constructive stochastic heuristic DM-TSP2 starts by generating a different initial basic feasible solution and then each solution is intensified by the novel procedure Far-to-Near which exchanges far cities by closer ones using three perturbation techniques: insertion, exchange, and 2-opt. Experimental results carried out on the classical travelling salesman problem using the well-known TSP-LIB benchmark instances demonstrate that our approach DM3 outclasses the simulated annealing algorithm, the genetic algorithm, and the cellular genetic algorithm. Furthermore, the proposed DM3 is statistically concurrent to the hybrid simulated annealing cellular genetic algorithm. Nevertheless, DM3 is easier to implement and needs only one parameter to identify (the maximum number of iterations).

show abstract

Section: The Proposed Metaheuristic: Dhouib-matrix-3 (Dm3)mentioning

confidence: 99%

Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

Dhouib

2021

Applied Computational Intelligence and Soft Computing

View full text Add to dashboard Cite

show abstract

“…Of the various kinds of algorithms, three local search algorithms show promising solutions in solving combinatoric optimization problems, namely the iterated local search (ILS), simulated annealing (SA) and hill climbing (HC) algorithms. The ILS algorithm has been proven to produce promising solutions for various kinds of optimization problems, such as timetabling [11]- [13], vehicle routing problems [14]- [16], and TSP [17], [18]. Meanwhile, the SA algorithm also shows promising results, such as in the fields of bin packing [19], timetabling [20]- [22], and TSP [23]- [25].…”

Section: Introductionmentioning

confidence: 99%

Hybrid iterated local search algorithm for optimization route of airplane travel plans

Muklason

Premananda

2023

IJECE

View full text Add to dashboard Cite

<span lang="EN-US">The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the Tabu-SA algorithm.</span>

show abstract

“…O TSP com selec ¸ão de hotéis [Vansteenwegen et al 2012, de Sousa et al 2021 é uma variac ¸ão do TSP com semelhanc ¸as com o problema abordado neste artigo. O objetivo principal é minimizar o número de viagens e tempo total percorrido.…”

Section: Introduc ¸ãOunclassified

Um algoritmo eficiente para um problema multiobjetivo de roteamento em rede de VANTs

Marques¹,

Coelho²,

Coelho³

et al. 2022

Anais Do III Workshop Brasileiro De Cidades Inteligentes (WBCI 2022)

Self Cite

View full text Add to dashboard Cite

Este artigo trata do roteamento de Veículos Aéreos Não Tripulados (VANT) em cenários dinâmicos de rede com autonomia de bateria limitada e múltiplas estações de carregamento. O problema é inspirado em restrições do mundo real, especialmente projetado para superar os desafios de um alcance limitado de condução de veículos. Considera-se uma variante multiobjetivo do Variable Neighborhood Search (VNS) para encontrar um conjunto de soluções não dominadas, respeitando a navegação em áreas proibidas e também a capacidade da bateria. Foi desenvolvido um caso de estudo onde um VANT deve atender clientes espalhados por uma rede representando um mapa.

show abstract

A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection

Cited by 12 publications

References 38 publications

Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

Hybrid iterated local search algorithm for optimization route of airplane travel plans

Um algoritmo eficiente para um problema multiobjetivo de roteamento em rede de VANTs

Contact Info

Product

Resources

About