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 ...

Quantum computers of the future hold promise for solving complex problems more quickly than ordinary computers. For example, they can factor large numbers exponentially faster than classical computers ...

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 ...

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 ...