A genetic algorithm for the uncapacitated single allocation planar hub location problem

DOI10.1016/j.cor.2014.09.003zbMath1348.90385MaRDI QIDQ337658

Nur Evin Ozdemirel, Haluk Damgacioglu, Derya Dinler, 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

zbMATH Keywords

genetic algorithmshub location problemsplanar hub location problems

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU, An efficient model for the multiple allocation hub maximal covering problem, Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making, Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm, Skyport location problem for urban air mobility system

Cites Work

• Unnamed Item
• Unnamed Item
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A clustering approach to the planar hub location problem
• Solving the uncapacitated hub location problem using genetic algorithms
• Heuristics for the p-hub location problem
• 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
• 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
• On the Complexity of Some Common Geometric Location Problems
• Interacting New Facilities and Location-Allocation Problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Hub Location and the p-Hub Median Problem