| dc.description.abstract | The Vehicle Routing Problem handles the optimization of the transportation routes in a way that ensures the finding of the optimal set of routes from the vertex to another. It depends on some constraints of the problem that is being handled. In this thesis, a problem of Vehicle Routing Problem of YCH company is introduced to consider with a fleet, limited number of trucks and time windows. The objectives of this thesis are building a model and finding the optimal routes to minimize the number of trucks used first and then, try to minimize the total travel distance by using the advantages of constraints programming. After testing and implementation, a case of YCH company will be solved. Outcomes from the mathematical model deal with VRP provided better utilization of vehicle for the company which compared to the current schedule by 10%. In this research, the mathematical model solved the problem with the limited variables and constraint, so the heuristics will be discussed and employed in the future for the large size.
Keywords: Vehicle Routing problem, Delivery, Time Windows, VRPTW, Constraints programming. | en_US |
