公交車(chē)調度問(wèn)題的數學(xué)模型

公交車(chē)調度問(wèn)題的數學(xué)模型

摘要

本文解決的是某大城市1條公交線(xiàn)路上公交車(chē)的調度問(wèn)題.目的是用盡可能少的車(chē)來(lái)運送乘客，同時(shí)不能讓乘客等待時(shí)間過(guò)長(cháng)，也不能超載．通過(guò)分析知，1個(gè)時(shí)區內需要的車(chē)只與該時(shí)區內車(chē)站的最大轉移客流量有關(guān)，首先是對該公交線(xiàn)路上所統計的上車(chē)、下車(chē)等數據進(jìn)行1系列變換處理，求出每個(gè)時(shí)段發(fā)的車(chē)的最大轉移客流量，得到1個(gè)新的表格．其次是根據最大轉移客流量，用線(xiàn)性規劃的方法求出這個(gè)模型需要發(fā)車(chē)次數的最小值，然后綜合考慮乘客的等待時(shí)間等給出各個(gè)時(shí)區的發(fā)車(chē)次數，確定全天發(fā)車(chē)時(shí)間表，由發(fā)車(chē)時(shí)間表，求出的最少車(chē)輛數．最后對這個(gè)解進(jìn)行了評價(jià)，說(shuō)明本模型的特點(diǎn)，并指出了進(jìn)1步優(yōu)化改進(jìn)的方向．
關(guān)鍵詞：公交調度，時(shí)區，算法

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

【公交車(chē)調度問(wèn)題的數學(xué)模型】相關(guān)文章：

購車(chē)問(wèn)題的數學(xué)模型03-07

公交車(chē)調度方案03-07

公交車(chē)調度方案設計03-07

車(chē)輛路徑調度問(wèn)題的啟發(fā)式算法綜述11-22

應用遺傳算法解決車(chē)間作業(yè)調度問(wèn)題03-07

水質(zhì)污染處理數學(xué)模型03-07

淺談大型水閘調度03-16

旅游業(yè)中模糊綜合評判的數學(xué)模型03-20

凍融循環(huán)對粉質(zhì)粘土動(dòng)力性能損傷的數學(xué)模型研究03-07