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

DOI10.1111/itor.13387MaRDI QIDQ6609706

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

Publication date: 24 September 2024

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

zbMATH Keywords

path relinkingmaximal covering location problemlearning in metaheuristicsadaptive iterated local search

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Lagrangean heuristic for the maximal covering location problem
• Computing approximate solutions of the maximum covering problem with GRASP
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Intelligent-guided adaptive search for the maximum covering location problem
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• Solving the maximal covering location problem with heuristic concentration
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• The Hierarchical Service Location Problem
• An exact algorithm for the maximal covering problem
• THE PROBABLE ERROR OF A MEAN
• Benchmarking optimization software with performance profiles.

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