A New Binary Encoding Scheme in Genetic Algorithm for Solving the Capacitated Vehicle Routing Problem

Full text
Author(s):	Lima, Stanley Jefferson de A. ; de Araujo, Sidnei Alves ; Korosec, P ; Melab, N ; Talbi, EG Total Authors: 5
Document type:	Journal article
Source:	BIOINSPIRED OPTIMIZATION METHODS AND THEIR APPLICATIONS, BIOMA 2018; v. 10835, p. 11-pg., 2018-01-01.
Abstract
In the last decades the Vehicle Routing Problem (VRP) and its ramifications, including the Capacitated Vehicle Routing Problem (CVRP), have attracted the attention of researchers mainly because their presence in many practical situations. Due to the difficulties encountered in their solutions, such problems are usually solved by means of heuristic and metaheuristics algorithms, among which is the Genetic Algorithm (GA). The solution of CVRP using GA requires a solution encoding step, which demands a special care to avoid high computational cost and to ensure population diversity that is essential for the convergence of GA to global optimal or sub-optimal solutions. In this work, we investigated a new binary encoding scheme employed by GA for solving the CVRP. Conducted experiments demonstrated that the proposed binary encoding is able to provide good solutions and is suitable for practical applications that require low computational cost. (AU)

FAPESP's process:	17/05188-9 - Automatic visual inspection of beans quality
Grantee:	Sidnei Alves de Araújo
Support Opportunities:	Regular Research Grants