학술논문
Heuristic algorithms for a multi-period multi-stop transportation planning problem
Document Type
Abstract
Source
Journal of the Operational Research Society. Sept, 2002, Vol. 53 Issue 9, p1027, 11 p.
Subject
Language
ISSN
0160-5682
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. doi: 10.1057/palgrave.jors.2601386 Keywords: logistics; distribution planning; vehicle routing; column generation; simulated annealing