작업순서에 의존적인 신문발송문제에서의 효율적 발송을 위한 시뮬레이션 분석

The Simulation Analysis for Efficient Delivery in Newspaper Delivery Problem with Sequence-Dependant Jobs

In this paper we studied a newspaper delivery problem with sequence-dependant jobs. To solve this problem we studied a production-allocation problem for a different editions of a newspaper when the plant was increased additionally and a production sequence of a different editions of a newspaper on a number of identical machines in parallel. With the objective of the problem is to minimize the vehicle routing cost and distance while keeping the total delay time beyond deadline as small as possible, in this problem was studied through a simulation analysis by a developed simulator. Use a solution which was derived by applying the Weighted Savings algorithm for route determination and the Weighted Urgent Route First algorithm for the determination of vehicle dispatching sequence. Also use a regret distance calculation approach for the allocation of local agent to plants. The position data and the distance data are obtained from the digital map. The experimental set was acquired in a discussion with staff who has worked on the delivery scheduling job for many years.