ScholarLens Back to search
2008•Railway Transport and EconomyRequires access

Optimization of Vehicle Routing Problem based on Improved Tabu Search Algorithm

Li Song

Open publisher page 1 citations

Abstract

A new improved tabu search algorithm for solving vehicle routing problem(VRP) is put forward.First,the whole VRP is decomposed into several sub-problems by vehicle-demand assigning structure,and tabu search algorithm is applied for solving each sub-problem,at last the optimal solution of the whole problem is found among the optimal solution of all sub-problems.The result of a representative example and the analysis are given.The simulation results show that the proposed algorithm can extend the search scope and improve the optimal solution,and it can solve the VRP problem efficiently.

About this research paper

What this paper is about

A new improved tabu search algorithm for solving vehicle routing problem(VRP) is put forward.First,the whole VRP is decomposed into several sub-problems by vehicle-demand assigning structure,and tabu search algorithm is applied for solving each sub-problem,at last the optimal solution of the whole problem is found among the optimal solution of all sub-problems.The result of a representative example and the analysis are given.The simulation results show that the proposed algorithm can extend the search scope and improve the optimal solution,and it can solve the VRP problem efficiently.

Why it matters

OpenAlex reports 1 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

A new improved tabu search algorithm for solving vehicle routing problem(VRP) is put forward.First,the whole VRP is decomposed into several sub-problems by vehicle-demand assigning structure,and tabu search algorithm is applied for solving each sub-problem,at last the optimal solution of the whole problem is found among the optimal solution of all sub-problems.The result of a representative example and the analysis are given.The simulation results show that the proposed algorithm can extend the search scope and improve the optimal solution,and it can solve the VRP problem efficiently.

Key concepts: Tabu search, Vehicle routing problem, Mathematical optimization, Guided Local Search, Scope (computer science), Algorithm, Computer science, Routing (electronic design automation)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Optimization of Vehicle Routing Problem based on Improved Tabu Search Algorithm — Research Paper | ScholarLens