GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem

DOI10.1016/J.COR.2013.08.026zbMath1348.90410OpenAlexW2038691272MaRDI QIDQ336883

Juanjo Peiró, Rafael Martí, 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.2013.08.026

zbMATH Keywords

heuristicscombinatorial optimizationGRASP\(p\)-hub

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (16)

Scatter search for an uncapacitated \(p\)-hub median problem ⋮ Heuristics for the capacitated modular hub location problem ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ 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 ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Less is more: general variable neighborhood search for the capacitated modular hub location problem ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ An efficient heuristic for a hub location routing problem ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem

Uses Software

• TTTPLOTS
• Unnamed Item

Cites Work

• Unnamed Item
• Allocation strategies in hub networks
• Hub location for time definite transportation
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• A quadratic integer program for the location of interacting hub facilities
• A probabilistic heuristic for a computationally difficult set covering problem
• Integer programming formulations of discrete hub location problems
• Greedy randomized adaptive search procedures
• TTT plots: a perl program to create time-to-target plots
• Network hub location problems: The state of the art
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

This page was built for publication: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem