A study in Tabu Search Algorithm to Solve a Special Vehicle Routing Problem | Zendy

Xingrong Yan | Zendy; Dong Hong-an | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A study in Tabu Search Algorithm to Solve a Special Vehicle Routing Problem

Author(s) -

Xingrong Yan,

Dong Hong-an

Publication year - 2012

Publication title -

international journal of engineering and manufacturing

Language(s) - English

Resource type - Journals

eISSN - 2306-5982

pISSN - 2305-3631

DOI - 10.5815/ijem.2012.01.08

Subject(s) - tabu search , vehicle routing problem , mathematical optimization , set (abstract data type) , routing (electronic design automation) , heuristic , computer science , algorithm , mathematics , programming language , computer network

In this paper, a kind of special vehicle routing problem based on reality-- vehicle routing problem with facultative demands is presented. The attributes of the problem and the optimization target are described. The mathematical model of the problem is set up. To solve the problem, A meta-heuristic approach called tobu search (TS) is put forward. The neighborhood structure and the parameters of TS algorithm are designed respectively. The proposed algorithm is successfully applied to a case and the result indicates the TS algorithm is practicable and valid.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research