The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
Andrew Runka, Beatrice M. Ombuki-Berman, Mario Ven...
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...