کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
553399 | 873486 | 2006 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A GIS supported Ant algorithm for the linear feature covering problem with distance constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
سیستم های اطلاعاتی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This 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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Decision Support Systems - Volume 42, Issue 2, November 2006, Pages 1063–1075
Journal: Decision Support Systems - Volume 42, Issue 2, November 2006, Pages 1063–1075
نویسندگان
Bo Huang, Nan Liu, Magesh Chandramouli,