Optimization of Water Supply Vehicle Routing Problem with Time Windows in Flood Disaster using Parallel Simulated Annealing Algorithm
This is a final project for Computational Intelligence Course, Pusan National University, Winter 2017.
In emergency planning, routing decision to distribute the relief supply is an important decision. Especially clean water supply during and after a flood disaster. That problem is formulated as a vehicle routing problem with time windows. In this paper, the vehicle routing problem with time windows is developed using parallel simulated annealing algorithm. The solution refined from this research can help the decision maker to choose which route is better to reach the destination faster and optimized the vehicle amount.
Figure 1. Numerical case results that applied using parallel simulated annealing algorithm coded in Java