<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=177363"><dc:title>Optimizing sustainable hub depot locations for empty container logistics in Slovenia using particle swarm optimization</dc:title><dc:creator>Tuljak Suban,	Danijela	(Avtor)
	</dc:creator><dc:subject>particle swarm optimization</dc:subject><dc:subject>empty container repositioning</dc:subject><dc:subject>hub depot</dc:subject><dc:subject>optimization</dc:subject><dc:subject>minimizing CO2 emissions</dc:subject><dc:subject>energy science and technology</dc:subject><dc:subject>mathematics and computing</dc:subject><dc:description>Containers account for 16% of all tonnage transported by sea. Therefore, the efficient repositioning of empty containers is a necessary, albeit often unprofitable, activity. This process supports both the local and global efficiency of container transport, especially given the significant imbalance in container flows from Asia to Europe. The transport sector is responsible for 21.2% of total CO2 emissions, making Empty Container Repositioning (ECR) crucial from an environmental perspective. Efficient repositioning and the identification of an optimal location for an empty container depot are crucial problems that can be effectively solved within a hub system. The aim is to find solutions that minimize the overall impact on the environment while reducing holding and travel costs. This paper proposes a robust and feasible method for determining the optimal location for an inland empty container depot, demonstrating its effectiveness on a large-scale logistics hub location problem in Slovenia. The proposed method takes into account both the economic costs and the emissions generated during the repositioning process and aims to select a hub location that minimizes these factors. The optimization is performed using a heuristic approach, Particle Swarm Optimization (PSO), which requires fewer constraints and assumptions compared to traditional linear optimization techniques. This method takes advantage of the behavior of swarms and their ability to find optimal solutions to complex problems. In contrast to classical approaches such as linear programming, which require considerable effort to formulate and solve, this method simplifies the process and efficiently identifies optimal solutions.</dc:description><dc:date>2025</dc:date><dc:date>2025-12-22 08:54:46</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>177363</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
