Heuristic algorithms for a multi-period multi-stop transportation planning problem

Heuristic algorithms for a multi-period multi-stop transportation planning problem

0.00 Avg rating0 Votes
Article ID: iaor2003977
Country: United Kingdom
Volume: 53
Issue: 9
Start Page Number: 1027
End Page Number: 1037
Publication Date: Sep 2002
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: transportation: general
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.

Reviews

Required fields are marked *. Your email address will not be published.