| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Izpis gradiva Pomoč

Naslov:Designing efficient algorithms for logistics management : optimizing timeconstrained vehicle routing
Avtorji:ID Bala, Karlo (Avtor)
ID Fale, Martin (Avtor)
ID Gvozdenović, Nebojša (Avtor)
ID Kramberger, Tomaž (Avtor)
ID Brcanov, Dejan (Avtor)
Datoteke:.pdf Bala_2025_Designing_efficient_algorithms.pdf (407,50 KB)
MD5: E466576B3CB6BA16EC00530254BC070C
 
URL https://doi.org/10.5937/StraMan2400018B
 
Jezik:Angleški jezik
Vrsta gradiva:Znanstveno delo
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FL - Fakulteta za logistiko
Opis:Background: City logistics is a critical component of urban economic development, as it optimizes supply chains, enhances customer satisfaction through reliable deliveries, and minimizes environmental impacts in densely populated areas. This field addresses various challenges, including traffic congestion, environmental concerns, noise pollution, and the crucial need for timely deliveries. Routing and scheduling are central to logistics operations, with modern software integrating time windows to meet precise scheduling demands driven by detailed customer requirements and operational efficiencies. Furthermore, advanced vehicle routing models now effectively simulate real-world factors such as traffic congestion, stochastic travel times, and dynamic product demands. Purpose: This paper aims to develop an algorithm that addresses the routing decisions. Our approach extends to the time dimension, considering travel times and customer service times within predefined time windows. Study design/methodology/approach: The proposed algorithm is structured to execute in iterative phases, aiming to optimize key logistical objectives. In order to generate competitive solutions, we seek to minimize the number of vehicles utilized and overall travel costs. The evaluation of solution space was conducted via Simulated Annealing. Findings/conclusions: The performance of the proposed algorithm, evaluated using the Gehring and Homberger benchmark instances for 200 customers, demonstrates its effectiveness. The algorithm successfully meets the target number of vehicles required, and the associated travel costs are on average within 1% of the best solutions reported in the relevant literature. Limitations/future research: Given the ongoing need for timely solutions from decision-makers, future research endeavors will focus on enhancing the computational efficiency of the algorithm. Additionally, incorporating more time-related features, such as stochastic travel times, could further improve the algorithm's real-time applicability.
Ključne besede:city logistics, vehicle routing, simulated annealing, time windows, scheduling
Status publikacije:Objavljeno
Verzija publikacije:Objavljena publikacija
Poslano v recenzijo:05.07.2024
Datum sprejetja članka:15.01.2025
Datum objave:11.02.2025
Založnik:University of Novi Sad, Faculty of Economics
Leto izida:2025
Št. strani:11 str.
PID:20.500.12556/DKUM-92297 Novo okno
UDK:005:656.1
COBISS.SI-ID:227110403 Novo okno
DOI:10.5937/StraMan2400018B Novo okno
ISSN pri članku:2334-6191
Opomba:Ključne besede v slovenščini: logistika v mestih, načrtovanje voznih poti, simulirano ohlajanje, časovni okviri, razporejanje nalog (prevedel bibliotekar)
Datum objave v DKUM:27.03.2025
Število ogledov:180
Število prenosov:7
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share



Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Strategic management
Skrajšan naslov:Strateg. manag.
Založnik:University of Novi Sad, Faculty of Economics
ISSN:2334-6191
COBISS.SI-ID:512586301 Novo okno

Gradivo je financirano iz projekta

Financer:Ministry of Education, Science and Technological Development of the Republic of Serbia
Številka projekta:174018
Naslov:Algebraic, logical and combinatorial methods with applications in theoretical computing

Licence

Licenca:CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
Povezava:http://creativecommons.org/licenses/by/4.0/deed.sl
Opis:To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.
Začetek licenciranja:11.02.2025

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici