Intelligent-guided adaptive search for the maximum covering location problem

DOI10.1016/j.cor.2016.08.018zbMath1391.90387OpenAlexW2510103015WikidataQ57739153 ScholiaQ57739153MaRDI QIDQ1652063

Vinícius R. Máximo, Mariá C. V. Nascimento, André C. P. L. F. de Carvalho

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.018

zbMATH Keywords

metaheuristicgrowing neural gasintelligent guided adaptive searchmaximum covering location problem

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Related Items (4)

Robust min-max regret covering problems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm

Uses Software

• TSPLIB
• GRASP
• PERL
• CPLEX
• Scatter Search
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• Community detection by modularity maximization using GRASP with path relinking
• A decomposition heuristic for the maximal covering location problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A Lagrangean heuristic for the maximal covering location problem
• Computing approximate solutions of the maximum covering problem with GRASP
• The traveling salesman. Computational solutions for RSP applications
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Greedy randomized adaptive search procedures
• A maximal covering location model in the presence of partial coverage
• MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms
• Solving the maximal covering location problem with heuristic concentration
• TTT plots: a perl program to create time-to-target plots
• Robust growing neural gas algorithm with application in cluster analysis
• Hybridization of GRASP metaheuristic with data mining techniques
• Iterated Greedy Algorithms for the Maximal Covering Location Problem
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• ParamILS: An Automatic Algorithm Configuration Framework
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• The Hierarchical Service Location Problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• An exact algorithm for the maximal covering problem
• Self-organizing maps.

This page was built for publication: Intelligent-guided adaptive search for the maximum covering location problem