- 相關(guān)推薦
公交車調(diào)度問題的數(shù)學(xué)模型
公交車調(diào)度問題的數(shù)學(xué)模型
摘要
本文解決的是某大城市1條公交線路上公交車的調(diào)度問題.目的是用盡可能少的車來運送乘客，同時不能讓乘客等待時間過長，也不能超載．通過分析知，1個時區(qū)內(nèi)需要的車只與該時區(qū)內(nèi)車站的最大轉(zhuǎn)移客流量有關(guān)，首先是對該公交線路上所統(tǒng)計的上車、下車等數(shù)據(jù)進(jìn)行1系列變換處理，求出每個時段發(fā)的車的最大轉(zhuǎn)移客流量，得到1個新的表格．其次是根據(jù)最大轉(zhuǎn)移客流量，用線性規(guī)劃的方法求出這個模型需要發(fā)車次數(shù)的最小值，然后綜合考慮乘客的等待時間等給出各個時區(qū)的發(fā)車次數(shù)，確定全天發(fā)車時間表，由發(fā)車時間表，求出的最少車輛數(shù)．最后對這個解進(jìn)行了評價，說明本模型的特點，并指出了進(jìn)1步優(yōu)化改進(jìn)的方向．
關(guān)鍵詞：公交調(diào)度，時區(qū)，算法
A Mathematical Model of Bus Scheduling
ABSTRACT
The scheduling problem of a public transporting ling in a city is studied. Its purpose is to transport passengers using fewest buses without overload, and not to let the passengers waiting for long at the same time. Through analysis, the bus starting form the station in a time zone has relation to the maximum shift capacity of passengers, so the data of the passengers get on and off in each station is processed, and the maximum shift capacity of passengers in a time zone is worked out and the form is obtained. Then the minimum times of starting bus in this model is calculated by linear programming according to the maximum shift capacity of passengers. Plus the condition of the waiting time of passengers the times of starting bus in a time zone is worked out, and then the minimum buses is determined by the bus scheduling form. At the end of the article the result is evaluated, and the characteristics of this model is introduced, and the direction of further Optimization is pointed out.
Key words：bus scheduling; time zone; algorithm
【公交車調(diào)度問題的數(shù)學(xué)模型】相關(guān)文章：
購車問題的數(shù)學(xué)模型03-07
公交車調(diào)度方案03-07
公交車調(diào)度方案設(shè)計03-07
車輛路徑調(diào)度問題的啟發(fā)式算法綜述11-22
應(yīng)用遺傳算法解決車間作業(yè)調(diào)度問題03-07
水質(zhì)污染處理數(shù)學(xué)模型03-07
淺談大型水閘調(diào)度03-16