Hybrid simulated annealing algorithm for solving vehicle routing problem
Haifeng Li
Abstract
Haifeng Li
Abstract
A mathematics modelwith two objective functionsfor vehiclerouting problem is constructed. So a hybrid simulated annealing algorithm is proposed. The algorithm mainly combines simulated annealing algorithm with 2-opt optimization algorithm. An important characteristic obtained is that the proposed algorithm not only possesses advantages of two algorithms but also overcomes disadvantages. For vehicle routing problem, the design route of hybrid simulated annealing algorithm is illustrated. The simulated experiments prove that the hybrid algorithm not only obtain solutions with high quality but also fast convergence speed.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A mathematics modelwith two objective functionsfor vehiclerouting problem is constructed. So a hybrid simulated annealing algorithm is proposed. The algorithm mainly combines simulated annealing algorithm with 2-opt optimization algorithm. An important characteristic obtained is that the proposed algorithm not only possesses advantages of two algorithms but also overcomes disadvantages. For vehicle routing problem, the design route of hybrid simulated annealing algorithm is illustrated. The simulated experiments prove that the hybrid algorithm not only obtain solutions with high quality but also fast convergence speed.
Key concepts: Simulated annealing, Computer science, Adaptive simulated annealing, Algorithm, Hybrid algorithm (constraint satisfaction), Mathematical optimization, Convergence (economics), Vehicle routing problem