Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
From MaRDI portal
Publication:689251
DOI10.1007/BF02060483zbMath0784.90044MaRDI QIDQ689251
Publication date: 21 March 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02060483
heuristics; tabu search; greedy randomized adaptive search procedure; discrete \(p\)-hub location problem
90B18: Communication networks in operations research
90C27: Combinatorial optimization
90B80: Discrete location and assignment
Related Items
The single allocation problem in the interacting three-hub network, Hub Location Problems: The Location of Interacting Facilities, Dual-based approach for a hub network design problem under non-restrictive policy, HubLocator: An exact solution method for the multiple allocation hub location problem, A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands, A parallel adaptive memory algorithm for the capacitated modular hub location problem, 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, An \(M/M/c\) queue model for hub covering location problem, Allocation strategies in hub networks, Hub location-allocation in intermodal logistic networks, A clustering approach to the planar hub location problem, A fuzzy programming approach for dynamic virtual hub location problem, A tabu-search based heuristic for the hub covering problem over incomplete hub networks, A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem, A GRASP for a difficult single machine scheduling problem, A linear program for the two-hub location problem, Tight linear programming relaxations of uncapacitated \(p\)-hub median problems, An efficient tabu search procedure for the \(p\)-median problem, Some personal views on the current state and the future of locational analysis, Efficient solution procedure and reduced size formulations for \(p\)-hub location problems, Location of hubs in a competitive environment, Integer programming formulations of discrete hub location problems, On tabu search for the location of interacting hub facilities, The hub location and routing problem, Solving large single allocation \(p\)-hub problems with two or three hubs, A hybrid heuristic for the uncapacitated hub location problem, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem, Matheuristics for optimizing the network in German wagonload traffic, Hub-and-spoke network design with congestion, Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm, Greedy randomized adaptive search procedures, Tabu search for graph partitioning, Metaheuristics: A bibliography, Benders decomposition algorithms for two variants of the single allocation hub location problem, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, Network hub location problems: The state of the art, Bounds for the single source modular capacitated plant location problem, A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- A probabilistic heuristic for a computationally difficult set covering problem
- Semi-greedy heuristics: An empirical study
- Future paths for integer programming and links to artificial intelligence
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Note—Operations Sequencing in Discrete Parts Manufacturing
- An Overview of Representative Problems in Location Research
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Tabu Search Applied to the Quadratic Assignment Problem
- Large-Scale Network Topological Optimization
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
