Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems

Entropy

Sebastián Muñoz-Herrera¹  Karol Suchan² 

[1] Departamento de Ingeniería Industrial, Universidad Católica de la Santísima Concepción, Alonso de Ribera 2850, Concepcion 4090541, Chile;Facultad de Ingeniería y Ciencias, Universidad Diego Portales, Av. Ejército Libertador 441, Santiago 8370191, Chile;

关键词: vehicle routing problem;    Fitness Landscape Analysis;    information analysis;    statistical analysis;    feasibility analysis;    Principal Component Analysis;   

DOI  :  10.3390/e24010053

来源: DOAJ

【 摘 要 】

Vehicle Routing Problems (VRP) comprise many variants obtained by adding to the original problem constraints representing diverse system characteristics. Different variants are widely studied in the literature; however, the impact that these constraints have on the structure of the search space associated with the problem is unknown, and so is their influence on the performance of search algorithms used to solve it. This article explores how assignation constraints (such as a limited vehicle capacity) impact VRP by disturbing the network structure defined by the solution space and the local operators in use. This research focuses on Fitness Landscape Analysis for the multiple Traveling Salesman Problem (m-TSP) and Capacitated VRP (CVRP). We propose a new Fitness Landscape Analysis measure that provides valuable information to characterize the fitness landscape’s structure under specific scenarios and obtain several relationships between the fitness landscape’s structure and the algorithmic performance.

【 授权许可】

Unknown