01905oam 2200445 450 991048484910332120221011171721.03-030-68520-9(CKB)4100000011763240(MiAaPQ)EBC6478641(PPN)25385654X(EXLCZ)99410000001176324020210704d2021 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierMetaheuristics for combinatorial optimization /editors, Salvatore Greco [et al.]Cham, Switzerland :Springer,[2021]©20211 online resource (68 pages)Advances in intelligent systems and computing.3-030-68519-5 This 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.Combinatorial optimizationMetaheuristicsTraveling salesman problemCombinatorial optimization.Metaheuristics.Traveling salesman problem,519.6Greco SalvatoreMiAaPQMiAaPQUtOrBLWBOOK9910484849103321Metaheuristics for combinatorial optimization2846551UNINA