<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-5CO98TLK</identifier><date>2025</date><creator>Lan, H.</creator><creator>Xiao, N.</creator><relation>documents/doc/5/URN_NBN_SI_doc-5CO98TLK_001.pdf</relation><relation>documents/doc/5/URN_NBN_SI_doc-5CO98TLK_001.txt</relation><format format_type="volume">20</format><format format_type="issue">3</format><format format_type="type">article</format><format format_type="extent">str. 351-368</format><identifier identifier_type="DOI">10.14743/apem2025.3.545</identifier><identifier identifier_type="ISSN">1854-6250</identifier><identifier identifier_type="COBISSID_HOST">265828611</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-5CO98TLK</identifier><language>eng</language><publisher publisher_location="Maribor">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</publisher><source>Advances in production engineering and management</source><rights>BY</rights><subject language_type_id="eng">capacity constraint</subject><subject language_type_id="eng">drone–vehicle collaboration</subject><subject language_type_id="slv">droni - vozila</subject><subject language_type_id="eng">heuristic algorithm</subject><subject language_type_id="eng">humanitarian logistics</subject><subject language_type_id="slv">humanitarna logistika</subject><subject language_type_id="eng">particle swarm optimization</subject><subject language_type_id="eng">PSO</subject><subject language_type_id="eng">stochastic demand</subject><subject language_type_id="slv">stohastični ukazi</subject><subject language_type_id="eng">time windows</subject><subject language_type_id="eng">travelling salesman problem</subject><subject language_type_id="eng">TSP</subject><subject language_type_id="eng">two-echelon routing</subject><subject language_type_id="eng">vehicle routing problem</subject><subject language_type_id="eng">VRP</subject><title>Two-echelon drone–truck collaborative TSP-based routing for humanitarian logistics with time windows and stochastic demand</title></Record>