Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies (CROSBI ID 536862)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Botinčan, Matko ; Goranka, Nogo
engleski
Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies
In this paper, we analyze how different search strategies (namely, the breadth-first, the depth-first and the best-first) influence the execution speed of the parallel branch-and-cut algorithm for solving the capacitated vehicle routing problem. We report anomalous behavior observed as a part of the experimental evaluation of the algorithm and relate to it known theoretical results on anomalies in parallel and on efficiency of search strategies in sequential branch-and-bound algorithms.
anomalies; branch-and-cut; capacitated vehicle routing problem; distributed computing; search strategies
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
47-56.
2008.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of 11th International Conference on Operational Research (KOI 2006 - Pula, Croatia, September 27-29, 2006)
Valter Boljunčić, Luka Neralić and Kristina Šorić
Zagreb: Hrvatsko društvo za operacijska istraživanja (CRORS)
Podaci o skupu
Nepoznat skup
predavanje
29.02.1904-29.02.2096