The Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup, Overtime and Inventory Restriction: Comparative Study of Three Resolution Methods

The technological advancements and the development of more powerful computers and advanced optimization algorithms make Dynamic Vehicle Routing Problem a more practical and appealing area of research and application. This paper treat a bi-objective Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup, Overtime and Inventory Restriction (DVRPSDP-OT-IR). The problem was solved by three methods; the first method is based on solving the mathematical model of each sub-problem by an iterative exact method, the second method is the memetic algorithm, and the third method is the golden ball algorithm. The three methods have been tested on instances from the literature, and the results show that golden ball algorithm is the most effective.