{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:12:57Z","timestamp":1725977577334},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319916408"},{"type":"electronic","value":"9783319916415"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-91641-5_6","type":"book-chapter","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T15:14:58Z","timestamp":1526051698000},"page":"62-74","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines"],"prefix":"10.1007","author":[{"given":"Marc-Andr\u00e9","family":"Carle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Martel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,12]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1287\/inte.29.5.5","volume":"29","author":"S Murthy","year":"1999","unstructured":"Murthy, S., Akkiraju, R., Goodwin, R., Keskinocak, P., Rachlin, J., Wu, F.: Cooperative multiobjective decision support for the paper industry. Interfaces 29(5), 5\u201330 (1999)","journal-title":"Interfaces"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.ijpe.2012.06.016","volume":"139","author":"MA Carle","year":"2012","unstructured":"Carle, M.A., Martel, A., Zufferey, N.: The CAT metaheuristic for the solution of multi-period activity-based supply chain network design problems. Int. J. Prod. Econ. 139(2), 664\u2013677 (2012)","journal-title":"Int. J. Prod. Econ."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1080\/00207540903449888","volume":"49","author":"E Silver","year":"2011","unstructured":"Silver, E., Zufferey, N.: Inventory control of an item with a probabilistic replenishment lead time and a known supplier shutdown period. Int. J. Prod. Res. 49, 923\u2013947 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10288-004-0057-3","volume":"3","author":"A Hertz","year":"2005","unstructured":"Hertz, A., Schindl, D., Zufferey, N.: Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2), 139\u2013161 (2005)","journal-title":"4OR"},{"key":"6_CR5","unstructured":"Zufferey, N.: Heuristiques pour les Probl\u00e8mes de la Coloration des Sommets d\u2019un Graphe et d\u2019Affectation de Fr\u00e9quences avec Polarit\u00e9s. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Switzerland (2002)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576\u2013591 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR7","first-page":"330","volume-title":"Parallel Combinatorial Optimization","author":"N Melab","year":"2006","unstructured":"Melab, N., Talbi, E.G., Cahon, S., Alba, E., Luque, G.: Parallel metaheuristics: models and frameworks. Parallel Combinatorial Optimization, p. 330. Wiley, Hoboken (2006)"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11, 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"6_CR10","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78295-7_2","volume-title":"Hybrid Metaheuristics","author":"GR Raidl","year":"2008","unstructured":"Raidl, G.R., Puchinger, J.: Combining (Integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. SCI, vol. 114, pp. 31\u201362. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78295-7_2"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., Stuetzle, T., Vo\u00df, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-1306-7"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101\u2013111 (1960)","journal-title":"Oper. Res."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed variables programming problem. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimization problems. Ann. Oper. Res. 131, 325\u2013372 (2004)","journal-title":"Ann. Oper. Res."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s11750-011-0235-3","volume":"22","author":"M Melo","year":"2014","unstructured":"Melo, M., Nickel, S., da Gama, F.S.: An efficient heuristic approach for a multi-period logistics network redesign problem. TOP 22, 80\u2013108 (2014)","journal-title":"TOP"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.cie.2010.09.007","volume":"59","author":"P Thanh","year":"2010","unstructured":"Thanh, P., P\u00e9ton, O., Bostel, N.: A linear relaxation-based heuristic approach for logistics network design. Comput. Ind. Eng. 59, 964\u2013975 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"6_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24724-1","volume-title":"Distributed Decision Making","author":"C Schneeweiss","year":"2003","unstructured":"Schneeweiss, C.: Distributed Decision Making, 2nd edn. Springer, Heidlberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24724-1","edition":"2"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Talukdar, S., Murthy, S., Akkiraju, R.: Asynchronous teams. In: Handbook of Metaheuristics. Kluwer Academic Publishers (2003)","DOI":"10.1007\/0-306-48056-5_19"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1287\/opre.50.2.249.425","volume":"50","author":"P Keskinocak","year":"2002","unstructured":"Keskinocak, P., Wu, F., Goodwin, R., Murthy, S., Akkiraju, R., Kumaran, S.: Scheduling solutions for the paper industry. Oper. Res. 50(2), 249\u2013259 (2002)","journal-title":"Oper. Res."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/B:JIMS.0000034108.66105.59","volume":"15","author":"M Aydin","year":"2004","unstructured":"Aydin, M., Fogarty, T.: Teams of autonomous agents for job-shop scheduling problems: an experimental study. J. Intell. Manuf. 15, 455\u2013462 (2004)","journal-title":"J. Intell. Manuf."},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-13541-5_22","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"E Ratajczak-Ropel","year":"2010","unstructured":"Ratajczak-Ropel, E.: Experimental evaluation of the A-team solving instances of the RCPSP\/max problem. In: J\u0119drzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS (LNAI), vol. 6071, pp. 210\u2013219. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13541-5_22"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy, G., Salhi, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177, 649\u2013672 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/0-387-23667-8_6","volume-title":"Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G.: Tabu search heuristics for the vehicle routing problem. In: Sharda, R., Vo\u00df, S., Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 145\u2013163. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/0-387-23667-8_6"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"TH Wu","year":"2002","unstructured":"Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29, 1393\u20131415 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"6_CR26","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1007\/s11590-011-0327-x","volume":"6","author":"N Zufferey","year":"2012","unstructured":"Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963\u2013973 (2012)","journal-title":"Optim. Lett."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4, 77\u201386 (2007)","journal-title":"Discrete Optim."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. Ser. A 102, 71\u201390 (2005)","journal-title":"Math. Program. Ser. A"},{"key":"6_CR29","first-page":"21","volume":"16","author":"M Ball","year":"2011","unstructured":"Ball, M.: Heuristics based on mathematical programming. Surv. Oper. Res. Manag. Sci. 16, 21\u201338 (2011)","journal-title":"Surv. Oper. Res. Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","Bioinspired Optimization Methods and Their Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91641-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T15:16:53Z","timestamp":1526051813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91641-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319916408","9783319916415"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91641-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}