Work

Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem

Year: 2011

Type: article

Abstract: The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to the many practical applications in the field of distribution, collection, logistics, etc. We study a generalization of the VRP called the generalized vehicle routing problem (GVRP) where given a partition of the nodes of the graph into node sets we want to find the optimal routes from the given depot to the number of predefined clusters which include exactly one node from each cluster. The purpose of this paper is to present heuristic algorithms to solve this problem approximately. We present constructive algorithms and local search algorithms for solving the generalized vehicle routing problem.

Source: International Journal of Computers Communications & Control

DOI: 10.15837/ijccc.2011.1.2210

Authors: Petrică Claudiu Pop, Ioana Zelina, Vasile Lupşe, Corina Pop Sitar, Camelia Chira

Institution: Babeș-Bolyai University

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: gold

Estimated APC paid: $539