An Ant Colony Optimization Approach for the Preference-Based Shortest Path Search
نویسندگان
چکیده
An ant colony optimization approach for the preference-based shortest path search Seung-Ho Ok, Woo-Jin Seo, Jin-Ho Ahn, Sungho Kang and Byungin Moon* School of Electrical Engineering and Computer Science, Kyungpook National University, 1370 Sankyuk-dong, Buk-gu, Daegu 702-701, Korea; Department of Electronic Engineering, Hoseo University, 165 Sechul-ri, Baebang-myun, Asan, Chungnam 336-795, Korea; Department of Electrical and Electronic Engineering, Yonsei University, 262 Seongsanno, Seodaemoon-Gu, Seoul 120-749, Korea; School of Electronics Engineering, Kyungpook National University, 1370 Sankyuk-dong, Buk-gu, Daegu 702-701, Korea
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملSolving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm
A shortest path search method based on ant colony algorithm is proposed. The method contracts the search space appropriately, obtaining, in a short time, a path that is as close as possible to the path obtained by the Dijkstra method (the optimum path). To improve the performance, we modify the pheromone update rule and introduce a learning strategy into the ant colony algorithm. The method obt...
متن کاملSingle-objective and multi-objective optimization using the HUMANT algorithm
When facing a real world, optimization problems mainly become multiobjective i.e. they have several criteria of excellence. A multi-criteria problem submitted for multi-criteria evaluation is a complex problem, as usually there is no optimal solution, and no alternative is the best one according to all criteria. However, if a metaheuristic algorithm is combined with a Multi-Criteria Decision-Ma...
متن کاملMetaheuristics for Finding Shortest Hamiltonian Path between Iranian Cities Using Sequential DOE Approach for Parameters Tuning
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is conducted. These are the main cities o...
متن کاملDIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is conducted. These are the main cities o...
متن کامل