In this paper, we present some initial results of several meta-heuristic optimization
algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic …

With the rapid development of mobile applications, mobile edge computing (MEC), which
provides various cloud resources (eg, computation and storage resources) closer to mobile …

1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the
aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint …

European transmission system operators are facing challenging times in the next decade as
majority of their transmission overhead lines are reaching the end of their projected lifetime …

In cloud computing, the virtual machine placement is a critical process which aims to identify
the most appropriate physical machine to host the virtual machine. It has a significant impact …

ABSTRACT Maximum Flow Problem (MFP) is deemed as one of several well-known basic
problems in weighted direct graphs [9]. Moreover, it can be applied to many applications in …

A new framework for Off-Earth mining method selection is proposed based on theoretical
equipment reliability and axiomatic design principles. This enables categorisation of mining …

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily.
One of the dynamic programming algorithm implementations consists of solving the 0/1 …

The advent of advanced multi-tasking machines (MTMs) in the metalworking industry has
provided the opportunity for more efficient parallel machining as compared to traditional …

Hybrid quantum-classical algorithms such as the Quantum Approximate Optimization
Algorithm (QAOA) are considered as one of the most encouraging approaches for taking …