{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:54:56Z","timestamp":1648943696147},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:00:00Z","timestamp":1437177600000},"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":["J Heuristics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10732-015-9297-y","type":"journal-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T11:01:09Z","timestamp":1437130869000},"page":"719-749","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A multiple neighborhood search for dynamic memory allocation in embedded systems"],"prefix":"10.1007","volume":"21","author":[{"given":"Mar\u00eda","family":"Soto","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Rossi","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"2","key":"9297_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.vlsi.2004.08.003","volume":"39","author":"D Atienza","year":"2006","unstructured":"Atienza, D., Mamagkakis, S., Poletti, F., Mendias, J., Catthoor, F., Benini, L., Soudris, D.: Efficient system-level prototyping of power-aware dynamic memory managers for embedded systems. Integr., VLSI J. 39(2), 113\u2013130 (2006)","journal-title":"Integr., VLSI J."},{"issue":"2","key":"9297_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R.: The reactive tabu search. ORSA J. Comput. 6(2), 126\u2013140 (1994)","journal-title":"ORSA J. Comput."},{"issue":"7","key":"9297_CR3","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1016\/j.cor.2010.10.007","volume":"38","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38(7), 1066\u20131075 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9297_CR4","doi-asserted-by":"crossref","unstructured":"Besbes, H., Jebara, S.F.: A solution to reduce noise enhancement in pre-whitened lms-type algorithms: the double direction adaptation. In: Proceedings of Control, Communications and Signal Processing, 2004, pp. 717\u2013720. (2004)","DOI":"10.1109\/ISCCSP.2004.1296512"},{"key":"9297_CR5","doi-asserted-by":"crossref","unstructured":"Blazy, S., Robillard, B., Appel, A.: Formal verification of coalescing graph-coloring register allocation. In: Proceedings of European Symposium On Programming, pp. 145\u2013164. Paphos, Chypre (2010)","DOI":"10.1007\/978-3-642-11957-6_9"},{"issue":"9","key":"9297_CR6","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1109\/TCAD.2008.927674","volume":"27","author":"U Brenner","year":"2008","unstructured":"Brenner, U., Struzyna, M., Vygen, J.: Bonnplace: Placement of leading-edge chips by advanced combinatorial algorithms. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27(9), 1607\u20131620 (2008)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"9297_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2849-1","volume-title":"Custom Memory Management Methodology","author":"F Catthoor","year":"1998","unstructured":"Catthoor, F., Wuytack, S., De Greef, E., Balasa, F., Nachtergaele, L., Vandecappelle, A.: Custom Memory Management Methodology. Kluwer Academic Publishers, Boston (1998)"},{"issue":"6","key":"9297_CR8","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s10951-010-0213-x","volume":"14","author":"S Ceschia","year":"2011","unstructured":"Ceschia, S., Gaspero, L., Schaerf, A.: Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 14(6), 601\u2013615 (2011)","journal-title":"J. Sched."},{"issue":"1","key":"9297_CR9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/S0377-2217(01)00336-8","volume":"143","author":"C-T Chang","year":"2002","unstructured":"Chang, C.-T.: Optimization approach for data allocation in multidisk database. Eur. J. Oper. Res. 143(1), 210\u2013217 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9297_CR10","unstructured":"Chiarandini, M., Paquete, L., Preuss, M., Ridge, E.: Experiments on metaheuristics: Methodological overview and open issues. Technical Report DMF-2007-03-003, The Danish Mathematical Society, Denmark (2007)"},{"issue":"5","key":"9297_CR11","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/S0026-2692(02)00009-5","volume":"33","author":"A Chimientia","year":"2002","unstructured":"Chimientia, A., Fanucci, L., Locatellic, R., Saponarac, S.: VLSI architecture for a low-power video codec system. Microelectron. J. 33(5), 417\u2013427 (2002)","journal-title":"Microelectron. J."},{"key":"9297_CR12","volume-title":"Practical Nonparametric Statistic","author":"WJ Conover","year":"1999","unstructured":"Conover, W.J.: Practical Nonparametric Statistic, 3rd edn. Wiley, New York (1999)","edition":"3"},{"issue":"1","key":"9297_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1132357.1132359","volume":"5","author":"P Coussy","year":"2006","unstructured":"Coussy, P., Casseau, E., Bomel, P., Baganne, A., Martin, E.: A formal method for hardware IP design and integration under I\/O and timing constraints. ACM Trans. Embed. Comput. Syst. 5(1), 29\u201353 (2006)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"9297_CR14","unstructured":"Coussy, P., Rossi, A., Sevaux, M., S\u00f6rensen, K., Trabelsi, K.: VNS for high-level synthesis. In: Proceedings of 8th Metaheuristics International Conference, MIC 2009, pp. 173:1\u2013173:10. Hamburg, Germany (2009)"},{"key":"9297_CR15","unstructured":"Cr\u00e9put, J.-C., Dafali, R., Rossi, A., Sevaux, M., Zerbo, B.: From simple heuristics to evolutionary approach for routing messages in a NoC. In: Proceedings of 10th anniversary of the metaheuristic community, pp. 55\u201357. Lorient, France (2010)"},{"key":"9297_CR16","doi-asserted-by":"crossref","unstructured":"Dafali, R., Diguet, J.-Ph., Sevaux, M.: Key research issues for reconfigurable Network-on-Chip. In: Proceedings of the International Conference on ReConFigurable Computing and FPGAs, ReConFig\u201908, pp. 181\u2013186. Cancun, Mexico (2008)","DOI":"10.1109\/ReConFig.2008.72"},{"issue":"2","key":"9297_CR17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G Dantzig","year":"1957","unstructured":"Dantzig, G.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013277 (1957)","journal-title":"Oper. Res."},{"issue":"1","key":"9297_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.artmed.2009.09.001","volume":"48","author":"P Demeester","year":"2010","unstructured":"Demeester, P., Souffriau, W., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Med. 48(1), 61\u201370 (2010)","journal-title":"Artif. Intell. Med."},{"key":"9297_CR19","doi-asserted-by":"crossref","unstructured":"Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2002), number 2740 in Lecture Notes in Computer Science, pp. 262\u2013275. Springer-Verlag (2003)","DOI":"10.1007\/978-3-540-45157-0_17"},{"issue":"1","key":"9297_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L Di Gaspero","year":"2006","unstructured":"Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Modell. Algorithms 5(1), 65\u201389 (2006)","journal-title":"J. Math. Modell. Algorithms"},{"key":"9297_CR21","volume-title":"Systems, Controls, Embedded Systems, Energy, and Machines. The Electrical Engineering Handbook","author":"RC Dorf","year":"2010","unstructured":"Dorf, R.C.: Systems, Controls, Embedded Systems, Energy, and Machines. The Electrical Engineering Handbook, 3rd edn. Taylor and Francis, Boca Raton (2010)","edition":"3"},{"key":"9297_CR22","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32, 675\u2013701 (1937)","journal-title":"J. Am. Stat. Assoc."},{"key":"9297_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Norwell (1997)"},{"issue":"4","key":"9297_CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008)","journal-title":"4OR"},{"issue":"3","key":"9297_CR25","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9297_CR26","first-page":"261","volume-title":"Decision and Control in Management Science. Advances in Computational Management Science","author":"P Hansen","year":"2002","unstructured":"Hansen, P., Mladenovi\u0107, N.: Industrial applications of the variable neighborhood search metaheuristic. In: Zaccour, G. (ed.) Decision and Control in Management Science. Advances in Computational Management Science, vol. 4, pp. 261\u2013273. Springer, US (2002)"},{"key":"9297_CR27","unstructured":"Idrissi Aouad, M., Idoumghar, L., Schott, R., Zendra, O.: Reduction of Energy Consumption in Embedded Systems: A Hybrid Evolutionary Algorithm. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, vol. 95. Djerba, Tunisie (2010a)"},{"key":"9297_CR28","unstructured":"Idrissi Aouad, M., Schott, R., Zendra, O.: A Tabu Search Heuristic for Scratch-Pad Memory Management. In: Proceedings of the International Conference on Software Engineering and Technology, pp. 386\u2013390. Rome, Italie (2010b)"},{"issue":"3","key":"9297_CR29","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ejor.2012.05.025","volume":"222","author":"J Jin","year":"2012","unstructured":"Jin, J., Crainic, T.G., Lokketangen, A.: A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. Eur. J. Oper. Res. 222(3), 441\u2013451 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9297_CR30","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MM.2003.1240211","volume":"23","author":"N Julien","year":"2003","unstructured":"Julien, N., Laurent, J., Senn, E., Martin, E.: Power consumption modeling and characterization of the TI C6201. IEEE Micro 23(5), 40\u201349 (2003)","journal-title":"IEEE Micro"},{"key":"9297_CR31","first-page":"333","volume-title":"Building Bridges. Bolyai Society Mathematical Studies","author":"B Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial problems in chip design. In: T\u00f3th, G., Katona, G., Lov\u00e1sz, L., P\u00e1lfy, P., Recski, A., Stipsicz, A., Sz\u00e1sz, D., Mikl\u00f3s, D., Gr\u00f6tschel, M., S\u00e1gi, G. (eds.) Building Bridges. Bolyai Society Mathematical Studies, vol. 19, pp. 333\u2013368. Springer, Berlin Heidelberg (2008)"},{"key":"9297_CR32","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.dam.2013.03.015","volume":"168","author":"PK Krause","year":"2014","unstructured":"Krause, P.K.: The complexity of register allocation. Discret. Appl. Math. 168, 51\u201359 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"9297_CR33","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.datak.2009.02.001","volume":"68","author":"M-H Lin","year":"2009","unstructured":"Lin, M.-H.: An optimal workload-based data allocation approach for multidisk databases. Data Knowl. Eng. 68(5), 499\u2013508 (2009)","journal-title":"Data Knowl. Eng."},{"key":"9297_CR34","doi-asserted-by":"crossref","unstructured":"Mahajan, A., Ali, M.: Hybrid evolutionary algorithm for the graph coloring register allocation problem for embedded systems. In: Transactions on Computational Science V. volume 5540 of Lecture Notes in Computer Science, pp. 206\u2013219. Springer, Berlin\/Heidelberg (2009)","DOI":"10.1007\/978-3-642-02097-1_11"},{"issue":"11","key":"9297_CR35","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighbourhood decomposition search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9297_CR36","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/1379022.1375609","volume":"43","author":"Q Pereira","year":"2008","unstructured":"Pereira, Q., Magno, F., Jens, P.: Register allocation by puzzle solving. SIGPLAN Not 43(6), 216\u2013226 (2008)","journal-title":"SIGPLAN Not"},{"key":"9297_CR37","unstructured":"Porumbel, D.: DIMACS graphs: Benchmark instances and best upper bound (2009)"},{"key":"9297_CR38","doi-asserted-by":"crossref","unstructured":"Porumbel, D., Hao, J.-K., Kuntz, P.: Diversity control and multi-parent recombination for evolutionary graph coloring algorithms. In: Proceedings of the EvoCOP Evolutionay Computation in Combinatorial Optimization, pp. 121\u2013132. T\u00fcbingen, Germany (2009)","DOI":"10.1007\/978-3-642-01009-5_11"},{"key":"9297_CR39","volume-title":"Advances in Metaheuristics. Operations Research\/Computer Science Interfaces Series","author":"A Reinholz","year":"2013","unstructured":"Reinholz, A., Schneider, H.: A hybrid (1+1)-evolutionary strategy for the open vehicle routing problem. In: Di Gaspero, L., Schaerf, A., St\u00fctzle, T. (eds.) Advances in Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol. 53. Springer, New York (2013)"},{"issue":"8","key":"9297_CR40","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1007\/s00500-013-1157-9","volume":"18","author":"M Sevaux","year":"2014","unstructured":"Sevaux, M., Rossi, A., Soto, M., Duarte, A., Mart\u00ed, R.: Grasp with ejection chains for the dynamic memory allocation in embedded systems. Soft Comput. 18(8), 1515\u20131527 (2014)","journal-title":"Soft Comput."},{"issue":"2","key":"9297_CR41","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1142\/S0217595911003132","volume":"28","author":"M Sevaux","year":"2011","unstructured":"Sevaux, M., Singh, A., Rossi, A.: Tabu search for multiprocessor scheduling: application to high level synthesis. Asia-Pac. J. Oper. Res. 28(2), 201\u2013212 (2011)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9297_CR42","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-79438-7_12","volume-title":"Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence","author":"K S\u00f6rensen","year":"2008","unstructured":"S\u00f6rensen, K., Sevaux, M., Schittekat, P.: \u201cMultiple neighbourhood\u201d search in commercial vrp packages: Evolving towards self-adaptive methods. In: Cotta, C., Sevaux, M., S\u00f6rensen, K. (eds.) Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol. 136, pp. 239\u2013253. Springer, Berlin (2008)"},{"key":"9297_CR43","unstructured":"Soto, M., Rossi, A., Sevaux, M.: Two upper bounds on the chromatic number. In: Proceedings of the CTW09 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 191\u2013194. Paris, France (2009)"},{"key":"9297_CR44","unstructured":"Soto, M., Rossi, A., Sevaux, M.: M\u00e9taheuristiques pour l\u2019allocation de m\u00e9moire dans les syst\u00e8mes embarqu\u00e9s. In: Proceedings of the ROADEF 11e congr\u00e8s de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationelle est d\u2019Aide \u00e0 la D\u00e9cision, pp. 35\u201343. Toulouse, France (2010)"},{"issue":"1","key":"9297_CR45","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10732-011-9165-3","volume":"18","author":"M Soto","year":"2011","unstructured":"Soto, M., Rossi, A., Sevaux, M.: A mathematical model and a metaheuristic approach for a memory allocation problem. J. Heuristics 18(1), 149\u2013167 (2011)","journal-title":"J. Heuristics"},{"key":"9297_CR46","doi-asserted-by":"crossref","unstructured":"Soto, M., Rossi, A., Sevaux, M.: Two iterative metaheuristic approaches to dynamic memory allocation for embedded systems. In: Merz, P., Hao, J.-K. (eds) Evolutionary Computation in Combinatorial Optimization, Proceedings of the 11th European Conference, EvoCOP 2011. Torino, Italy, April 27-29 (2011). Lecture Notes in Computer Science, vol. 6622, pp. 250\u2013261. Springer (2011)","DOI":"10.1007\/978-3-642-20364-0_22"},{"issue":"1","key":"9297_CR47","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2013.05.016","volume":"231","author":"M Soto","year":"2013","unstructured":"Soto, M., Rossi, A., Sevaux, M.: Iterative approaches for a dynamic memory allocation problem in embedded systems. Eur. J. Oper. Res. 231(1), 34\u201342 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9297_CR48","doi-asserted-by":"crossref","unstructured":"Soto, M., Sevaux, M., Rossi, A., Laurent, J.: Memory Allocation Problems in Embedded Systems: Optimization Methods. Wiley-ISTE, Paris, London (2013)","DOI":"10.1002\/9781118577585"},{"key":"9297_CR49","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. Technical report (1998)"},{"issue":"4\u20135","key":"9297_CR50","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Paper: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"9297_CR51","volume-title":"Metaheuristics","author":"K Trabelsi","year":"2010","unstructured":"Trabelsi, K., Sevaux, M., Coussy, P., Rossi, A., S\u00f6rensen, K.: Advanced Metaheuristics for high-level synthesis. Metaheuristics. Springer, Berlin (2010)"},{"key":"9297_CR52","unstructured":"Wuytack, S., Catthoor, F., Nachtergaele, L., De Man, H.: Power exploration for data dominated video application. In: Proceedings of the IEEE International Symposium on Low Power Electronics and Design, pp. 359\u2013364. Monterey, CA, USA (1996)"},{"key":"9297_CR53","doi-asserted-by":"crossref","unstructured":"Xuan, D., Zongbin, L., Xinqin, G., Lijun, Y.: Optimizing the performance of chip shooter machine based on improved genetic algorithm. In: Proceedings of 7th World Congress on Intelligent Control and Automation, pp. 2849\u20132853. Chongqing, China (2008)","DOI":"10.1109\/WCICA.2008.4593377"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9297-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9297-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9297-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T10:06:47Z","timestamp":1566986807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9297-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,18]]},"references-count":53,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9297"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9297-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,18]]}}}