Routing Optimization for School Bus Problem
-
摘要: 以社区儿童接送服务车辆的路线优化问题为研究对象,建立了多目标非线性整数规划模型,其中目标函数包括车辆数最少、车辆行驶的时间最短、所有乘客总旅行时间最短、各辆车的负荷均衡、各辆车的运行时间均衡5个目标.这5个目标分为4个优先级.提出了解决这类问题的新的启发式优化算法.该算法从构造最小生成树开始,找出基本线路;然后通过选择可调单元调整线路得到优化的线路.提出了线路确定后,乘客要求调整线路时应遵循的原则.Abstract: A multi-objective nonlinear integer programming model was proposed to study the school bus problem.In the model,there are five objectives: to minimize the number of buses,to minimize total travel time of buses,to minimize total travel time spent by all children,to balance the loads among buses and to balance the travel time among buses,the objectives are sorted into four levels.A new heuristic optimization algorithm for solving the problem was presented.The algorithm starts with generating a minimum spanning tree to find basic routes,and then selects an adjustable unit to modify and determine the final routes.Further adjustment on the routes after the routes have been set is allowable if it follows some presented rules.
-
Key words:
- school bus problem /
- community /
- optimization /
- multi-objective /
- model /
- heuristic optimization algorithm
-
BODIN L D,BERMAN L.Routing and scheduling of school buses by computer[J].Transpn.Sci.,1979 (13):113-129.[2] CHAPLEAU L,FERLAND J,ROUSSEAU J.Clustering for routing in densely populated areas[J].Eur.J.Oper.Res.,1985(20):48-57.[3] DULAC G,FERLAND J A,FORGUES P A.School bus routes generator in urban surroundings[J].Comput. Ops Res.,1980(7):199-213.[4] BOWERMAN R,HALL B,CALAMAI P.A multi-objective optimization approach to urban school bus routing:formulation and solution method[J].Transpn.Res.-A,1995(29A):107-123.[5] LEE S,MOORE L J.Multi-criteria school busing models[J].Management Sci.,1977(23):703-715.[6] BRACE J,BRAMEL J,POSNER B,Simchi-levi.A computerized approach to New York city school bus routing problem[J].IIE Transactions,1997(29):693-702.[7] LYO Li,Z FU.The school bus routing problem:a case study[J].Journal of the Operational Research Society,2002 (53):552-558.[8] KRUSKAL J B Jr.On the shortest spanning subtree of a graph and the traveling salesman problem[J].Proc.Amer.Math.Soc.,1956(7):48-50.[9] FISHER M L.Optimal solution of vehicle routing problems using minimum k-trees[J].Opns.Res.,1994 (42):626-642.[10] 郭耀煌.安排城市卡车行车路线的一种新算法[J].系统工程学报,1989(2):70-78.GUO Yaohuang.A new algorithm for scheduling urban vehicle routing[J].Journal of Systems Engineering,1989 (2):70-78.[11] 郭耀煌,李军.车辆优化调度[M].成都:成都科技大学出版社,1994.GUO Yaohuang,LI Jun.Optimization scheduling of vehicles[M].Chengdu Scientific and Technological University Press,1994:145-148.[12] SYSLO M M,DEO N,KOWALIK J S.Discrete optimization algorithms with Pascal programs[M].Englewood Cliffs:Prentice-Hall,1983:343-356.[13] 郭强,谢秉磊.随机旅行时间车辆路径问题的模型及其算法[J].系统工程学报,2003,18(3):244-247.GUO Qiang,XIE Binglei.Model and algorithm of vehicle routing problem with stochastic travel time[J].Journal of Systems Engineering,2003,18(3):244-247.[14] 张建勇,郭耀煌,李军.一种具有模糊费用系数的VSP的修正C-W节约算法[J].西南交通大学学报,2004,39(3):281-284.ZHANG Jiangyong,GUO Yaohuang,LI Jun.Modified Clark-Wright algorithm for vehicle scheduling problem with fuzzy cost coefficients[J].Journal of Southwest Jiaotong University,2004,39 (3):281-284.
点击查看大图
计量
- 文章访问数: 1576
- HTML全文浏览量: 54
- PDF下载量: 386
- 被引次数: 0