{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:53:13Z","timestamp":1742932393297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181660"},{"type":"electronic","value":"9783319181677"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18167-7_11","type":"book-chapter","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T04:27:19Z","timestamp":1430972839000},"page":"117-128","source":"Crossref","is-referenced-by-count":1,"title":["A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict"],"prefix":"10.1007","author":[{"given":"Sihem Ben","family":"Jouida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahlem","family":"Ouni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"272","volume":"3","author":"S.J. David","year":"1974","unstructured":"David, S.J.: Fast algorithms for bin packing. Journal of Computer and System Sciences\u00a03, 272\u2013314 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR2","first-page":"739","volume":"5","author":"M. Maiza","year":"2011","unstructured":"Maiza, M.: Heuristics for Solving the Bin-Packing Problem with Conflict. Applied Mathematical Sciences\u00a05, 739\u2013752 (2011)","journal-title":"Applied Mathematical Sciences"},{"key":"11_CR3","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization. Wiley (1979)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., \u00d6hring, S.: Approximation Algorithms for Time Constrained Scheduling. Information and Computation\u00a0132, 85\u2013108 (1997)","journal-title":"Information and Computation"},{"key":"11_CR5","unstructured":"Kemal, K., Grdal, E.: Decision support for packing in warehouses. In: 21st International Symposium, Istanbul, Turkey (2006)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M. Gendreau","year":"2004","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Computers & Operations Research\u00a031, 347\u2013358 (2004)","journal-title":"Computers & Operations Research"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-09129-7_20","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"H. Masri","year":"2014","unstructured":"Masri, H., Krichen, S., Guitouni, A.: A Multi-start Tabu Search Approach for Solving the Information Routing Problem. In: Murgante, B., et al. (eds.) ICCSA 2014, Part II. LNCS, vol.\u00a08580, pp. 267\u2013277. Springer, Heidelberg (2014)"},{"key":"11_CR8","first-page":"281","volume":"206","author":"A. Khanafer","year":"2010","unstructured":"Khanafer, A., Clautiaux, F., Talbi, E.-G.: New lower bounds for bin packing problem with conflicts. Computers & Operations Research\u00a0206, 281\u2013288 (2010)","journal-title":"Computers & Operations Research"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing\u00a011, 345\u2013357 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/S0377-2217(02)00134-0","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research\u00a0141, 410\u2013420 (2002)","journal-title":"European Journal of Operational Research"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., Taillard, E., Werra, D.: A User\u2019s Guide to Tabu Search. Ann. Oper. Res.\u00a041, 3\u201328 (1993)","journal-title":"Ann. Oper. Res."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S.-P. Fekete","year":"2001","unstructured":"Fekete, S.-P., Schepers, J.: New classes of fast lower bounds for bin packing problems. Mathematical Programming\u00a091, 11\u201331 (2001)","journal-title":"Mathematical Programming"},{"key":"11_CR13","first-page":"1739","volume":"35","author":"M. Maiza","year":"2011","unstructured":"Maiza, M., Radjef, M.S.: Heuristics for Solving the Bin-Packing Problem with Conflicts. Applied Mathematical Sciences\u00a035, 1739\u20131752 (2011)","journal-title":"Applied Mathematical Sciences"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18167-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:45:57Z","timestamp":1676447157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18167-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181660","9783319181677"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18167-7_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}