{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:30:15Z","timestamp":1726065015589},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389185"},{"type":"electronic","value":"9783030389192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38919-2_34","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:03:18Z","timestamp":1579194198000},"page":"417-428","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Cosma","sequence":"first","affiliation":[]},{"given":"Petrica C.","family":"Pop","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"MI Balinski","year":"1961","unstructured":"Balinski, M.I.: Fixedcost transportation problems. Nav. Res. Logist. 8(1), 41\u201354 (1961)","journal-title":"Nav. Res. Logist."},{"issue":"5","key":"34_CR2","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/opre.2014.1288","volume":"62","author":"E Buson","year":"2014","unstructured":"Buson, E., Roberti, R., Toth, P.: A reduced-cost iterated local search heuristic for the fixed-charge transportation problem. Oper. Res. 62(5), 1095\u20131106 (2014)","journal-title":"Oper. Res."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2018.03.007","volume":"95","author":"H Calvete","year":"2018","unstructured":"Calvete, H., Gale, C., Iranzo, J., Toth, P.: A matheuristic for the two-stage fixed-charge transportation problem. Comput. Oper. Res. 95, 113\u2013122 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"113684","DOI":"10.1109\/ACCESS.2019.2936095","volume":"7","author":"O Cosma","year":"2019","unstructured":"Cosma, O., Danciulescu, D., Pop, P.C.: On the two-stage transportation problem with fixed charge for opening the distribution centers. IEEE Access 7(1), 113684\u2013113698 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"34_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.37193\/CJM.2019.02.04","volume":"35","author":"O Cosma","year":"2019","unstructured":"Cosma, O., Pop, P.C., Pop Sitar, C.: An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. Carpathian J. Math. 35(2), 153\u2013164 (2019)","journal-title":"Carpathian J. Math."},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G Guisewite","year":"1990","unstructured":"Guisewite, G., Pardalos, P.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25(1), 75\u201399 (1990)","journal-title":"Ann. Oper. Res."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.ejor.2007.12.005","volume":"194","author":"N Jawahar","year":"2009","unstructured":"Jawahar, N., Balaji, A.N.: A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur. J. Oper. Res. 194, 496\u2013537 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"34_CR8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.37193\/CJM.2017.03.11","volume":"33","author":"PC Pop","year":"2017","unstructured":"Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G.: Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian J. Math. 33(3), 365\u2013371 (2017)","journal-title":"Carpathian J. Math."},{"issue":"2","key":"34_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.37193\/CJM.2016.02.10","volume":"32","author":"PC Pop","year":"2016","unstructured":"Pop, P.C., Matei, O., Pop Sitar, C., Zelina, I.: A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpathian J. Math. 32(2), 225\u2013232 (2016)","journal-title":"Carpathian J. Math."},{"issue":"9","key":"34_CR10","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1016\/j.cor.2011.09.020","volume":"39","author":"KAAD Raj","year":"2012","unstructured":"Raj, K.A.A.D., Rajendran, C.: A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput. Oper. Res. 39(9), 2016\u20132032 (2012)","journal-title":"Comput. Oper. Res."},{"key":"34_CR11","unstructured":"Hundt, R.: Loop recognition in C++\/Java\/Go\/Scala. In: Proceedings of Scala Days (2011). https:\/\/days2011.scala-lang.org\/sites\/days2011\/files\/ws3-1-Hundt.pdf"},{"key":"34_CR12","unstructured":"https:\/\/www.cpubenchmark.net\/compare\/Intel-Pentium-D-830-vs-Intel-i5-4590\/1127vs2234"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T18:19:18Z","timestamp":1665512358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}