File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A GIS supported Ant algorithm for the linear feature covering problem with distance constraints

TitleA GIS supported Ant algorithm for the linear feature covering problem with distance constraints
Authors
KeywordsAnt algorithm
GIS
Linear feature covering problem
Two-phase local search
Issue Date2006
Citation
Decision Support Systems, 2006, v. 42, n. 2, p. 1063-1075 How to Cite?
AbstractThis paper analyzes a linear feature covering problem (LFCP) with distance constraints, and characterizes the problem by a fuzzy multi-objective (MO) optimization model. An integrated approach combining an Ant algorithm (LFCP-Ant) and a Geographic Information System (GIS) has been devised to solve the LFCP problem in large scale. The efficacy of the proposed approach is demonstrated using a case study of locating new fire stations in Singapore. A GIS has been used to transform the continuous problem into a discrete one, which is then solved using the LFCP-Ant. This algorithm employs a two-phase local search to improve both search efficiency and precision. © 2005 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/330079
ISSN
2023 Impact Factor: 6.7
2023 SCImago Journal Rankings: 2.211
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHuang, Bo-
dc.contributor.authorLiu, Nan-
dc.contributor.authorChandramouli, Magesh-
dc.date.accessioned2023-08-09T03:37:38Z-
dc.date.available2023-08-09T03:37:38Z-
dc.date.issued2006-
dc.identifier.citationDecision Support Systems, 2006, v. 42, n. 2, p. 1063-1075-
dc.identifier.issn0167-9236-
dc.identifier.urihttp://hdl.handle.net/10722/330079-
dc.description.abstractThis paper analyzes a linear feature covering problem (LFCP) with distance constraints, and characterizes the problem by a fuzzy multi-objective (MO) optimization model. An integrated approach combining an Ant algorithm (LFCP-Ant) and a Geographic Information System (GIS) has been devised to solve the LFCP problem in large scale. The efficacy of the proposed approach is demonstrated using a case study of locating new fire stations in Singapore. A GIS has been used to transform the continuous problem into a discrete one, which is then solved using the LFCP-Ant. This algorithm employs a two-phase local search to improve both search efficiency and precision. © 2005 Elsevier B.V. All rights reserved.-
dc.languageeng-
dc.relation.ispartofDecision Support Systems-
dc.subjectAnt algorithm-
dc.subjectGIS-
dc.subjectLinear feature covering problem-
dc.subjectTwo-phase local search-
dc.titleA GIS supported Ant algorithm for the linear feature covering problem with distance constraints-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.dss.2005.09.002-
dc.identifier.scopuseid_2-s2.0-33749848477-
dc.identifier.volume42-
dc.identifier.issue2-
dc.identifier.spage1063-
dc.identifier.epage1075-
dc.identifier.isiWOS:000242209700038-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats