Solving Capacity Problems as Asymmetric Travelling Salesman Problems
نویسندگان
چکیده
منابع مشابه
Solving Capacity Problems as Asymmetric Travelling Salesman Problems
The railway capacity optimization problem deals with the maximization of the number of trains running on a given network per unit time. In this study, we frame this problem as a typical asymmetrical Travelling Salesman Problem (ATSP), with the ATSP nodes representing the train arrival /departure events and the ATSP total cost representing the total time-interval of the schedule. The application...
متن کاملClustering Evolutionary Computation for Solving Travelling Salesman Problems
This paper proposes the methods for solving the traveling salesman problems using clustering techniques and evolutionary methods. Gaussian mixer model and K-means clustering are two clustering techniques that are considered in this paper. The traveling salesman problems are clustered in order to group the nearest nodes in the problems. Then, the evolutionary methods are applied to each cluster....
متن کاملOn Solving Travelling Salesman Problems by Genetic Algorithms
We present a genetic algorithm for solving the traveling salesman problem by genetic algorithms to optimality for traveling salesman problems with up to 442 cities. Mlihlenbein et al. [MGK 88], [MK 89] have proposed a genetic algorithm for the traveling salesman problem, which generates very good but not optimal solutions for traveling salesman problems with 442 and 531 cities. We have improved...
متن کاملSolving Large Travelling Salesman Problems with Small Populations
A new genetic algorithm for the solution of the travelling salesman problem is presented in this paper. The approach is to introduce several knowledge-augmented genetic operators which guide the genetic algorithm more directly towards better quality of the populationbut are not trapped in local optima prematurely. The algorithm applies a greedy crossover and two advanced mutation operations bas...
متن کاملHeuristics for sparse general travelling salesman problems
The well-known travelling salesman problem can be expressed in graphtheoretic terms as follows : find a minimum-weight Hamiltonian cycle in a connected edge-weighted graph G(N, A). vVe concentrate here on the problem where G is large and sparse, i.e., where INI is 500 or more and IAI is O( INI). Such graphs arise frequently in practice, where G represents a road network, and each node (city) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Artificial Intelligence & Applications
سال: 2015
ISSN: 0976-2191,0975-900X
DOI: 10.5121/ijaia.2015.6204