乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:31:07Z","timestamp":1720719067760},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"vor","delay-in-days":339,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1016\/j.procs.2019.12.066","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T11:46:18Z","timestamp":1577792778000},"page":"900-907","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes"],"prefix":"10.1016","volume":"162","author":[{"given":"Ovidiu","family":"Cosma","sequence":"first","affiliation":[]},{"given":"Petrica","family":"Pop","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2019.12.066_bib0001","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00291-005-0029-9","article-title":"A genetic algorithm for two-stage transportation problem using priority based encoding","volume":"28","author":"Gen","year":"2006","journal-title":"OR Spectrum"},{"issue":"2","key":"10.1016\/j.procs.2019.12.066_bib0002","doi-asserted-by":"crossref","first-page":"137","DOI":"10.37193\/CJM.2019.02.04","article-title":"An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem","volume":"35","author":"Cosma","year":"2019","journal-title":"Carpathian Journal of Mathematics"},{"key":"10.1016\/j.procs.2019.12.066_bib0003","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.ejor.2007.12.005","article-title":"A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge","volume":"194","author":"Jawahar","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.procs.2019.12.066_bib0004","doi-asserted-by":"crossref","first-page":"2016","DOI":"10.1016\/j.cor.2011.09.020","article-title":"A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem","volume":"39","author":"Raj","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.procs.2019.12.066_bib0005","doi-asserted-by":"crossref","first-page":"365","DOI":"10.37193\/CJM.2017.03.11","article-title":"Solving the Two-Stage Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm","volume":"33","author":"Pop","year":"2017","journal-title":"Carpathian Journal of Mathematics"},{"key":"10.1016\/j.procs.2019.12.066_bib0006","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2018.03.007","article-title":"A matheuristic for the two-stage fixed-charge transportation problem","volume":"95","author":"Calvete","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.procs.2019.12.066_bib0007","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s00291-015-0416-9","article-title":"An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots","volume":"38","author":"Calvete","year":"2016","journal-title":"OR Spectrum"},{"key":"10.1016\/j.procs.2019.12.066_bib0008","doi-asserted-by":"crossref","first-page":"10462","DOI":"10.1016\/j.eswa.2011.02.093","article-title":"Solving a capacitated fixed-cost transportation problem by artificial immune and genetic algorithms with a Pr\u00fcfer number representation","volume":"38","author":"Molla-Alizadeh-Zavardehi","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.procs.2019.12.066_bib0009","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-3-642-28942-2_50","article-title":"A Hybrid Classical Approach to a Fixed-Charge Transportation Problem","volume":"7208","author":"Pintea","year":"2012","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"10.1016\/j.procs.2019.12.066_bib00010","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/jigpal\/jzv014","article-title":"An improved hybrid algorithm for capacitated fixed-charge transportation problem","volume":"23","author":"Pintea","year":"2015","journal-title":"Logic Journal of IJPL"},{"issue":"2","key":"10.1016\/j.procs.2019.12.066_bib00011","doi-asserted-by":"crossref","first-page":"225","DOI":"10.37193\/CJM.2016.02.10","article-title":"A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem","volume":"32","author":"Pop","year":"2016","journal-title":"Carpathian Journal of Mathematics"},{"key":"10.1016\/j.procs.2019.12.066_bib00012","unstructured":"Cosma O, Pop PC, Matei O, Zelina I. A hybrid iterated local search for solving a particular two-stage fixed-charge transportation problem. In Proc. of HAIS 2018, Lecture Notes in Computer Science 2018; 10870:684-693."},{"issue":"1","key":"10.1016\/j.procs.2019.12.066_bib00013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","article-title":"Minimum concave-cost network flow problems: applications, complexity, and algorithms","volume":"25","author":"Guisewite","year":"1990","journal-title":"Annals of Operations Research"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050919320770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050919320770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T12:34:31Z","timestamp":1665318871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050919320770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":13,"alternative-id":["S1877050919320770"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2019.12.066","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2019.12.066","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}