2020•Unpublished venueRequires access

Performance Analysis of Greedy-based Construction Heuristics on Classical Vehicle Routing Problem

Yandong He, Mingyao Qi, Fuli Zhou, Huilin Li

Abstract

Vehicle Routing Problem (VRP) has been studying in the past 60 years, many versions of basic VRP has also been extended. In this paper, we introduce and design some greedy-based construction heuristics to obtain better initial feasible solutions for some classical VRP with time windows (VRPTW). This construction heuristics include basic greedy heuristics (BG), global K-greedy heuristics (GKG), random greedy heuristics (RG) and random K-greedy heuristics (RKG). At last the performance analysis of these heuristics is given about basic VRPTW and VRPTW with roaming delivery locations (VRPTW-RDL). Some interesting conclusions is given.

About this research paper

What this paper is about

Why it matters

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

Key concepts: Heuristics, Vehicle routing problem, Greedy algorithm, Greedy randomized adaptive search procedure, Mathematical optimization, Routing (electronic design automation), Computer science, Metaheuristic