<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-ETRDSC1Q/326aa332-24ee-4f74-a29b-627b6f130661/PDF"><dcterms:extent>2356 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-ETRDSC1Q/f27b9e73-564b-4ceb-950a-0d7da1e9e63e/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2014-2026"><edm:begin xml:lang="en">2014</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-ETRDSC1Q"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2022</dcterms:issued><dc:creator>Huang, Q. L.</dc:creator><dc:creator>Liu, S. F.</dc:creator><dc:creator>Niu, X. Y.</dc:creator><dc:format xml:lang="sl">letnik:17</dc:format><dc:format xml:lang="sl">številka:4</dc:format><dc:format xml:lang="sl">str. 439-454</dc:format><dc:identifier>DOI:10.14743/apem2022.4.447</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:269349123</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-ETRDSC1Q</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</dc:publisher><dcterms:isPartOf xml:lang="sl">Advances in production engineering and management</dcterms:isPartOf><dc:subject xml:lang="sl">distribucija</dc:subject><dc:subject xml:lang="en">distribution</dc:subject><dc:subject xml:lang="en">end-of-line</dc:subject><dc:subject xml:lang="sl">iskalni algoritem velike soseske</dc:subject><dc:subject xml:lang="sl">konec poti</dc:subject><dc:subject xml:lang="en">large-scale neighbourhood search algorithm</dc:subject><dc:subject xml:lang="sl">logistika</dc:subject><dc:subject xml:lang="sl">optimizacija poti</dc:subject><dc:subject xml:lang="en">optimization</dc:subject><dc:subject xml:lang="en">path optimization</dc:subject><dc:subject xml:lang="sl">usmerjanje vozil</dc:subject><dc:subject xml:lang="en">vehicle routing</dc:subject><dcterms:temporal rdf:resource="2014-2026" /><dc:title xml:lang="sl">End-of-line delivery vehicle routing optimization based on large-scale neighbourhood search algorithms considering customer-consumer delivery location preferences|</dc:title><dc:description xml:lang="sl">Logistics is an important guarantee for economic and social development. Among the various aspects of logistics, the urban logistics end distribution link, which involves the direct connection between distribution personnel and customers, has a direct impact on customers' sense of experience and satisfaction with logistics services. At present, there are unscientific and unreasonable selection methods for logistics end distribution paths, often based on the subjective experience of distribution personnel, which often results in a mismatch between distribution paths and distribution needs, affecting market demand while further increasing the distribution costs of enterprises. Therefore, based on the characteristics of customer-consumers, this paper considers that consumers can select multiple receiving addresses, and each address has a corresponding time window limit. This paper finds that it needs to spend a lot of costs for the enterprise to improve the service level of distribution, and the enterprise can save the cost from time window, as well as obtain the better distribution time by using alternative addresses through the verification and analysis of an example. Based on the above analysis, this paper proposes the urban logistics terminal distribution path optimization path based on large-scale neighbourhood search algorithm, which can promote the further matching between logistics distribution enterprises and customer needs, so as to improve the probability of consumers receiving goods in time as well as reduce the cost of enterprises</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-ETRDSC1Q"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-ETRDSC1Q" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-ETRDSC1Q/326aa332-24ee-4f74-a29b-627b6f130661/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza v Mariboru, Fakulteta za strojništvo</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-ETRDSC1Q/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-ETRDSC1Q" /></ore:Aggregation></rdf:RDF>