Heuristic algorithms for a multi-period multi-stop transportation planning problem |
| |
Authors: | J-U Kim Y-D Kim S-O Shim |
| |
Institution: | 1.Entrue Consulting Partners, LG CNS Co. Ltd., Jung-gu,Seoul,South Korea;2.Korea Advanced Institute of Science and Technology, Yusong-gu,Daejon,South Korea |
| |
Abstract: | We consider a multi-period multi-stop transportation planning problem (MPMSTP) in a one-warehouse multi-retailer distribution system where a fleet of homogeneous vehicles delivers products from a warehouse to retailers. The objective of the MPMSTP is to minimize the total transportation distance for product delivery over the planning horizon while satisfying demands of the retailers. We suggest two heuristic algorithms based on the column generation method and the simulated annealing algorithm. Computational experiments on randomly generated test problems showed that the suggested algorithms gave better solutions than an algorithm currently used in practice and algorithms modified from existing algorithms for vehicle routing problems. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|