A hybrid adaptive iterated local search heuristic for the maximal covering location problem

DOI10.1111/ITOR.13387MaRDI QIDQ6609706zbMATH OpenFDO

Authors Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/ITOR.13387

zbMATH Keywords

adaptive iterated local searchlearning in metaheuristicsmaximal covering location problempath relinking

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• A Lagrangean heuristic for the maximal covering location problem
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• An exact algorithm for the maximal covering problem
• Benchmarking optimization software with performance profiles.
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• Computing approximate solutions of the maximum covering problem with GRASP
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Intelligent-guided adaptive search for the maximum covering location problem
• Solving the maximal covering location problem with heuristic concentration
• The Hierarchical Service Location Problem
• THE PROBABLE ERROR OF A MEAN

Cited in

(3)

• The K-prize-collecting coverage problem by aligned disks
• Metaheuristics and a matheuristic for solving the facility layout problem in the presence of alternative process plans and machine redundancy
• Conflict-aware seat assignment in classroom environments

This page was built for publication: A hybrid adaptive iterated local search heuristic for the maximal covering location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609706)