… In this study, an LLH selection method which is based on a choice function, namely the
Modified Choice Function (MCF) [42], is integrated with the ABC algorithm. Specifically, MCF is …

… the traveling salesman problem or the list matching problem (… problem data be used in the
linear part of the cost functional only. For the traveling salesman problem tliis rcquires a choice …

… In approaching the Traveling Salesman Problem, we first used representations found in the
… Our choice of p replaces the systematic choice of k with a stochastic one and the choice of a …

… functions. One of the authors’ conclusions is that the results are not sensitive to the choice
of the distance decay function. … of the attraction function, we formally define the problem, we …

Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the
traveling salesman problem are considered. We measure the closeness of a tour by the ratio …

… In the special case where S consists of all tours through a set V , our computer code
makes each choice of φ by choosing a partition of V into nonempty sets V0,V1,...,Vk. The …

… We compare six metaheuristic optimization algorithms applied to solving the travelling
salesman problem. We focus on three classical approaches: genetic algorithms, simulated …

… We introduce and study the Travelling Salesman Problem with Multiple Time Windows …
Salesman Problem with Time Windows and the recently introduced Travelling Salesman Problem …

… a solution for this combinatorial problem. What are the best parameters to select for a
genetic algorithm that creates a variety efficient to solve the Travelling Salesman Problem (TSP)? …

… In the traveling salesman problem (TSP) we are given a set {cl9 c2,..., cN} ofcities and for
each pair {ci9 … (Note that, given the choice of f3, there is only one possible choice of t4 …