| The dynamic progressive location problem | |
| Zhou, Jing ; Zhou, Jian | |
| 2010-05-10 ; 2010-05-10 | |
| 会议名称 | PROCEEDING OF THE SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES ; 7th International Conference on Information and Management Sciences ; Urumchi, PEOPLES R CHINA ; Web of Science |
| 关键词 | dynamic location problem progressive location genetic algorithm MULTISOURCE WEBER PROBLEM Computer Science, Information Systems Computer Science, Theory & Methods Information Science & Library Science Management |
| 中文摘要 | In this paper, a dynamic progressive location problem is initiated in the continuous Euclidean space, where the decisions of number of new facilities and their locating time are made at the beginning of multiple periods according to predictable demands. In order to formulate this problem, a semi-decision model is first presented in which the time for new facility construction is predetermined. Based on the semi-decision model, a full-decision model is given for the dynamic progressive location problem. In order to solve the semi-decision model, a genetic algorithm is designed, and an enumeration algorithm and a heuristic algorithm are designed to solve the full-decision model efficiently. Finally, some numerical examples are presented to illustrate the performance and effectiveness of these algorithms. |
| 会议录出版者 | CALIFORNIA POLYTECHNIC STATE UNIV ; SAN LUIS OBISPO ; CAL POLY, SAN LUIS OBISPO, CA 93407 USA |
| 语种 | 英语 ; 英语 |
| 内容类型 | 会议论文 |
| 源URL | [http://hdl.handle.net/123456789/18982]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | Zhou, Jing,Zhou, Jian. The dynamic progressive location problem[C]. 见:PROCEEDING OF THE SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 7th International Conference on Information and Management Sciences, Urumchi, PEOPLES R CHINA, Web of Science. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论