2011•Journal of Jilin University(Science Edition)Requires access

Vehicle Routing Problem with Time Windows and Improved Tabu Search Algorithm

GE Jin-hui

Abstract

An improved tabu search algorithm was utilized to solve vehicle routing problem with time windows and built a general mathematical model corresponding to this problem.In the process of solving,initial solutions were selected from many random structured practical solutions,and 2-opt method was adopted to produce neighborhood and structured dynamic structure tabu list so that the size and structure of tabu list could be changed in the searching process,the overall ability in search excellence was improved.Simulation experiments indicate the feasibility,validity and superiority of the algorithm.

About this research paper

What this paper is about

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

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