File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/13658810701492365
- Scopus: eid_2-s2.0-41449118356
- WOS: WOS:000254345900002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Seeking the Pareto front for multiobjective spatial optimization problems
Title | Seeking the Pareto front for multiobjective spatial optimization problems |
---|---|
Authors | |
Keywords | GIS Multiobjective optimization Multiobjective routing Pareto-front |
Issue Date | 2008 |
Citation | International Journal of Geographical Information Science, 2008, v. 22, n. 5, p. 507-526 How to Cite? |
Abstract | 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. |
Persistent Identifier | http://hdl.handle.net/10722/330104 |
ISSN | 2023 Impact Factor: 4.3 2023 SCImago Journal Rankings: 1.436 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, B. | - |
dc.contributor.author | Fery, P. | - |
dc.contributor.author | Xue, L. | - |
dc.contributor.author | Wang, Y. | - |
dc.date.accessioned | 2023-08-09T03:37:49Z | - |
dc.date.available | 2023-08-09T03:37:49Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | International Journal of Geographical Information Science, 2008, v. 22, n. 5, p. 507-526 | - |
dc.identifier.issn | 1365-8816 | - |
dc.identifier.uri | http://hdl.handle.net/10722/330104 | - |
dc.description.abstract | 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. | - |
dc.language | eng | - |
dc.relation.ispartof | International Journal of Geographical Information Science | - |
dc.subject | GIS | - |
dc.subject | Multiobjective optimization | - |
dc.subject | Multiobjective routing | - |
dc.subject | Pareto-front | - |
dc.title | Seeking the Pareto front for multiobjective spatial optimization problems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/13658810701492365 | - |
dc.identifier.scopus | eid_2-s2.0-41449118356 | - |
dc.identifier.volume | 22 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 507 | - |
dc.identifier.epage | 526 | - |
dc.identifier.eissn | 1362-3087 | - |
dc.identifier.isi | WOS:000254345900002 | - |