Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
نویسندگان
1 School of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
2 School of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
3 School of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
doi
چکیده
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time window. Therefore, revenue given in each time window is different. In this paper a project with two companies in a city with eight customers is considered and the best routing with maximum revenue is obtained.
