Driver Scheduling for Oil Distribution Center with Multiple Objectives

碩士 === 華梵大學 === 工業工程與經營資訊學系碩士班 === 94 === It has been a long history on the study of crew scheduling issue, these include airline crew scheduling、bus driver scheduling、railway driver scheduling and service personnel scheduling, etc. Crew scheduling problem belongs to integer programming problem, it...

Full description

Bibliographic Details
Main Authors: Yu-Fan Fu, 傅玉璠
Other Authors: Junn-Yuan Teng
Format: Others
Language:zh-TW
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/85658994449271081196
Description
Summary:碩士 === 華梵大學 === 工業工程與經營資訊學系碩士班 === 94 === It has been a long history on the study of crew scheduling issue, these include airline crew scheduling、bus driver scheduling、railway driver scheduling and service personnel scheduling, etc. Crew scheduling problem belongs to integer programming problem, it is also combinational optimization problem because time spent on achieving a solution usually increases exponentially as the variables in a problem increase, it is so-called NP-hard problem. This research is focusing on the driver scheduling problem of oil distribution, driver scheduling with multi-objective model (DSMM) for oil distribution in oil depot is built through multi-objective mathematical programming method. Four objective functions , driver number, cost, satisfaction and fairness are considered in the proposed model. Limitations on resource as well as regulations are considered in the same time. The proposed model in this research is solved through the use of a combination of weighting method and genetic algorithm (GA). An oil depot in northern Taiwan of Chinese Petroleum Corporation (CPC) is used as target for case study and analysis. A solution is obtained through practical application of the model and algorithm, finally, an optimum solution of driver scheduling which meets related limitations is obtained. The solution obtained from a case study is compared to real scheduling table in this research, the result shows that the scheduling table obtained in this study is greatly improved.