| Summary: | 碩士 === 國立交通大學 === 運輸科技與管理學系 === 92 === Because the bus scheduling relates to reliability, safety and vehicle life, the bus schedule is very important to the public transit company. A good bus scheduling can make the operation of the public transit company more efficient. Vehicle maintenance is another major component in public transit operations. But the current operation procedures of bus scheduling is often established before considering the vehicle maintenance requirement. The schedule must be modified by dispatchers to fulfill the requirement.
In recent years, the ant colony algorithm are used in many cases. The ant colony algorithm often has better solutions or efficiency better than other algorithms do. So we propose an ant colony system (ACS) based algorithm to solve this problem of public transit scheduling with maintenance requirement.
The five major issues embedded in our algorithm are 1.network designing, 2.the state transition rule, 3.the route building rule, 4.the pheromone local updating rule and 5.the pheromone global updating rule. According to these rules, we will solve the problem of public transit scheduling with maintenance requirement.
In order to prove this algorithm, we obtain real operation data from a public transit company, and we test these small real samples through generating those testing examples. The testing results confirm that this algorithm can successfully solve the problem of a real operation and meanwhile, it also generates the schedules of the buses operation and maintenance.
|
|---|
