Path relinking approach for multiple allocation hub maximal covering problem
From MaRDI portal
Publication:971739
DOI10.1016/j.camwa.2008.10.004zbMath1186.90069MaRDI QIDQ971739
Publication date: 16 May 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2008.10.004
90C35: Programming involving graphs or networks
68T05: Learning and adaptive systems in artificial intelligence
90B10: Deterministic network models in operations research
90B80: Discrete location and assignment
Related Items
Fuzzy covering location problems with different aggregation operators, An efficient model for the multiple allocation hub maximal covering problem, The facility location problem with maximum distance constraint, An \(M/M/c\) queue model for hub covering location problem, Integer linear programming model for multidimensional two-way number partitioning problem, Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm, Multi-period hub set covering problems with flexible radius: a modified genetic solution, Hub location problem considering spoke links with incentive-dependent capacities
Uses Software
Cites Work
- Integer programming formulations of discrete hub location problems
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Principles of scatter search
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- The Latest Arrival Hub Location Problem
- Hub Location and the p-Hub Median Problem
- The single-assignment hub covering problem: Models and linearizations
- Lower Bounds for the Hub Location Problem