A methodology for the selection of the optimal land uses of the reclamation of mined areas is proposed. It takes into consideration several multi-nature criteria and constraints, including spatial constrains related t...A methodology for the selection of the optimal land uses of the reclamation of mined areas is proposed. It takes into consideration several multi-nature criteria and constraints, including spatial constrains related to the permissible land uses in certain parts of the mined area. The methodology combines desirability functions and evolution searching algorithms for selection of the optimal reclamation scheme. Its application for the reclamation planning of the Amynteon lignite surface mine in Greece indicated that it handles effectively spatial and non-spatial constraints and incorporates easily the decision-makers preferences regarding the reclamation strategy in the optimization procedure.展开更多
Although many computing algorithms have been developed to analyze the relationship between land use pattern and driving forces (RLPDF), little has been done to assess and reduce the uncertainty of predictions. In this...Although many computing algorithms have been developed to analyze the relationship between land use pattern and driving forces (RLPDF), little has been done to assess and reduce the uncertainty of predictions. In this study, we investigated RLPDF based on 1990, 2005 and 2012 datasets at two spatial scales using eight state-of-the-art single computing algorithms and four consensus methods in Jinjing rive catchment in Hunan Province, China. At the entire catchment scale, the mean AUC values were between 0.715 (ANN) and 0.948 (RF) for the single-algorithms, and from 0.764 to 0.962 for the consensus methods. At the subcatchment scale, the mean AUC values between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. At the subcatchment scale, the mean AUC values were between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. The result suggested that among the eight single computing algorithms, RF performed the best overall for woodland and paddy field;consensus method showed higher predictive performance for woodland and paddy field models than the single computing algorithms. We compared the simulation results of the best - and worst-performing algorithms for the entire catchment in 2012, and found that approximately 72.5% of woodland and 72.4% of paddy field had probabilities of occurrence of less than 0.1, and 3.6% of woodland and 14.5% of paddy field had probabilities of occurrence of more than 0.5. In other words, the simulation errors associated with using different computing algorithms can be up to 14.5% if a probability level of 0.5 is set as the threshold. The results of this study showed that the choice of modeling approaches can greatly affect the accuracy of RLPDF prediction. The computing algorithms for specific RLPDF tasks in specific regions have to be localized and optimized.展开更多
In response to the strong drive for social and economic development, local governments have implemented urban master plans, providing measures and timeframes to address the continuous demand for land and to alleviate ...In response to the strong drive for social and economic development, local governments have implemented urban master plans, providing measures and timeframes to address the continuous demand for land and to alleviate urban problems. In this paper, a multi-objective model was constructed to discuss the problem, including economic benefits and ecological effectiveness, in terms of land use optimization. A genetic algorithm was then adopted to solve the model, and a performance evaluation and sensitivity analysis were conducted using Pareto optimality. Results showed that a set of tradeoffs could be acquired by the allocation of land use. In addition, the Pareto solutions proved the model to be efficient; for example, a limit of 13,500 ha of urban area conformed to plan recommendations. The reduction in crop land, orchard land, grassland, and unused land provided further efficiencies. These results implied that further potential regional land resources remain and that the urban master plan is able to support sustainable local development in the years to come, as well as verified that it is feasible to use land use allocation multi-objective modeling and genetic algorithms.展开更多
This paper explores the potential application of a modified version of the Non-dominated Sorting Genetic Algorithm (NSGA)-II for land-use planning in Mediterranean islands that constitute a geographical entity with si...This paper explores the potential application of a modified version of the Non-dominated Sorting Genetic Algorithm (NSGA)-II for land-use planning in Mediterranean islands that constitute a geographical entity with similar characteristics. Study area is the island of Naxos, which is a typical Mediterranean island. In order to monitor the land-use changes of the island for the period 1987-2010, object-based classification of three Landsat images has been carried out. The 1987 land-use classification defined the initial population for the Genetic Algorithm (GA) and the aim was to provide the optimal development scenario for Naxos island taking into consideration legislation, geological characteristics and environmental parameters. The GA was used in order to introduce land use changes while maximizing transformation suitability, compactness, economic return, and minimizing soil erosion. The output of the GA was compared to the actual development of the island. The outcomes confirmed the proposed algorithm’s convergence process, while the GA solutions eventually formed a Pareto Front and performed adequately across all objectives. The GA algorithm has proposed reduction of Irrigated farming land by 16%, increase of Dry farming land by 131%, and the maximum allowed by the defined constraints increase of Urban land (100%), mostly on the eastern and central part of Naxos. These changes significantly differ from the actual development of the island. Economic return after optimization increased by 18%, while soil erosion decreased from 1948 t/y to 1843 t/y.展开更多
The Optimum use of energy is one of the significant needs in wireless sensor networks, because sensor devices would usually use the battery power. In this article, we give the suggested routing algorithm (BSDCH) with ...The Optimum use of energy is one of the significant needs in wireless sensor networks, because sensor devices would usually use the battery power. In this article, we give the suggested routing algorithm (BSDCH) with determining an optimum routine due to the energy use and the number of passed hobs. To transfer date from nodes’ sensor to BS (Base Station), data sending has been utilized in chains. In BSDCH algorithm, the nodes’ space is divided into several regions. In this article, each part is called a cluster. In each cluster, a node which is the best due to energy and distance comparison with other cluster nodes it is continuously selected with a given Formula (4) which is called main CH (Cluster Head) and forms a chain in that cluster and in each node cluster, it is selected by Formula (5) as secondary CH with the least distance and the best situation to BS and main CH. the secondary CH task is to receive data from the main CH and send data to the BS. As far as the main cluster head would waste too much energy to send data to BS, so to send data through secondary CH, we can keep main CH energy for more time. In the time of sending data from nodes to main CH, a multi chain is utilized. In the time of making nodes’ chain, nods are connected straight into its main CH radius and other nodes are connected in their sending radius which would have the least distance to main CH. Finally, also, BSDCH has been compared with PEGASIS [1] and PDCH [2]. The simulation results are shown which are indicator of a better BSDCH performance.展开更多
文摘A methodology for the selection of the optimal land uses of the reclamation of mined areas is proposed. It takes into consideration several multi-nature criteria and constraints, including spatial constrains related to the permissible land uses in certain parts of the mined area. The methodology combines desirability functions and evolution searching algorithms for selection of the optimal reclamation scheme. Its application for the reclamation planning of the Amynteon lignite surface mine in Greece indicated that it handles effectively spatial and non-spatial constraints and incorporates easily the decision-makers preferences regarding the reclamation strategy in the optimization procedure.
文摘Although many computing algorithms have been developed to analyze the relationship between land use pattern and driving forces (RLPDF), little has been done to assess and reduce the uncertainty of predictions. In this study, we investigated RLPDF based on 1990, 2005 and 2012 datasets at two spatial scales using eight state-of-the-art single computing algorithms and four consensus methods in Jinjing rive catchment in Hunan Province, China. At the entire catchment scale, the mean AUC values were between 0.715 (ANN) and 0.948 (RF) for the single-algorithms, and from 0.764 to 0.962 for the consensus methods. At the subcatchment scale, the mean AUC values between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. At the subcatchment scale, the mean AUC values were between 0.624 (CTA) and 0.972 (RF) for the single-algorithms, and from 0.758 to 0.979 for the consensus methods. The result suggested that among the eight single computing algorithms, RF performed the best overall for woodland and paddy field;consensus method showed higher predictive performance for woodland and paddy field models than the single computing algorithms. We compared the simulation results of the best - and worst-performing algorithms for the entire catchment in 2012, and found that approximately 72.5% of woodland and 72.4% of paddy field had probabilities of occurrence of less than 0.1, and 3.6% of woodland and 14.5% of paddy field had probabilities of occurrence of more than 0.5. In other words, the simulation errors associated with using different computing algorithms can be up to 14.5% if a probability level of 0.5 is set as the threshold. The results of this study showed that the choice of modeling approaches can greatly affect the accuracy of RLPDF prediction. The computing algorithms for specific RLPDF tasks in specific regions have to be localized and optimized.
基金National Natural Science Foundation of China,No.41130748 No.41171070+2 种基金 China Postdoctoral Science Foundation,No.200902132 No.20080440511 The Humanities and Social Sciences Project of Ministry of Education,PRC,No.10YJCZH031
文摘In response to the strong drive for social and economic development, local governments have implemented urban master plans, providing measures and timeframes to address the continuous demand for land and to alleviate urban problems. In this paper, a multi-objective model was constructed to discuss the problem, including economic benefits and ecological effectiveness, in terms of land use optimization. A genetic algorithm was then adopted to solve the model, and a performance evaluation and sensitivity analysis were conducted using Pareto optimality. Results showed that a set of tradeoffs could be acquired by the allocation of land use. In addition, the Pareto solutions proved the model to be efficient; for example, a limit of 13,500 ha of urban area conformed to plan recommendations. The reduction in crop land, orchard land, grassland, and unused land provided further efficiencies. These results implied that further potential regional land resources remain and that the urban master plan is able to support sustainable local development in the years to come, as well as verified that it is feasible to use land use allocation multi-objective modeling and genetic algorithms.
文摘This paper explores the potential application of a modified version of the Non-dominated Sorting Genetic Algorithm (NSGA)-II for land-use planning in Mediterranean islands that constitute a geographical entity with similar characteristics. Study area is the island of Naxos, which is a typical Mediterranean island. In order to monitor the land-use changes of the island for the period 1987-2010, object-based classification of three Landsat images has been carried out. The 1987 land-use classification defined the initial population for the Genetic Algorithm (GA) and the aim was to provide the optimal development scenario for Naxos island taking into consideration legislation, geological characteristics and environmental parameters. The GA was used in order to introduce land use changes while maximizing transformation suitability, compactness, economic return, and minimizing soil erosion. The output of the GA was compared to the actual development of the island. The outcomes confirmed the proposed algorithm’s convergence process, while the GA solutions eventually formed a Pareto Front and performed adequately across all objectives. The GA algorithm has proposed reduction of Irrigated farming land by 16%, increase of Dry farming land by 131%, and the maximum allowed by the defined constraints increase of Urban land (100%), mostly on the eastern and central part of Naxos. These changes significantly differ from the actual development of the island. Economic return after optimization increased by 18%, while soil erosion decreased from 1948 t/y to 1843 t/y.
文摘The Optimum use of energy is one of the significant needs in wireless sensor networks, because sensor devices would usually use the battery power. In this article, we give the suggested routing algorithm (BSDCH) with determining an optimum routine due to the energy use and the number of passed hobs. To transfer date from nodes’ sensor to BS (Base Station), data sending has been utilized in chains. In BSDCH algorithm, the nodes’ space is divided into several regions. In this article, each part is called a cluster. In each cluster, a node which is the best due to energy and distance comparison with other cluster nodes it is continuously selected with a given Formula (4) which is called main CH (Cluster Head) and forms a chain in that cluster and in each node cluster, it is selected by Formula (5) as secondary CH with the least distance and the best situation to BS and main CH. the secondary CH task is to receive data from the main CH and send data to the BS. As far as the main cluster head would waste too much energy to send data to BS, so to send data through secondary CH, we can keep main CH energy for more time. In the time of sending data from nodes to main CH, a multi chain is utilized. In the time of making nodes’ chain, nods are connected straight into its main CH radius and other nodes are connected in their sending radius which would have the least distance to main CH. Finally, also, BSDCH has been compared with PEGASIS [1] and PDCH [2]. The simulation results are shown which are indicator of a better BSDCH performance.
