A new genetic algorithm for traveling salesman problem and its application.

by Lee, Ka-wai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical references (leaves 61-67).Chapter 1 --- Introduction --- p.6Chapter 1.1 --- Traveling Salesman Problem --- p.6Chapter 1.2 --- Genetic Algorithms --- p.8Chapter 1.3 --- Solving TSP using Genetic Algorithms --- p.10Chapter 1.4 --- Outline of Work --- p.12Chapter Part I --- Algorithm Development --- p.14Chapter 2 --- A Local DP Crossover Operator 一 LDPX --- p.15Chapter 2.1 --- Review of DP for Solving TSP --- p.15Chapter 2.2 --- On the Original LDPX --- p.18Chapter 2.2.1 --- Gene Representation --- p.18Chapter 2.2.2 --- The Original Crossover Procedure --- p.19Chapter 2.3 --- Analysis --- p.21Chapter 2.3.1 --- Ring TSP --- p.21Chapter 2.3.2 --- Computational Results of Solving Ring TSP and Other TSP using LDPX --- p.22Chapter 2.4 --- Augmentation of the Gene Set Representation --- p.24Chapter 2.5 --- Enhancement of Crossover Procedure --- p.25Chapter 2.6 --- Computational Comparison of the new proposed LDPX with the orig- inal LDPX --- p.26Chapter 2.7 --- SPIR ´ؤ An Operator for Single Parent Improved Reproduction --- p.26Chapter 3 --- A New TSP Solver --- p.29Chapter 4 --- Performance Analysis of the TSP Solver --- p.33Chapter 4.1 --- Computational results --- p.34Chapter 4.2 --- "Comparison between SPIR/LDPX, PMX and ER" --- p.35Chapter 4.3 --- Convergence Test of SPIR/LDPX --- p.37Chapter Part II --- Application --- p.43Chapter 5 --- Flowshop Scheduling Problem --- p.44Chapter 5.1 --- Brief Review of the Flowshop Scheduling Problem --- p.44Chapter 5.2 --- Flowshop Scheduling with travel times between machines --- p.45Chapter 6 --- A New Approach to Solve FSTTBM --- p.47Chapter 7 --- Computational Results of the New Algorithm for CPFSTTBM --- p.53Chapter 7.1 --- Comparison with Global Optimum --- p.54Chapter 7.2 --- The Algorithm of SPIRIT --- p.55Chapter 7.3 --- Comparison with SPIRIT --- p.57Chapter 8 --- Conclusion --- p.59Bibliography --- p.61Chapter A --- Random CPFSTTBM problem Generation Algorithm --- p.6

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

Contributions to the solution of the symmetric travelling salesman problem

Imperial Users onl

School bus selection, routing and scheduling.

The aim of this thesis is to develop formulations and exact algorithms for the school bus routing and scheduling problem and to develop an integrated software implementation using Xpress-MP/CPLEX and ArcGIS of ESRI, a geographical information system software package. In this thesis, bus flow, single commodity flow, two-commodity flow, multi-commodity flow, and time window formulations have been developed. They capture all of the important elements of the School Bus Routing and Scheduling Problem (SBRSP) including homogeneous or heterogeneous bus fleets, the identification of bus stops from a large set of potential bus stops, and the assignment of students to stops and stops to routes. They allow for the one stop-one bus and one stop-multi bus scenarios. Each formulation of the SBRSP has a linear programming relaxation and we present the relationships among them. We present a Branch-and-Cut exact algorithm which makes use of new linearization techniques, new valid inequalities, and the first valid equalities. We develop an integrated software package that is based on Geographical Information System (GIS) map-based interface, linking to an Xpress-MP/CPLEX solver. The interface between GIS and Xpress-MP is written in VBA and VC++.Dept. of Mathematics and Statistics. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .K4. Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6250. Thesis (Ph.D.)--University of Windsor (Canada), 2005

Development of some local search methods for solving the vehicle routing problem

Master'sMASTER OF ENGINEERIN

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field