Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Review of the effectiveness of vehicle activated signs

This paper reviews the effectiveness of vehicle activated signs. Vehicle activated signs are being reportedly used in recent years to display dynamic information to road users on an individual basis in order to give a warning or inform about a specific event. Vehicle activated signs are triggered individually by vehicles when a certain criteria is met. An example of such criteria is to trigger a speed limit sign when the driver exceeds a pre-set threshold speed. The preset threshold is usually set to a constant value which is often equal, or relative, to the speed limit on a particular road segment. This review examines in detail the basis for the configuration of the existing sign types in previous studies and explores the relation between the configuration of the sign and their impact on driver behavior and sign efficiency. Most of previous studies showed that these signs have significant impact on driver behavior, traffic safety and traffic efficiency. In most cases the signs deployed have yielded reductions in mean speeds, in speed variation and in longer headways. However most experiments reported within the area were performed with the signs set to a certain static configuration within applicable conditions. Since some of the aforementioned factors are dynamic in nature, it is felt that the configurations of these signs were thus not carefully considered by previous researchers and there is no clear statement in the previous studies describing the relationship between the trigger value and its consequences under different conditions. Bearing in mind that different designs of vehicle activated signs can give a different impact under certain conditions of road, traffic and weather conditions the current work suggests that variable speed thresholds should be considered instead.