{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T17:01:10Z","timestamp":1709139670092},"reference-count":13,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T00:00:00Z","timestamp":1360195200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2013,9]]},"abstract":"Abstract<\/jats:title>The optimal diversity management problem is a special case of the p<\/jats:italic>\u2010median problem, which arises in the production of wire harness for the automotive industry. Instances are typically very large and graphs consist of several nonconnected components. The greedy algorithm is normally applied to handle these large instances, producing solutions that are considered quite good. We design an approach that uses decomposition combined with a genetic algorithm and simulated annealing algorithm to improve greedy solutions of the optimal diversity management problem. We report computational results that render this approach as capable of improving greedy solutions on real instances from a company manufacturing wire harness for automobiles.<\/jats:p>","DOI":"10.1111\/itor.12004","type":"journal-article","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T11:47:27Z","timestamp":1360237647000},"page":"617-625","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Using decomposition to improve greedy solutions of the optimal diversity management problem"],"prefix":"10.1111","volume":"20","author":[{"given":"Agostinho","family":"Agra","sequence":"first","affiliation":[{"name":"Center for Research and Development in Mathematics and Applications, Department of Mathematics Universidade de Aveiro 3810\u2010193 Aveiro Portugal"}]},{"given":"Jorge Orestes","family":"Cerdeira","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Technology, Department of Mathematics Universidade Nova de Lisboa, Quinta da Torre 2829\u2010516 Caparica Portugal"},{"name":"Forest Research Centre, Instituto Superior de Agronomia Universidade T\u00e9cnica de Lisboa, Tapada da Ajuda 1349\u2010017 Lisboa Portugal"}]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[{"name":"Center for Research and Development in Mathematics and Applications, Department of Mathematics Universidade de Aveiro 3810\u2010193 Aveiro Portugal"}]}],"member":"311","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"e_1_2_8_2_1","first-page":"137","volume-title":"Local Search in Combinatorial Optimization","author":"Aarts E.H.L.","year":"1997"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-009-9614-9"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-009-9612-y"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-004-0059-1"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0700-6"},{"key":"e_1_2_8_7_1","unstructured":"Briant O. 2000.\u00c9tude th\u00e9orique et num\u00e9rique du probl\u00e8me de la gestion de la diversit\u00e9. Ph.D. thesis Institute Nacional Polytechnique de Grenoble Grenoble France."},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0108"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90336-T"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-012-0741-3"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_2_8_12_1","volume-title":"Discrete Location Theory","author":"Mirchandani P.B.","year":"1990"},{"key":"e_1_2_8_13_1","first-page":"137","volume-title":"Local Search in Combinatorial Optimization","author":"M\u00fchlenbein H.","year":"1997"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20128"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12004","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/itor.12004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T05:31:45Z","timestamp":1694583105000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/itor.12004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,7]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1111\/itor.12004"],"URL":"https:\/\/doi.org\/10.1111\/itor.12004","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"value":"0969-6016","type":"print"},{"value":"1475-3995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,7]]},"assertion":[{"value":"2011-10-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-12-23","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
