摘要
大型运动会要求主办方在规定时间内将相关人员从运动员村运送至指定比赛场馆。基于大城市日趋严重的交通拥堵,为满足运送时间的要求,通常在城市公共交通网络中设置专用交通道。但专用交通道的设置会对城市公共交通产生影响,最小化其对城市公共交通影响是专用交通道优化问题的关键。针对此类问题,在给出了改进的混合整数规划模型的基础上,提出了基于问题特性的变长度染色体混沌遗传算法,包括变长度染色体编码、混沌个体初始化、交叉操作、变异操作、适应度函数的计算和不可行解的惩罚、修复策略等。最后,以经典算例和随机生成算例对算法有效性进行了验证。
Large sportive games require organizers to deliver related people from the athletes＇ village to the designated venues in a strict time window. Lane reservation on some roads in the transportation network is often used to meet the transportation requirement due to the increasingly serious traffic jam in the cities. But the lane reservation has an influence on public traffic of cities. Minimizing such an influence is a key issue for Lane Reservation Problem（LRP）. After presenting the improved mixed integer programming model for LRP, this paper proposes a chaos genetic algorithm with variable length chromosome based on the characteristics of LRP, including variable length chromosome encoding method, chaos individuals initialization, crossover operation, variation operation, fitness function computing, punishment and reparation strategies for infeasible solutions. At last, a bench- mark example and randomly generated examples are used to verify the effectiveness of the proposed algorithm.
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2013年第1期15-22,共8页
Operations Research and Management Science
基金
国家自然科学基金资助项目(71071129)
中法“蔡元培”交流合作项目(24021SH)
西北工业大学人文社科与管理振兴基金资助项目(RW200902)
西北工业大学研究生创业种子基金资助项目(Z2012174,Z2012175)
关键词
专用交通道优化
混沌遗传算法
变长度染色体
lane reservation problem
chaos genetic algorithm
variable length chromosome
