Genetic algorithms and traveling salesman problems

Article Abstract:

A genetic algorithm (GA) for solving the traveling salesman problem (TSP) is developed. The GA employs asexual reproduction while attaining the global convergence property of a GA. Asexual reproduction also simplifies the GA encoding of the TSP by allowing permutations of the number of tours to function as candidates in a GA-population without 'fixing up' algorithms. Euclidean and non-Euclidean symmetric TSPs are also studied.

Models, Traveling-salesman problem

---

A simple tabu search for warehouse location

Article Abstract:

A simple, but efficient, tabu-search algorithm, evaluated on the standard OR Library benchmarks and M* instances, is presented to tackle the uncapacitated warehouse location problem (UWLP). Results indicate that the algorithm quickly finds optimal solutions to all benchmarks, and compares favorably with state-of-the-art genetic algorithms.

Algorithm

---

Tabu search algorithms for water network optimization

Article Abstract:

A tabu search algorithm is proposed in a study to investigate the least-cost design of looped water distribution networks. Application of the approach to some classical water distribution network case studies demonstrates the usefulness of tabu search algorithms in the solution of similar optimization problems.

Water Supply and Irrigation Systems, Water supply, Water Distribution

Similar abstracts:

• Abstracts: Dominant, an algorithm for the p-center problem. A new algorithm for the multi-item exponentially discounted optimal selection problem
• Abstracts: More U.K. power generators weigh buying supply businesses. With a big nuclear push, France transforms its energy equation
• Abstracts: Feature based feedback into the early stages of design. ining time series data for segmentation by using Ant Colony optimization
• Abstracts: Financial services strategies in the Euro-zone. Managing the aftermath: lessons from the Royal Bank of Scotland's acquisition of NatWest
• Abstracts: Decomposition of the fuzzy parametric space in multiobjective nonlinear programming problems. PROMISE/scenarios: an interactive method for multiobjective stochastic linear programming under partial uncertainty

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.