AbstractThis project studies the problem of dynamic vehicle routing (Dynamic Vehicle Routing Problem: DVRP) are characteristic of the problem is that the service is requested by the customer, where the customer will order one after another come and go over time. Make the decisions required to plan the routes of vehicles to deliver goods to the new customers added. Where to route vehicles to try to make up the cost of the lowest freight. In this project will be the development of methods to get the answers and try to compare the ability to find answers and to find answers to each parameter. To do this experiment with a solution looking for a problem, or experiment with a random. The solution, which will trial know, transportation expenses and how much will be the path of vehicles that transport expenses are low.
การแปล กรุณารอสักครู่..