乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:24:23Z","timestamp":1720297463414},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["150465\/2018-1","302075\/2018-6"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.cor.2020.104934","type":"journal-article","created":{"date-parts":[[2020,2,27]],"date-time":"2020-02-27T07:34:45Z","timestamp":1582788885000},"page":"104934","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Cargo routing and scheduling problem in deep-sea transportation: Case study from a fertilizer company"],"prefix":"10.1016","volume":"119","author":[{"given":"Pietro Tiaraju","family":"Giavarina dos Santos","sequence":"first","affiliation":[]},{"given":"Endel","family":"Kretschmann","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6220-3159","authenticated-orcid":false,"given":"Denis","family":"Borenstein","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8276-7197","authenticated-orcid":false,"given":"Pablo Cristini","family":"Guedes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2020.104934_bib0001","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.21518","article-title":"A maritime inventory routing problem: Discrete time formulations and valid inequalities","volume":"62","author":"Agra","year":"2013","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0002","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.ejor.2013.06.042","article-title":"Hybrid heuristics for a short sea inventory routing problem","volume":"236","author":"Agra","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0003","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2005.06.047","article-title":"Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: applications and model","volume":"176","author":"Al-Khayyal","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104934_bib0004","first-page":"79","article-title":"The maritime pickup and delivery problem with time windows and split loads","volume":"49","author":"Andersson","year":"2011","journal-title":"INFOR: Inf. Syste. Oper.Res."},{"issue":"9","key":"10.1016\/j.cor.2020.104934_bib0005","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","article-title":"Industrial aspects and literature survey: combined inventory management and routing","volume":"37","author":"Andersson","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2020.104934_bib0006","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.cor.2016.07.017","article-title":"A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping","volume":"77","author":"Arnesen","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0007","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ejor.2013.10.042","article-title":"Exact algorithms for the traveling salesman problem with draft limits","volume":"235","author":"Battarra","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0008","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.cor.2005.05.017","article-title":"A multi-start local search heuristic for ship scheduling \u2013 a computational study","volume":"34","author":"Br\u00f8nmo","year":"2007","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2020.104934_bib0009","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1057\/palgrave.jors.2602263","article-title":"Ship routing and scheduling with flexible cargo sizes","volume":"58","author":"Br\u00f8nmo","year":"2007","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0010","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ejor.2008.12.028","article-title":"Column generation approaches to ship scheduling with flexible cargo sizes","volume":"200","author":"Br\u00f8nmo","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0011","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2010.08.023","article-title":"Maritime inventory routing with multiple products: acase study from the cement industry","volume":"208","author":"Christiansen","year":"2011","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0012","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ejor.2012.12.002","article-title":"Ship routing and scheduling in the new millennium","volume":"228","author":"Christiansen","year":"2013","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0013","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1030.0036","article-title":"Ship routing and scheduling: status and perspectives","volume":"38","author":"Christiansen","year":"2004","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0014","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","article-title":"Ship scheduling with soft time windows: an optimisation based approach","volume":"131","author":"Fagerholt","year":"2001","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2020.104934_bib0015","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600973","article-title":"A combined ship scheduling and allocation problem","volume":"51","author":"Fagerholt","year":"2000","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0016","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1111\/j.1475-3995.2000.tb00196.x","article-title":"A travelling salesman problem with allocation, time window and precedence constraints - an application to ship scheduling","volume":"7","author":"Fagerholt","year":"2000","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0017","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1080\/03088839.2012.744481","article-title":"Bulk ship routing and scheduling: solving practical problems may provide better results","volume":"40","author":"Fagerholt","year":"2013","journal-title":"Marit. Policy Manage."},{"issue":"5","key":"10.1016\/j.cor.2020.104934_bib0018","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.cor.2006.08.004","article-title":"Repairing MIP infeasibility through local branching","volume":"35","author":"Fischetti","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2020.104934_bib0019","series-title":"International Conference on Computational Logistics","first-page":"3","article-title":"Applying a relax-and-fix approach to a fixed charge network flow model of a maritime inventory routing problem","author":"Friske","year":"2018"},{"issue":"8","key":"10.1016\/j.cor.2020.104934_bib0020","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.compchemeng.2003.08.009","article-title":"Improving the logistics of multi-compartment chemical tankers","volume":"28","author":"Jetlund","year":"2004","journal-title":"Comput. Chem. Eng."},{"issue":"11","key":"10.1016\/j.cor.2020.104934_bib0021","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.compchemeng.2004.03.009","article-title":"Flowsheet decomposition heuristic for scheduling: a relax-and-fix method","volume":"28","author":"Kelly","year":"2004","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0022","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s13160-010-0008-7","article-title":"Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques","volume":"27","author":"Kobayashi","year":"2010","journal-title":"Jap. J. Ind. Appl.Math."},{"issue":"4","key":"10.1016\/j.cor.2020.104934_bib0023","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1057\/jors.2008.192","article-title":"A tabu search heuristic for ship routing and scheduling","volume":"61","author":"Korsvik","year":"2010","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2020.104934_bib0024","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/j.cor.2010.07.005","article-title":"A large neighbourhood search heuristic for ship routing and scheduling with split loads","volume":"38","author":"Korsvik","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2020.104934_bib0025","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tre.2014.04.003","article-title":"The ship routing and freight assignment problem for daily frequency operation of maritime liner shipping","volume":"67","author":"Lin","year":"2014","journal-title":"Transp. Res. Part E"},{"issue":"6","key":"10.1016\/j.cor.2020.104934_bib0026","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2020.104934_bib0027","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.omega.2017.01.005","article-title":"The traveling salesman problem with pickups, deliveries, and draft limits","volume":"74","author":"Malaguti","year":"2018","journal-title":"Omega"},{"key":"10.1016\/j.cor.2020.104934_bib0028","series-title":"International Conference on Computational Logistics","first-page":"273","article-title":"A variable neighborhood search heuristic for tramp ship scheduling","author":"Malliappi","year":"2011"},{"issue":"4","key":"10.1016\/j.cor.2020.104934_bib0029","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10845-008-0207-0","article-title":"Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups","volume":"21","author":"Mohammadi","year":"2010","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"10.1016\/j.cor.2020.104934_bib0030","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.ejor.2013.12.013","article-title":"MIRPLib\u2013a library of maritime inventory routing problem instances: survey, core model, and benchmark results","volume":"235","author":"Papageorgiou","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104934_bib0031","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery models part II: transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"10.1016\/j.cor.2020.104934_bib0032","series-title":"Production Planning by Mixed Integer Programming","author":"Pochet","year":"2006"},{"issue":"9","key":"10.1016\/j.cor.2020.104934_bib0033","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1016\/j.cor.2011.10.025","article-title":"The traveling salesman problem with draft limits","volume":"39","author":"Rakke","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"31","key":"10.1016\/j.cor.2020.104934_bib0034","first-page":"1","article-title":"Ship routing with pickup and delivery for a maritime oil transportation system: MIP model and heuristics","volume":"4","author":"Rodrigues","year":"2016","journal-title":"Systems"},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0035","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch and cut and price for the pickup and delivery problem with time windows","volume":"43","author":"Ropke","year":"2009","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.cor.2020.104934_bib0036","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","article-title":"An evolutionary algorithm for polishing mixed integer programming solutions","volume":"19","author":"Rothberg","year":"2007","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2020.104934_bib0037","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2020.104934_bib0038","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.cor.2010.10.031","article-title":"A maritime inventory routing problem: practical approach","volume":"40","author":"Song","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2020.104934_bib0039","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.cor.2012.04.021","article-title":"A branch-price-and-cut method for a ship routing and scheduling problem with split loads","volume":"39","author":"St\u00e5lhane","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2020.104934_bib0040","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1111\/itor.12478","article-title":"Optimizing multiship routing and scheduling with constraints on inventory levels in a Brazilian oil company","volume":"25","author":"Stanzani","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2020.104934_bib0041","first-page":"1","article-title":"Solving the vessel routing and scheduling problem at a canadian maritime transportation company","author":"Trottier","year":"2019","journal-title":"INFOR: Inf. Syst. Oper.Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104934_bib0042","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11750-011-0174-z","article-title":"Using and extending fix-and-relax to solve maritime inventory routing problems","volume":"21","author":"Uggen","year":"2013","journal-title":"TOP"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300514?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300514?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T02:08:29Z","timestamp":1668650909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054820300514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":42,"alternative-id":["S0305054820300514"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2020.104934","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cargo routing and scheduling problem in deep-sea transportation: Case study from a fertilizer company","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2020.104934","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104934"}}