Comparative research of stochastic vehicle routing algorithms

In this study, first of all optimization algorithms for transportation networks and graphs, which are Postman Problem and Traveling Salesman Problem for this study, which can lead us to solve the VRP are studied. Then basic knowledge for VRPs is given and problem types, such as capacity, distance and time restricted VRP are studied. Also tour construction and tour improvement heuristics for VRP are given and Stochastic Vehicle Routing Problem (SVRP), which means some of the variables of the VRP are uncertain, is considered and some sort of uncertainty types for the SVRP are studied. Furthermore a literature research and studies on SVRP are given and some models and solutions methods from these studies are considered. Lastly an heuristic solution algorithm is proposed and performed on a model and findings are compared. Keywords: Postman Problem, Traveling Salesman Problem, Vehicle Routing Problem, Stochastic Vehicle Routing Problem, Heuristic Algorithm.