首页 | 本学科首页   官方微博 | 高级检索  
     检索      

社区儿童接送服务车辆的线路优化
引用本文:郭强,李育安,郭耀煌.社区儿童接送服务车辆的线路优化[J].西南交通大学学报,2006,41(4):486-490.
作者姓名:郭强  李育安  郭耀煌
作者单位:1. 西南交通大学经济管理学院,四川,成都,610031
2. 香港理工大学管理系,香港
基金项目:国家自然科学基金资助项目(70071028);中国-欧盟国际合作项目:中欧环境管理合作计划--地方与城市发展
摘    要:以社区儿童接送服务车辆的路线优化问题为研究对象,建立了多目标非线性整数规划模型,其中目标函数包括车辆数最少、车辆行驶的时间最短、所有乘客总旅行时间最短、各辆车的负荷均衡、各辆车的运行时间均衡5个目标.这5个目标分为4个优先级.提出了解决这类问题的新的启发式优化算法.该算法从构造最小生成树开始,找出基本线路;然后通过选择可调单元调整线路得到优化的线路.提出了线路确定后,乘客要求调整线路时应遵循的原则.

关 键 词:校车问题  社区  优化  多目标  模型  启发式优化算法
文章编号:0258-2724(2006)04-0486-05
收稿时间:2006-02-24
修稿时间:2006-02-24

Routing Optimization for School Bus Problem
GUO Qiang,LI Lyo,GUO Yaohuang.Routing Optimization for School Bus Problem[J].Journal of Southwest Jiaotong University,2006,41(4):486-490.
Authors:GUO Qiang  LI Lyo  GUO Yaohuang
Institution:1. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China; 2. The Hong Kong Polytechnic University, Hong Kong
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.
Keywords:school bus problem  community  optimization  multi-objective  model  heuristic optimization algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号