Search academic resources

Metaheuristics Algorithms are widely recognized as one of most practical approaches for Combinatorial Optimization Problems. This paper presents a comparison between two metaheuristics to solve a problem of Phase Bal...

Ising machines are novel computing devices for the energy minimization of Ising models. These combinatorial optimization problems are of paramount importance for science and technology, but remain difficult to tackle on ...

El problema de programación flexible del taller de trabajos (FJSSP) es uno de los problemas de optimización combinatoria más desafiantes, con aplicabilidad práctica en un entorno de producción real. En este trabajo,...

The portfolio optimization problem is a mathematical and financial decision-making method that aims to achieve an optimal trade-off between financial risk and return. This paper presents the first application of the nove...

In recent years, there has been a growing interest in optical simulation of lattice spin models for applications in unconventional computing. Here, we propose optical implementation of a three-state Potts spin model by u...

The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on...

Subjects / keywords: Metaheuristics; Operations research; Combinatorial optimization; Approximation theory

Subjects / keywords: graphs and hypergraphs, network theory, combinatorial optimization, coding theory, block designs; Science: Mathematics

BackgroundLast-mile logistics accounts for approximately 28% of total logistics costs and is a major contributor to urban carbon emissions. The integration of drones with electric trucks offers a path toward more efficie...