ScholarLens Back to search
2012•Unpublished venueRequires access

An Improved TS for the Open Vehicle Routing Problem with Soft Time Windows

GE Jin-hui, Xiomg Ying, Hongzhen Wang

Open publisher page 3 citations

Abstract

In this paper, a problem is described and mathematical formulation is established on the basis of open vehicle routing problem with soft time windows. Meanwhile, an improved tabu search algorithm (TS) is proposed to optimize the OVRPSTW. in improved TS static, the initial solutions are obtained at random and then current one is selected from better solutions. Two paths are randomly selected on 2-opt to improve solution, ensuring the optimization between and inside the paths. Tabu list's length is expressed by linear Representation to conduct a dynamic tabu list. Thus, the length and the struction of tabu list change with search process diversifying the search path, to expand the scope of neighborhood search, and to improve global optimization. Simulation experiment proved the feasibility and effectiveness of tabu search algorithm.

About this research paper

What this paper is about

In this paper, a problem is described and mathematical formulation is established on the basis of open vehicle routing problem with soft time windows. Meanwhile, an improved tabu search algorithm (TS) is proposed to optimize the OVRPSTW. in improved TS static, the initial solutions are obtained at random and then current one is selected from better solutions. Two paths are randomly selected on 2-opt to improve solution, ensuring the optimization between and inside the paths. Tabu list's length is expressed by linear Representation to conduct a dynamic tabu list. Thus, the length and the struction of tabu list change with search process diversifying the search path, to expand the scope of neighborhood search, and to improve global optimization. Simulation experiment proved the feasibility and effectiveness of tabu search algorithm.

Why it matters

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

In this paper, a problem is described and mathematical formulation is established on the basis of open vehicle routing problem with soft time windows. Meanwhile, an improved tabu search algorithm (TS) is proposed to optimize the OVRPSTW. in improved TS static, the initial solutions are obtained at random and then current one is selected from better solutions. Two paths are randomly selected on 2-opt to improve solution, ensuring the optimization between and inside the paths. Tabu list's length is expressed by linear Representation to conduct a dynamic tabu list. Thus, the length and the struction of tabu list change with search process diversifying the search path, to expand the scope of neighborhood search, and to improve global optimization. Simulation experiment proved the feasibility and effectiveness of tabu search algorithm.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved TS for the Open Vehicle Routing Problem with Soft Time Windows — Research Paper | ScholarLens