By Topic

On the Flexible Demand Assignment Problems: Case of Unmanned Aerial Vehicles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bahram Alidaee ; School of business administration, The University of Mississippi, University, MS, USA ; Haibo Wang ; Frank Landram

Multiresource generalized assignment problem (MRGAP) has enormous applications in solving real problems of industries. In recent years, several generalizations of MRGAP have been proposed to tackle very difficult problems. An important generalization is called flexible demand assignment (FDA) problem. In this paper, a generalization of FDA is proposed that has many applications. Two features of our formulation are inclusion of: 1) acceptance of orders from a large set of available orders and 2) consideration of setup time between operations of two consecutive of tasks. We show an interesting application of generalized FDA is unmanned aerial vehicle (UAV) assignment problem. For the UAV assignment problem, we show our formulation considerably reduces the size of the problem compared to some recent results. To test effectiveness of the proposed model, computational experiment with CPLEX for the UAV assignment problem is presented.

Published in:

IEEE Transactions on Automation Science and Engineering  (Volume:8 ,  Issue: 4 )