Fixed set search applied to the traveling salesman problem

Raka Jovanovic, Milan Tuba, Stefan Voß

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the greedy randomized adaptive search procedure (GRASP). The basic concept of FSS is to avoid focusing on specific high quality solutions but on parts or elements that such solutions have. This is done through fixing a set of elements that exist in such solutions and dedicating computational effort to finding near optimal solutions for the underlying subproblem. The simplicity of implementing the proposed method is illustrated on the traveling salesman problem. Our computational experiments show that the FSS manages to find significantly better solutions than the GRASP it is based on, the dynamic convexized method and the ant colony optimization combined with a local search.

Original languageEnglish
Title of host publicationHybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings
EditorsMaria J. Blesa Aguilera, Christian Blum, Pedro Pinacho-Davidson, Julio Godoy del Campo, Haroldo Gambini Santos
PublisherSpringer Verlag
Pages63-77
Number of pages15
ISBN (Print)9783030059828
DOIs
Publication statusPublished - 1 Jan 2019
Event11th International Workshop on Hybrid Metaheuristics, HM 2019 - Concepción, Chile
Duration: 16 Jan 201918 Jan 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11299 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Workshop on Hybrid Metaheuristics, HM 2019
CountryChile
CityConcepción
Period16/1/1918/1/19

Fingerprint

Traveling salesman problem
Travelling salesman problems
Greedy Randomized Adaptive Search Procedure
Ant colony optimization
Metaheuristics
Computational Experiments
Local Search
Simplicity
Optimal Solution
Experiments

Keywords

  • GRASP
  • Metaheuristic
  • Traveling salesman problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jovanovic, R., Tuba, M., & Voß, S. (2019). Fixed set search applied to the traveling salesman problem. In M. J. Blesa Aguilera, C. Blum, P. Pinacho-Davidson, J. Godoy del Campo, & H. Gambini Santos (Eds.), Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings (pp. 63-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11299 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05983-5_5

Fixed set search applied to the traveling salesman problem. / Jovanovic, Raka; Tuba, Milan; Voß, Stefan.

Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings. ed. / Maria J. Blesa Aguilera; Christian Blum; Pedro Pinacho-Davidson; Julio Godoy del Campo; Haroldo Gambini Santos. Springer Verlag, 2019. p. 63-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11299 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jovanovic, R, Tuba, M & Voß, S 2019, Fixed set search applied to the traveling salesman problem. in MJ Blesa Aguilera, C Blum, P Pinacho-Davidson, J Godoy del Campo & H Gambini Santos (eds), Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11299 LNCS, Springer Verlag, pp. 63-77, 11th International Workshop on Hybrid Metaheuristics, HM 2019, Concepción, Chile, 16/1/19. https://doi.org/10.1007/978-3-030-05983-5_5
Jovanovic R, Tuba M, Voß S. Fixed set search applied to the traveling salesman problem. In Blesa Aguilera MJ, Blum C, Pinacho-Davidson P, Godoy del Campo J, Gambini Santos H, editors, Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings. Springer Verlag. 2019. p. 63-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-05983-5_5
Jovanovic, Raka ; Tuba, Milan ; Voß, Stefan. / Fixed set search applied to the traveling salesman problem. Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings. editor / Maria J. Blesa Aguilera ; Christian Blum ; Pedro Pinacho-Davidson ; Julio Godoy del Campo ; Haroldo Gambini Santos. Springer Verlag, 2019. pp. 63-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bbffce2e10504d45b4e7b0f22d1df4c4,
title = "Fixed set search applied to the traveling salesman problem",
abstract = "In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the greedy randomized adaptive search procedure (GRASP). The basic concept of FSS is to avoid focusing on specific high quality solutions but on parts or elements that such solutions have. This is done through fixing a set of elements that exist in such solutions and dedicating computational effort to finding near optimal solutions for the underlying subproblem. The simplicity of implementing the proposed method is illustrated on the traveling salesman problem. Our computational experiments show that the FSS manages to find significantly better solutions than the GRASP it is based on, the dynamic convexized method and the ant colony optimization combined with a local search.",
keywords = "GRASP, Metaheuristic, Traveling salesman problem",
author = "Raka Jovanovic and Milan Tuba and Stefan Vo{\ss}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-05983-5_5",
language = "English",
isbn = "9783030059828",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "63--77",
editor = "{Blesa Aguilera}, {Maria J.} and Christian Blum and Pedro Pinacho-Davidson and {Godoy del Campo}, Julio and {Gambini Santos}, Haroldo",
booktitle = "Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings",

}

TY - GEN

T1 - Fixed set search applied to the traveling salesman problem

AU - Jovanovic, Raka

AU - Tuba, Milan

AU - Voß, Stefan

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the greedy randomized adaptive search procedure (GRASP). The basic concept of FSS is to avoid focusing on specific high quality solutions but on parts or elements that such solutions have. This is done through fixing a set of elements that exist in such solutions and dedicating computational effort to finding near optimal solutions for the underlying subproblem. The simplicity of implementing the proposed method is illustrated on the traveling salesman problem. Our computational experiments show that the FSS manages to find significantly better solutions than the GRASP it is based on, the dynamic convexized method and the ant colony optimization combined with a local search.

AB - In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the greedy randomized adaptive search procedure (GRASP). The basic concept of FSS is to avoid focusing on specific high quality solutions but on parts or elements that such solutions have. This is done through fixing a set of elements that exist in such solutions and dedicating computational effort to finding near optimal solutions for the underlying subproblem. The simplicity of implementing the proposed method is illustrated on the traveling salesman problem. Our computational experiments show that the FSS manages to find significantly better solutions than the GRASP it is based on, the dynamic convexized method and the ant colony optimization combined with a local search.

KW - GRASP

KW - Metaheuristic

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85059945573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059945573&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-05983-5_5

DO - 10.1007/978-3-030-05983-5_5

M3 - Conference contribution

SN - 9783030059828

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 63

EP - 77

BT - Hybrid Metaheuristics - 11th International Workshop, HM 2019, Proceedings

A2 - Blesa Aguilera, Maria J.

A2 - Blum, Christian

A2 - Pinacho-Davidson, Pedro

A2 - Godoy del Campo, Julio

A2 - Gambini Santos, Haroldo

PB - Springer Verlag

ER -