Pregled bibliografske jedinice broj: 275339
Assessment of Heuristic Algorithms for Solving Real Capacitated Vehicle Routing Problems by Analytic Hierarchy Process
Assessment of Heuristic Algorithms for Solving Real Capacitated Vehicle Routing Problems by Analytic Hierarchy Process // Proceedings of the 12th World International Congress on Intelligent Transport Systems
San Francisco (CA), 2009. str. 3172-3185 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 275339 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Assessment of Heuristic Algorithms for Solving Real Capacitated Vehicle Routing Problems by Analytic Hierarchy Process
(Assessment of heuristic algorithms for solving the real capacitated vehicle routing problems)
Autori
Ćavar, Ivana ; Carić, Tonči ; Gold, Hrvoje
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 12th World International Congress on Intelligent Transport Systems
/ - San Francisco (CA), 2009, 3172-3185
ISBN
978-160423635-4
Skup
12th World Congress on Intelligent Transport Systems 2005
Mjesto i datum
San Francisco (CA), Sjedinjene Američke Države, 06.11.2005. - 10.11.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
fleet management ; vehicle routing problem ; analytic hierarchy process ; heuristic
Sažetak
In solving the real-world transport tasks, it is not easy to set up the real problem within the frames of mathematically defined vehicle routing problems (VRP). There are also difficulties in selecting the algorithm that could give the optimal solution of the classified problem. Using the real vehicle routing problem six constructive algorithms were developed and for each algorithm five optimisations i.e. local searches were performed. All calculations were made by using the interactive software environment Venera, and the algorithms were written in the programming language Mars. The solutions have been assessed and inter-compared by means of analytic hierarchy process. For the same problem, the location of the depot in relation to the user cluster was changed. Six mentioned algorithms were performed on the newly created problem, and the newly obtained solutions were analyzed in relation to the previous location of the depot. The following factors were taken into consideration: the number of vehicles, the time necessary to calculate the route and the overall travelled distance of the vehicle fleet. It has been determined that there is dependence of the solutions obtained by certain algorithms regarding the location of the depot with regard to the customers as well as the possibility of achieving savings by changing the location of the depot.
Izvorni jezik
Engleski
Znanstvena područja
Tehnologija prometa i transport
POVEZANOST RADA
Ustanove:
Fakultet prometnih znanosti, Zagreb
Citiraj ovu publikaciju:
Časopis indeksira:
- Scopus