Please use this identifier to cite or link to this item:
|Title:||A heuristic approach to the multi-period multi-commodity transportation problem|
|Authors:||Poh, K.L. |
|Source:||Poh, K.L., Choo, K.W., Wong, C.G. (2005-06). A heuristic approach to the multi-period multi-commodity transportation problem. Journal of the Operational Research Society 56 (6) : 708-718. ScholarBank@NUS Repository. https://doi.org/10.1057/palgrave.jors.2601875|
|Abstract:||This paper describes an approach to solving a real-world problem which involves the transportation of multiple types of commodities from a number of sources to a number of destinations in discrete time periods, using a capacitated heterogeneous fleet of vehicles. The preliminary objective is to minimize the total number of discrete periods needed to complete the entire operation. The problem is first formulated as a mixed integer programme and its tractability is then greatly improved by reformulating it through backward decomposition into two separate models and solved iteratively. A heuristic approach harnessing specific features of the second approach is developed for solving large size problems to obtain near-optimal solutions within reasonable time. The design of the heuristic also takes into consideration the secondary objectives of minimizing the total vehicle capacity used and minimizing the total capacity of sources needed to satisfy the demands at the destinations. Computational results are provided for a variety of randomly generated problems as well as problems from the literature. The approach described here may be applied to the multi-period transportation of personnel and goods from multiple starting points to multiple destinations in both military and civilian applications. © 2005 Operational Research Society Ltd. All rights reserved.|
|Source Title:||Journal of the Operational Research Society|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2018
WEB OF SCIENCETM
checked on Dec 11, 2017
checked on Jan 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.