A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equ...A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.展开更多
To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed ...To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.展开更多
A new fully fuzzy linear programming （FFLP） problem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crisp 6-parametric linear programming （LP） ...A new fully fuzzy linear programming （FFLP） problem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crisp 6-parametric linear programming （LP） problem. Giving the value of deviation degree in each constraint, the 6-fuzzy optimal solution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict： to improve the values of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to illustrate the proposed method.展开更多
With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions ...With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational law...The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational laws of intuitionistic fuzzy numbers are introduced, and the score function and accuracy function are presented to compare the intuitionistic fuzzy numbers. The intuitionistic fuzzy ordered weighted averaging （IFOWA） operator which is an extension of the well-known ordered weighted averaging （OWA） operator is investigated to aggregate the intuitionistic fuzzy information. In order to determine the weights of intuitionistic fuzzy ordered weighted averaging operator, a linear goal programming procedure is proposed for learning the weights from data. Finally, an example is illustrated to verify the effectiveness and practicability of the developed method.展开更多
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc...A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.展开更多
The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a nove...The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.展开更多
It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria...It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria is incomplete certain. A new multiple criteria decision- making method with incomplete certain information based on ternary AHP is proposed. This improves on Takeda＇s method. In this method, the ternary comparison matrix of the alternatives under each pseudo-criteria is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained as to normalize priority vector of the alternatives, then the order of alternatives is obtained by solving two kinds of linear programming problems. Finally, an example is given to show the feasibility and effectiveness of the method.展开更多
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood d...A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.展开更多
Multi-sensor system is becoming increasingly important in a variety of military and civilian applications. In general, single sensor system can only provide partial information about environment while multi-sensor sys...Multi-sensor system is becoming increasingly important in a variety of military and civilian applications. In general, single sensor system can only provide partial information about environment while multi-sensor system provides a synergistic effect, which improves the quality and availability of information. Data fusion techniques can effectively combine this environmental information from similar and/or dissimilar sensors. Sensor management, aiming at improving data fusion performance by controlling sensor behavior, plays an important role in a data fusion process. This paper presents a method using fisher information gain based sensor effectiveness metric for sensor assignment in multi-sensor and multi-target tracking applications. The fisher information gain is computed for every sensor-target pairing on each scan. The advantage for this metric over other ones is that the fisher information gain for the target obtained by multi-sensors is equal to the sum of ones obtained by the individual sensor, so standard transportation problem formulation can be used to solve this problem without importing the concept of pseudo sensor. The simulation results show the effectiveness of the method.展开更多
DEA is a nonparametric method used in operation researches and economics fields for the evaluation of the production frontier. It has distinct intrinsic which is worth coping with assessment problems with multiple inp...DEA is a nonparametric method used in operation researches and economics fields for the evaluation of the production frontier. It has distinct intrinsic which is worth coping with assessment problems with multiple inputs in particular with multiple outputs. This paper used D~ C2 R model of DEA to assess the comparative efficiency of the multiple schemes of agricultural industrial structure, at the end we chose the most favorable also known as ＂OPTIMAL＂ scheme. In addition to this, using some functional insights from DEA model non optimal schemes or less optimal schemes had also been improved to some extent. Assessment and selection of optimal schemes of agricultural industrial structure using DEA model gave a greater and better insight of agricultural industrial structure and was the first of such researches in Pakistan.展开更多
In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such ...In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.展开更多
The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted i...The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.展开更多
This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fau...This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.展开更多
This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodol...This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.展开更多
This article introduces a fleet composition algorithm for a fleet of intermediate carriers, which should deliver a swarm of miniature unmanned aerial vehicles （mini-UAVs） to a mission area. The algorithm is based on...This article introduces a fleet composition algorithm for a fleet of intermediate carriers, which should deliver a swarm of miniature unmanned aerial vehicles （mini-UAVs） to a mission area. The algorithm is based on the sequential solution of several knapsack problems with various constraints. The algorithm allows both to form an initial set of required types of intermediate carriers, and to generate a fleet of intermediate carriers. The formation of a fleet of intermediate carriers to solve a suppression of enemy air defense （SEAD） problem is presented to illustrate the proposed algorithm.展开更多
A novel method for decision making with fuzzy probability assessments and fuzzy payoff is presented. The consistency of the fuzzy probability assessment is considered. A fuzzy aggregate algorithm is used to indicate t...A novel method for decision making with fuzzy probability assessments and fuzzy payoff is presented. The consistency of the fuzzy probability assessment is considered. A fuzzy aggregate algorithm is used to indicate the fuzzy expected payoff of alternatives. The level sets of each fuzzy expected payoff are then obtained by solving linear programming models. Based on a defuzzification function associated with the level sets of fuzzy number and a numerical integration formula (Newton-Cotes formula), an effective approach to rank the fuzzy expected payoff of alternatives is also developed to determine the best alternative. Finally, a numerical example is provided to illustrate the proposed method.展开更多
To strengthen border patrol measures, unmanned aerial vehicles(UAVs) are gradually used in many countries to detect illegal entries on borders. However, how to efficiently deploy limited UAVs to patrol on borders of l...To strengthen border patrol measures, unmanned aerial vehicles(UAVs) are gradually used in many countries to detect illegal entries on borders. However, how to efficiently deploy limited UAVs to patrol on borders of large areas remains challenging. In this paper, we first model the problem of deploying UAVs for border patrol as a Stackelberg game. Two players are considered in this game: The border patrol agency is the leader,who optimizes the patrol path of UAVs to detect the illegal immigrant. The illegal immigrant is the follower, who selects a certain area of the border to pass through at a certain time after observing the leader’s strategy. Second, a compact linear programming problem is proposed to tackle the exponential growth of the number of leader’s strategies. Third, a method is proposed to reduce the size of the strategy space of the follower. Then, we provide some theoretic results to present the effect of parameters of the model on leader’s utilities. Experimental results demonstrate the positive effect of limited starting and ending areas of UAV’s patrolling conditions and multiple patrolling altitudes on the leader ’s utility, and show that the proposed solution outperforms two conventional patrol strategies and has strong robustness.展开更多
基金supported by the National Natural Science Foundation of China(70771080)the Special Fund for Basic Scientific Research of Central Colleges+2 种基金China University of Geosciences(Wuhan) (CUG090113)the Research Foundation for Outstanding Young TeachersChina University of Geosciences(Wuhan)(CUGQNW0801)
文摘A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.
基金the National Natural Science Foundation of China (70471074)China Postdoctoral Science Foundation(2005038042)Department of Science and Technology of Guangdong Province(2004B36001051).
文摘To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.
基金supported by the National Natural Science Foundation of China(71202140)the Fundamental Research for the Central Universities(HUST:2013QN099)
文摘A new fully fuzzy linear programming （FFLP） problem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crisp 6-parametric linear programming （LP） problem. Giving the value of deviation degree in each constraint, the 6-fuzzy optimal solution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict： to improve the values of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to illustrate the proposed method.
文摘With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (70771025)the Fundamental Research Funds for the Central Universities of Hohai University (2009B04514)Humanities and Social Sciences Foundations of Ministry of Education of China(10YJA630067)
文摘The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational laws of intuitionistic fuzzy numbers are introduced, and the score function and accuracy function are presented to compare the intuitionistic fuzzy numbers. The intuitionistic fuzzy ordered weighted averaging （IFOWA） operator which is an extension of the well-known ordered weighted averaging （OWA） operator is investigated to aggregate the intuitionistic fuzzy information. In order to determine the weights of intuitionistic fuzzy ordered weighted averaging operator, a linear goal programming procedure is proposed for learning the weights from data. Finally, an example is illustrated to verify the effectiveness and practicability of the developed method.
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)the Fundamental Research Funds for the Central Universities(K50511700004)
文摘A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.
基金Fundamental Research Funds for the Central Universities(2024JBZX038)National Natural Science F oundation of China(62076023)。
文摘The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.
文摘It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria is incomplete certain. A new multiple criteria decision- making method with incomplete certain information based on ternary AHP is proposed. This improves on Takeda＇s method. In this method, the ternary comparison matrix of the alternatives under each pseudo-criteria is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained as to normalize priority vector of the alternatives, then the order of alternatives is obtained by solving two kinds of linear programming problems. Finally, an example is given to show the feasibility and effectiveness of the method.
基金This project was supported by the National Natural Science Foundation of China (60272024).
文摘A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
文摘Multi-sensor system is becoming increasingly important in a variety of military and civilian applications. In general, single sensor system can only provide partial information about environment while multi-sensor system provides a synergistic effect, which improves the quality and availability of information. Data fusion techniques can effectively combine this environmental information from similar and/or dissimilar sensors. Sensor management, aiming at improving data fusion performance by controlling sensor behavior, plays an important role in a data fusion process. This paper presents a method using fisher information gain based sensor effectiveness metric for sensor assignment in multi-sensor and multi-target tracking applications. The fisher information gain is computed for every sensor-target pairing on each scan. The advantage for this metric over other ones is that the fisher information gain for the target obtained by multi-sensors is equal to the sum of ones obtained by the individual sensor, so standard transportation problem formulation can be used to solve this problem without importing the concept of pseudo sensor. The simulation results show the effectiveness of the method.
文摘DEA is a nonparametric method used in operation researches and economics fields for the evaluation of the production frontier. It has distinct intrinsic which is worth coping with assessment problems with multiple inputs in particular with multiple outputs. This paper used D~ C2 R model of DEA to assess the comparative efficiency of the multiple schemes of agricultural industrial structure, at the end we chose the most favorable also known as ＂OPTIMAL＂ scheme. In addition to this, using some functional insights from DEA model non optimal schemes or less optimal schemes had also been improved to some extent. Assessment and selection of optimal schemes of agricultural industrial structure using DEA model gave a greater and better insight of agricultural industrial structure and was the first of such researches in Pakistan.
基金Projects(61272139,61070199,61103182)supported by the National Natural Science Foundation of ChinaProject(2013ZX01028001-002)supported by the National Science and Technology Major Projects of China+1 种基金Project(2011AA01A103)supported by theNational High-Tech Research and Development Plan of ChinaProject(11JJ7003)supported by Hunan Provincial Natural ScienceFoundation of China
文摘In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.
基金Project(2011AA060407) supported by the National High Technology Research and Development Program of ChinaProject(51074073) supported by the National Natural Science Foundation of China
文摘The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.
基金supported by the National Natural Science Foundation of China(61473144)
文摘This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.
基金supported by the National Natural Sciences Foundation of China(6113200261321061+3 种基金6123101161201183)the National Basic Research Program of China(2014CB340206)the Tsinghua University Initiative Scientific Research Program(2011Z05117)
文摘This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.
基金supported by the National Natural Science Foundation of China(60774064)the Aerospace Science Foundation (20085153015)
文摘This article introduces a fleet composition algorithm for a fleet of intermediate carriers, which should deliver a swarm of miniature unmanned aerial vehicles （mini-UAVs） to a mission area. The algorithm is based on the sequential solution of several knapsack problems with various constraints. The algorithm allows both to form an initial set of required types of intermediate carriers, and to generate a fleet of intermediate carriers. The formation of a fleet of intermediate carriers to solve a suppression of enemy air defense （SEAD） problem is presented to illustrate the proposed algorithm.
文摘A novel method for decision making with fuzzy probability assessments and fuzzy payoff is presented. The consistency of the fuzzy probability assessment is considered. A fuzzy aggregate algorithm is used to indicate the fuzzy expected payoff of alternatives. The level sets of each fuzzy expected payoff are then obtained by solving linear programming models. Based on a defuzzification function associated with the level sets of fuzzy number and a numerical integration formula (Newton-Cotes formula), an effective approach to rank the fuzzy expected payoff of alternatives is also developed to determine the best alternative. Finally, a numerical example is provided to illustrate the proposed method.
基金supported by the National Natural Science Foundation of China (71971075,71871079)the National Key Research and Development Program of China (2019YFE0110300)+1 种基金the Anhui Provincial Natural Science Foundation (1808085MG213)the Fundamental R esearch Funds for the Central Universities (PA2019GDPK0082)。
文摘To strengthen border patrol measures, unmanned aerial vehicles(UAVs) are gradually used in many countries to detect illegal entries on borders. However, how to efficiently deploy limited UAVs to patrol on borders of large areas remains challenging. In this paper, we first model the problem of deploying UAVs for border patrol as a Stackelberg game. Two players are considered in this game: The border patrol agency is the leader,who optimizes the patrol path of UAVs to detect the illegal immigrant. The illegal immigrant is the follower, who selects a certain area of the border to pass through at a certain time after observing the leader’s strategy. Second, a compact linear programming problem is proposed to tackle the exponential growth of the number of leader’s strategies. Third, a method is proposed to reduce the size of the strategy space of the follower. Then, we provide some theoretic results to present the effect of parameters of the model on leader’s utilities. Experimental results demonstrate the positive effect of limited starting and ending areas of UAV’s patrolling conditions and multiple patrolling altitudes on the leader ’s utility, and show that the proposed solution outperforms two conventional patrol strategies and has strong robustness.
