In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...