摘要
This paper presents a sequential optimum algorithm for vehicle schedulingproblem, which includes obtaining initial theoretical solution, adjustingsolution, forming initial routes and adjustins routes. This method can beapplied to general transportation problems with multiple depots and multiplevehicle types on complex network. In comparison with manual scheduling ofChengdu Transportation Company II, the result shows that this method isreasonable, feasible and applicable.
This paper presents a sequential optimum algorithm for vehicle schedulingproblem, which includes obtaining initial theoretical solution, adjustingsolution, forming initial routes and adjustins routes. This method can beapplied to general transportation problems with multiple depots and multiplevehicle types on complex network. In comparison with manual scheduling ofChengdu Transportation Company II, the result shows that this method isreasonable, feasible and applicable.
