Knowledge-informed Pareto simulated annealing for multi-objective spatial allocation
نویسندگان
چکیده
Spatial allocation is the process of assigning different attributes (e.g., land-use or land-cover) to spatial entities (e.g., map polygons or grid cells). It is an exercise that often requires the analysis of multiple, sometimes conflicting, objectives. Multi-objective spatial allocation problems often exhibit substantial computational complexity, especially when spatial pattern characteristics are specified as the allocation objectives. Optimization techniques that incorporate heuristics or knowledgeinformed rules have been found to be more effective in solving spatial allocation problem. In this article, we (1) develop and demonstrate a knowledge-informed Pareto simulated annealing approach to tackle specifically multi-objective allocation problems that consider spatial patterns as objectives and (2) determine whether the knowledge-informed approach is more effective than standard Pareto simulation annealing in solving multi-objective spatial allocation problems. Four multi-objective spatial allocation problems were formulated in a gridded two-dimensional discrete space to benchmark the performance of our knowledge-informed algorithms and a standard Pareto simulated annealing algorithm. These four problems, each with two objectives, represent all combinations of cases in which there are (1) conflicting or concordant objectives and (2) two pattern objectives or one pattern objective and one non-pattern objective, representing objectives with similar or different degrees of difficulty. We generated 1200 sets of solutions, represented as allocation maps. Performance indices that measure the computational effectiveness and efficiency were developed for evaluation. The results suggest that the solutions generated by the knowledge-informed approach are more effective in approximating the set of Pareto optimal solutions than those generated by the standard Pareto simulated annealing. 0198-9715/$ see front matter 2006 Elsevier Ltd. All rights reserved. doi:10.1016/j.compenvurbsys.2006.08.002 * Corresponding author. Tel.: +1 503 725 3159; fax: +1 503 725 3166. E-mail address: [email protected] (J.-D. Duh). Please cite this article in press as: Duh, J. -D., & Brown, D.G. (2001), Knowledge-informed..., Computers, Environment and Urban Systems (2006), doi:10.1016/j.compenvurbsys.2006.08.002 2 J.-D. Duh, D.G. Brown / Comput., Environ. and Urban Systems xxx (2006) xxx–xxx ARTICLE IN PRESS 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
A Knowledge-Informed and Pareto-Based Artificial Bee Colony Optimization Algorithm for Multi-Objective Land-Use Allocation
Land-use allocation is of great significance in urban development. This type of allocation is usually considered to be a complex multi-objective spatial optimization problem, whose optimized result is a set of Pareto-optimal solutions (Pareto front) reflecting different tradeoffs in several objectives. However, obtaining a Pareto front is a challenging task, and the Pareto front obtained by sta...
متن کاملKnowledge-Informed Simulated Annealing for Spatial Allocation Problems
Generating prescribed patterns in spatial allocation is a difficult and complex optimization task. Many spatial allocation problems require the arrangement of resources in ways that their patterns promote some desirable landscape functions (e.g., Taylor et al.,2007; De Clercq et al., 2007; Milder et al., 2008). The complexity of the optimization task comes from the simultaneous effects of sitin...
متن کاملA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملAn archived multi-objective simulated annealing for a dynamic cellular manufacturing system
To design a group layout of a cellular manufacturing system (CMS) in a dynamic environment, a multi-objective mixed-integer non-linear programming model is developed. The model integrates cell formation, group layout and production planning (PP) as three interrelated decisions involved in the design of a CMS. This paper provides an extensive coverage of important manufacturing features u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers, Environment and Urban Systems
دوره 31 شماره
صفحات -
تاریخ انتشار 2007