Abstract
In this paper, we propose an optimization algorithm inspired by the immune response mechanism and apply it to Traveling Salesman Problem (TSP). We test the proposed algorithm by the simulations on randomly generated 100 data sets of 10-city problems and two of TSPLIB[11] benchmark problems: ulysses22 (22-city) and eil51 (51-city). The simulation results illustrate that the proposed algorithm can find one hundred percent valid solutions in short computation time, and the solution quality is very good.
| Original language | English |
|---|---|
| Pages | 2875-2880 |
| Number of pages | 6 |
| State | Published - 2004 |
| Event | SICE Annual Conference 2004 - Sapporo, Japan Duration: 2004/08/04 → 2004/08/06 |
Conference
| Conference | SICE Annual Conference 2004 |
|---|---|
| Country/Territory | Japan |
| City | Sapporo |
| Period | 2004/08/04 → 2004/08/06 |
Keywords
- Artificial immune system
- Combinatorial optimization probelms
- Immune network
- Immune response
- Traveling salesman problem(TSP)
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering