2006•Zhongguo gonglu xuebaoRequires access

Simulated Annealing Algorithm for Vehicle Routing Problem

Dawei Hu, Zhu Zhi-qiang, Hu Yong

Abstract

After constructing a mathematical model for the vehicle routing problem(VRP),using the between-route improvement method and within-route improvement method,authors combined the strategy of the simulated annealing algorithm to solve VRP.Authors emphasized the design thought of the simulated annealing algorithm to solve VRP;analyzed and worked out a program flow chart of simulated annealing algorithm for the VRP in detail and achieved to solve VRP on computer.The simulated test results show that the algorithm can solve the VRP efficiently and quickly.Comparing with other algorithms,the simulated annealing algorithm has practicality and effectiveness.Simultaneously,authors provided an effective algorithm to solve the VRP in large scale.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Simulated annealing, Vehicle routing problem, Adaptive simulated annealing, Algorithm, Flow chart, Computer science, Mathematical optimization, Routing (electronic design automation)