메뉴 건너뛰기




Volumn 215, Issue 11, 2010, Pages 3782-3795

Bees algorithm for generalized assignment problem

Author keywords

Bees algorithm; Ejection chain; Generalized assignment problem; Integer programming; Meta heuristics; Swarm intelligence

Indexed keywords

COMPUTATIONAL STUDIES; CONTINUOUS OPTIMIZATION; EJECTION CHAIN; FOOD SOURCES; GENERALIZED ASSIGNMENT PROBLEM; HONEY BEE; INTEGER OPTIMIZATION; META HEURISTIC ALGORITHM; META HEURISTICS; NEW MEMBERS; NP-HARD PROBLEM; OPTIMIZATION PROBLEMS; SWARM INTELLIGENCE;

EID: 73449097425     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.11.018     Document Type: Article
Times cited : (172)

References (57)
  • 2
    • 0002394311 scopus 로고
    • An algorithm for the generalized assignment problems
    • Brans J.P. (Ed), North-Holland
    • Martello S., and Toth P. An algorithm for the generalized assignment problems. In: Brans J.P. (Ed). Operational Research (1981), North-Holland 589-603
    • (1981) Operational Research , pp. 589-603
    • Martello, S.1    Toth, P.2
  • 6
    • 0016473805 scopus 로고
    • A branch and bound based algorithm for the generalized assignment problem
    • Ross G.T., and Soland P.M. A branch and bound based algorithm for the generalized assignment problem. Mathematical Programming 8 (1975) 91-103
    • (1975) Mathematical Programming , vol.8 , pp. 91-103
    • Ross, G.T.1    Soland, P.M.2
  • 7
    • 0000354875 scopus 로고
    • A multiplier adjustment method for the generalized assignment problem
    • Fisher M.L., Jaikumar R., and Van Wassenhove L.N. A multiplier adjustment method for the generalized assignment problem. Management Science 32 (1986) 1095-1103
    • (1986) Management Science , vol.32 , pp. 1095-1103
    • Fisher, M.L.1    Jaikumar, R.2    Van Wassenhove, L.N.3
  • 8
    • 0031272503 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the generalized assignment problem
    • Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841
    • (1997) Operations Research , vol.45 , pp. 831-841
    • Savelsbergh, M.1
  • 9
    • 3843079596 scopus 로고    scopus 로고
    • Solving the generalized assignment problem: an optimizing and heuristic approach
    • Nauss R.M. Solving the generalized assignment problem: an optimizing and heuristic approach. Informs Journal of Computing 15 (2003) 249-266
    • (2003) Informs Journal of Computing , vol.15 , pp. 249-266
    • Nauss, R.M.1
  • 10
    • 34249754951 scopus 로고
    • Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches
    • Osman I.H. Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum 17 (1995) 211-225
    • (1995) OR Spektrum , vol.17 , pp. 211-225
    • Osman, I.H.1
  • 11
    • 0030735527 scopus 로고    scopus 로고
    • A genetic algorithm for the generalized assignment problem
    • Chu P.C., and Beasley J.E. A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24 (1997) 17-23
    • (1997) Computers and Operations Research , vol.24 , pp. 17-23
    • Chu, P.C.1    Beasley, J.E.2
  • 12
    • 21844525198 scopus 로고
    • A robust heuristic for the generalized assignment problem
    • Racer M., and Amini M.M. A robust heuristic for the generalized assignment problem. Annals of Operations Research 50 (1994) 487-503
    • (1994) Annals of Operations Research , vol.50 , pp. 487-503
    • Racer, M.1    Amini, M.M.2
  • 13
    • 0001397186 scopus 로고    scopus 로고
    • A variable-depth search algorithm with branching search for the generalized assignment problem
    • Yagiura M., Yamaguchi T., and Ibaraki T. A variable-depth search algorithm with branching search for the generalized assignment problem. Optimization Methods and Software 10 (1998) 419-441
    • (1998) Optimization Methods and Software , vol.10 , pp. 419-441
    • Yagiura, M.1    Yamaguchi, T.2    Ibaraki, T.3
  • 14
    • 0002361901 scopus 로고    scopus 로고
    • A variable-depth search algorithm for the generalized assignment problem
    • Vob S., Martello S., Osman I.H., and Roucairol C. (Eds), Kluwer Academic Publishers, Boston
    • Yagiura M., Yamaguchi T., and Ibaraki T. A variable-depth search algorithm for the generalized assignment problem. In: Vob S., Martello S., Osman I.H., and Roucairol C. (Eds). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1999), Kluwer Academic Publishers, Boston 459-471
    • (1999) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , pp. 459-471
    • Yagiura, M.1    Yamaguchi, T.2    Ibaraki, T.3
  • 16
    • 0035401203 scopus 로고    scopus 로고
    • A tabu search heuristic for the generalized assignment problem
    • Diaz J.A., and Fernandez E. A tabu search heuristic for the generalized assignment problem. European Journal Operational Research 132 (2001) 22-38
    • (2001) European Journal Operational Research , vol.132 , pp. 22-38
    • Diaz, J.A.1    Fernandez, E.2
  • 17
    • 3142537983 scopus 로고    scopus 로고
    • An ejection chain approach for the generalized assignment problem
    • Yagiura M., Ibaraki T., and Glover F. An ejection chain approach for the generalized assignment problem. Informs Journal of Computing 16 (2004) 131-151
    • (2004) Informs Journal of Computing , vol.16 , pp. 131-151
    • Yagiura, M.1    Ibaraki, T.2    Glover, F.3
  • 18
    • 3843110331 scopus 로고    scopus 로고
    • Adaptive search heuristics for the generalized assignment problem
    • Lourenço H.R., and Serra D. Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing 9 (2002) 209-234
    • (2002) Mathware and Soft Computing , vol.9 , pp. 209-234
    • Lourenço, H.R.1    Serra, D.2
  • 20
    • 25444438659 scopus 로고    scopus 로고
    • A two-phase path relinking algorithm for the generalized assignment problem
    • Technical Report No, 378, CEDRIC, CNAM
    • L. Alfandari, A. Plateau, P. Tolla, A two-phase path relinking algorithm for the generalized assignment problem, Technical Report No.: 378, CEDRIC, CNAM, 2002.
    • (2002)
    • Alfandari, L.1    Plateau, A.2    Tolla, P.3
  • 21
    • 25444479311 scopus 로고    scopus 로고
    • A path relinking algorithm for the generalized assignment problem
    • Resende M.G.C., and Sousa J.D. (Eds), Kluwer Academic Publishers, Boston
    • Alfandari L., Plateau A., and Tolla P. A path relinking algorithm for the generalized assignment problem. In: Resende M.G.C., and Sousa J.D. (Eds). Metaheuristics: Computer Decision-Making (2004), Kluwer Academic Publishers, Boston 1-17
    • (2004) Metaheuristics: Computer Decision-Making , pp. 1-17
    • Alfandari, L.1    Plateau, A.2    Tolla, P.3
  • 22
    • 10444233870 scopus 로고    scopus 로고
    • An effective metaheuristic algorithm for the generalized assignment problem
    • Man, and Cybernetics, Tucson, Arizona, USA
    • M. Yagiura, T. Ibaraki, F. Glover, An effective metaheuristic algorithm for the generalized assignment problem, in: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, Tucson, Arizona, USA, 2001.
    • (2001) Proceedings of IEEE International Conference on Systems
    • Yagiura, M.1    Ibaraki, T.2    Glover, F.3
  • 24
    • 25444472683 scopus 로고    scopus 로고
    • A path relinking approach with ejection chains for the generalized assignment problem
    • Yagiura M., Ibaraki T., and Glover F. A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research 169 (2006) 548-569
    • (2006) European Journal of Operational Research , vol.169 , pp. 548-569
    • Yagiura, M.1    Ibaraki, T.2    Glover, F.3
  • 25
    • 4344608505 scopus 로고    scopus 로고
    • Heuristics for ant colony optimisation using the generalised assignment problem
    • Portland, Oregon, USA
    • M. Randall, Heuristics for ant colony optimisation using the generalised assignment problem, in: Proceedings of IEEE Congress on Evolutionary Computation, Portland, Oregon, USA, 2004, pp. 1916-1923.
    • (2004) Proceedings of IEEE Congress on Evolutionary Computation , pp. 1916-1923
    • Randall, M.1
  • 26
    • 2442615184 scopus 로고    scopus 로고
    • An improved hybrid genetic algorithm for the generalized assignment problem
    • Nicosia, Cyprus
    • H. Feltl, G.R. Raidl, An improved hybrid genetic algorithm for the generalized assignment problem, in: Proceedings of the 2004 ACM Symposium on Applied Computing, Nicosia, Cyprus, 2004, pp. 990-995.
    • (2004) Proceedings of the 2004 ACM Symposium on Applied Computing , pp. 990-995
    • Feltl, H.1    Raidl, G.R.2
  • 27
    • 73449091582 scopus 로고    scopus 로고
    • A. Baykasoǧlu, L. Özbaki{dotless}r, P. Tapkan, Artificial bee colony algorithm and its application to generalized assignment problem, in: F.T.S. Chan, M.K. Tiwari (Eds.), Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, I-Tech Education and Publishing, Vienna, Austria, 2007, pp. 113-144.
    • A. Baykasoǧlu, L. Özbaki{dotless}r, P. Tapkan, Artificial bee colony algorithm and its application to generalized assignment problem, in: F.T.S. Chan, M.K. Tiwari (Eds.), Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, I-Tech Education and Publishing, Vienna, Austria, 2007, pp. 113-144.
  • 28
  • 33
    • 35548969890 scopus 로고    scopus 로고
    • Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach
    • Verdegay J.L. (Ed), Springer-Verlag, Berlin Heidelbelg
    • Lucic P., and Teodorovic D. Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach. In: Verdegay J.L. (Ed). Fuzzy Sets in Optimization (2003), Springer-Verlag, Berlin Heidelbelg 67-82
    • (2003) Fuzzy Sets in Optimization , pp. 67-82
    • Lucic, P.1    Teodorovic, D.2
  • 34
    • 46149121233 scopus 로고    scopus 로고
    • Bee colony optimization - a cooperative learning approach to complex transportation problems
    • September
    • D. Teodorovic, M. Dell'Orco, Bee colony optimization - a cooperative learning approach to complex transportation problems, in: Proceedings of the 10th EWGT Meeting, Poznan, 13-16 September 2005, pp. 51-60.
    • (2005) Proceedings of the 10th EWGT Meeting, Poznan, 13-16 , pp. 51-60
    • Teodorovic, D.1    Dell'Orco, M.2
  • 35
    • 36048940032 scopus 로고    scopus 로고
    • Routing and wavelength assignment in all-optical networks based on the bee colony optimization
    • Markovic G.Z., Teodorovic D., and Acimovic-Raspopovic V.S. Routing and wavelength assignment in all-optical networks based on the bee colony optimization. AI Communications 20 4 (2007) 273-285
    • (2007) AI Communications , vol.20 , Issue.4 , pp. 273-285
    • Markovic, G.Z.1    Teodorovic, D.2    Acimovic-Raspopovic, V.S.3
  • 37
    • 77049105442 scopus 로고    scopus 로고
    • BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior
    • Wedde H.F., Farooq M., and Zhang Y. BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior. Lecture Notes in Computer Science 3172 (2004) 83-94
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 83-94
    • Wedde, H.F.1    Farooq, M.2    Zhang, Y.3
  • 40
    • 25144488571 scopus 로고    scopus 로고
    • Cooperative bees swarm for solving the maximum weighted satisfiability problem
    • Drias H., Sadeg S., and Yahi S. Cooperative bees swarm for solving the maximum weighted satisfiability problem. Lecture Notes in Computer Science 3512 (2005) 318-325
    • (2005) Lecture Notes in Computer Science , vol.3512 , pp. 318-325
    • Drias, H.1    Sadeg, S.2    Yahi, S.3
  • 42
    • 37249039513 scopus 로고    scopus 로고
    • An artificial bee colony (ABC) algorithm for numeric function optimization
    • Indianapolis, Indiana, USA, May 12-14
    • B. Baştürk, D. Karaboǧa, An artificial bee colony (ABC) algorithm for numeric function optimization, in: IEEE Swarm Intelligence Symposium, Indianapolis, Indiana, USA, May 12-14, 2006.
    • (2006) IEEE Swarm Intelligence Symposium
    • Baştürk, B.1    Karaboǧa, D.2
  • 43
    • 35148821762 scopus 로고    scopus 로고
    • A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
    • Karaboǧa D., and Baştürk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39 (2007) 459-471
    • (2007) Journal of Global Optimization , vol.39 , pp. 459-471
    • Karaboǧa, D.1    Baştürk, B.2
  • 44
    • 26444559584 scopus 로고    scopus 로고
    • Engineering optimizations via nature-inspired virtual bee algorithms
    • Yang X.S. Engineering optimizations via nature-inspired virtual bee algorithms. Lecture Notes in Computer Science 3562 (2005) 317-323
    • (2005) Lecture Notes in Computer Science , vol.3562 , pp. 317-323
    • Yang, X.S.1


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