LEADER 01905oam 2200445 450 001 9910484849103321 005 20221011171721.0 010 $a3-030-68520-9 035 $a(CKB)4100000011763240 035 $a(MiAaPQ)EBC6478641 035 $a(PPN)25385654X 035 $a(EXLCZ)994100000011763240 100 $a20210704d2021 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aMetaheuristics for combinatorial optimization /$feditors, Salvatore Greco [et al.] 210 1$aCham, Switzerland :$cSpringer,$d[2021] 210 4$dİ2021 215 $a1 online resource (68 pages) 225 1 $aAdvances in intelligent systems and computing. 311 0 $a3-030-68519-5 330 $aThis book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants. The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem. 606 $aCombinatorial optimization 606 $aMetaheuristics 606 $aTraveling salesman problem 615 0$aCombinatorial optimization. 615 0$aMetaheuristics. 615 0$aTraveling salesman problem, 676 $a519.6 702 $aGreco$b Salvatore 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910484849103321 996 $aMetaheuristics for combinatorial optimization$92846551 997 $aUNINA