This is a preview. Log in through your library . Abstract The soft-clustered vehicle routing problem (Soft-CluVRP) is a relaxation of the clustered vehicle routing problem (CluVRP), which in turn is a ...

We describe a genetic algorithm (GA) for designing efficient search paths, against a moving target, in complicated environments. The immediate application is acoustic search for submarines, but the ...

Research teams from energy giant ExxonMobil and IBM have been working together to find quantum solutions to one of the most complex problems of our time: managing the tens of thousands of merchant ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...