This repository is the implementation in C++ for the paper A memetic algorithm for vehicle routing with simultaneous pickup and delivery and time windows by Zhenyu Lei, Jin-Kao Hao.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows (VRPSPDTW) has a number of real-world applications, especially in reverse logistics. In this work, we propose an effective memetic algorithm that integrates a lightweight feasible and infeasible route descent search and a learning-based adaptive route-inheritance crossover to solve this complex problem. We evaluate the effectiveness of the proposed algorithm on the set of 65 popular benchmark instances as well as 20 real-world large-scale benchmark instances. We provide a comprehensive analysis to better understand the design and performance of the proposed algorithm.
In this repository, we have:
solutions/folder provides the solutions for benchmark instancesinclude/andsrc/folders contain the source code of the algorithm.CMakelists.txtis the cmake configuration file.
The well-known benchmark instances WC and the large-scale real-world benchmark instances JD were tested in our work. Please download and configure the instances before running the code.
In addition, please configure other necessary directories and parameters in include/Config.hpp file.
And then compile the code by the following commands:
mkdir build
cd build
cmake ..
makeThen you can run directly the executable binary with default parameters set in include/Config.hpp by the following command:
./MA-FIRDYou can also run the code with your own parameters by the following command:
./MA-FIRD --dataset_dir <dataset dir> --output_dir <output dir> -D <datasets> -I <instance> -S <seed> -c <dispatch cost> -v <unit cost> -t <max iterations> -e <max running time> -p <patience> -z <population size> -r <init ratio> -y <fitness coefficient> -u <adjust factor>If it is helpful for your research, please cite our paper: