Redirigiendo al acceso original de articulo en 21 segundos...
Inicio  /  Water  /  Vol: 7 Par: 5 (2015)  /  Artículo
ARTÍCULO
TITULO

A Heuristic Dynamically Dimensioned Search with Sensitivity Information (HDDS-S) and Application to River Basin Management

Jinggang Chu    
Yong Peng    
Wei Ding and Yu Li    

Resumen

River basin simulation and multi-reservoir optimal operation have been critical for river basin management. Due to the intense interaction between human activities and river basin systems, the river basin model and multi-reservoir operation model are complicated with a large number of parameters. Therefore, fast and stable optimization algorithms are required for river basin management under the changing conditions of climate and current human activities. This study presents a new global optimization algorithm, named as heuristic dynamically dimensioned search with sensitivity information (HDDS-S), to effectively perform river basin simulation and multi-reservoir optimal operation during river basin management. The HDDS-S algorithm is built on the dynamically dimensioned search (DDS) algorithm; and has an improved computational efficiency while maintaining its search capacity compared to the original DDS algorithm. This is mainly due to the non-uniform probability assigned to each decision variable on the basis of its changing sensitivity to the optimization objectives during the adaptive change from global to local search with dimensionality reduced. This study evaluates the new algorithm by comparing its performance with the DDS algorithm on a river basin model calibration problem and a multi-reservoir optimal operation problem. The results obtained indicate that the HDDS-S algorithm outperforms the DDS algorithm in terms of search ability and computational efficiency in the two specific problems. In addition; similar to the DDS algorithm; the HDDS-S algorithm is easy to use as it does not require any parameter tuning and automatically adjusts its search to find good solutions given an available computational budget.

 Artículos similares

       
 
Chun Chen, Zhi-Hua Hu and Lei Wang    
In order to improve the horizontal transportation efficiency of the terminal Automated Guided Vehicles (AGVs), it is necessary to focus on coordinating the time and space synchronization operation of the loading and unloading of equipment, the transporta... ver más

 
Uthman Baroudi, Mohammad Alshaboti, Anis Koubaa and Sahar Trigui    
In this paper, we address the problem of online dynamic multi-robot task allocation (MRTA) problem. In the existing literature, several works investigated this problem as a multi-objective optimization (MOO) problem and proposed different approaches to s... ver más
Revista: Applied Sciences

 
Vic Grout    
This paper provides an initial introduction to, and definition of, the ?Dynamically Powered Relays for a Flexible Optical Network? (DPR-FON) problem for opto-electro-optical (OEO) regenerators used in optical networks. In such networks, optical transmiss... ver más
Revista: Future Internet

 
Esteve Codina, Francisca Rosell, Luís Cadarso, Ángel Marín     Pág. 615 - 624
This paper focuses on a mathematical programming based model for setting the schedule of a given number of services on a public transportation network. The structure of the model is that of a time-expanded or diachronic network, where origin to destinati... ver más

 
Teodor Gabriel Crainic, Phuong Khanh Nguyen, Michel Toulouse     Pág. 26 - 39
The paper introduces the first methodology addressing with a single fleet of vehicles the routing of the three different types of transportation demands encountered in City Logistics, inbound, outbound and intra-city traffic. We propose a tabu search met... ver más