A Postal Transportation Planning Algorithm

우편물 기간운송계획 알고리듬

We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.