Fixed Set Search Applied to the Territory Design Problem

Tobias Cors, Tobias Vlcek, Stefan Voss, Raka Jovanovic, Tobias Vlćek

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we apply the novel fixed set search (FSS) metaheuristic in combination with mixed-integer programming to solve the Territory Design Problem (TDP). In this matheuristic approach, we select the territory centers with an extended greedy randomised adaptive search procedure (GRASP) while optimising the subproblem of the territory-center allocation with a standard mixed-integer programming solver. The FSS adds a learning procedure to GRASP and helps us to narrow down the most common territory centers in the solution population in order to fix them. This improves the speed of the optimisation and helps to find high-quality solutions on all instances of our computational study at least once within a small number of runs.
Original languageEnglish
Title of host publicationMetaheuristics, Mic 2022
EditorsL DiGaspero, P Festa, A Nakib, M Pavone, Luca Di Gaspero, Paola Festa, Amir Nakib, Mario Pavone
PublisherSpringer Nature
Pages322-334
Number of pages13
Volume13838
ISBN (Electronic)978-3-031-26504-4
ISBN (Print)978-3-031-26503-7, 9783031265037
DOIs
Publication statusPublished - 2023
Event14th International Conference on Metaheuristics (MIC) - Syracuse, Italy
Duration: 11 Jul 202214 Jul 2022

Publication series

NameLecture Notes In Computer Science

Conference

Conference14th International Conference on Metaheuristics (MIC)
Country/TerritoryItaly
CitySyracuse
Period11/07/2214/07/22

Keywords

  • Fixed set search
  • Matheuristic
  • Territory design problem

Fingerprint

Dive into the research topics of 'Fixed Set Search Applied to the Territory Design Problem'. Together they form a unique fingerprint.

Cite this