| A hybrid genetic algorithm for solving the length-balanced two arc-disjoint shortest paths problem (CPCI-S收录) | |
| Li, Yanzhi; Lim, Andrew; Ma, Hong | |
| 会议名称 | ADVANCES IN APPLIED ARTICIAL INTELLIGENCE, PROCEEDINGS |
| 关键词 | shortest path length-balanced Lagrangian relaxation |
| URL标识 | 查看原文 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2115399 |
| 专题 | 华南理工大学 |
| 作者单位 | 1.[1]Hong Kong Univ Sci & Technol, Dept Ind Engn & Logist Management, Kowloon, Hong Kong, Peoples R China 2.[2]S China Univ Technol, Sch Engn & Comp Sci, Guangdong, Peoples R China |
| 推荐引用方式 GB/T 7714 | Li, Yanzhi,Lim, Andrew,Ma, Hong. A hybrid genetic algorithm for solving the length-balanced two arc-disjoint shortest paths problem (CPCI-S收录)[C]. 见:ADVANCES IN APPLIED ARTICIAL INTELLIGENCE, PROCEEDINGS. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论