Memetic Algorithm for a Multi-Objective Vehicle Routing Problem with Multiple Trips

@article{Ayadi2013MemeticAF,
  title={Memetic Algorithm for a Multi-Objective Vehicle Routing Problem with Multiple Trips},
  author={Rajaa Ayadi and Youssef Benadada},
  journal={IJCSA},
  year={2013},
  volume={10},
  pages={72-91}
}
This paper considers a variant of the vehicle routing problem where vehicles are allowed to take more than one route during the working day. A restricted fleet size is used in order to serve customers’ demand. Therefore, vehicles could exceed the time horizon. The objective is to optimize both maximum overtime and routing cost. A mathematical model has been proposed for the VRPM. A memetic algorithm has been developed to solve it by combining a genetic algorithm based on suitable encoding and… CONTINUE READING