Optimization Methods for Snow Removal of Bus Stops

Detta är en L3-uppsats från Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

Sammanfattning: Snow removal is an important optimization problem in countries with snowfall. Bus stops can only be cleared after the adjacent street is cleared. The problem of optimizing snow removal for bus stops in an urban area is a special case of the Travelling Salesman Problem with Time Windows, where each stop only can be cleared after a certain time has passed. The solver Gurobi is used to solve the mathematical model of this problem to optimality. A local search and a tabu search is implemented. The results of the mathematical model are compared to the results of the implemented tabu search method. The results show that if a solution needs to be produced quickly, the tabu search provides better solutions than Gurobi. 

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)