178 search results - page 24 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
CSC
2009
13 years 9 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
CPAIOR
2006
Springer
14 years 11 days ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
CISIS
2008
IEEE
14 years 3 months ago
2008
IEEE
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
GECCO
2000
Springer
14 years 7 days ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...