Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 344400

Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies


Botinčan, Matko; Goranka, Nogo
Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies // Proceedings of 11th International Conference on Operational Research (KOI 2006 - Pula, Croatia, September 27-29, 2006) / Valter Boljunčić, Luka Neralić and Kristina Šorić (ur.).
Zagreb: Hrvatsko društvo za operacijska istraživanja (CRORS), 2008. str. 47-56 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 344400 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies

Autori
Botinčan, Matko ; Goranka, Nogo

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
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), 2008, 47-56

Skup
International Conference on Operational Research (KOI 2006)

Mjesto i datum
Pula, Hrvatska, 27.09.2006. - 29.09.2006

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
anomalies; branch-and-cut; capacitated vehicle routing problem; distributed computing; search strategies

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Projekti:
037-0362980-2774 - Distribuirani algoritmi za pronalaženje optimalnih putova u grafovima (Manger, Robert, MZOS ) ( CroRIS)

Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb

Profili:

Avatar Url Matko Botinčan (autor)

Avatar Url Goranka Nogo (autor)


Citiraj ovu publikaciju:

Botinčan, Matko; Goranka, Nogo
Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies // Proceedings of 11th International Conference on Operational Research (KOI 2006 - Pula, Croatia, September 27-29, 2006) / Valter Boljunčić, Luka Neralić and Kristina Šorić (ur.).
Zagreb: Hrvatsko društvo za operacijska istraživanja (CRORS), 2008. str. 47-56 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Botinčan, M. & Goranka, N. (2008) Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies. U: Valter Boljunčić, L. (ur.)Proceedings of 11th International Conference on Operational Research (KOI 2006 - Pula, Croatia, September 27-29, 2006).
@article{article, author = {Botin\v{c}an, Matko and Goranka, Nogo}, editor = {Valter Boljun\v{c}i\'{c}, L.}, year = {2008}, pages = {47-56}, keywords = {anomalies, branch-and-cut, capacitated vehicle routing problem, distributed computing, search strategies}, title = {Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies}, keyword = {anomalies, branch-and-cut, capacitated vehicle routing problem, distributed computing, search strategies}, publisher = {Hrvatsko dru\v{s}tvo za operacijska istra\v{z}ivanja (CRORS)}, publisherplace = {Pula, Hrvatska} }
@article{article, author = {Botin\v{c}an, Matko and Goranka, Nogo}, editor = {Valter Boljun\v{c}i\'{c}, L.}, year = {2008}, pages = {47-56}, keywords = {anomalies, branch-and-cut, capacitated vehicle routing problem, distributed computing, search strategies}, title = {Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies}, keyword = {anomalies, branch-and-cut, capacitated vehicle routing problem, distributed computing, search strategies}, publisher = {Hrvatsko dru\v{s}tvo za operacijska istra\v{z}ivanja (CRORS)}, publisherplace = {Pula, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font