An efficient genetic algorithm for the uncapacitated r-allocation p-hub maximal covering problem
From MaRDI portal
Publication:4987784
Recommendations
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
Cites work
- A hub covering network design problem for cargo applications in Turkey
- A quadratic integer program for the location of interacting hub facilities
- Allocation strategies in hub networks
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- GRASP for the uncapacitated r-allocation p-hub median problem
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 2172799 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- Integer programming formulations of discrete hub location problems
- Model formulations for hub covering problems
- Network hub location problems: The state of the art
- Optimal recombination in genetic algorithms for combinatorial optimization problems. I
- Optimal recombination in genetic algorithms for combinatorial optimization problems. II
- Solution approaches to hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- The single-assignment hub covering problem: Models and linearizations
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(15)- A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
- A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Solving the uncapacitated single allocation p-hub Median problem on GPU
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
- An efficient model for the multiple allocation hub maximal covering problem
- General variable neighborhood search for the capacitated single allocation hub maximal covering problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Path relinking approach for multiple allocation hub maximal covering problem
This page was built for publication: An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987784)
