메뉴 건너뛰기




Volumn , Issue , 2010, Pages 7-12

ABC-GSX: A hybrid method for solving the traveling salesman problem

Author keywords

Artificial bee colony; Greedy subtour crossover; Optimization; Swarm intelligence; Traveling salesman problem

Indexed keywords

ARTIFICIAL BEE COLONIES; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL TIME; CROSSOVER METHODS; DECISION MAKING PROCESS; FOOD SOURCES; GREEDY SUBTOUR CROSSOVER; HONEY BEE; HYBRID METHOD; HYBRID PROCEDURE; NP-HARD PROBLEM; OPTIMIZATION PROBLEMS; POSSIBLE SOLUTIONS; SWARM INTELLIGENCE;

EID: 79952757872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NABIC.2010.5716308     Document Type: Conference Paper
Times cited : (25)

References (17)
  • 1
    • 12344292547 scopus 로고    scopus 로고
    • Assigning cells to switches in mobile networks using an ant colony optimization heuristic
    • DOI 10.1016/j.comcom.2004.07.006, PII S0140366404002609
    • J.R.L. Fournier, S. Pierre, "Assigning cells to switches in mobile networks using an ant colony optimization heuristic," Computer Communications., vol. 28, pp. 65-73, 2005. (Pubitemid 40120737)
    • (2005) Computer Communications , vol.28 , Issue.1 , pp. 65-73
    • Fournier, J.R.L.1    Pierre, S.2
  • 2
    • 9344232811 scopus 로고    scopus 로고
    • Ant colony optimization techniques for the vehicle routing problem
    • J.E. Bella, P.R. McMullen, "Ant colony optimization techniques for the vehicle routing problem," Advanced Engineering Informatics., vol. 18, pp. 41-48, 2004.
    • (2004) Advanced Engineering Informatics. , vol.18 , pp. 41-48
    • Bella, J.E.1    McMullen, P.R.2
  • 3
    • 27144529109 scopus 로고    scopus 로고
    • A review of TSP based approaches for flowshop scheduling
    • DOI 10.1016/j.ejor.2004.06.040, PII S0377221705001475
    • T.P. Bagchi, IN.D. Gupta, C. Sriskandarajah, "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research., pp. 816-854,2006. (Pubitemid 41492018)
    • (2006) European Journal of Operational Research , vol.169 , Issue.3 , pp. 816-854
    • Bagchi, T.P.1    Gupta, J.N.D.2    Sriskandarajah, C.3
  • 4
    • 43549119353 scopus 로고    scopus 로고
    • Rescheduling and optimization of logistic processes using GA and ACO
    • DOI 10.1016/j.engappai.2007.08.006, PII S0952197607001169
    • C.A. Silvaa, J.M.C. Sousaa, T.A. Runkler, "Rescheduling and optimization of logistic processes using GA and ACO," Engineering Applications of Artificial Intelligence., vol. 21, pp. 343-352, 2008. (Pubitemid 351680685)
    • (2008) Engineering Applications of Artificial Intelligence , vol.21 , Issue.3 , pp. 343-352
    • Silva, C.A.1    Sousa, J.M.C.2    Runkler, T.A.3
  • 9
    • 79955266092 scopus 로고    scopus 로고
    • A novel discrete particle swarm optimization to solve traveling salesman problem
    • W.-L. Zhong, J. Zhang, W.-N. Chen, "A Novel Discrete Particle Swarm Optimization to Solve Traveling Salesman Problem," in Proc. IEEE Int. Conf. Evol. Comput. (CEC), 2007, pp. 3283-3287.
    • (2007) Proc. IEEE Int. Conf. Evol. Comput. (CEC) , pp. 3283-3287
    • Zhong, W.-L.1    Zhang, J.2    Chen, W.-N.3
  • 11
    • 35148827874 scopus 로고    scopus 로고
    • Erciyes University, Engineering Faculty, Computer Engineering Department, Turkey, Technical Report-TR06
    • D. Karaboga, "An idea based on honey bee swarm for numerical optimization," Erciyes University, Engineering Faculty, Computer Engineering Department, Turkey, Technical Report-TR06, 2005.
    • (2005) An Idea Based on Honey Bee Swarm for Numerical Optimization
    • Karaboga, D.1
  • 12
    • 75149134664 scopus 로고    scopus 로고
    • A survey: Algorithms simulating bee swarm intelligence
    • D. Karaboga, B. Akay, "A Survey: Algorithms Simulating Bee Swarm Intelligence," Artificial Intelligence Review., vol. 31, pp. 68-85, 2009.
    • (2009) Artificial Intelligence Review. , vol.31 , pp. 68-85
    • Karaboga, D.1    Akay, B.2
  • 13
    • 27744441939 scopus 로고    scopus 로고
    • The use of waggle dance information by honey bees throughout their foraging careers
    • DOI 10.1007/s00265-005-0019-6
    • J.C. Biesmeijer, T.D. Seeley, "The use of waggle dance information by honey bees throughout their foraging careers," Behav. Ecol. Sociobiol., vol. 59, pp. 133-142,2005. (Pubitemid 41597322)
    • (2005) Behavioral Ecology and Sociobiology , vol.59 , Issue.1 , pp. 133-142
    • Biesmeijer, J.C.1    Seeley, T.D.2
  • 15
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • G.A. Croes, "A method for solving traveling salesman problems," Operations Research., vol. 6, pp. 791-812, 1958.
    • (1958) Operations Research. , vol.6 , pp. 791-812
    • Croes, G.A.1
  • 16
    • 0026225350 scopus 로고
    • TSPLIB-A traveling salesman problem library
    • G. Reineit, "TSPLIB-A traveling salesman problem library," ORSA Journal on Computing., vol. 3, no. 4, pp. 376-384, 1991.
    • (1991) ORSA Journal on Computing. , vol.3 , Issue.4 , pp. 376-384
    • Reineit, G.1
  • 17
    • 34250187782 scopus 로고    scopus 로고
    • Particle swarm optimization-based algorithms for TSP and generalized TSP
    • DOI 10.1016/j.ipl.2007.03.010, PII S0020019007000804
    • X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu, Q.x. Wang, "Particle swarm optimization-based algorithms for TSP and generalized TSP," Information Processing Letters., vol 103, pp. 169-176,2007. (Pubitemid 46898376)
    • (2007) Information Processing Letters , vol.103 , Issue.5 , pp. 169-176
    • Shi, X.H.1    Liang, Y.C.2    Lee, H.P.3    Lu, C.4    Wang, Q.X.5


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