Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation

DOI10.1007/s10589-007-9069-1zbMath1147.90421OpenAlexW2028902954MaRDI QIDQ2479841

Marcus Randall

Publication date: 3 April 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9069-1

zbMATH Keywords

Ant colony optimisationCapacitated hub location problemsMeta-heuristic search

Mathematics Subject Classification ID

Optimality conditions for problems involving partial differential equations (49K20) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51)

Related Items (8)

Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm ⋮ A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming ⋮ Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm

Uses Software

• OR-Library
• Tabu search
• HAS-QAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic assignment problems
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Heuristics for the p-hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Solution algorithms for the capacitated single allocation hub location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• On tabu search for the location of interacting hub facilities
• A genetic algorithm for the generalised assignment problem
• Solution approaches to hub location problems
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Variable neighborhood decomposition search
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Solving the hub location problem with modular link capacities
• Ant colonies for the quadratic assignment problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Neural versus traditional approaches to the location of interacting hub facilities
• Hub Location and the p-Hub Median Problem
• Ants can colour graphs
• Topological Design of Two-Level Telecommunication Networks with Modular Switches

This page was built for publication: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation