메뉴 건너뛰기




Volumn 38, Issue 10, 2011, Pages 1367-1376

Bee colony optimization for the p-center problem

Author keywords

Bee colony optimization; Combinatorial optimization; Location analysis; Meta heuristics; p Center problem

Indexed keywords

BENCH-MARK PROBLEMS; BIOLOGICALLY INSPIRED METHODS; COLLECTIVE INTELLIGENCES; COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEM; CPU TIME; DISTANCE MATRICES; HIGH-QUALITY SOLUTIONS; HONEY BEE; LOCATION ANALYSIS; META HEURISTICS; METAHEURISTIC; NUMERICAL EXPERIMENTS; P-CENTER;

EID: 79951550821     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.12.002     Document Type: Article
Times cited : (98)

References (44)
  • 1
    • 0012220401 scopus 로고    scopus 로고
    • Bee system: Modeling combinatorial optimization transportation engineering problems by swarm intelligence
    • Sao Miguel, Azores Islands
    • Lučić P, Teodorović D. Bee system: modeling combinatorial optimization transportation engineering problems by swarm intelligence. In: Preprints of the TRISTAN IV triennial symposium on transportation analysis, Sao Miguel, Azores Islands; 2001. p. 4415.
    • (2001) Preprints of the TRISTAN IV Triennial Symposium on Transportation Analysis , pp. 4415
    • Lučić, P.1    Teodorović, D.2
  • 4
    • 35548969890 scopus 로고    scopus 로고
    • Vehicle routing problem with uncertain demand at nodes: The bee system and fuzzy logic approach
    • P. Lučić, and D. Teodorović Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach J.L. Verdegay, Fuzzy Sets Based Heuristics for Optimization 2003 Physica Verlag Berlin, Heidelberg 67 82
    • (2003) Fuzzy Sets Based Heuristics for Optimization , pp. 67-82
    • Lučić, P.1    Teodorović, D.2
  • 5
    • 36048940032 scopus 로고    scopus 로고
    • Routing and wavelength assignment in all-optical networks based on the bee colony optimization
    • Network Analysis in Natural Sciences and Engineering
    • G. Marković, D. Teodorović, and V. Aćimović- Raspopović Routing and wavelength assignment in all-optical networks based on the bee colony optimization AI Communications 20 2007 273 285 (Pubitemid 350096313)
    • (2007) AI Communications , vol.20 , Issue.4 , pp. 273-285
    • Markovic, G.Z.1    Teodorovic, D.B.2    Acimovic-Raspopovic, V.S.3
  • 6
    • 40949089215 scopus 로고    scopus 로고
    • Mitigating traffic congestion: Solving the ride-matching problem by Bee Colony Optimization
    • DOI 10.1080/03081060801948027, PII 791459120
    • D. Teodorović, and M. Dell'Orco Mitigating traffic congestion: solving the ride-matching problem by bee colony optimization Transportation Planning and Technology 31 2008 135 152 (Pubitemid 351404793)
    • (2008) Transportation Planning and Technology , vol.31 , Issue.2 , pp. 135-152
    • Teodorovic, D.1    Dell'Orco, M.2
  • 7
    • 79951553073 scopus 로고    scopus 로고
    • Heuristic solution algorithms for a traffic sensor optimization problem
    • Washington, DC
    • Edara P, elmić M, Teodorović D. Heuristic solution algorithms for a traffic sensor optimization problem. In: INFORMS 2008, Washington, DC; 2008.
    • (2008) INFORMS 2008
    • Edara, P.1    Elmić, M.2    Teodorović, D.3
  • 9
    • 0000890583 scopus 로고
    • Optimal locations of switching centers and the absolute centers and medians of a graph
    • S.L. Hakimi Optimal locations of switching centers and the absolute centers and medians of a graph Operations Research 12 1964 450 459
    • (1964) Operations Research , vol.12 , pp. 450-459
    • Hakimi, S.L.1
  • 10
    • 0000890585 scopus 로고
    • Optimum distribution of switching centers in a communication network and some related graph theoretic problems
    • S.L. Hakimi Optimum distribution of switching centers in a communication network and some related graph theoretic problems Operations Research 13 3 1965 462 475
    • (1965) Operations Research , vol.13 , Issue.3 , pp. 462-475
    • Hakimi, S.L.1
  • 11
    • 0017518063 scopus 로고
    • The centers and medians of a graph
    • E. Minieka The centers and medians of a graph Operations Research 25 4 1977 641 650
    • (1977) Operations Research , vol.25 , Issue.4 , pp. 641-650
    • Minieka, E.1
  • 12
    • 0021532114 scopus 로고
    • The planar two center and two median problems
    • Z. Drezner The planar two center and two median problems Transportation Science 18 1984 451 461
    • (1984) Transportation Science , vol.18 , pp. 451-461
    • Drezner, Z.1
  • 15
    • 2142679347 scopus 로고    scopus 로고
    • Solving the p-center problem with tabu search and variable neighborhood search
    • N. Mladenović, M. Labbe, and P. Hansen Solving the p-center problem with tabu search and variable neighborhood search Networks 42 1 2003 48 64
    • (2003) Networks , vol.42 , Issue.1 , pp. 48-64
    • Mladenović, N.1    Labbe, M.2    Hansen, P.3
  • 17
    • 19944395598 scopus 로고    scopus 로고
    • Solving two location models with few facilities by using a hybrid heuristic: A real health resources case
    • DOI 10.1016/j.cor.2004.04.009, PII S0305054804000929
    • J.A. Pacheco, and S. Casado Solving two location models with few facilities by using a hybrid heuristic: a real health resources case Computers & Operations Research 32 12 2005 3075 3091 (Pubitemid 40749365)
    • (2005) Computers and Operations Research , vol.32 , Issue.12 , pp. 3075-3091
    • Pacheco, J.A.1    Casado, S.2
  • 18
    • 12344323561 scopus 로고    scopus 로고
    • Location analysis: A synthesis and survey
    • DOI 10.1016/j.ejor.2003.11.032, PII S0377221704002139
    • C. ReVelle, and H. Eiselt Location analysis: a synthesis and survey European Journal of Operational Research 165 1 2005 1 19 (Pubitemid 40135590)
    • (2005) European Journal of Operational Research , vol.165 , Issue.1 , pp. 1-19
    • Revelle, C.S.1    Eiselt, H.A.2
  • 19
    • 55749087203 scopus 로고    scopus 로고
    • New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems
    • D. Chen, and R. Chen New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems Computers & Operations Research 36 5 2009 1646 1655
    • (2009) Computers & Operations Research , vol.36 , Issue.5 , pp. 1646-1655
    • Chen, D.1    Chen, R.2
  • 25
    • 0034870046 scopus 로고    scopus 로고
    • MBO: Marriage in honey bees optimization a haplometrosis polygynous swarming approach
    • Abbass HA. MBO: marriage in honey bees optimization-a haplometrosis polygynous swarming approach. In: Proceedings of the congress on evolutionary computation, Seoul, South Korea; 2001. p. 20714. (Pubitemid 32806339)
    • (2001) Proceedings of the IEEE Conference on Evolutionary Computation, ICEC , vol.1 , pp. 207-214
    • Abbass, H.A.1
  • 26
    • 77049105442 scopus 로고    scopus 로고
    • BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior
    • Ant Colony Optimization and Swarm Intelligence
    • H.F. Wedde, M. Farooq, and Y. Zhang BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior Ant colony optimization and swarm intelligence. Lecture notes in computer science vol. 3172 2004 83 94 (Pubitemid 39210704)
    • (2004) LECTURE NOTES IN COMPUTER SCIENCE , Issue.3172 , pp. 83-94
    • Wedde, H.F.1    Farooq, M.2    Zhang, Y.3
  • 29
    • 35148827874 scopus 로고    scopus 로고
    • Technical Report, Erciyes University, Engineering Faculty Computer Engineering Department Kayseri/Turkiye
    • Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical Report, Erciyes University, Engineering Faculty Computer Engineering Department Kayseri/Turkiye; 2005.
    • (2005) An Idea Based on Honey Bee Swarm for Numerical Optimization
    • Karaboga, D.1
  • 30
    • 35148821762 scopus 로고    scopus 로고
    • A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm
    • DOI 10.1007/s10898-007-9149-x
    • D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471 (Pubitemid 47551831)
    • (2007) Journal of Global Optimization , vol.39 , Issue.3 , pp. 459-471
    • Karaboga, D.1    Basturk, B.2
  • 31
    • 34548479029 scopus 로고    scopus 로고
    • On the performance of artificial bee colony (ABC) algorithm
    • DOI 10.1016/j.asoc.2007.05.007, PII S1568494607000531
    • D. Karaboga, and B. Basturk On the performance of artificial bee colony algorithm Applied Soft Computing 8 2008 687 697 (Pubitemid 47374599)
    • (2008) Applied Soft Computing Journal , vol.8 , Issue.1 , pp. 687-697
    • Karaboga, D.1    Basturk, B.2
  • 35
    • 75149134664 scopus 로고    scopus 로고
    • A survey: Algorithms simulating bee swarm intelligence
    • D. Karaboga, and B. Akay A survey: algorithms simulating bee swarm intelligence Artificial Intelligence Review 31 2009 61 85
    • (2009) Artificial Intelligence Review , vol.31 , pp. 61-85
    • Karaboga, D.1    Akay, B.2
  • 36
    • 70349980163 scopus 로고    scopus 로고
    • Bee colony optimization (BCO)
    • D. Teodorović Bee colony optimization (BCO) C.P. Lim, L.C. Jain, S. Dehuri, Innovations in swarm intelligence 2009 Springer-Verlag Berlin, Heidelberg 39 60
    • (2009) Innovations in Swarm Intelligence , pp. 39-60
    • Teodorović, D.1
  • 37
    • 0025922920 scopus 로고
    • A model of collective nectar source selection by honey bees: self- organization through simple rules
    • S. Camazine, and J. Sneyd A model of collective nectar source by honey bees: self-organization through simple rules Journal of Theoretical Biology 149 1991 547 571 (Pubitemid 23401635)
    • (1991) Journal of Theoretical Biology , vol.149 , Issue.4 , pp. 547-571
    • Camazine, S.1    Sneyd, J.2
  • 38
    • 79951553979 scopus 로고    scopus 로고
    • An application of a meta-heuristic algorithm to p-center location problem
    • YUINFO, Kopaonik, Serbia (in Serbian on CD 026.pdf)
    • Teodorović D, Davidović T, elmić M, Ramljak D. An application of a meta-heuristic algorithm to p-center location problem. In: Proceedings of the symposium on information technology, YUINFO, Kopaonik, Serbia (in Serbian on CD 026.pdf); 2010.
    • (2010) Proceedings of the Symposium on Information Technology
    • Teodorović D, D.1
  • 41
    • 0018678438 scopus 로고
    • An algorithmic approach to network location problems. Part ii. The p-median
    • O. Kariv, and S.L. Hakimi An algorithmic approach to network location problems. Part ii. The p-median SIAM Journal of Applied Mathematics 37 1969 539 560
    • (1969) SIAM Journal of Applied Mathematics , vol.37 , pp. 539-560
    • Kariv, O.1    Hakimi, S.L.2
  • 42
    • 0000904049 scopus 로고
    • P-center problems
    • G.Y. Handler p-center problems P. Mirchandani, R.L. Francis, Discrete location theory 1990 John Wiley & Sons 305 347
    • (1990) Discrete Location Theory , pp. 305-347
    • Handler, G.Y.1
  • 43
    • 0020119719 scopus 로고
    • POLYNOMIALLY BOUNDED ALGORITHMS FOR LOCATING p-CENTERS ON A TREE
    • R. Chandrasekaran, and A. Tamir Polynomial bounded algorithms for locating p-centers on a tree Mathematical Programming 22 1982 304 315 (Pubitemid 12554655)
    • (1982) Mathematical Programming , vol.22 , Issue.3 , pp. 304-315
    • Chandrasekaran, R.1    Tamir, A.2
  • 44
    • 0038712937 scopus 로고
    • Heuristic methods for the p-center problem
    • B. Pelgrin Heuristic methods for the p-center problem RAIRO Recherche Operationelle 25 1991 65 72
    • (1991) RAIRO Recherche Operationelle , vol.25 , pp. 65-72
    • Pelgrin, B.1


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