Abstract
Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (MDVRPOT)
Highlights
Dantzig and Ramser (1959) introduced a wide class of problems, the objective of which is to determine the best roads linking two or more points under certain constraints
The results obtained by applying the memetic algorithm (MA) to the instances presented by Kilby et al (1998) are presented to assess its performance based on the classical dynamic vehicle routing problem (DVRP)
The results obtained by applying the MA to the instances of Ouaddi et al (2018) and those obtained by the ant colony system (ACS) of the same study (Ouaddi et al, 2018) are compared
Summary
Dantzig and Ramser (1959) introduced a wide class of problems, the objective of which is to determine the best roads linking two or more points under certain constraints. Many researchers have studied different possible variants of this problem. These variants are defined depending on the nature, constraints, and objectives of the problem. The objective is to determine the optimal set of routes that should deliver to a set of customers from a single depot with a limited fleet of trucks with limited capacities. These customers have varying demands for the same products. Golden et al (1977) introduced the term ‘vehicle routing’ and called this variant ‘the generic vehicle routing problem’ (VRP). Researchers have defined and treated a large number of VRPs according to the demands of the transport market and ability of the technological context (Eksioglu et al (2009))
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial Engineering Computations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
