A genetic algorithm for the uncapacitated single allocation planar hub location problem
Authors:
- Haluk DamgaciogluHDHaluk Damgacioglu
- Derya DinlerDDDerya Dinler
- Nur Evin OzdemirelNONur Evin Ozdemirel
- Cem IyigunCICem Iyigun
- 1 October 2015
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 62, 224-236
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problemEuropean Journal of Operational Research, 2010
- Two genetic algorithms for solving the uncapacitated single allocation p-hub median problemEuropean Journal of Operational Research, 2007
- Solving the uncapacitated hub location problem using genetic algorithmsComputers & Operations Research, 2005
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 1998
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- A clustering approach to the planar hub location problemAnnals of Operations Research, 1992
- Avoiding local optima in thep-hub location problem using tabu search and GRASPAnnals of Operations Research, 1992
- Heuristics for the p-hub location problemEuropean Journal of Operational Research, 1991
- Locating transportation terminals to serve an expanding demandTransportation Research Part B: Methodological, 1990
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987