On tabu search for the location of interacting hub facilities
From MaRDI portal
Publication:1328642
DOI10.1016/0377-2217(94)90245-3zbMath0806.90075OpenAlexW2027549260MaRDI QIDQ1328642
Darko Skorin-Kapov, Jadranka Skorin-Kapov
Publication date: 26 July 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90245-3
Related Items
A note on Steiner tree games ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ An efficient heuristic for the expansion problem of cellular wireless networks ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Tabu search for graph partitioning ⋮ A tabu search algorithm for frequency assignment ⋮ Metaheuristics: A bibliography ⋮ 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 ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Machine learning augmented approaches for hub location problems ⋮ Allocation strategies in hub networks ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Hub location-allocation in intermodal logistic networks ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Hub-and-spoke network design with congestion ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Tabu search for a class of single-machine scheduling problems ⋮ Threshold based discounting networks: the cost allocation provided by the nucleolus ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm ⋮ Stochastic air freight hub location and flight routes planning ⋮ Modeling two-stage UHL problem with uncertain demands ⋮ Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ A linear program for the two-hub location problem ⋮ Tight linear programming relaxations of uncapacitated \(p\)-hub median problems ⋮ Some personal views on the current state and the future of locational analysis ⋮ 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 ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ Digital data networks design using genetic algorithms ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Network cost minimization using threshold-based discounting ⋮ A hybrid heuristic for the uncapacitated hub location problem
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A clustering approach to the planar hub location problem
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Tabu Search—Part I
- Tabu Search—Part II
- Location of facilities with rectangular distances among point and area destinations
