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

Napredna pretraga

Pregled bibliografske jedinice broj: 602946

Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms


Taner, Filip; Galić, Ante; Carić Tonči
Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms // Promet-Traffic & Transportation, 24 (2012), 343-351 (međunarodna recenzija, članak, znanstveni)


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

Naslov
Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

Autori
Taner, Filip ; Galić, Ante ; Carić Tonči

Izvornik
Promet-Traffic & Transportation (0353-5320) 24 (2012); 343-351

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Problem usmjeravanja vozila; metaheuristike; iterativna lokalna pretraga; simulirano kaljenje
(vehicle routing problem; metaheuristics; iterated local search; simulated annealing)

Sažetak
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.

Izvorni jezik
Engleski

Znanstvena područja
Tehnologija prometa i transport



POVEZANOST RADA


Ustanove
Fakultet prometnih znanosti, Zagreb

Profili:

Avatar Url Tonči Carić (autor)

Avatar Url Ante Galić (autor)

Citiraj ovu publikaciju

Taner, Filip; Galić, Ante; Carić Tonči
Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms // Promet-Traffic & Transportation, 24 (2012), 343-351 (međunarodna recenzija, članak, znanstveni)
Taner, F., Galić, A. & Carić Tonči (2012) Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms. Promet-Traffic & Transportation, 24, 343-351.
@article{article, year = {2012}, pages = {343-351}, keywords = {vehicle routing problem, metaheuristics, iterated local search, simulated annealing}, journal = {Promet-Traffic and Transportation}, volume = {24}, issn = {0353-5320}, title = {Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms}, keyword = {vehicle routing problem, metaheuristics, iterated local search, simulated annealing} }

Časopis indeksira:


  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus





Contrast
Increase Font
Decrease Font
Dyslexic Font