A memetic approach to vehicle routing problem with dynamic requests
The paper presents an effective algorithm for solving Vehicle Routing Problem with Dynamic Requests based on memetic algorithms. The proposed method is applied to a widely-used set of 21 benchmark problems yielding 14 new best-know results when using the same numbers of fitness function evaluations...
Main Authors: | Mańdziuk, Jacek, Żychowski, Adam |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/83736 http://hdl.handle.net/10220/42760 |
Similar Items
-
A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
by: Sanae Larioui, et al.
Published: (2015-11-01) -
Bacterial Memetic Algorithm for Asymmetric Capacitated Vehicle-Routing Problem
by: Ákos Holló-Szabó, et al.
Published: (2022-11-01) -
A new memetic algorithm for solving split delivery vehicle routing problem
by: Ali Bozorgi-Amiri, et al.
Published: (2015-11-01) -
Tabu Search and Memetic Algorithms for a Real Scheduling and Routing Problem
by: Anass El-Yaakoubi, et al.
Published: (2017-11-01) -
Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (MDVRPOT)
by: Khaoula Ouaddi, et al.
Published: (2020-06-01)