A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Vehicle routing with split deliveries
Discrete Applied Mathematics
The split delivery vehicle scheduling problem with time windows and grid network distances
Computers and Operations Research
A two-stage heuristic approach for the newspaper delivery problem
Computers and Industrial Engineering - Special issue: IE in Korea
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Integrated production and distribution planning for single-period inventory products
International Journal of Computer Integrated Manufacturing
Degenerating algorithm: a new method for improving system efficiency
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A tabu search with vocabulary building approach for the vehicle routing problem with split demands
International Journal of Metaheuristics
An adaptive memory algorithm for the split delivery vehicle routing problem
Journal of Heuristics
Hi-index | 0.00 |
The objective of this study is to find an optimal allocation of newspaper agents and an optimal routes and schedules for newspaper delivery to minimize delivery cost while keeping the total delay time of delivery short. A practical approach was used for solving the problem using heuristic algorithms and a digital map. The Regret Distance algorithm, the Modified Saving algorithm, the Weighted Savings algorithm, the Urgent Route First algorithm and the Modified Urgent Route First algorithm were investigated. As an optimal algorithm, the Regret Distance Calculation algorithm to allocate the agents for each plant, the Weighted Savings algorithm for routing, and the Modified Urgent Route First algorithm for vehicle scheduling were selected. A split delivery scheme was also selected. With these selected algorithms and a split delivery scheme, a method using a computer program was used at newspaper companies for allocation of demand and vehicle routing and scheduling. This computer program was used to validate our proposed method at the Chosun Ilbo company, which is one of the major newspaper company in Korea. It was found that our method saved the delivery cost by 15% and reduced the delay time by 40% on the average compared to the current manual method.