ScholarLens Back to search
2010•Unpublished venueRequires access

Tabu Search Algorithm for Solving the Vehicle Routing Problem

Cui-hua Guan, Yan Cao, Jing Shi

Open publisher page 10 citations

Abstract

We start with the background and the solutions of vehicle routing problem, and then focus on the interpretation of Tabu search algorithm and the impact of its key factors. In particular, the idea of tabu search algorithm is applied to solve the vehicle routing problem. We design a new intuitive and easy to understand client-direct-arrangement solution method, and finally realize the algorithm through C language. The experimental results show that the algorithm is feasible and have high quality solutions.

About this research paper

What this paper is about

We start with the background and the solutions of vehicle routing problem, and then focus on the interpretation of Tabu search algorithm and the impact of its key factors. In particular, the idea of tabu search algorithm is applied to solve the vehicle routing problem. We design a new intuitive and easy to understand client-direct-arrangement solution method, and finally realize the algorithm through C language. The experimental results show that the algorithm is feasible and have high quality solutions.

Why it matters

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

We start with the background and the solutions of vehicle routing problem, and then focus on the interpretation of Tabu search algorithm and the impact of its key factors. In particular, the idea of tabu search algorithm is applied to solve the vehicle routing problem. We design a new intuitive and easy to understand client-direct-arrangement solution method, and finally realize the algorithm through C language. The experimental results show that the algorithm is feasible and have high quality solutions.

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

Related papers

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