ScholarLens Back to search
2008•Traffic and Transportation StudiesRequires access

A Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands

Xing Liu, Changli Shen, Guiqiang Wang

Open publisher page 0 citations

Abstract

The Vehicle Routing Problem (VRP) with stochastic demands was discussed. In this kind of VRP, the number of vehicles to serve customers and the number of customers served by each vehicle were unfixed before performing an optimization. A tabu search algorithm was designed for this purpose. In the algorithm, a vehicle-customer structure concept was designed to simplify the neighborhood structure. In order to analyze the effectiveness of the tabu search algorithm, a genetic algorithm and a hybrid algorithm were designed. The computational result showed that the tabu search algorithm based on the vehicle-customer structure was more effective than two other algorithms for the Vehicle Routing Problem with stochastic demands.

About this research paper

What this paper is about

The Vehicle Routing Problem (VRP) with stochastic demands was discussed. In this kind of VRP, the number of vehicles to serve customers and the number of customers served by each vehicle were unfixed before performing an optimization. A tabu search algorithm was designed for this purpose. In the algorithm, a vehicle-customer structure concept was designed to simplify the neighborhood structure. In order to analyze the effectiveness of the tabu search algorithm, a genetic algorithm and a hybrid algorithm were designed. The computational result showed that the tabu search algorithm based on the vehicle-customer structure was more effective than two other algorithms for the Vehicle Routing Problem with stochastic demands.

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

The Vehicle Routing Problem (VRP) with stochastic demands was discussed. In this kind of VRP, the number of vehicles to serve customers and the number of customers served by each vehicle were unfixed before performing an optimization. A tabu search algorithm was designed for this purpose. In the algorithm, a vehicle-customer structure concept was designed to simplify the neighborhood structure. In order to analyze the effectiveness of the tabu search algorithm, a genetic algorithm and a hybrid algorithm were designed. The computational result showed that the tabu search algorithm based on the vehicle-customer structure was more effective than two other algorithms for the Vehicle Routing Problem with stochastic demands.

Key concepts: Tabu search, Vehicle routing problem, Guided Local Search, Computer science, Mathematical optimization, Genetic algorithm, Algorithm, Hill climbing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands — Research Paper | ScholarLens