2007•Computer Engineering and Applications JournalRequires access

Tabu search algorithm for VRP with alternative time windows

Zhang Shu-chu

Abstract

Vehicle Routing Problem(VRP) is a kind of combinatorial optimization problem which plays an important role in the fields of physical distribution and logistics.VRP with Alternative Time Windows(VRPATW) is studied,a mathematical model of VRPATW is established and a PFIH-tabu search algorithm is introduced to solve.Then computational results are provided to show that the algorithm can be used to solve 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: Vehicle routing problem, Tabu search, Mathematical optimization, Computer science, Guided Local Search, Combinatorial optimization, Algorithm, Mathematics