A Memetic Algorithm for the Cumulative Capacitated Vehicle Routing Problem Including Priority Indexes

Abstract

This paper studies the Cumulative Capacitated Vehicle Routing Problem, including Priority Indexes, a variant of the classical Capacitated Vehicle Routing Problem, which serves the customers according to a certain level of preference. This problem can be effectively implemented in commercial and public environments where customer service is essential, for instance, in the delivery of humanitarian aid or in waste collection systems. For this problem, we aim to minimize two objectives simultaneously, the total latency and the total tardiness of the system. A Mixed Integer formulation is developed and solved using the AUGMECON2 approach to obtain true efficient Pareto fronts. However, as expected, the use of commercial software was able to solve only small instances, up to 15 customers. Therefore, two versions of a Memetic Algorithm with Random Keys (MA-RK) were developed to solve the problem. The computational results show that both algorithms provided good solutions, although the second version obtained denser and higher quality Pareto fronts. Later, both algorithms were used to solve larger instances (20–100 customers). The results were mixed in terms of quality but, in general, the MA-RK v2 consistently outperforms the first version. The models and algorithms proposed in this research provide useful insights for the decision-making process and can be applied to solve a wide variety of business situations where economic, customer service, environmental, and social concerns are involved.

Low-Power Task Scheduling Algorithm for the Multicore Processor System Based on the Genetic Algorithm

“…Therefore, low power consumption, as a key design requirement of real-time embedded systems, is receiving more and more attention. For multicore energy-saving task scheduling, Nucamendi-Guillén made an in-depth discus-sion, pointing out the problem of real-time energy-saving scheduling in multicore systems, which can be summarized into three aspects: allocation problem, priority problem, and speed regulation problem [11]. Zhang proposed an energy-efficient task assignment method based on heterogeneous multicore processors [12].…”

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

“…In addition, if the fitness function is not properly selected, the genetic algorithm often converges to local optima, failing to identify the global optimum [174][175][176]. Genetic algorithms can be improved in four aspects: individuals and populations, selection operations, crossover operations, and mutation operations, thereby optimizing the population and addressing the drawbacks of early maturity and local optima; an example of an improved GA is MA [177][178][179]. The ant colony algorithm and particle swarm algorithm are the most commonly used swarm intelligence algorithms.…”

The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

“…The authors tested it with instances with more than 400 clients. More recently, the authors in [59] studied another variant of the problem, a CCVRP with priority indexes. This variant incorporated precedence constraints to ensure that certain clients were visited before others.…”