Optimization with the Attractor-Based Search System
Description:... This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.
This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.
به شما اطمینان می دهیم در کمتر از 8 ساعت به درخواست شما پاسخ خواهیم داد.
* نتیجه بررسی از طریق ایمیل ارسال خواهد شد
شماره کارت : 6104337650971516 شماره حساب : 8228146163 شناسه شبا (انتقال پایا) : IR410120020000008228146163 بانک ملت به نام مهدی تاج دینی