Pregled bibliografske jedinice broj: 142953
HYBRID CHAINS OF HEURISTIC METHODS FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
HYBRID CHAINS OF HEURISTIC METHODS FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS // ANNALS OF DAAAM FOR 2003 & PROCEEDINGS / B.KATALINIC (ur.).
Beč: Published by DAAAM International, 2003. str. 81-82 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 142953 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
HYBRID CHAINS OF HEURISTIC METHODS FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
Autori
Carić, Tonči ; Ivaković, Čedomir ; Protega, Veselko ;
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
ANNALS OF DAAAM FOR 2003 & PROCEEDINGS
/ B.KATALINIC - Beč : Published by DAAAM International, 2003, 81-82
Skup
14th INTERNATIONAL DAAAM SYMPOSIUM"INTELLIGENT MANUFACTURING & AUTOMATION:FOCUS ON RECONSTRUCTION AND DEVELIOPMENT"
Mjesto i datum
Sarajevo, Bosna i Hercegovina, 22.10.2003. - 25.10.2003
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
VRP; optimization; heuristic methods; algorithms
Sažetak
Vehicle Routing Problem with Time Windows, (VRPTW)cannot always be solved generally and exactly.In actual applications this problem is solved heuristically.This paper provides proposals of new modifications of the exiting heuristic methods.By combining the methods so that the output of one method becomes the initial solution of another, a hybrid chain of heuristic methods is created.The methods are developed in the environment of Java programming language and tested on the Solomon's testing set of problems.
Izvorni jezik
Engleski
Znanstvena područja
Tehnologija prometa i transport
POVEZANOST RADA
Ustanove:
Fakultet prometnih znanosti, Zagreb
