How to allocate a resource efficiently and fairly attracts the attention of both researchers and practitioners. Data envelopment analysis（DEA） has been brought to bear on its solution. The existing literature applie...How to allocate a resource efficiently and fairly attracts the attention of both researchers and practitioners. Data envelopment analysis（DEA） has been brought to bear on its solution. The existing literature applies Gini coefficient to measure the fairness in the resource allocation process. However, the Gini coefficient is inapplicable in many applications. This paper proposes a novel centralized resource allocation model based on DEA that considers both the efficiency and the fairness. This paper adopts a notion of fairness, namely α-fairness that is well studied in welfare economics and is of practical significance. The new model integratesα-fairness with DEA to support resource allocation decisions. It aids decision makers in making a trade-off between the efficiency and the fairness. An illustrative application is used to validate the proposed approach.展开更多
As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in mult...As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.展开更多
This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission...This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission area, the targets can intermittently obtain the position information of the UAVs from sensing devices, and take appropriate actions to increase the distance between themselves and the UAVs. Aiming at this problem, an environment model is established using the search map, and the updating method of the search map is extended by considering the sensing capabilities of the moving targets. A multi-UAV search path planning optimization model based on the model predictive control (MPC) method is constructed, and a hybrid particle swarm optimization algorithm with a crossover operator is designed to solve the model. Simulation results show that the proposed method can effectively improve the cooperative search efficiency and can find more targets per unit time compared with the coverage search method and the random search method.展开更多
The earth observation satellites(EOSs)scheduling problem for emergency tasks often presents many challenges.For example,the scheduling calculation should be completed in seconds,the scheduled task rate is supposed to ...The earth observation satellites(EOSs)scheduling problem for emergency tasks often presents many challenges.For example,the scheduling calculation should be completed in seconds,the scheduled task rate is supposed to be as high as possible,the disturbance measure of the scheme should be as low as possible,which may lead to the loss of important observation opportunities and data transmission delays.Existing scheduling algorithms are not designed for these requirements.Consequently,we propose a rolling horizon strategy(RHS)based on event triggering as well as a heuristic algorithm based on direct insertion,shifting,backtracking,deletion,and reinsertion(ISBDR).In the RHS,the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term,large-scale problem into a short-term,small-scale problem,which can improve the schedulability of the original scheduling scheme and emergency response sensitivity.In the ISBDR algorithm,the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency tasks.Simultaneously,two heuristic factors,namely the emergency task urgency degree and task conflict degree,are constructed to improve the emergency task scheduling guidance and algorithm efficiency.Finally,we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion,shifting,deletion,and reinsertion(ISDR).The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance,and decrease the disturbance measure of the scheme,therefore,it is more suitable for emergency task scheduling.展开更多
As unmanned aerial vehicles(UAVs) are used more and more in military operations, increasing their level of autonomous decision making becomes necessary. In uncertain battlefield environments, when making sovereign dec...As unmanned aerial vehicles(UAVs) are used more and more in military operations, increasing their level of autonomous decision making becomes necessary. In uncertain battlefield environments, when making sovereign decisions, UAVs must choose low-risk options. An integrated framework is proposed for UAV robust decision making in air-to-ground attack missions under severe uncertainty. In the offline part of the framework, the battlefield scenarios are analyzed and an influence diagram is built to represent the decision situation. In the online part, the UAV evaluates the alternative actions for every scenario, and then the optimal robust action is chosen, using the robust decision model. Results of simulation show that the proposed approach is feasible and effective. The framework can support UAVs in making independent robust decisions under circumstances which require immediate responses under severe uncertainty, and it can also be extended to applications in more complex situations.展开更多
Air-to-air combat tactical decisions for multiple unmanned aerial vehicles(ACTDMU)are a key decision-making step in beyond visual range combat.Complex influencing factors,strong antagonism and real-time requirements n...Air-to-air combat tactical decisions for multiple unmanned aerial vehicles(ACTDMU)are a key decision-making step in beyond visual range combat.Complex influencing factors,strong antagonism and real-time requirements need to be considered in the ACTDMU problem.In this paper,we propose a multicriteria game approach to ACTDMU.This approach consists of a multicriteria game model and a Pareto Nash equilibrium algorithm.In this model,we form the strategy profiles for the integration of air-to-air combat tactics and weapon target assignment strategies by considering the correlation between them,and we design the vector payoff functions based on predominance factors.We propose a algorithm of Pareto Nash equilibrium based on preference relations using threshold constraints(PNE-PRTC),and we prove that the solutions obtained by this algorithm are refinements of Pareto Nash equilibrium solutions.The numerical experiments indicate that PNE-PRTC algorithm is considerably faster than the baseline algorithms and the performance is better.Especially on large-scale instances,the Pareto Nash equilibrium solutions can be calculated by PNEPRTC algorithm at the second level.The simulation experiments show that the multicriteria game approach is more effective than one-side decision approaches such as multiple-attribute decision-making and randomly chosen decisions.展开更多
This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,proce...This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.展开更多
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.展开更多
基金Manuscript received March 5, 2010 accepted March 2, 2011 Supported by National Natural Science Foundation of China （61004103）, National Research Foundation for the Doctoral Program of Higher Education of China （20100111110005）, China Postdoctoral Science Foundation （20090460742）, and Natural Science Foundation of Anhui Province of China （090412058, 11040606Q44）
基金supported by the National Natural Science Foundation of China(7117118171301155)+1 种基金the Fundamental Research Fundsfor the Central Universities(WK2040160008J2014HGBZ0172)
文摘How to allocate a resource efficiently and fairly attracts the attention of both researchers and practitioners. Data envelopment analysis（DEA） has been brought to bear on its solution. The existing literature applies Gini coefficient to measure the fairness in the resource allocation process. However, the Gini coefficient is inapplicable in many applications. This paper proposes a novel centralized resource allocation model based on DEA that considers both the efficiency and the fairness. This paper adopts a notion of fairness, namely α-fairness that is well studied in welfare economics and is of practical significance. The new model integratesα-fairness with DEA to support resource allocation decisions. It aids decision makers in making a trade-off between the efficiency and the fairness. An illustrative application is used to validate the proposed approach.
文摘As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.
基金supported by the National Natural Science Foundation of China(7140104871671059)the National Natural Science Funds of China for Innovative Research Groups(71521001)
文摘This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission area, the targets can intermittently obtain the position information of the UAVs from sensing devices, and take appropriate actions to increase the distance between themselves and the UAVs. Aiming at this problem, an environment model is established using the search map, and the updating method of the search map is extended by considering the sensing capabilities of the moving targets. A multi-UAV search path planning optimization model based on the model predictive control (MPC) method is constructed, and a hybrid particle swarm optimization algorithm with a crossover operator is designed to solve the model. Simulation results show that the proposed method can effectively improve the cooperative search efficiency and can find more targets per unit time compared with the coverage search method and the random search method.
基金supported by the National Natural Science Foundation of China(71671059)
文摘The earth observation satellites(EOSs)scheduling problem for emergency tasks often presents many challenges.For example,the scheduling calculation should be completed in seconds,the scheduled task rate is supposed to be as high as possible,the disturbance measure of the scheme should be as low as possible,which may lead to the loss of important observation opportunities and data transmission delays.Existing scheduling algorithms are not designed for these requirements.Consequently,we propose a rolling horizon strategy(RHS)based on event triggering as well as a heuristic algorithm based on direct insertion,shifting,backtracking,deletion,and reinsertion(ISBDR).In the RHS,the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term,large-scale problem into a short-term,small-scale problem,which can improve the schedulability of the original scheduling scheme and emergency response sensitivity.In the ISBDR algorithm,the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency tasks.Simultaneously,two heuristic factors,namely the emergency task urgency degree and task conflict degree,are constructed to improve the emergency task scheduling guidance and algorithm efficiency.Finally,we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion,shifting,deletion,and reinsertion(ISDR).The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance,and decrease the disturbance measure of the scheme,therefore,it is more suitable for emergency task scheduling.
基金Projects(7113100271401048)supported by the National Natural Science Foundation of China+1 种基金Project(13YJC630051)supported by the Humanities and Social Science Program of Ministry of Education of ChinaProject(2012HGZY0009)supported by the Fundamental Research Funds for the Central Universities of China
文摘As unmanned aerial vehicles(UAVs) are used more and more in military operations, increasing their level of autonomous decision making becomes necessary. In uncertain battlefield environments, when making sovereign decisions, UAVs must choose low-risk options. An integrated framework is proposed for UAV robust decision making in air-to-ground attack missions under severe uncertainty. In the offline part of the framework, the battlefield scenarios are analyzed and an influence diagram is built to represent the decision situation. In the online part, the UAV evaluates the alternative actions for every scenario, and then the optimal robust action is chosen, using the robust decision model. Results of simulation show that the proposed approach is feasible and effective. The framework can support UAVs in making independent robust decisions under circumstances which require immediate responses under severe uncertainty, and it can also be extended to applications in more complex situations.
基金the National Natural Science Foundation of China(71971075,71871079,71671059)the Anhui Provincial Natural Science Foundation(1808085MG213).
文摘Air-to-air combat tactical decisions for multiple unmanned aerial vehicles(ACTDMU)are a key decision-making step in beyond visual range combat.Complex influencing factors,strong antagonism and real-time requirements need to be considered in the ACTDMU problem.In this paper,we propose a multicriteria game approach to ACTDMU.This approach consists of a multicriteria game model and a Pareto Nash equilibrium algorithm.In this model,we form the strategy profiles for the integration of air-to-air combat tactics and weapon target assignment strategies by considering the correlation between them,and we design the vector payoff functions based on predominance factors.We propose a algorithm of Pareto Nash equilibrium based on preference relations using threshold constraints(PNE-PRTC),and we prove that the solutions obtained by this algorithm are refinements of Pareto Nash equilibrium solutions.The numerical experiments indicate that PNE-PRTC algorithm is considerably faster than the baseline algorithms and the performance is better.Especially on large-scale instances,the Pareto Nash equilibrium solutions can be calculated by PNEPRTC algorithm at the second level.The simulation experiments show that the multicriteria game approach is more effective than one-side decision approaches such as multiple-attribute decision-making and randomly chosen decisions.
基金supported by the National Natural Science Foundation of China (7087103290924021+2 种基金70971035)the National High Technology Research and Development Program of China (863 Program) (2008AA042901)Anhui Provincial Natural Science Foundation (11040606Q27)
文摘This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.
基金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.
