乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:24:23Z","timestamp":1732037063464},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1016\/j.cie.2017.11.018","type":"journal-article","created":{"date-parts":[[2017,11,23]],"date-time":"2017-11-23T12:01:46Z","timestamp":1511438506000},"page":"304-318","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":43,"special_numbering":"C","title":["A novel two-level optimization approach for clustered vehicle routing problem"],"prefix":"10.1016","volume":"115","author":[{"given":"Petrica C.","family":"Pop","sequence":"first","affiliation":[]},{"given":"Levente","family":"Fuksz","sequence":"additional","affiliation":[]},{"given":"Andrei Horvat","family":"Marc","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2017.11.018_b0005","unstructured":"Applegate, D., Bixby, R., Chvatal, V., & Cook, W. (2001). Concorde tsp solver ."},{"issue":"7","key":"10.1016\/j.cie.2017.11.018_b0010","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1057\/jors.2009.51","article-title":"Some applications of the generalized vehicle routing problem","volume":"61","author":"Baldacci","year":"2010","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.cie.2017.11.018_b0020","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.2013.1227","article-title":"Exact algorithms for the clustered vehicle routing problem","volume":"62","author":"Battarra","year":"2014","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.cie.2017.11.018_b0025","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/trsc.1100.0352","article-title":"Formulations and branch-and-cut algorithms for the generalized vehicle routing problem","volume":"45","author":"Bektas","year":"2011","journal-title":"Transportation Science"},{"year":"1999","series-title":"Nonlinear programming","author":"Bertsekas","key":"10.1016\/j.cie.2017.11.018_b0030"},{"issue":"2","key":"10.1016\/j.cie.2017.11.018_b0035","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","article-title":"The clustered traveling salesman problem","volume":"2","author":"Chisman","year":"1975","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2017.11.018_b0040","first-page":"265","article-title":"Understanding interactions among genetic algorithm parameters","volume":"5","author":"Deb","year":"1998","journal-title":"Foundations of Genetic Algorithms"},{"key":"10.1016\/j.cie.2017.11.018_b0045","unstructured":"Defryn, C. & S\u00f6rensen, K. (2014). A variable neighborhood metaheuristic for the clustered vehicle routing problem. In Proceedings of 15th EU\/ME Workshop (pp. 123\u2013127). Istanbul, Turkey."},{"key":"10.1016\/j.cie.2017.11.018_b0050","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cor.2017.02.007","article-title":"A fast two-level variable neighborhood search for the clustered vehicle routing problem","volume":"83","author":"Defryn","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2017.11.018_b0055","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.cie.2015.11.022","article-title":"A two-level solution approach to solve the clustered vehicle routing problem","volume":"91","author":"Exposito-Izquierdo","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2017.11.018_b0060","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2017.11.018_b0065","doi-asserted-by":"crossref","unstructured":"Fuksz, L. & Pop, P. C. (2013). A hybrid genetic algorithm with variable neighborhood search approach to the number partitioning problem. In Proceedings of HAIS 2013, Lecture notes in computer science (Vol. 8073, pp. 649\u2013658). Springer.","DOI":"10.1007\/978-3-642-40846-5_65"},{"issue":"1","key":"10.1016\/j.cie.2017.11.018_b0070","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","article-title":"An efficient transformation of the generalized vehicle routing problem","volume":"122","author":"Ghiani","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2017.11.018_b0075","first-page":"10","article-title":"Comparative analysis of recombination operators in genetic algorithms for the traveling salesman problem","volume":"Vol. 6679","author":"Gog","year":"2011"},{"key":"10.1016\/j.cie.2017.11.018_b0080","series-title":"Fleet management and logistics","first-page":"33","article-title":"Metaheuristics in vehicle routing","author":"Golden","year":"1998"},{"key":"10.1016\/j.cie.2017.11.018_b0085","doi-asserted-by":"crossref","unstructured":"Horvat Marc, A., Fuksz, L., Pop, P.C., & Danciulescu, D. (2015). A novel hybrid algorithm for solving the clustered vehicle routing problem. In Proceedings of HAIS 2015, Lecture notes in artificial intelligence (Vol. 121, pp. 679\u2013689).","DOI":"10.1007\/978-3-319-19644-2_56"},{"key":"10.1016\/j.cie.2017.11.018_b0090","doi-asserted-by":"crossref","unstructured":"Horvat Marc, A., Fuksz, L., Pop, P. C., & Danciulescu, D. (2017) A decomposition-based method for solving the clustered vehicle routing problem. Logic Journal of IJPL, doi:https:\/\/doi.org\/10.1093\/jigpal\/jzx037. In press.","DOI":"10.1093\/jigpal\/jzx037"},{"issue":"9","key":"10.1016\/j.cie.2017.11.018_b0095","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1057\/palgrave.jors.2601420","article-title":"Some applications of the clustered travelling salesman problem","volume":"53","author":"Laporte","year":"2002","journal-title":"The Journal of the Operational Research Society"},{"year":"2002","series-title":"The generalized minimum spanning tree problem","author":"Pop","key":"10.1016\/j.cie.2017.11.018_b0100"},{"year":"2012","series-title":"Generalized network design problems, modelling and optimization","author":"Pop","key":"10.1016\/j.cie.2017.11.018_b0105"},{"key":"10.1016\/j.cie.2017.11.018_b0110","doi-asserted-by":"crossref","unstructured":"Pop, P. C. & Chira, C. (2014). A hybrid approach based on genetic algorithms for solving the clustered vehicle routing problem. In Proceedings of IEEE congress on evolutionary computation (CEC-2014) (pp. 1421\u20131426). Beijing, China.","DOI":"10.1109\/CEC.2014.6900422"},{"key":"10.1016\/j.cie.2017.11.018_b0115","doi-asserted-by":"crossref","unstructured":"Pop, P. C., Matei, O., Sabo, C., & Petrovan, A. (2017). A two-level solution approach for solving the generalized minimum spanning tree problem. European Journal of Operational Research, https:\/\/doi.org\/10.1016\/j.ejor.2017.08.015.","DOI":"10.1016\/j.ejor.2017.08.015"},{"issue":"1","key":"10.1016\/j.cie.2017.11.018_b0120","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.apm.2011.05.037","article-title":"New mathematical models of the generalized vehicle routing problem and extensions","volume":"36","author":"Pop","year":"2012","journal-title":"Applied Mathematical Modelling"},{"key":"10.1016\/j.cie.2017.11.018_b0125","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.neucom.2012.03.032","article-title":"An improved hybrid algorithm for solving the generalized vehicle routing problem","volume":"109","author":"Pop","year":"2013","journal-title":"Neurocomputing"},{"key":"10.1016\/j.cie.2017.11.018_b0130","first-page":"119","article-title":"A genetic algorithm for solving the generalized vehicle routing problem","volume":"6077","author":"Pop","year":"2010","journal-title":"Lecture Notes in Artificial Intelligence"},{"issue":"2","key":"10.1016\/j.cie.2017.11.018_b0135","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2298\/YJOR1102187P","article-title":"A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem","volume":"21","author":"Pop","year":"2011","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10.1016\/j.cie.2017.11.018_b0140","unstructured":"Sevaux, M. & S\u00f6rensen, K. (2008). Hamiltonian paths in large clustered routing problems. In Proceedings of EU\/MEeting workshop on metaheuristics for logistics and vehicle routing. Troyes, France."},{"key":"10.1016\/j.cie.2017.11.018_b0145","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","article-title":"Hybrid metaheuristics for the clustered vehicle routing problem","volume":"58","author":"Vidal","year":"2015","journal-title":"Computers and Operations Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083521730551X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083521730551X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T14:18:10Z","timestamp":1570371490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S036083521730551X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":28,"alternative-id":["S036083521730551X"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2017.11.018","relation":{},"ISSN":["0360-8352"],"issn-type":[{"type":"print","value":"0360-8352"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel two-level optimization approach for clustered vehicle routing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2017.11.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}