The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional...The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot’s exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.展开更多
Data envelopment analysis (DEA) has become a standard non parametric approach to productivity analysis, especially to relative efficiency analysis of decision making units (DMUs). Extended to the prediction field, it ...Data envelopment analysis (DEA) has become a standard non parametric approach to productivity analysis, especially to relative efficiency analysis of decision making units (DMUs). Extended to the prediction field, it can solve the prediction problem with multiple inputs and outputs which can not be solved easily by the regression analysis method.But the traditional DEA models can not solve the problem with undesirable outputs,so in this paper the inherent relationship between goal programming and the DEA method based on the relationship between multiple goal programming and goal programming is explored,and a mixed DEA model which can make all factors of inputs and undesirable outputs decrease in different proportions is built.And at the same time,all the factors of desirable outputs increase in different proportions.展开更多
In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are establish...In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].展开更多
Groundwater is the primary water source in the Kingdom of Saudi Arabia. As result of lack of basic knowledge on irrigation practices, massive abstractions of groundwater occurred in 1980＇s. A Decision Support Linear ...Groundwater is the primary water source in the Kingdom of Saudi Arabia. As result of lack of basic knowledge on irrigation practices, massive abstractions of groundwater occurred in 1980＇s. A Decision Support Linear Goal Programming （LGP） model was developed to determine optimal groundwater irrigation levels, to assess the implications for water management policies, and to estimate welfare impact on producer surplus. Due to the reductions of groundwater in 1980＇s, the Al-Wajid aquifer water levels have dropped in agricultural areas by more than 200 m. Results from this study estimate that the total groundwater of the Al-Wajid aquifer that can be saved is equal to 66 MCM for the first scenario, 147 MCM for the second scenario, and 229 MCM for the third scenario. Regarding the welfare analysis impacts, it is clear that the total gross margin is decreasing up to 7.7% at the end of the year of scenario Ⅲ. Therefore, the third scenario with a water saving increase to 18.1% is recommended as a directive for agricultural policy formation in the future.展开更多
Being aimed at the vital decisive problems to be solved during.making long-term planning and overall planning of the development of coal mining areas of China, this paper presents comprehensive theories and methods fo...Being aimed at the vital decisive problems to be solved during.making long-term planning and overall planning of the development of coal mining areas of China, this paper presents comprehensive theories and methods for the choice of mining area optimum planning schemes by use of combining technic analysis with system simulation and system optimization.The main contents are as follows: the prediction of technic and economic indexes in the developing process of existing mining areas and new mining area, including computer simulation analysis of maximum possibility of output growth in a working mine, the effect of technic progress on productive development, and grey predictive model of the change of technic and economic indexes; the dynamic simulation model of the mining area system, including five subsystem models; mining area output, investment, economic benefit, number of workers and staff of a mining area, mining area population, and ecologic environmental dynamic change under different schemes;the 0--1 programming, the goal programming and the analytic hierarchy process for contrast analysis optimization of mining area planning schemes.展开更多
基金Project(A1420060159) supported by the National Basic Research of China projects(60234030 60404021) supported bythe National Natural Science Foundation of China
文摘The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot’s exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.
文摘Data envelopment analysis (DEA) has become a standard non parametric approach to productivity analysis, especially to relative efficiency analysis of decision making units (DMUs). Extended to the prediction field, it can solve the prediction problem with multiple inputs and outputs which can not be solved easily by the regression analysis method.But the traditional DEA models can not solve the problem with undesirable outputs,so in this paper the inherent relationship between goal programming and the DEA method based on the relationship between multiple goal programming and goal programming is explored,and a mixed DEA model which can make all factors of inputs and undesirable outputs decrease in different proportions is built.And at the same time,all the factors of desirable outputs increase in different proportions.
基金Foundation item： Supported by Hunan Provincial Natural Science Foundation of China（05JJ40103） Supported by Soft Science Research Fund of Hunan Province（2006ZK3028） Supported by Scientific Research Fund of Hunan Provincial Education Department（105B0707, 08C470）
文摘In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].
文摘Groundwater is the primary water source in the Kingdom of Saudi Arabia. As result of lack of basic knowledge on irrigation practices, massive abstractions of groundwater occurred in 1980＇s. A Decision Support Linear Goal Programming （LGP） model was developed to determine optimal groundwater irrigation levels, to assess the implications for water management policies, and to estimate welfare impact on producer surplus. Due to the reductions of groundwater in 1980＇s, the Al-Wajid aquifer water levels have dropped in agricultural areas by more than 200 m. Results from this study estimate that the total groundwater of the Al-Wajid aquifer that can be saved is equal to 66 MCM for the first scenario, 147 MCM for the second scenario, and 229 MCM for the third scenario. Regarding the welfare analysis impacts, it is clear that the total gross margin is decreasing up to 7.7% at the end of the year of scenario Ⅲ. Therefore, the third scenario with a water saving increase to 18.1% is recommended as a directive for agricultural policy formation in the future.
文摘Being aimed at the vital decisive problems to be solved during.making long-term planning and overall planning of the development of coal mining areas of China, this paper presents comprehensive theories and methods for the choice of mining area optimum planning schemes by use of combining technic analysis with system simulation and system optimization.The main contents are as follows: the prediction of technic and economic indexes in the developing process of existing mining areas and new mining area, including computer simulation analysis of maximum possibility of output growth in a working mine, the effect of technic progress on productive development, and grey predictive model of the change of technic and economic indexes; the dynamic simulation model of the mining area system, including five subsystem models; mining area output, investment, economic benefit, number of workers and staff of a mining area, mining area population, and ecologic environmental dynamic change under different schemes;the 0--1 programming, the goal programming and the analytic hierarchy process for contrast analysis optimization of mining area planning schemes.
