Pregled bibliografske jedinice broj: 205644
On Distributed Solving of the Capacitated Vehicle Routing Problem with Branch-and-Cut Algorithms
On Distributed Solving of the Capacitated Vehicle Routing Problem with Branch-and-Cut Algorithms // Proceedings of the 8th International Symposium on Operational Research in Slovenia (SOR '05) / Zadnik Stirn, Lidija ; Drobne, Samo (ur.).
Ljubljana: Slovensko društvo informatika, 2005. str. 345-350 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 205644 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On Distributed Solving of the Capacitated Vehicle Routing Problem with Branch-and-Cut Algorithms
Autori
Botinčan, Matko ; Nogo, Goranka
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 8th International Symposium on Operational Research in Slovenia (SOR '05)
/ Zadnik Stirn, Lidija ; Drobne, Samo - Ljubljana : Slovensko društvo informatika, 2005, 345-350
Skup
The 8th International Symposium on Operational Research (SOR'05)
Mjesto i datum
Nova Gorica, Slovenija, 27.09.2005. - 30.09.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
vehicle routing problem; branch-and-cut; distributed computing; experimental evaluation
Sažetak
In this paper, we describe theoretical and implementation issues concerning solving the capacitated vehicle routing problem with branch-and-cut algorithms. A distributed solver for the capacitated vehicle routing problem has been implemented within the branch-and-cut framework SYMPHONY. We present results obtained during experimental evaluation of the solver on a cluster of computers and analyze its scalability.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
0037104
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
