A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
A Kreß, F Kiel, J Metternich - 2021 - tuprints.ulb.tu-darmstadt.de
This paper offers an exact algorithm for one of the most complex members of the Knapsack
Problem family: The Multiple-choice Multidimensional Knapsack Problem (MMKP). Based …
Problem family: The Multiple-choice Multidimensional Knapsack Problem (MMKP). Based …
Collaborative A*-Market-based Intelligent Planning Algorithm for Multi-Spraying Robots
L Liang, YY Chen - 2023 35th Chinese Control and Decision …, 2023 - ieeexplore.ieee.org
This paper addresses the cooperative path planning problem of multi-spraying robots with
rectangular spraying areas, where obstacles are the rectangular spraying areas that are …
rectangular spraying areas, where obstacles are the rectangular spraying areas that are …
[PDF][PDF] Organic Self-Adaptable Real-Time Applications
L Khaluf, FJ Rammig - the fifteenth international conference on …, 2019 - personales.upv.es
Nowadays, computing systems tend to find inspiration for their behavior in organic systems.
Approaches have been published to develop a system behavior with the potential to react to …
Approaches have been published to develop a system behavior with the potential to react to …
[PDF][PDF] An Algorithmic Solution for Adaptable Real-Time Applications
L Khaluf, FJ Rammig - personales.upv.es
Most real-life facilities nowadays belong to real-time systems. Eg, airplanes, trains, cars,
medical machines, alarming systems and robotics, etc. Some of these systems behave on …
medical machines, alarming systems and robotics, etc. Some of these systems behave on …
A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems
M Mahrueyan - 2017 - pantheon.ufrj.br
The EigenAnt algorithm has recently been introduced to solve the problem of finding the
shortest path between two nodes by using dynamics involving local pheromone …
shortest path between two nodes by using dynamics involving local pheromone …