메뉴 건너뛰기




Volumn 22, Issue 4, 2010, Pages 528-542

Bicriteria p-hub location problems and evolutionary algorithms

Author keywords

Heuristics; Multiple criteria; P hub location

Indexed keywords


EID: 78649340826     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0370     Document Type: Article
Times cited : (25)

References (28)
  • 1
    • 0347126420 scopus 로고    scopus 로고
    • An Efficient Genetic Algorithm for the p-Median Problem
    • DOI 10.1023/A:1026130003508
    • Alp, O., E. Erkut, Z. Drezner. 2003. An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. 122(1-4) 21-42. (Pubitemid 38103388)
    • (2003) Annals of Operations Research , vol.122 , Issue.1-4 , pp. 21-42
    • Alp, O.1    Erkut, E.2    Drezner, Z.3
  • 2
    • 0038612858 scopus 로고    scopus 로고
    • The balance between proximity and diversity in multiobjective evolutionary algorithms
    • Bosman, P. A. N., D. Thierens. 2003. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. Evolutionary Comput. 7(2) 174-188.
    • (2003) IEEE Trans. Evolutionary Comput. , vol.7 , Issue.2 , pp. 174-188
    • Bosman, P.A.N.1    Thierens, D.2
  • 4
    • 0038208493 scopus 로고    scopus 로고
    • Hub location problems
    • Z. Drezner, H. W. Hamacher, eds, Chapter 12, Springer-Verlag, Heidelberg, Germany
    • Campbell, J. F., A. T. Ernst, M. Khrishnamoorthy. 2002. Hub location problems. Z. Drezner, H. W. Hamacher, eds. Facility Location: Applications and Theory, Chapter 12. Springer-Verlag, Heidelberg, Germany, 373-407.
    • (2002) Facility Location: Applications and Theory , pp. 373-407
    • Campbell, J.F.1    Ernst, A.T.2    Khrishnamoorthy, M.3
  • 6
    • 84943330702 scopus 로고    scopus 로고
    • Approximation algorithms for data distribution with load balancing of Web servers
    • IEEE Computer Society, Washington DC
    • Chen, L., H. Choi. 2001. Approximation algorithms for data distribution with load balancing of Web servers. Proc. 2001 IEEE Internat. Conf. Cluster Comput. (CLUSTER'01), IEEE Computer Society, Washington, DC, 274-281.
    • (2001) Proc. 2001 IEEE Internat. Conf. Cluster Comput. (CLUSTER'01) , pp. 274-281
    • Chen, L.1    Choi, H.2
  • 7
    • 41349092784 scopus 로고    scopus 로고
    • Capacitated single allocation hub location problems-A bi-criteria approach
    • Costa, M. G., E. M. Captivo, J. Climaco. 2008. Capacitated single allocation hub location problems-A bi-criteria approach. Comput. Oper. Res. 35(11) 3671-3695.
    • (2008) Comput. Oper. Res. , vol.35 , Issue.11 , pp. 3671-3695
    • Costa, M.G.1    Captivo, E.M.2    Climaco, J.3
  • 8
    • 0033897386 scopus 로고    scopus 로고
    • The capacitated multiple allocation hub location problem: Formulations and algorithms
    • Ebery, J., M. Khrishnamoorthy, A. Ernst, N. Boland. 2000. The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120(3) 614-631.
    • (2000) Eur. J. Oper. Res. , vol.120 , Issue.3 , pp. 614-631
    • Ebery, J.1    Khrishnamoorthy, M.2    Ernst, A.3    Boland, N.4
  • 9
    • 0040913897 scopus 로고    scopus 로고
    • Efficient algorithms for the uncapacitated single allocation p-hub median problem
    • Ernst, A. T., M. Khrishnamoorthy. 1996. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3) 139-154.
    • (1996) Location Sci. , vol.4 , Issue.3 , pp. 139-154
    • Ernst, A.T.1    Khrishnamoorthy, M.2
  • 10
    • 0005036454 scopus 로고    scopus 로고
    • An exact solution approach based on shortest-paths for p-hub median problems
    • Ernst, A. T., M. Khrishnamoorthy. 1998a. An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. 10(2) 149-162.
    • (1998) INFORMS J. Comput. , vol.10 , Issue.2 , pp. 149-162
    • Ernst, A.T.1    Khrishnamoorthy, M.2
  • 11
    • 0031647407 scopus 로고    scopus 로고
    • Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
    • Ernst, A. T., M. Khrishnamoorthy. 1998b. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104(1) 100-112.
    • (1998) Eur. J. Oper. Res. , vol.104 , Issue.1 , pp. 100-112
    • Ernst, A.T.1    Khrishnamoorthy, M.2
  • 14
    • 0015094608 scopus 로고
    • On a bicriterion formulation of the problems of integrated system identification and system optimization
    • Haimes, Y. Y., L. S. Lasdon, D. A. Wismer. 1971. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Systems, Man Cybernetics 1(3) 296-297.
    • (1971) IEEE Trans. Systems, Man Cybernetics , vol.1 , Issue.3 , pp. 296-297
    • Haimes, Y.Y.1    Lasdon, L.S.2    Wismer, D.A.3
  • 15
    • 78649342978 scopus 로고    scopus 로고
    • Working paper, OTBResear ch Institute for Housing, Urban and Mobility Studies, Delft University of Technology, Delft, The Netherlands
    • Janic, M. 2002. The problem of airport capacity: Case of London Heathrow Airport. Working paper, OTBResear ch Institute for Housing, Urban and Mobility Studies, Delft University of Technology, Delft, The Netherlands.
    • (2002) The Problem of Airport Capacity: Case of London Heathrow Airport
    • Janic, M.1
  • 16
    • 0344183121 scopus 로고    scopus 로고
    • A heuristic approach to bicriteria scheduling
    • Köksalan, M. 1999. A heuristic approach to bicriteria scheduling. Naval Res. Logist. 46(7) 777-789.
    • (1999) Naval Res. Logist. , vol.46 , Issue.7 , pp. 777-789
    • Köksalan, M.1
  • 17
    • 61349139979 scopus 로고    scopus 로고
    • An evolutionary metaheuristic for approximating preference-nondominated solutions
    • Köksalan, M., S. (P.) Phelps. 2007. An evolutionary metaheuristic for approximating preference-nondominated solutions. INFORMS J. Comput. 19(2) 291-301.
    • (2007) INFORMS J. Comput. , vol.19 , Issue.2 , pp. 291-301
    • Köksalan, M.1    Phelps, S.P.2
  • 18
    • 0037410805 scopus 로고    scopus 로고
    • Location models for airline hubs behaving as M/D/c queues
    • Marianov, V., D. Serra. 2003. Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. 30(7) 983-1003.
    • (2003) Comput. Oper. Res. , vol.30 , Issue.7 , pp. 983-1003
    • Marianov, V.1    Serra, D.2
  • 19
    • 32544439876 scopus 로고    scopus 로고
    • New formulations for the uncapacitated multiple allocation hub location problem
    • Marín, A., L. Cánovas, M. Landete. 2006. New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172(1) 274-292.
    • (2006) Eur. J. Oper. Res. , vol.172 , Issue.1 , pp. 274-292
    • Marín, A.1    Cánovas, L.2    Landete, M.3
  • 20
    • 0035284148 scopus 로고    scopus 로고
    • Inventory, transportation, service quality and the location of distribution centers
    • Nozick, L. K., M. A. Turnquist. 2001. Inventory, transportation, service quality and the location of distribution centers. Eur. J. Oper. Res. 129(2) 362-371.
    • (2001) Eur. J. Oper. Res. , vol.129 , Issue.2 , pp. 362-371
    • Nozick, L.K.1    Turnquist, M.A.2
  • 21
    • 0023561366 scopus 로고
    • A quadratic integer program for the location of interacting hub facilities
    • O'Kelly, M. E. 1987. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3) 393-404.
    • (1987) Eur. J. Oper. Res. , vol.32 , Issue.3 , pp. 393-404
    • O'Kelly, M.E.1
  • 22
    • 84855685593 scopus 로고    scopus 로고
    • Genetic algorithm with multistart search for the p-hub median problem
    • IEEE Computer Society, Washington DC
    • Pérez, M., F. Almeida, J. M. Moreno-Vega. 1998. Genetic algorithm with multistart search for the p-hub median problem. Proc. 24th Conf. EUROMICRO, IEEE Computer Society, Washington, DC, 702-707.
    • (1998) Proc. 24th Conf. EUROMICRO , pp. 702-707
    • Pérez, M.1    Almeida, F.2    Moreno-Vega, J.M.3
  • 23
    • 0030575685 scopus 로고    scopus 로고
    • Tight linear programming relaxations of uncapacitated p-hub median problems
    • Skorin-Kapov, D., J. Skorin-Kapov, M. E. O'Kelly. 1996. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94(3) 582-593.
    • (1996) Eur. J. Oper. Res. , vol.94 , Issue.3 , pp. 582-593
    • Skorin-Kapov, D.1    Skorin-Kapov, J.2    O'Kelly, M.E.3
  • 24
    • 0032122903 scopus 로고    scopus 로고
    • Efficient solution procedure and reduced size formulations for p-hub location problems
    • Sohn, J., S. Park. 1998. Efficient solution procedure and reduced size formulations for p-hub location problems. Eur. J. Oper. Res. 108(1) 118-126.
    • (1998) Eur. J. Oper. Res. , vol.108 , Issue.1 , pp. 118-126
    • Sohn, J.1    Park, S.2
  • 25
    • 68349145475 scopus 로고    scopus 로고
    • Ph.D. thesis, Middle East Technical University, Industrial Engineering Department, Ankara, Turkey
    • Soylu, B. 2007. An evolutionary algorithm for multiple criteria problems. Ph.D. thesis, Middle East Technical University, Industrial Engineering Department, Ankara, Turkey.
    • (2007) An Evolutionary Algorithm for Multiple Criteria Problems
    • Soylu, B.1
  • 26
    • 77950300538 scopus 로고    scopus 로고
    • A favorable weight-based evolutionary algorithm for multiple criteria problems
    • Soylu, B., M. Köksalan. 2010. A favorable weight-based evolutionary algorithm for multiple criteria problems. IEEE Trans. Evolutionary Comput. 14(2) 191-205.
    • (2010) IEEE Trans. Evolutionary Comput. , vol.14 , Issue.2 , pp. 191-205
    • Soylu, B.1    Köksalan, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.