Seeking the Pareto front for multiobjective spatial optimization problems
文献类型：SCI/SSCI论文
| 作者 | Wang Y. |
| 发表日期 | 2008 |
| 关键词 | multiobjective optimization GIS pareto-front multiobjective routing multicriteria generation algorithms gis |
| 英文摘要 | Spatial optimization problems, such as route selection, usually involve multiple, conflicting objectives relevant to locations. An ideal approach to solving such multiobjective optimization problems (MOPs) is to find an evenly distributed set of Pareto-optimal alternatives, which is capable of representing the possible trade-off among different objectives. However, these MOPs are commonly solved by combining the multiple objectives into a parametric scalar objective, in the form of a weighted sum function. It has been found that this method fails to produce a set of well spread solutions by disregarding the concave part of the Pareto front. In order to overcome this ill-behaved nature, a novel adaptive approach has been proposed in this paper. This approach seeks to provide an unbiased approximation of the Pareto front by tuning the search direction in the objective space according to the largest unexplored region until a set of well-distributed solutions is reached. To validate the proposed methodology, a case study on multiobjective routing has been performed using the Singapore road network with the support of GIS. The experimental results confirm the effectiveness of the approach. |
| 出处 | International Journal of Geographical Information Science |
| 卷 | 22 |
| 期 | 5 |
| 页 | 507-526 |
| 收录类别 | SCI |
| 语种 | 英语 |
| ISSN号 | 1365-8816 |
| 源URL | [http://ir.igsnrr.ac.cn/handle/311030/23838]  |
| 专题 | 地理科学与资源研究所_历年回溯文献 |
| 推荐引用方式 GB/T 7714 | Wang Y.. Seeking the Pareto front for multiobjective spatial optimization problems. 2008. |
入库方式： OAI收割
来源：地理科学与资源研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。