Solving Vehicle Routing Problems by using Iterated Local Search Optimization Case Study: Tongnamkeang Shop, Ubon Ratchathani Province

บทคัดย่อ

This paper presents a heuristic for solving vehicle routing problems. The Iterated Local Search (ILS) is applied to solve for solutions with the objective of minimizing total distances. The demand from each customer is uncertain and distance between some pairs of customers is asymmetric. ILS consists of three phases. The first phase is to construct an initial feasible solution with the Clark and Wright Saving method. The second phase is to improve the solution obtained from the first phase by using three cooperative methods: Customer Exchange method, One Move Operator method and 2-OPT method. The final phase is to perturb the percentage of total customers for the solution. The experimental results compared to the current vehicle routes show that the proposed heuristic provides good solutions. The total distance can be reduced from 95.53 kilometers to 69.18 kilometers or decreased by 27.58%.