A genetic algorithm for the uncapacitated single allocation planar hub location problem
From MaRDI portal
Publication:337658
DOI10.1016/J.COR.2014.09.003zbMATH Open1348.90385OpenAlexW1998006396MaRDI QIDQ337658FDOQ337658
Authors: Haluk Damgacioglu, Derya Dinler, Nur Evin Ozdemirel, Cem Iyigun 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.003
Recommendations
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Solving the uncapacitated hub location problem using genetic algorithms
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- 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
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A quadratic integer program for the location of interacting hub facilities
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Network hub location problems: The state of the art
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Solving the uncapacitated hub location problem using genetic algorithms
- On the Complexity of Some Common Geometric Location Problems
- 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
- Interacting New Facilities and Location-Allocation Problems
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A clustering approach to the planar hub location problem
- Heuristics for the p-hub location problem
Cited In (14)
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making
- Solving the uncapacitated hub location problem using genetic algorithms
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- An efficient model for the multiple allocation hub maximal covering problem
- A biased random-key genetic algorithm for the tree of hubs location problem
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A hybrid heuristic for the uncapacitated hub location problem
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Solving the uncapacitated single allocation p-hub Median problem on GPU
- Skyport location problem for urban air mobility system
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
- An $$\alpha $$-risk appetite cost minimizing model for multi-commodity capacitated p-hub median problem with time windows and uncertain flows
This page was built for publication: A genetic algorithm for the uncapacitated single allocation planar hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337658)
