کنفرانس بین المللی کنترل ، ابزار دقیق و اتوماسیون

صفحه اصلی / هشتمین کنفرانس بین المللی کنترل ، ابزار دقیق و اتوماسیون

A Simulated Annealing Approach (SA) to Vehicle Routing Problem with Time Windows (VRPTW)

نویسندگان :

Mohsen Mohammadi¹ Nima Mahmoodian² Hossein Mohammadi³

1- دانشگاه شیراز 2- دانشگاه شیراز 3- دانشگاه شیراز

کلمات کلیدی :

Vehicle Routing Problem - Simulated Annealing (SA) -Optimization - Time Window – Energy optimization.

چکیده :

Huge industries and companies need to save energy while delivering various products to customers. This paper studied the Vehicle Routing Problem with Time Window (VRPTW). Using VRPTW optimization methods, product distribution companies would be able to choose almost the best routes for a specific number of vehicles to minimize the cost of fuel, driver’s wage, driving range, and the time needed to provide the products to the customers. This study has focused on suggesting a programing method using the Simulated Annealing (SA) algorithm to minimize the total distance traveled by vehicles in a distribution chain and set the desired timetable in which vehicles are supposed to serve specific customers in the network. The result of this study is that problems as big as 350 nodes are calculated with zero-time window violation and zero capacity violation in less than 10 minutes, which is much less than many similar approaches.