Search published articles


Showing 2 results for Simulated Annealing Algorithm
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
M. Yaghini, M. Momeni, M. Sarmadi ,
Volume 22, Issue 1 (3-2011)
Abstract

  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, two hybrid efficient and effective metaheuristic algorithms are developed. The simulated annealing and ant colony optimization algorithms are combined with the local search methods. To evaluate the proposed algorithms, the standard problems with different sizes are used. The algorithms parameters are tuned by design of experiments approach and the most appropriate values for the parameters are adjusted. The performance of the proposed algorithms is analyzed by quality of solution and CPU time measures. The results show high efficiency and effectiveness of the proposed algorithms .


Clustering Based Intelligent Route Optimization Algorithm for Capacitated Vehicle Routing Problem
Md. Rafsan Islam, Md. Azizur Rahman, Kazi Mohammad Nazib, Lasker Ershad Ali,
Volume 36, Issue 3 (9-2025)
Abstract
The Capacitated Vehicle Routing Problem (CVRP) is a significant variant of the vehicle routing problem that incorporates constraints related to customer demand and vehicle capacity. Owing to its extensive applications in logistics and transportation, CVRP has attracted substantial research attention, with numerous algorithms proposed from the perspective of intelligent search. A common solution strategy involves two phases: first, assigning customers to different vehicles to form feasible routes, and second, optimizing these routes. This paper presents a two-phase CVRP solution framework through the clustering concept with intelligent search to improve route planning. In the first phase, a set of clustering methods - fuzzy c-means, k-means, and k-medoids - combined with a nearest neighbor heuristic search, are applied to generate feasible routes for each vehicle. In the second phase, these routes are iteratively optimized using the Simulated Annealing (SA) algorithm. The process yields three distinct solution pathways: fuzzy c-means with SA, k-means with SA, and k-medoids with SA. For performance evaluation, 46 benchmark CVRP datasets from a publicly available library are used. Simulation results demonstrate that k-means with SA performs the best, surpassing the other two approaches and outperforming other clustering-based two-phase state-of-the-art algorithms in terms of solution quality.
 
Page 1 from 1