乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:43:14Z","timestamp":1740159794392,"version":"3.37.3"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"content-version":"vor","delay-in-days":28,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006012","name":"Christian Doppler Research Association","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006012","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1016\/j.procs.2021.01.334","type":"journal-article","created":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T21:54:47Z","timestamp":1613944487000},"page":"843-851","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Stacking and transporting steel slabs using high-capacity vehicles"],"prefix":"10.1016","volume":"180","author":[{"given":"Biljana","family":"Roljic","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Leitner","sequence":"additional","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2021.01.334_bib0001","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","article-title":"An exact algorithm for the pickup and delivery problem with time windows","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0002","doi-asserted-by":"crossref","unstructured":"Battarra, M., Cordeau, J.F., Iori, M, 2014. Pickup-and-delivery problems for goods transportation, in: Toth, P., Vigo, D. (Eds.), Vehicle Routing: Problems, Methods, and Applications, Second Edition, chapter 6, pp. 161-191. doi: 10.1137\/1.9781611973594. ch6.","DOI":"10.1137\/1.9781611973594.ch6"},{"key":"10.1016\/j.procs.2021.01.334_bib0003","doi-asserted-by":"crossref","unstructured":"Beham, A., Raggl, S., Wagner, S., Affenzeller, M., 2019. Uncertainty in real-world steel stacking problems, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA. p. 1438-1440. doi: 10. 1145\/3319619.3326803.","DOI":"10.1145\/3319619.3326803"},{"key":"10.1016\/j.procs.2021.01.334_bib0004","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","article-title":"A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows","volume":"33","author":"Bent","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0005","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2018.07.013","article-title":"A comparison of two meta-heuristics for the pickup and delivery problem with transshipment","volume":"100","author":"Danloup","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0006","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2019.04.006","article-title":"A local-search based heuristic for the unrestricted block relocation problem","volume":"108","author":"Feillet","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0007","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","article-title":"A tree search procedure for the container relocation problem","volume":"39","author":"Forster","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0008","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","article-title":"A heuristic rule for relocating blocks","volume":"33","author":"Kim","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib0009","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","article-title":"Loading, unloading and premarshalling of stacks in storage areas: Survey and classification","volume":"239","author":"Lehnfeld","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.procs.2021.01.334_bib00010","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems: Part i: Transportation between customers and depot","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"10.1016\/j.procs.2021.01.334_bib00011","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems: Part ii: Transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"10.1016\/j.procs.2021.01.334_bib00012","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ejor.2013.05.037","article-title":"A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem","volume":"231","author":"Petering","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.procs.2021.01.334_bib00013","series-title":"Handbook of Metaheuristics","first-page":"399","article-title":"Large neighborhood search","author":"Pisinger","year":"2010"},{"key":"10.1016\/j.procs.2021.01.334_bib00014","doi-asserted-by":"crossref","unstructured":"Raa, B., van der Stricht, W., 2006. A local search algorithm for the inventory matching problem in a steel company. IFAC Proceedings Volumes 39,359-364. doi: 10.3182\/20060517-3-FR-2903.00193.","DOI":"10.3182\/20060517-3-FR-2903.00193"},{"key":"10.1016\/j.procs.2021.01.334_bib00015","series-title":"Computer Aided Systems Theory - EUROCAST 2019","first-page":"438","article-title":"Investigating the dynamic block relocation problem","author":"Raggl","year":"2020"},{"key":"10.1016\/j.procs.2021.01.334_bib00016","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1504\/IJSCOM.2018.091621","article-title":"Solving a real world steel stacking problem","volume":"3","author":"Raggl","year":"2018","journal-title":"International Journal of Service and Computing Oriented Manufacturing"},{"key":"10.1016\/j.procs.2021.01.334_bib00017","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":"Transportation Science"},{"key":"10.1016\/j.procs.2021.01.334_bib00018","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"year":"1997","series-title":"A new local search algorithm providing high quality solutions to vehicle routing problems","author":"Shaw","key":"10.1016\/j.procs.2021.01.334_bib00019"},{"key":"10.1016\/j.procs.2021.01.334_bib00020","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2018.02.019","article-title":"An exact algorithm for the unrestricted block relocation problem","volume":"95","author":"Tanaka","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib00021","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2017.08.010","article-title":"New insights on the block relocation problem","volume":"89","author":"Tricoire","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2021.01.334_bib00022","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10696-015-9229-z","article-title":"Tree search procedures for the blocks relocation problem with batch moves","volume":"28","author":"Zhang","year":"2015","journal-title":"Flexible Services and Manufacturing Journal"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050921003884?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050921003884?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T16:06:14Z","timestamp":1659369974000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050921003884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":22,"alternative-id":["S1877050921003884"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2021.01.334","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Stacking and transporting steel slabs using high-capacity vehicles","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2021.01.334","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}