Study on Vehicle Routing Problem Based on Parallel Simulated Annealing Algorithm
Xie Hong-yan
Abstract
Xie Hong-yan
Abstract
The paper improves on the traditional simulated annealing algorithm and proposes a parallel simulated annealing algorithm based on memory to the solution of the VRP model and uses simulated data to the verification of the model and algorithm, with results showing that the improved algorithm,besides being capable of yielding satisfactory results,is also superior in computational efficiency,convergence rate,robustness,and capacity of optimization.
A significance statement is not available in the OpenAlex record.
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.
The paper improves on the traditional simulated annealing algorithm and proposes a parallel simulated annealing algorithm based on memory to the solution of the VRP model and uses simulated data to the verification of the model and algorithm, with results showing that the improved algorithm,besides being capable of yielding satisfactory results,is also superior in computational efficiency,convergence rate,robustness,and capacity of optimization.
Key concepts: Simulated annealing, Vehicle routing problem, Computer science, Adaptive simulated annealing, Robustness (evolution), Mathematical optimization, Algorithm, Rate of convergence