An Attraction Map Framework of a Complex Multi-Echelon Vehicle Routing Problem with Random Walk Analysis

The paper aims to investigate the basin of attraction map of a complex Vehicle Routing Problem with random walk analysis. The Vehicle Routing Problem (VRP) is a common discrete optimization problem in field of logistics. In the case of the base VRP, the positions of one single depot and many customers (which have product demands) are given. The vehicles and their capacity limits are also fixed in the system and the objective function is the minimization of the length of the route. In the literature, many approaches have appeared to simulate the transportation demands. Most of the approaches are using some kind of metaheuristics. Solving the problems with metaheuristics requires exploring the fitness landscape of the optimization problem. The fitness landscape analysis consists of the investigation of the following elements: the set of the possible states, the fitness function and the neighborhood relationship. We use also metaheuristics are used to perform neighborhood discovery depending on the neighborhood interpretation. In this article, the following neighborhood operators are used for the basin of attraction map: 2-opt, Order Crossover (OX), Partially Matched Crossover (PMX), Cycle Crossover (CX). Based on our test results, the 2-opt and Partially Matched Crossover operators are more efficient than the Order Crossover and Cycle Crossovers.

@article{agardi2021attraction,
  title={An attraction map framework of a complex multi-echelon vehicle routing problem with random walk analysis},
  author={Ag{'a}rdi, Anita and Kov{'a}cs, L{'a}szl{'o} and B{'a}nyai, Tam{'a}s},
  journal={Applied Sciences},
  volume={11},
  number={5},
  pages={2100},
  year={2021},
  publisher={MDPI}
}