Path relinking approach for multiple allocation hub maximal covering problem

DOI10.1016/J.CAMWA.2008.10.004MaRDI QIDQ971739zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

evolutionary algorithmscatter searchpath relinkinghub covering

Mathematics Subject Classification ID

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)

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

Cites work

• Hub Location and the p-Hub Median Problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Integer programming formulations of discrete hub location problems
• Lower Bounds for the Hub Location Problem
• Principles of scatter search
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• The latest arrival hub location problem
• The single-assignment hub covering problem: Models and linearizations

Cited in

(10)

• An \(M/M/c\) queue model for hub covering location problem
• Evolutionary Computation in Combinatorial Optimization
• 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
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• Integer linear programming model for multidimensional two-way number partitioning problem
• Multi-period hub set covering problems with flexible radius: a modified genetic solution
• An efficient model for the multiple allocation hub maximal covering problem
• Hub location problem considering spoke links with incentive-dependent capacities
• The facility location problem with maximum distance constraint

Describes a project that uses

Uses Software

• Scatter Search

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)