2008•Jisuanji fangzhenRequires access

Improved Tabu Search Algorithm for Vehicle Routing Problem with Alternative Time Windows

Shanlin Yang

Abstract

The Vehicle Routing Problem with Alternative Time Windows (VRPATW) was studied. Based on the model of VRP with single time window constraint, a model of VRPATW was built, and an improved Tabu Search algorithm was introduced. The algorithm first generates a good feasible initial solution, using improved PFIH algorithm, then improves the initial solution using Tabu Search. Finally the experiment results show that the algorithm can solve 100 customers VRPATW efficiently.

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, Algorithm, Mathematical optimization, Computer science, Constraint (computer-aided design), Search algorithm