Heuristic concentration and tabu search: A head to head comparison

DOI10.1016/S0377-2217(97)00310-XzbMath0955.90056OpenAlexW2044508317MaRDI QIDQ1291635

K. Appert

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00310-x

zbMATH Keywords

heuristicstabu searchlocation\(p\)-medianheuristic concentration

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (15)

A conditional \(p\)-hub location problem with attraction functions ⋮ Comparison of metaheuristic algorithms for examination timetabling problem ⋮ Solving the maximal covering location problem with heuristic concentration ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ The design of reverse distribution networks: Models and solution procedures ⋮ Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles ⋮ The heuristic concentration-integer and its application to a class of location problems ⋮ Variable neighborhood search: Principles and applications ⋮ Hybrid heuristics for examination timetabling problem ⋮ Location analysis: a synthesis and survey ⋮ A gamma heuristic for the \(p\)-median problem ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ Exemplar-based clustering via simulated annealing ⋮ Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Facility siting and integer-friendly programming
• General local search methods
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• Future paths for integer programming and links to artificial intelligence
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• Tabu Search—Part I
• Tabu Search—Part II
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Heuristic concentration and tabu search: A head to head comparison