<?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-HCVSGQFM/eaff1182-a745-4a5a-a95f-87f0ca660152/PDF"><dcterms:extent>1505 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-HCVSGQFM/82352f49-73c9-4810-8697-12b41af72985/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-HCVSGQFM"><dcterms:issued>2023</dcterms:issued><dc:creator>Cao, J.</dc:creator><dc:creator>Han, H.</dc:creator><dc:creator>Han, T. C.</dc:creator><dc:creator>Wang, Y. J.</dc:creator><dc:format xml:lang="sl">letnik:18</dc:format><dc:format xml:lang="sl">številka:3</dc:format><dc:format xml:lang="sl">str. 381-395</dc:format><dc:identifier>DOI:10.14743/apem2023.3.480</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:268862723</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-HCVSGQFM</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</dc:publisher><dc:source xml:lang="sl">Advances in production engineering and management</dc:source><dc:subject xml:lang="sl">algoritmi</dc:subject><dc:subject xml:lang="en">ant colony optimization algorithm</dc:subject><dc:subject xml:lang="en">Benders decomposition algorithm</dc:subject><dc:subject xml:lang="en">delay cost</dc:subject><dc:subject xml:lang="sl">dinamično modeliranje</dc:subject><dc:subject xml:lang="en">dynamic information</dc:subject><dc:subject xml:lang="sl">epidemije</dc:subject><dc:subject xml:lang="en">genetic algorithm</dc:subject><dc:subject xml:lang="en">humanitarian logistics</dc:subject><dc:subject xml:lang="sl">humanitarna pomoč</dc:subject><dc:subject xml:lang="en">logistic</dc:subject><dc:subject xml:lang="sl">logistika</dc:subject><dc:subject xml:lang="sl">matematični modeli</dc:subject><dc:subject xml:lang="en">mixed integer programming</dc:subject><dc:subject xml:lang="sl">model nalezljive bolezni</dc:subject><dc:subject xml:lang="en">multi-objective</dc:subject><dc:subject xml:lang="en">optimization</dc:subject><dc:subject xml:lang="sl">transportna omrežja</dc:subject><dc:title xml:lang="sl">Optimal logistics scheduling with dynamic information in emergency response: case studies for humanitarian objectives|</dc:title><dc:description xml:lang="sl">The mathematical model of infectious disease is a typical problem in mathematical modeling, and the common infectious disease models include the susceptible-infected (SI) model, the susceptible-infected-recovered model (SIR), the susceptible-infected-recovered-susceptible model (SIRS) and the susceptible-exposed-infected-recovered (SEIR) model. These models can be used to predict the impact of regional return to work after the epidemic. In this paper, we use the SEIR model to solve the dynamic medicine demand information in humanitarian relief phase. A multistage mixed integer programming model for the humanitarian logistics and transport resource is proposed. The objective functions of the model include delay cost and minimum running time in the time-space network. The model describes that how to distribute and deliver medicine resources from supply locations to demand locations with an efficient and lower-cost way through a transportation network. The linear programming problem is solved by the proposed Benders decomposition algorithm. Finally, we use two cases to calculate model and algorithm. The results of the case prove the validity of the model and algorithm</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-HCVSGQFM"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-HCVSGQFM" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-HCVSGQFM/eaff1182-a745-4a5a-a95f-87f0ca660152/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-HCVSGQFM/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-HCVSGQFM" /></ore:Aggregation></rdf:RDF>