Search
CSV
RISOn computational complexity of the constructive-optimizer neural network for the traveling salesman problem
The authors formerly proposed the constructive-optimizer neural network (CONN) for the traveling salesman problem (TSP) to provide the best compromise between the solution quality and convergence speed. However, the computational complexity of CONN...
A new approach to solve traveling salesman problem using genetic algorithm based on heuristic crossover and mutation operator
This paper proposes a new solution for Traveling Salesman Problem (TSP), using genetic algorithm. A heuristic crossover and mutation operation have been proposed to prevent premature convergence. Presented operations try not only to solve...
Modeling of hysteresis in piezoelectric actuator based on adaptive IIR filter
A novel approach for constructing reversible fault tolerant n-bit binary comparator
Nonlinear observer design for stabilization of gliding robotic fish
The generalized covering traveling salesman problem
In this paper we develop a problem with potential applications in humanitarian relief transportation and telecommunication networks. Given a set of vertices including the depot, facility and customer vertices,the goal is ...
The Generalized Covering Salesman Problem
and the Generalized Traveling Salesman Problem are special cases of the GCSP, we tested our heuristics on both of these two problems as well. Overall, the results show that our proposed heuristics find high-quality solutions very rapidly...