Heuristics for the p-hub location problem
From MaRDI portal
Publication:803033
DOI10.1016/0377-2217(91)90090-IzbMath0726.90042OpenAlexW1971918127MaRDI QIDQ803033
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90090-i
Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (41)
On tabu search for the location of interacting hub facilities ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem ⋮ An efficient algorithm for solving the median problem on real road networks ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ A genetic algorithm for the uncapacitated single allocation planar hub location problem ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Optimal use of hub facilities: A two-hub model with fixed arc costs ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ The single allocation problem in the interacting three-hub network ⋮ The hub location and routing problem ⋮ Allocation strategies in hub networks ⋮ An improved algorithm for fixed-hub single allocation problems ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ Graph clustering ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Hub location-allocation in intermodal logistic networks ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Hub-and-spoke network design with congestion ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ A polynomial algorithm for balanced clustering via graph partitioning ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ A linear program for the two-hub location problem ⋮ Tight linear programming relaxations of uncapacitated \(p\)-hub median problems ⋮ The tree of hubs location problem ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ Efficient solution procedure and reduced size formulations for \(p\)-hub location problems ⋮ Location of hubs in a competitive environment ⋮ A hybrid genetic/optimization algorithm for a task allocation problem ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Network cost minimization using threshold-based discounting ⋮ Integer programming formulations of discrete hub location problems ⋮ A hybrid heuristic for the uncapacitated hub location problem
Cites Work
This page was built for publication: Heuristics for the p-hub location problem
