Generalized assignment problem
View article
The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs Open
In this paper, we present the dynamic Hungarian algorithm, applicable to optimally solving the assignment problem in situations with changing edge costs or weights. This problem is relevant, for example, in a transportation domain where th…
View article
Bilevel Knapsack with Interdiction Constraints Open
We consider a bilevel integer programming model that extends the classic 0–1 knapsack problem in a very natural way. The model describes a Stackelberg game where the leader’s decision interdicts a subset of the knapsack items for the follo…
View article
Deep Neural Networks for Linear Sum Assignment Problems Open
Many resource allocation issues in wireless communications can be modeled as assignment problems and can be solved online with global information. However, traditional methods for assignment problems take a lot of time to find the optimal …
View article
Hierarchical method of task assignment for multiple cooperating UAV teams Open
The problem of task assignment for multiple cooperating unmanned aerial vehicle (UAV) teams is considered. Multiple UAVs forming several small teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchica…
View article
Solving a dynamic assignment problem in the socio-economic system Open
The deterministic variant of the dynamic assignment problem is considered. The task of finding the path of maximum cost is investigated. Examples of solution the dynamic assignment problem and solving the problem of finding the path of max…
View article
Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem Open
The 0/1 multidimensional knapsack problem is the 0/1 knapsack problem with m constraints which makes it difficult to solve using traditional methods like dynamic programming or branch and bound algorithms. We present a genetic algorithm fo…
View article
Migrating birds optimization (MBO) algorithm to solve knapsack problem Open
This study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of knapsack problem. The knapsack problem which is classified as NP-complete problem is a combinatorial optimization problem.…
View article
The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods Open
We propose a novel mechanism for solving the assignment problem when we have a two sided matching problem with preferences from one side (the agents/reviewers) over the other side (the objects/papers) and both sides have capacity constrain…
View article
Online Task Assignment and Coordination in Multi-Robot Fleets Open
We propose a loosely-coupled framework for integrated task assignment, motion planning, coordination and control of heterogeneous fleets of robots subject to non-cooperative tasks. The approach accounts for the important real-world require…
View article
Multi-UAV Cooperative Task Assignment Based on Half Random Q-Learning Open
Unmanned aerial vehicle (UAV) clusters usually face problems such as complex environments, heterogeneous combat subjects, and realistic interference factors in the course of mission assignment. In order to reduce resource consumption and i…
View article
Knapsack problems with position-dependent item weights or profits Open
We consider three new knapsack problems with variable weights or profits of items, where the weight or profit of an item depends on the position of the item in the sequence of items packed in the knapsack. We show how to solve the problems…
View article
Channel Assignment in Uplink Wireless Communication Using Machine Learning Approach Open
This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. A convex optimization based algorithm is p…
View article
Weapon-Target Assignment Strategy in Joint Combat Decision-Making Based on Multi-Head Deep Reinforcement Learning Open
In response to the modeling difficulties and low search efficiency of traditional weapon-target assignment algorithms, this paper proposes a deep reinforcement learning-based intelligent weapon-target assignment method. A weapon-target int…
View article
Multi-UAV simultaneous target assignment and path planning based on deep reinforcement learning in dynamic multiple obstacles environments Open
Target assignment and path planning are crucial for the cooperativity of multiple unmanned aerial vehicles (UAV) systems. However, it is a challenge considering the dynamics of environments and the partial observability of UAVs. In this ar…
View article
Multi-stage online task assignment driven by offline data under spatio-temporal crowdsourcing Open
In the era of the Internet of Things (IoT), the crowdsourcing process is driven by data collected by devices that interact with each other and with the physical world. As a part of the IoT ecosystem, task assignment has become an important…
View article
Operator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints Open
The assembly process is extremely complex for aircraft and its management requires to address numerous optimization problems related to the assignment of tasks to workstations, staffing problem for each workstation and finally the assignme…
View article
Task Assignment for Multi-UAV under Severe Uncertainty by Using Stochastic Multicriteria Acceptability Analysis Open
This paper considers a task assignment problem for multiple unmanned aerial vehicles (UAVs). The UAVs are set to perform attack tasks on a collection of ground targets in a severe uncertain environment. The UAVs have different attack capab…
View article
DaTask: A Decomposition-Based Deadline-Aware Task Assignment and Workers’ Path-Planning in Mobile Crowd-Sensing Open
Mobile crowd-sensing (MCS) has recently become a promising approach for massive data collection, which empowers common people to perform sensing tasks with their smart devices. In MCS, locations of tasks and workers are diverse, and worker…
View article
A Unified Multi-Objective Optimization Framework for UAV Cooperative Task Assignment and Re-Assignment Open
This paper focuses on cooperative multi-task assignment and re-assignment problems when multiple unmanned aerial vehicles (UAVs) attack multiple known targets. A unified multi-objective optimization framework for UAV cooperative task assig…
View article
A New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function Open
The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety p…
View article
The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods Open
Motivated by the common academic problem of allocating papers to referees for conference reviewing we propose a novel mechanism for solving the assignment problem when we have a two sided matching problem with preferences from one side (th…
View article
A Multi-Target Consensus-Based Auction Algorithm for Distributed Target Assignment in Cooperative Beyond-Visual-Range Air Combat Open
With recent advances in airborne weapons, air combat tends to occur in the form of beyond-visual-range (BVR) combat and multi-aircraft cooperation. Target assignment is critical in multi-aircraft BVR air combat decision-making. Most previo…
View article
Optimizing integrated aircraft assignment and turnaround handling Open
Airlines face many different planning processes until the day of operation. The assignment of aircraft to flights is of central importance and is determined by the optimization of the two planning problems Fleet Assignment and Tail Assignm…
View article
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size Open
The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence. Against this background, we study the expressive power of neural networks throug…
View article
Comparison and Analysis of Algorithms for the 0/1 Knapsack Problem Open
The 0/1 knapsack problem is a typical problem in the field of operational research and combinatorial optimization, and it belongs to the NP problem. Research on the solutions of the 0/1 knapsack problem algorithm has very important practic…
View article
Improved Online Algorithms for Knapsack and GAP in the Random Order Model Open
The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity. In the onli…
View article
Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation Open
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which requ…
View article
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem Open
The discounted {0–1} knapsack problem may be a kind of backpack issue with gathering structure and rebate connections among things. A moth-flame optimization algorithm has shown good searchability combined with an effective solution presen…
View article
A hybrid heuristic algorithm for the sequencing generalized assignment problem in an assembly line Open
International audience
View article
Parallelizing Assignment Problem with DNA Strands. Open
In this article, using DNA computing, we proposed a parallel DNA algorithm to solve the assignment problem in linear time.