A hybrid genetic algorithm for two-layer location-routing problem
文献类型：会议论文
| 作者 | Jin L(金莉); Zhu YL(朱云龙) ; Shen H(申海); Ku T(库涛)
|
| 出版日期 | 2010 |
| 会议名称 | 4th International Conference on New Trends in Information Science and Service Science, NISS2010 |
| 会议日期 | May 11-13, 2010 |
| 会议地点 | Gyeongju, Korea, Republic of |
| 关键词 | Distributed parameter networks Genetic algorithms Heuristic methods Information science Learning algorithms Logistics Tabu search |
| 页码 | 642-645 |
| 中文摘要 | Location-routing problem (LRP) is a combinational optimization problem in a logistics system. Most heuristic methods employed for LRP is dividing the problem into location assignment and vehicle routing with a two-phase method, but this method often does not lead to a satisfactory result for the information can not be compressed from one phase to the other efficiently. In this paper we are concerned with a particular type of facility location problem in which there exists two echelons of facilities, and use a hybrid genetic algorithm to solve the problem regarding its solution as a whole, and thus easily obtain the optimal solution. Genetic algorithm uses a three-level chromosome coding method composed of binary code and integer code. Improving crossover and mutation with tabu search algorithm to increase search efficiency. The numerical results indicate that the method is feasible for practical applications. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议录 | NISS2010 - 4th International Conference on New Trends in Information Science and Service Science
 |
| 会议录出版者 | IEEE Computer Society |
| 会议录出版地 | Piscataway, NJ |
| 语种 | 英语 |
| ISBN号 | 978-1-4244-6982-6 |
| 源URL | [http://ir.sia.cn/handle/173321/8303]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Jin L,Zhu YL,Shen H,et al. A hybrid genetic algorithm for two-layer location-routing problem[C]. 见:4th International Conference on New Trends in Information Science and Service Science, NISS2010. Gyeongju, Korea, Republic of. May 11-13, 2010. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。