Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
From MaRDI portal
Publication:2479841
Optimality conditions for problems involving partial differential equations (49K20) Numerical methods based on necessary conditions (49M05) Numerical optimization and variational techniques (65K10) Interior-point methods (90C51) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Logistics network based on an improved ant colony algorithm
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Solution algorithms for the capacitated single allocation hub location problem
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
Cites work
- A genetic algorithm for the generalised assignment 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
- Ant colonies for the quadratic assignment problem
- Ant colony optimization.
- Ants can colour graphs
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Heuristics for the p-hub location problem
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1480194 (Why is no real title available?)
- scientific article; zbMATH DE number 1488089 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Hub Location and the p-Hub Median Problem
- Integer programming formulations of discrete hub location problems
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Neural versus traditional approaches to the location of interacting hub facilities
- On tabu search for the location of interacting hub facilities
- Quadratic assignment problems
- Solution algorithms for the capacitated single allocation hub location problem
- Solution approaches to hub location problems
- Solving the hub location problem with modular link capacities
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Topological Design of Two-Level Telecommunication Networks with Modular Switches
- Variable neighborhood decomposition search
Cited in
(11)- HUBBI: iterative network design for incomplete hub location problems
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- 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
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Ant colony system solving capacitated location-allocation problems on a line
- Logistics network based on an improved ant colony algorithm
- General variable neighborhood search for the capacitated single allocation hub maximal covering problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
This page was built for publication: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479841)
