2012Jisuanji yingyong yanjiuRequires access

Implementation for VRP with multi-window based on collaborative adaptive tabu algorithm

WU Kuan-ren

Open publisher page 0 citations

Abstract

Aiming at solving multi-window VRP,this paper proposed a method based on collaborative tabu optimization algorithm.Firstly,it defined the mathematical model for multi-window VRP.Then it used the C-W algorithm to get the initial solution,and used four operators to search neighbor and defined the goal function to evaluate the quality of the solution.Then designed a tabu length modifying method and collaborative sub tabu algorithm adaptively.Used the best solution of collaborative sub tabu algorithm as the initial solution of the main tabu search algorithm.The simulation experiment shows the method can solve the multi-window VRP effectively.Compared with the other methods,the method reduces the iteration numbers and gets the best solution 386.38 with the big superiority.

About this research paper

What this paper is about

Aiming at solving multi-window VRP,this paper proposed a method based on collaborative tabu optimization algorithm.Firstly,it defined the mathematical model for multi-window VRP.Then it used the C-W algorithm to get the initial solution,and used four operators to search neighbor and defined the goal function to evaluate the quality of the solution.Then designed a tabu length modifying method and collaborative sub tabu algorithm adaptively.Used the best solution of collaborative sub tabu algorithm as the initial solution of the main tabu search algorithm.The simulation experiment shows the method can solve the multi-window VRP effectively.Compared with the other methods,the method reduces the iteration numbers and gets the best solution 386.38 with the big superiority.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Aiming at solving multi-window VRP,this paper proposed a method based on collaborative tabu optimization algorithm.Firstly,it defined the mathematical model for multi-window VRP.Then it used the C-W algorithm to get the initial solution,and used four operators to search neighbor and defined the goal function to evaluate the quality of the solution.Then designed a tabu length modifying method and collaborative sub tabu algorithm adaptively.Used the best solution of collaborative sub tabu algorithm as the initial solution of the main tabu search algorithm.The simulation experiment shows the method can solve the multi-window VRP effectively.Compared with the other methods,the method reduces the iteration numbers and gets the best solution 386.38 with the big superiority.

Key concepts: Tabu search, Computer science, Algorithm, Vehicle routing problem, Guided Local Search, Window (computing), Mathematical optimization, Function (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Implementation for VRP with multi-window based on collaborative adaptive tabu algorithm — Research Paper | ScholarLens