<?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-6VN6YA83/4ff2af1b-40ea-4afb-8dc4-e061f3036fb4/PDF"><dcterms:extent>1010 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-6VN6YA83/e6c7e7c9-0e94-4b77-8f4c-325e79232fa9/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-6VN6YA83"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2023</dcterms:issued><dc:creator>Ai, T.</dc:creator><dc:creator>Huang, H. F.</dc:creator><dc:creator>Huang, L.</dc:creator><dc:creator>Jiao, F.</dc:creator><dc:creator>Ma, W. G.</dc:creator><dc:creator>Song, R. 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. 303-316</dc:format><dc:identifier>DOI:10.14743/apem2023.3.474</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:268736003</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-6VN6YA83</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">bulk cargo terminal</dc:subject><dc:subject xml:lang="en">deep reinforcement learning</dc:subject><dc:subject xml:lang="en">double deep Q-network</dc:subject><dc:subject xml:lang="sl">globoko okrepljeno učenje</dc:subject><dc:subject xml:lang="sl">kontejnerski terminali</dc:subject><dc:subject xml:lang="en">Markov decision process (MDP) model</dc:subject><dc:subject xml:lang="sl">nalaganje</dc:subject><dc:subject xml:lang="en">optimisation</dc:subject><dc:subject xml:lang="sl">optimizacija</dc:subject><dc:subject xml:lang="en">prioritised experience replay and softmax strategy-based dueling</dc:subject><dc:subject xml:lang="sl">pristanišča</dc:subject><dc:subject xml:lang="sl">razlaganje</dc:subject><dc:subject xml:lang="en">scheduling</dc:subject><dcterms:temporal rdf:resource="2014-2026" /><dc:title xml:lang="sl">An improved deep reinforcement learning approach: a case study for optimisation of berth and yard scheduling for bulk cargo terminal|</dc:title><dc:description xml:lang="sl">The cornerstone of port production operations is ship handling, necessitating judicious allocation of diverse production resources to enhance the efficiency of loading and unloading operations. This paper introduces an optimisation method based on deep reinforcement learning to schedule berths and yards at a bulk cargo terminal. A Markov Decision Process model is formulated by analysing scheduling processes and unloading operations in bulk port imports business. The study presents an enhanced reinforcement learning algorithm called PS-D3QN (Prioritised Experience Replay and Softmax strategy-based Dueling Double Deep Q-Network), amalgamating the strengths of the Double DQN and Dueling DQN algorithms. The proposed solution is evaluated using actual port data and benchmarked against the other two algorithms mentioned in this paper. The numerical experiments and comparative analysis substantiate that the PS-D3QN algorithm significantly enhances the efficiency of berth and yard scheduling in bulk terminals, reduces the cost of port operation, and eliminates errors associated with manual scheduling. The algorithm presented in this paper can be tailored to address scheduling issues in the fields of production and manufacturing with suitable adjustments, including problems like the job shop scheduling problem and its extensions</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-6VN6YA83"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-6VN6YA83" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-6VN6YA83/4ff2af1b-40ea-4afb-8dc4-e061f3036fb4/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-6VN6YA83/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-6VN6YA83" /></ore:Aggregation></rdf:RDF>