Bicriteria p-Hub Location Problems and Evolutionary Algorithms

Published Online:https://doi.org/10.1287/ijoc.1090.0370

References

  • Alp O., Erkut E., Drezner Z. An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. (2003) 122(1–4):21–42CrossrefGoogle Scholar
  • Bosman P. A. N., Thierens D. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. Evolutionary Comput. (2003) 7(2):174–188CrossrefGoogle Scholar
  • Çamlar O. Solution to multi-objective hub location problem using evolutionary algorithm—An application to PTT network. (2005) . Master's thesis, Department of Industrial Engineering, Middle East Technical University, Ankara, TurkeyGoogle Scholar
  • Campbell J. F., Ernst A. T., Khrishnamoorthy M., Drezner Z., Hamacher H. W. Hub location problems. Facility Location: Applications and Theory (2002) (Springer-Verlag, Heidelberg, Germany) 373–407Chapter 12CrossrefGoogle Scholar
  • Çetiner S. An iterative hub location and routing problem for postal delivery systems. (2003) . Mater's thesis, Department of Industrial Engineering, Middle East Technical University, Ankara, TurkeyGoogle Scholar
  • Chen L., Choi H. Approximation algorithms for data distribution with load balancing of Web servers. Proc. 2001 IEEE Internat. Conf. Cluster Comput. (CLUSTER'01) (2001) (IEEE Computer Society, Washington, DC) 274–281CrossrefGoogle Scholar
  • Costa M. G., Captivo E. M., Climaco J. Capacitated single allocation hub location problems—A bi-criteria approach. Comput. Oper. Res. (2008) 35(11):3671–3695CrossrefGoogle Scholar
  • Ebery J., Khrishnamoorthy M., Ernst A., Boland N. The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. (2000) 120(3):614–631CrossrefGoogle Scholar
  • Ernst A. T., Khrishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. (1996) 4(3):139–154CrossrefGoogle Scholar
  • Ernst A. T., Khrishnamoorthy M. An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. (1998a) 10(2):149–162LinkGoogle Scholar
  • Ernst A. T., Khrishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. (1998b) 104(1):100–112CrossrefGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability—A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco) Google Scholar
  • Goldberg D. E.Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Reading, MA) Google Scholar
  • Haimes Y. Y., Lasdon L. S., Wismer D. A. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Systems, Man Cybernetics (1971) 1(3):296–297CrossrefGoogle Scholar
  • Janic M. The problem of airport capacity: Case of London Heathrow Airport. (2002) . Working paper, OTB Research Institute for Housing, Urban and Mobility Studies, Delft University of Technology, Delft, The NetherlandsGoogle Scholar
  • Köksalan M. A heuristic approach to bicriteria scheduling. Naval Res. Logist. (1999) 46(7):777–789CrossrefGoogle Scholar
  • Köksalan M., Phelps S. (P.). An evolutionary metaheuristic for approximating preference-nondominated solutions. INFORMS J. Comput. (2007) 19(2):291–301LinkGoogle Scholar
  • Marianov V., Serra D. Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. (2003) 30(7):983–1003CrossrefGoogle Scholar
  • Marín A., Cánovas L., Landete M. New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. (2006) 172(1):274–292CrossrefGoogle Scholar
  • Nozick L. K., Turnquist M. A. Inventory, transportation, service quality and the location of distribution centers. Eur. J. Oper. Res. (2001) 129(2):362–371CrossrefGoogle Scholar
  • O'Kelly M. E. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32(3):393–404CrossrefGoogle Scholar
  • Pérez M., Almeida F., Moreno-Vega J. M. Genetic algorithm with multistart search for the p-hub median problem. Proc. 24th Conf. EUROMICRO (1998) (IEEE Computer Society, Washington, DC) 702–707CrossrefGoogle Scholar
  • Skorin-Kapov D., Skorin-Kapov J., O'Kelly M. E. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. (1996) 94(3):582–593CrossrefGoogle Scholar
  • Sohn J., Park S. Efficient solution procedure and reduced size formulations for p-hub location problems. Eur. J. Oper. Res. (1998) 108(1):118–126CrossrefGoogle Scholar
  • Soylu B. An evolutionary algorithm for multiple criteria problems. (2007) . Ph.D. thesis, Middle East Technical University, Industrial Engineering Department, Ankara, TurkeyGoogle Scholar
  • Soylu B., Köksalan M. A favorable weight-based evolutionary algorithm for multiple criteria problems. IEEE Trans. Evolutionary Comput. (2010) 14(2):191–205CrossrefGoogle Scholar
  • Steuer R. E.Multiple Criteria Optimization: Theory, Computation, and Application (1986) (John Wiley & Sons, New York) Google Scholar
  • Zitzler E., Thiele L., Laumanns M., Fonseca C. M., da Fonseca V. G. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evolutionary Comput. (2003) 7(2):117–132CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.