In this project, I implemented with Python the solutions of the scheduling problem using different methods, the metaheuristic : genetic algorithm and secondly the dynamic programming.

We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine. The ...

1 Transportation Engineering College, Dalian Maritime University, Dalian, China. 2 School of Maritime Economics and Management, Dalian Maritime University, Dalian, China. With the development of the ...

Big O - upper bound Big Omega - lower bound Big Theta - upper and lower bound - that's what's usually used but called Big O. An ArrayList is implemented with an array. When the array hits capacity, ...

Abstract: Traveling salesman problem (TSP) is a problem of determining the shortest path for a salesman to take to visit all cities. Although a small number of cities is easy to solve, as the number ...

We report on laser drilling borehole arrays using ultrashort pulsed lasers with a particular focus on reducing the inadvertent heat accumulation across the workpiece by optimizing the drilling ...