Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem
From MaRDI portal
(Redirected from Publication:879279)
Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Recommendations
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median 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 hub location problem using genetic algorithms
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
Cites work
- A quadratic integer program for the location of interacting hub facilities
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary computation. 1. Basic algorithms and operators
- Evolutionary computation. 2. Advanced algorithms and operators
- Genetic algorithm for network cost minimization using threshold based discounting
- Heuristics for the p-hub location problem
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- scientific article; zbMATH DE number 2172799 (Why is no real title available?)
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Integer programming formulations of discrete hub location problems
- Location of hubs in a competitive environment
- Network cost minimization using threshold-based discounting
- Neural versus traditional approaches to the location of interacting hub facilities
- Obtaining test problems via Internet
- On cost allocation in hub-like networks
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Threshold based discounting networks: the cost allocation provided by the nucleolus
Cited in
(41)- Computing minimal doubly resolving sets of graphs
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- HUBBI: iterative network design for incomplete hub location problems
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- The freight consolidation and containerization problem
- A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
- A competitive hub location and pricing problem
- Spatial analysis of single allocation hub location problems
- Skyport location problem for urban air mobility system
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- A compact linearisation of Euclidean single allocation hub location problems
- GRASP for the uncapacitated r-allocation p-hub median problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Allocation strategies in hub networks
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Solving the uncapacitated single allocation p-hub Median problem on GPU
- Hub location-allocation in intermodal logistic networks
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Genetic algorithm to solve the p-centre and p-radius problem on a network
- Machine learning augmented approaches for hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- A hybrid framework for designing customer centric hub and spoke transportation networks with delivery time windows
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Computing the metric dimension of graphs by genetic algorithms
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
This page was built for publication: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879279)
