Fixed Set Search Applied to the Territory Design Problem

被引：0

作者：

Cors, Tobias ^{[1
]}

Vlcek, Tobias ^{[2
]}

Voss, Stefan ^{[3
]}

Jovanovic, Raka ^{[4
]}

机构：

[1] Univ Hamburg, Inst Operat Management, Moorweidenstr 18, D-20148 Hamburg, Germany

[2] Univ Hamburg, Inst Logist Transport & Prod, Moorweidenstr 18, D-20148 Hamburg, Germany

[3] Univ Hamburg, Inst Informat Syst, Von Melle Pk 5, D-20146 Hamburg, Germany

[4] Hamad Bin Khalifa Univ, Qatar Environm & Energy Res Inst, POB 5825, Doha, Qatar

来源：

METAHEURISTICS, MIC 2022 | 2023年 / 13838卷

关键词：

Fixed set search; Matheuristic; Territory design problem; GRASP;

D O I：

10.1007/978-3-031-26504-4_23

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：322 / 334

页数：13

共 50 条

[31] Local search algorithm for unicost set covering problem
Musliu, Nysret
ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 302 - 311
[32] Iterated local search for the generalized independent set problem
Nogueira, Bruno
Pinheiro, Rian G. S.
Tavares, Eduardo
OPTIMIZATION LETTERS, 2021, 15 (04) : 1345 - 1369
[33] An Efficient Local Search for the Feedback Vertex Set Problem
Zhang, Zhiqiang
Ye, Ansheng
Zhou, Xiaoqing
Shao, Zehui
ALGORITHMS, 2013, 6 (04) : 726 - 746
[34] Applying local search to the feedback vertex set problem
Galinier, Philippe
Lemamou, Eunice
Bouzidi, Mohamed Wassim
JOURNAL OF HEURISTICS, 2013, 19 (05) : 797 - 818
[35] Accelerating Local Search for the Maximum Independent Set Problem
Dahlum, Jakob
Lamm, Sebastian
Sanders, Peter
Schulz, Christian
Strash, Darren
Werneck, Renato F.
EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 : 118 - 133
[36] Tabu search applied to the protein folding problem.
GardunoJuarez, R
Morales, LB
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1997, 214 : 219 - COMP
[37] Hybrid search algorithm applied to the colour quantisation problem
Nolle, L
Schaefer, G
APPLICATIONS AND INNOVATIONS IN INTELLIGENT SYSTEMS XIII, 2006, : 29 - +
[38] Local search optimisation applied to the minimum distance problem
Bland, J. A.
ADVANCED ENGINEERING INFORMATICS, 2007, 21 (04) : 391 - 397
[39] Fitness-Based Search Method for Superior Solution Set Search Problem
Fukushima, Ryu
Tamura, Kenichi
Tsuchiya, Junichi
Yasuda, Keiichiro
2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2018, : 757 - 762
[40] On the Use of Guided Design Search for Discovering Significant Decision Variables in the Fixed-Charge Capacitated Multicommodity Network Design Problem
Lewis, Mark W.
NETWORKS, 2009, 53 (01) : 6 - 18

← 1 2 3 4 5 →