This paper considers a fleet of electric vehicles and drones that deliver goods collaboratively. To determine the optimal routes of this electric vehicle-drone routing problem, the problem is formulated as a mixed-integer linear program to minimize the total operational costs. To solve the model, we develop an adaptive memetic algorithm that employs a multi-operator concept with a Q-learning-based selection mechanism and a set of local search operators for exploring the complex search space of the problem. Using extensive numerical experiments, we prove the effectiveness of our proposal and reveal some interesting managerial insights.
An Adaptive Memetic Algorithm for a Cost-Optimal Electric Vehicle-Drone Routing Problem
IEEE Transactions on Intelligent Transportation Systems ; 25 , 12 ; 19619-19632
2024-12-01
17938063 byte
Article (Journal)
Electronic Resource
English
A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
BASE | 2018
|A memetic algorithm for the open capacitated arc routing problem
Online Contents | 2013
|