Heuristic concentration: Two stage solution construction
From MaRDI portal
Publication:1278583
DOI10.1016/S0377-2217(96)00100-2zbMath0923.90107OpenAlexW1967623040WikidataQ128111185 ScholiaQ128111185MaRDI QIDQ1278583
Charles S. Re Velle, Kenneth E. Rosing
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00100-2
Related Items (42)
Spatial analysis of single allocation hub location problems ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ A neural model for the \(p\)-median problem ⋮ BEAMR: an exact and approximate model for the \(p\)-median problem ⋮ Solving the maximal covering location problem with heuristic concentration ⋮ Solving the hub location problem with modular link capacities ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ Incorporating waiting time in competitive location models ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Redesign of vaccine distribution networks ⋮ Fixed set search applied to the clique partitioning problem ⋮ The design of reverse distribution networks: Models and solution procedures ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows ⋮ A set partitioning heuristic for the home health care routing and scheduling problem ⋮ A cellular heuristic for the multisource Weber problem. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Optimizing two-level reverse distribution networks with hybrid memetic algorithms ⋮ Facility location for market capture when users rank facilities by shorter travel and waiting times ⋮ GASUB: finding global optima to discrete location problems by a genetic-like algorithm ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ The heuristic concentration-integer and its application to a class of location problems ⋮ A fast swap-based local search procedure for location problems ⋮ Lagrangean relaxation heuristics for the \(p\)-cable-trench problem ⋮ Variable neighborhood search: Principles and applications ⋮ Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification ⋮ Location analysis: a synthesis and survey ⋮ Defining tabu list size and aspiration criterion within tabu search methods ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Reserve design for species preservation ⋮ A gamma heuristic for the \(p\)-median problem ⋮ Concurrent optimization of harvesting and road network layouts under steep terrain ⋮ Allocating servers to facilities, when demand is elastic to travel and waiting times ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ Exemplar-based clustering via simulated annealing ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Heuristic concentration and tabu search: A head to head comparison ⋮ Network distance characteristics that affect computational effort in \(p\)-median location problems ⋮ Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
Uses Software
Cites Work
- Unnamed Item
- Facility siting and integer-friendly programming
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Integer Programming: Methods, Uses, Computations
- 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: Two stage solution construction
