A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics | Zendy

Zheng-yang Zeng | Zendy; Weisheng Xu | Zendy; Zhiyu Xu | Zendy; Weihui Shao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics

Author(s) -

Zheng-yang Zeng,

Weisheng Xu,

Zhiyu Xu,

Weihui Shao

Publication year - 2014

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2014/517467

Subject(s) - vehicle routing problem , grasp , greedy randomized adaptive search procedure , benchmark (surveying) , heuristics , mathematical optimization , heuristic , context (archaeology) , computer science , routing (electronic design automation) , iterated local search , greedy algorithm , metaheuristic , mathematics , computer network , programming language , geography , paleontology , geodesy , biology

The two-echelon vehicle routing problem (2E-VRP) is a variant of the classical vehicle routing problem (VRP) arising in two-level transportation systems such as those encountered in the context of city logistics. In the 2E-VRP, freight from a depot is compulsorily delivered through intermediate depots, named satellites. The first echelons are routes that distribute freight from depot to satellites, and the second are those from satellites to customers. This problem is solved by a hybrid heuristic which is composed of a greedy randomized adaptive search procedure (GRASP) with a route-first cluster-second procedure embedded and a variable neighborhood descent (VND), called GRASP

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