Path relinking approach for multiple allocation hub maximal covering problem
DOI10.1016/J.CAMWA.2008.10.004zbMATH Open1186.90069OpenAlexW1999901720MaRDI QIDQ971739FDOQ971739
Authors: Bo Qu, Kerui Weng 
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
Recommendations
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- An efficient model for the multiple allocation hub maximal covering problem
- Evolutionary Computation in Combinatorial Optimization
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
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
- Hub Location and the p-Hub Median Problem
- The latest arrival hub location problem
- The single-assignment hub covering problem: Models and linearizations
- Lower Bounds for the Hub Location Problem
Cited In (10)
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Fuzzy covering location problems with different aggregation operators
- Integer linear programming model for multidimensional two-way number partitioning problem
- An efficient model for the multiple allocation hub maximal covering problem
- An \(M/M/c\) queue model for hub covering location problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Hub location problem considering spoke links with incentive-dependent capacities
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- The facility location problem with maximum distance constraint
- Evolutionary Computation in Combinatorial Optimization
Uses Software
This page was built for publication: Path relinking approach for multiple allocation hub maximal covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971739)
