Summary: | 碩士 === 國立中央大學 === 土木工程學系 === 102 === Due to the affection of urbanization, the demand in delivering commodities is greatly increased. To save time, most people will ask a moving company to help deliver their commodities. In general, the moving company performs many delivery tasks at the same time and these task assignments are done mainly based on the personal experience of the decision maker. Therefore, the moving company needs to assign a lot of vans to finish these tasks. Therefore, the situation in which most of vans is not laden when their return trips to the moving company could occur. This means that these task assignments are inefficiency. This study proposes a fleet assignment model where the actual commodity delivery constraints are taken into consideration and the objective is to maximize the profit of the moving company. Since the problem size is expected to be huge, a solution algorithm is thus developed to efficiently solve the problem.
The model is formulated as an integer multiple commodity network flow problem, which is characterized as NP-hard and cannot be optimally solved in a reasonable time for large-scale problems. To efficiently solve large-scale problems that occur in the real world, a solution algorithm is developed. To evaluate the performance of the proposed model and solution algorithm, a case study for a fleet assignment operation associated with a moving company in Taichung is performed. The test results are good, showing that the model and the algorithm could be useful for the moving company to formulate the fleet scheduling in future.
|