Pregled bibliografske jedinice broj: 291905
Distributed Solving of Bakery Products Delivery Problem
Distributed Solving of Bakery Products Delivery Problem // Joint Conference Of The Canadian Operational Research Society And Optimization Days
Montréal, 2006. str. 59-60 (predavanje, međunarodna recenzija, sažetak, znanstveni)
CROSBI ID: 291905 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Distributed Solving of Bakery Products Delivery Problem
Autori
Galić, Ante ; Carić, Tonči ; Fosin, Juraj
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni
Izvornik
Joint Conference Of The Canadian Operational Research Society And Optimization Days
/ - Montréal, 2006, 59-60
Skup
Joint Conference Of The Canadian Operational Research Society And Optimization Days
Mjesto i datum
Montréal, Kanada, 08.05.2006. - 10.05.2006
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
VRP; routing; bakery; delivery; optimization
Sažetak
In the city of Zagreb, Capital of Croatia, bakery company daily delivers bread, rolls and other bakery products to customers which have their specific quantity demands and time periods in which delivery must start. Delivery is performed with heterogeneous fleet of vehicles where each vehicle has its own predefined time of depot leaving. All customers are geocoded on the digital city map with transport layer (one-way streets, prohibited turns) thus making possible to calculate asymmetric matrix of minimal distances between them. Also, asymmetric matrix of approximate minimal travel times between customers is calculated where the predicted travel times are based on street categorisation and statistics from historical data included in the digital map. Initial solution obtained using coefficient weighted time-distance heuristics was improved using λ -interchange algorithm. Also, simulated annealing method was used to escape local optima. Algorithms have been implemented in developed programming language which facilitates the writing of algorithms for solving VRP problems. In order to speed up the problem solving procedure, distributed versions of algorithms were implemented. Four times speed-up achieved on cluster of five networked computers was gained using distributed versions of algorithms. Currently, the company uses routes that are constructed manually where experience of dispatcher and drivers plays the main role. On the other side, obtained results shows that it is possible to reduce expenses up to 35% in total travelled distance using computer aided routing system.
Izvorni jezik
Engleski
Znanstvena područja
Tehnologija prometa i transport
POVEZANOST RADA
Ustanove:
Fakultet prometnih znanosti, Zagreb