A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem | Zendy

Abdesslem Layeb | Zendy; Meryem Ammi | Zendy; Salim Chıkhı | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem

Author(s) -

Abdesslem Layeb,

Meryem Ammi,

Salim Chıkhı

Publication year - 2013

Publication title -

journal of computing and information technology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.169

H-Index - 27

eISSN - 1846-3908

pISSN - 1330-1136

DOI - 10.2498/cit.1002085

Subject(s) - grasp , computer science , simulated annealing , vehicle routing problem , benchmark (surveying) , heuristic , constructive , mathematical optimization , algorithm , consistent heuristic , null move heuristic , routing (electronic design automation) , process (computing) , artificial intelligence , mathematics , search algorithm , incremental heuristic search , computer network , programming language , beam search , geodesy , geography , operating system

This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem, which characterized by using a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic and a simulated annealing procedure as an improvement phase. The new constructive heuristic uses four steps to generate feasible initial solutions, and the simulated annealing enhances these solutions found to reach the optimal one. We tested our algorithm on two sets of benchmark instances and the obtained results are very encouraging

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