<?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-UVEP5QYW/c417c9ca-e00a-4a18-89a3-f08b1d165588/PDF"><dcterms:extent>766 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-UVEP5QYW/64f985bf-8153-49ca-a709-930ad4b5909c/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-UVEP5QYW"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2022</dcterms:issued><dc:creator>Jin, C.</dc:creator><dc:creator>Lu, L. J.</dc:creator><dc:creator>Min, J. N.</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:17</dc:format><dc:format xml:lang="sl">str. 121-133</dc:format><dc:identifier>DOI:10.14743/apem2022.1.425</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:269124355</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-UVEP5QYW</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">algoritmi</dc:subject><dc:subject xml:lang="en">clustering first and routing later</dc:subject><dc:subject xml:lang="en">modified Clarke-Wright savings algorithm</dc:subject><dc:subject xml:lang="en">partitioning algorithms</dc:subject><dc:subject xml:lang="en">split deliveries and pickups</dc:subject><dc:subject xml:lang="en">two-stage construction heuristic</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">A two-stage construction heuristic approach for vehicle routing problem with split deliveries and pickups: case studies and performance comparison|</dc:title><dc:description xml:lang="sl">The vehicle routing problem with split deliveries and pickups is a hot research topic in recent years, where a customer can be served multiple times with split deliveries and pickups. The objective is to minimize the travel distance, use the fewest number of vehicles and increase the load rate, which will further reduce the carbon emissions that damage the environment. In this paper, we use a two-stage construction heuristic approach to solve this problem. First, partitioning algorithms based on the multi-restart-iterative sweep algorithm are adopted to partition the customer domain into sub-domains according to the vehicle capacity, and to determine the split points and the corresponding values. Second, a modified Clarke-Wright savings algorithm is used to check the possibility of each point in each route based on the load of each point and the vehicle load limitation. The three case studies with 12 instances per each from the reconstructed Solomon benchmark datasets were conducted to evaluate the effectiveness and feasibility of the proposed approaches-Unsplit, Both-Split and Enhanced-Both-Split. The comparison among these approaches reveals that the splits reduce the total travel cost and vehicles used, and increase the average loading rate considerably, especially when customers have larger demand values. Our computation results proves that the vehicle routing problem with split deliveries and pickups is highly beneficial for transportation and logistics 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-UVEP5QYW"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-UVEP5QYW" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-UVEP5QYW/c417c9ca-e00a-4a18-89a3-f08b1d165588/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-UVEP5QYW/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-UVEP5QYW" /></ore:Aggregation></rdf:RDF>