Scatter search for an uncapacitated \(p\)-hub median problem
From MaRDI portal
Publication:337508
DOI10.1016/J.COR.2014.12.009zbMath1348.90407OpenAlexW2094223061MaRDI QIDQ337508
Rafael Martí, Juanjo Peiró, Angel Corberán
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.12.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (9)
Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ A non-triangular hub location problem ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ An efficient heuristic for a hub location routing problem ⋮ The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application
Uses Software
Cites Work
- Unnamed Item
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Allocation strategies in hub networks
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- A quadratic integer program for the location of interacting hub facilities
- Greedy randomized adaptive search procedures
- A hybrid heuristic for the \(p\)-median problem
- General network design: a unified view of combined location and network design problems
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Network hub location problems: The state of the art
- Principles of scatter search
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Solving the hub location problem in a star–star network
This page was built for publication: Scatter search for an uncapacitated \(p\)-hub median problem