The main goal of this paper is to study the following combinatorial problem : given a finite set E = (e1, e2, ...,em} and a subset family a - [S1,S2, ... ,Sk} of E , does there exist a tree T with the edge set E such ...The main goal of this paper is to study the following combinatorial problem : given a finite set E = (e1, e2, ...,em} and a subset family a - [S1,S2, ... ,Sk} of E , does there exist a tree T with the edge set E such that each induced subgraph T[Si] of Si is precisely a path (1≤i≤k) ?展开更多
Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage pheno...Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage phenomena can be divided intO local blockage and network blockage. In this paper, which deals mainly with the latter, the fundamental concepts and definitions of network blocking flow, blocking outset are presented and the related theorems are proved. It is proved that the sufficient and necessary condition for the emergence of a blocking now in a network is the existence of the blocking outset. The necessary conditions for the existence of the blocking outset in a network are analysed and the characteristic cutset of blockage which reflects the all possible situation of blocking nows in the network is defined.In the last part of the paper the mathematical model of the minimum blocking now is developed and the solution to a small network is given.展开更多
In order to increase production efficiency at open-pit mines, on the basis oflinear programming, a practical mathematical model for optimizing truck flow was developed, whichimproved the traditional fixed manual sched...In order to increase production efficiency at open-pit mines, on the basis oflinear programming, a practical mathematical model for optimizing truck flow was developed, whichimproved the traditional fixed manual schedule method. The model has advantages from linearprogramming and objective programming, makes most handling points working at full capacity and keepsan optimized ratio between trucks and excavators. For ensuring feasibility of the model inpractical production, four standards for feasibility test were proposed. The model satisfied all thestandards. The application in a large scale open-pit iron mine indicated that the model reduced thenumber of required trucks by 10 percent compared with the fixed manual schedule method.展开更多
Increasing demand for water from all sectors presents a challenge for policy makers to improve water allocation policies for storage reservoirs. In addition, there are many other organisms and species present in river...Increasing demand for water from all sectors presents a challenge for policy makers to improve water allocation policies for storage reservoirs. In addition, there are many other organisms and species present in river waters that also require water for their survival. Due to the lack of awareness many times the minimum required quantity and quality of water for river ecosystem is not made available at downstream of storage reservoirs. So, a sustainable approach is required in reservoir operations to maintain the river ecosystem with environmental flow while meeting the other demands. Multi-objective, multi-reservoir operation model developed with Python programming using Fuzzy Linear Programing method incorporating environmental flow requirement of river is presented in this paper. Objective of maximization of irrigation release is considered for first run. In second run maximization of releases for hydropower generation is considered as objective. Further both objectives are fuzzified by incorporating linear membership function and solved to maximize fuzzified objective function simultaneously by maximizing satisfaction level indicator (λ). The optimal reservoir operation policy is presented considering constraints including Irrigation release, Turbine release, Reservoir storage, Environmental flow release and hydrologic continuity. Model applied for multi-reservoir system consists of four reservoirs, i.e., Jayakwadi Stage-I Reservoir (R1), Jayakwadi Stage-II Reservoir (R2), Yeldari Reservoir (R3), Siddheshwar Reservoir (R4) in Godavari River sub-basin from Marathwada region of Maharashtra State, India.展开更多
Water is the soul of the world. It is the most important element for the survival of humans, animals, birds, plants and all other living things on earth. Water is essential for the beginning of life as well as regular...Water is the soul of the world. It is the most important element for the survival of humans, animals, birds, plants and all other living things on earth. Water is essential for the beginning of life as well as regular availability of water ensuring the survival, growth and overall nourishment. Thus, proper planning and use of reservoir water are essential for all. To tackle this issue different optimization techniques underline their need and importance in the reservoir operations. In the present study, multi-reservoir optimization model is developed using Python programing language considering the objective of maximization of total annual release for hydropower generation. Model is applied to 3 reservoirs from Godavari River basin from Maharashtra state India. Water essential for conservation of environment has also been made available in river as environmental flow as per the recommendations of Central Water Commission (CWC) India. Developed optimization model provides optimal monthly operation policies.展开更多
This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mosts...This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mostseriously blocked situation is studied. With the conceptof complete outset presented in [1], the relationship between the minimum now capacity of a network and its minimum complete cut capacity is discussed, and the reasons for the difference betweent the minimum now capacity of a network and its minimum complete cut capa-city are analysed. In order to get the solution to the problem, the concepts of normalization of a network and its blocking path graph are presented. In the paper it is proved that the necessary and sufficient conditions for the equality between the minumum now capacity and its minumum complete cut capacity are the existence of a feasible flow in the blocking path graph. For the reason that there are some dependent production points in the blocking path graph of a network, the proof about the tenability of the Gale's Theorm for the planat normalized network without circuit is made.展开更多
An interval linear traffic planning model is developed for supporting vehicle emissions limited under uncertainty. The interval linear traffic planning model can address uncertainties of traffic system and vehicle emi...An interval linear traffic planning model is developed for supporting vehicle emissions limited under uncertainty. The interval linear traffic planning model can address uncertainties of traffic system and vehicle emissions related to system costs and limitation of emission. The interval linear traffic planning model is applicable to complex traffic system. One virtual city as our study object was taken by using the interval linear traffic planning model. In this study, one virtual case and a scenario are provided for three planning periods. The results indicate that the interval linear traffic planning model can effectively reduce the vehicles emission and provide strategies for authorities to deal with problems of transportation system.展开更多
This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control...This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these issues, some existing techniques are discussed in this study. Various researchers use an intermediate graph called Event Inter Actions Graph (EIAG) to solve the problem of generating the control flow graph of nondeterministic programs. Some researches propose an intermediate graph called Interaction Sequence Testing Criteria (ISTC) approach based on sequence of interactions to solve the problem of test coverage criteria based on control and data flow. Another method to solve the problem of generating test coverage based on control flow graph of nondeterministic programs is constraint based approach. It needs constrained elements to generate test case which includes structural element and constraint. The selection of good test cases has been addressed by test data generation technique. The technique of concurrent path analysis approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It reduces the number of combined concurrent test paths. The sequential test paths are combined to form concurrent test path. The Integration and System Test Automation (ISTA) approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It is used for automated test case generation and execution by using high-level Petri net is a finite state test model.展开更多
基金Supported by the National Natural Science Foundation of China
文摘The main goal of this paper is to study the following combinatorial problem : given a finite set E = (e1, e2, ...,em} and a subset family a - [S1,S2, ... ,Sk} of E , does there exist a tree T with the edge set E such that each induced subgraph T[Si] of Si is precisely a path (1≤i≤k) ?
文摘Blockage is a kind of phenomenon occurring frequently in modern transportation network. This paper deals with the research work on the blocking now in a network with the help of network flow theory. The blockage phenomena can be divided intO local blockage and network blockage. In this paper, which deals mainly with the latter, the fundamental concepts and definitions of network blocking flow, blocking outset are presented and the related theorems are proved. It is proved that the sufficient and necessary condition for the emergence of a blocking now in a network is the existence of the blocking outset. The necessary conditions for the existence of the blocking outset in a network are analysed and the characteristic cutset of blockage which reflects the all possible situation of blocking nows in the network is defined.In the last part of the paper the mathematical model of the minimum blocking now is developed and the solution to a small network is given.
基金This work was financially supported by the National Key Technologies RD Program in the 10th five-year plan (No.2001BA609A-08).
文摘In order to increase production efficiency at open-pit mines, on the basis oflinear programming, a practical mathematical model for optimizing truck flow was developed, whichimproved the traditional fixed manual schedule method. The model has advantages from linearprogramming and objective programming, makes most handling points working at full capacity and keepsan optimized ratio between trucks and excavators. For ensuring feasibility of the model inpractical production, four standards for feasibility test were proposed. The model satisfied all thestandards. The application in a large scale open-pit iron mine indicated that the model reduced thenumber of required trucks by 10 percent compared with the fixed manual schedule method.
文摘Increasing demand for water from all sectors presents a challenge for policy makers to improve water allocation policies for storage reservoirs. In addition, there are many other organisms and species present in river waters that also require water for their survival. Due to the lack of awareness many times the minimum required quantity and quality of water for river ecosystem is not made available at downstream of storage reservoirs. So, a sustainable approach is required in reservoir operations to maintain the river ecosystem with environmental flow while meeting the other demands. Multi-objective, multi-reservoir operation model developed with Python programming using Fuzzy Linear Programing method incorporating environmental flow requirement of river is presented in this paper. Objective of maximization of irrigation release is considered for first run. In second run maximization of releases for hydropower generation is considered as objective. Further both objectives are fuzzified by incorporating linear membership function and solved to maximize fuzzified objective function simultaneously by maximizing satisfaction level indicator (λ). The optimal reservoir operation policy is presented considering constraints including Irrigation release, Turbine release, Reservoir storage, Environmental flow release and hydrologic continuity. Model applied for multi-reservoir system consists of four reservoirs, i.e., Jayakwadi Stage-I Reservoir (R1), Jayakwadi Stage-II Reservoir (R2), Yeldari Reservoir (R3), Siddheshwar Reservoir (R4) in Godavari River sub-basin from Marathwada region of Maharashtra State, India.
文摘Water is the soul of the world. It is the most important element for the survival of humans, animals, birds, plants and all other living things on earth. Water is essential for the beginning of life as well as regular availability of water ensuring the survival, growth and overall nourishment. Thus, proper planning and use of reservoir water are essential for all. To tackle this issue different optimization techniques underline their need and importance in the reservoir operations. In the present study, multi-reservoir optimization model is developed using Python programing language considering the objective of maximization of total annual release for hydropower generation. Model is applied to 3 reservoirs from Godavari River basin from Maharashtra state India. Water essential for conservation of environment has also been made available in river as environmental flow as per the recommendations of Central Water Commission (CWC) India. Developed optimization model provides optimal monthly operation policies.
文摘This paper deals with the research work on the phenomena of local blockage in a transportation network. Onthe basis of introducing the research results in [1], theminimum now capacity problem of a network in the mostseriously blocked situation is studied. With the conceptof complete outset presented in [1], the relationship between the minimum now capacity of a network and its minimum complete cut capacity is discussed, and the reasons for the difference betweent the minimum now capacity of a network and its minimum complete cut capa-city are analysed. In order to get the solution to the problem, the concepts of normalization of a network and its blocking path graph are presented. In the paper it is proved that the necessary and sufficient conditions for the equality between the minumum now capacity and its minumum complete cut capacity are the existence of a feasible flow in the blocking path graph. For the reason that there are some dependent production points in the blocking path graph of a network, the proof about the tenability of the Gale's Theorm for the planat normalized network without circuit is made.
文摘An interval linear traffic planning model is developed for supporting vehicle emissions limited under uncertainty. The interval linear traffic planning model can address uncertainties of traffic system and vehicle emissions related to system costs and limitation of emission. The interval linear traffic planning model is applicable to complex traffic system. One virtual city as our study object was taken by using the interval linear traffic planning model. In this study, one virtual case and a scenario are provided for three planning periods. The results indicate that the interval linear traffic planning model can effectively reduce the vehicles emission and provide strategies for authorities to deal with problems of transportation system.
文摘This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these issues, some existing techniques are discussed in this study. Various researchers use an intermediate graph called Event Inter Actions Graph (EIAG) to solve the problem of generating the control flow graph of nondeterministic programs. Some researches propose an intermediate graph called Interaction Sequence Testing Criteria (ISTC) approach based on sequence of interactions to solve the problem of test coverage criteria based on control and data flow. Another method to solve the problem of generating test coverage based on control flow graph of nondeterministic programs is constraint based approach. It needs constrained elements to generate test case which includes structural element and constraint. The selection of good test cases has been addressed by test data generation technique. The technique of concurrent path analysis approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It reduces the number of combined concurrent test paths. The sequential test paths are combined to form concurrent test path. The Integration and System Test Automation (ISTA) approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It is used for automated test case generation and execution by using high-level Petri net is a finite state test model.
