In recent years, the prospect of real-world quantum computing has raised hopes for solving hard combinatorial optimisation problems, leading to tremendous theoretical work on developing and analysing ...

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

Abstract: With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management.

This repository contains a set of 1787 feasible instances for the 0-1 Knapsack Problem with Group Fairness. The instances are in folder instances and the generator used to create them is in folder ...

Yash is an aspiring computer science student who loves to build things and write about all things tech. In his free time, he likes to play Squash, read a copy of the latest Murakami, and hunt dragons ...

The Dynamic Vehicle Routing Problem with Stochastic Requests (DVRPSR) is a prototypical problem in transportation logistics. The DVRPSR calls for an initial route plan and an online scheduling policy ...