چکیده:
More and more companies in routing industry are interested in dynamic transportation problems that can be found in several real-life scenarios. In this paper, we addressed a dynamic vehicle routing problem with soft time windows (D-VRPSTW) in which new requests appear at any point during the vehicle’s route. We presented a mathematical formulation of the problem as well as a genetic algorithm hybridized with a variable neighborhood search (VNS) metaheuristic designed for the considered problem. Then, using the time discretization in intervals with new features, we focused on the proposed solution method to solve each partial static problem. We extended the dynamic vehicle routing problem (D-VRPSTW) by considering several objective functions, i.e. minimizing the transportation time by producing better planning, improving the quality of service by minimizing the delay time for each customer, and minimizing time loss by increasing the stopping time for each vehicle. The solution quality of this method has been compared against the existing results on benchmark problems.
خلاصه ماشینی:
com Solving a Dynamic Vehicle Routing Problem with Soft Time Windows Based on Static Problem Resolution by a Hybrid Approach Bouchra Bouziyane a,*, Btissam Dkhissi a and Mohammad Cherkaoui a a National school of applied sciences, Abdelmalek Essaadi University, Tetuan, Morocco Abstract More and more companies in routing industry are interested in dynamic transportation problems that can be found inseveral real-life scenarios.
(2017) proposed a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the variable neighborhood descent (VND) algorithm to solve the dynamic vehicle routing problem with time windows (DVRPTW).
(2015) used a memetic algorithm to solve the vehicle routing problem by minimizing the total travelled distance with respect of time window constraints of suppliers and customers.
Another example of this type of method is a metaheuristic procedure based on an adaptive large neighborhood search proposed by Chen et al (2018) to solve the dynamic vehicle routing problem (DVRP) with limited vehicles and hard-time windows.
3. Dynamic vehicle routing problem with soft time windows Our algorithm is designed to generate high quality solutions by applying some improvements that focus on two points which are mentioned as follows: - The strategy of discretization we have been following is different from that proposed in literature, because we used different lengths of time slices.
Hybrid genetic algorithm for the static and dynamic Vehicle Routing Problem with Soft Time Windows.