{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:40:09Z","timestamp":1751064009668,"version":"3.41.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016agp0006","type":"journal-article","created":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T22:25:44Z","timestamp":1512080744000},"page":"2897-2905","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Pareto Local Search for Multi-Objective DCOPs"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Maxime","family":"CLEMENT","sequence":"first","affiliation":[{"name":"The Graduate University for Advanced Studies"},{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tenda","family":"OKIMOTO","sequence":"additional","affiliation":[{"name":"Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"INOUE","sequence":"additional","affiliation":[{"name":"The Graduate University for Advanced Studies"},{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] P.J. Modi, W.-M. Shen, M. Tambe, and M. Yokoo, \u201cADOPT: Asynchronous distributed constraint optimization with quality guarantees,\u201d Artif. Intell., vol.161, no.1-2, pp.149-180, 2005. 10.1016\/j.artint.2004.09.003","DOI":"10.1016\/j.artint.2004.09.003"},{"key":"2","unstructured":"[2] A. Petcu and B. Faltings, \u201cA scalable method for multiagent constraint optimization,\u201d Proc. 19th International Joint Conference on Artificial Intelligence, pp.266-271, 2005."},{"key":"3","unstructured":"[3] R. Maheswaran, M. Tambe, E. Bowring, J. Pearce, and P. Varakantham, \u201cTaking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling,\u201d Proc. 3rd International Conference on Autonomous Agents and Multiagent Systems, pp.310-317, 2004."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] V. Lesser, C. Ortiz, and M. Tambe, eds., Distributed Sensor Networks: A Multiagent Perspective, Kluwer Academic Publishers, 2003.","DOI":"10.1007\/978-1-4615-0363-7"},{"key":"5","unstructured":"[5] R. Junges and A. Bazzan, \u201cEvaluating the performance of DCOP algorithms in a real world, dynamic problem,\u201d Proc. 7th International Conference on Autonomous Agents and Multiagent Systems, pp.599-606, 2008."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] E. Roll\u00f3n and J. Larrosa, \u201cBucket elimination for multiobjective optimization problems,\u201d J. Heuristics., vol.12, no.4-5, pp.307-328, 2006. 10.1007\/s10732-006-6726-y","DOI":"10.1007\/s10732-006-6726-y"},{"key":"7","unstructured":"[7] E. Roll\u00f3n and J. Larrosa, \u201cMulti-objective russian doll search,\u201d Proc. 22nd AAAI Conference on Artificial Intelligence, pp.249-254, 2007."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] R. Marinescu, \u201cExploiting problem decomposition in multi-objective constraint optimization,\u201d Proc. 15th International Conference on Principles and Practice of Constraint Programming, pp.592-607, 2009. 10.1007\/978-3-642-04244-7_47","DOI":"10.1007\/978-3-642-04244-7_47"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] T. Matsui, M. Silaghi, K. Hirayama, M. Yokoo, and H. Matsuo, \u201cDistributed search method with bounded cost vectors on multiple objective DCOPs,\u201d Proc. 15th International Conference on Principles and Practice of Multi-Agent Systems, pp.137-152, 2012. 10.1007\/978-3-642-32729-2_10","DOI":"10.1007\/978-3-642-32729-2_10"},{"key":"10","unstructured":"[11] T. Okimoto, N. Schwind, M. Clement, and K. Inoue, \u201cLp-norm based algorithm for multi-objective distributed constraint optimization,\u201d Proc. 13th International Conference on Autonomous Agents and Multiagent Systems, pp.1427-1428, 2014."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] A. Rogers, A. Farinelli, R. Stranders, and N. Jennings, \u201cBounded approximate decentralised coordination via the max-sum algorithm,\u201d Artif. Intell., vol.175, no.2, pp.730-759, 2011. 10.1016\/j.artint.2010.11.001","DOI":"10.1016\/j.artint.2010.11.001"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] L. Paquete, M. Chiarandini, and T. St\u00fctzle, \u201cPareto local optimum sets in the bi-objective traveling salesman problem: An experimental study,\u201d Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, pp.177-200, Springer Verlag, 2004. 10.1007\/978-3-642-17144-4_7","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] M. Wack, T. Okimoto, M. Clement, and K. Inoue, \u201cLocal search based approximate algorithm for multi-objective DCOPs,\u201d International Conference on Principles and Practice of Multi-Agent Systems, pp.390-406, Springer, 2014. 10.1007\/978-3-319-13191-7_32","DOI":"10.1007\/978-3-319-13191-7_32"},{"key":"14","unstructured":"[15] T. Schiex, H. Fargier, and G. Verfaillie, \u201cValued constraint satisfaction problems: Hard and easy problems,\u201d Proc. 14th International Joint Conference on Artificial Intelligence, pp.631-639, 1995."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] F.T. Leighton, \u201cA graph coloring algorithm for large scheduling problems,\u201d J. Res. Nat. Bur. Stand., vol.84, no.6, pp.489-506, 1979. 10.6028\/jres.084.024","DOI":"10.6028\/jres.084.024"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] W. Zhang, G. Wang, Z. Xing, and L. Wittenburg, \u201cDistributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks,\u201d Artif. Intell., vol.161, no.1-2, pp.55-87, 2005. 10.1016\/j.artint.2004.10.004","DOI":"10.1016\/j.artint.2004.10.004"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] C.M. Fonseca, L. Paquete, and M. L\u00f3pez-Ib\u00e1\u00f1ez, \u201cAn improved dimension-sweep algorithm for the hypervolume indicator,\u201d Proc. 2006 Congress on Evolutionary Computation (CEC 2006), pp.1157-1163, IEEE Press, Piscataway, NJ, July 2006. 10.1109\/cec.2006.1688440","DOI":"10.1109\/CEC.2006.1688440"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] K. Hirayama and M. Yokoo, \u201cThe distributed breakout algorithms,\u201d Artif. Intell., vol.161, no.1-2, pp.89-115, 2005. 10.1016\/j.artint.2004.08.004","DOI":"10.1016\/j.artint.2004.08.004"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[20] E. Angel, E. Bampis, and L. Gourv\u00e8s, \u201cApproximating the pareto curve with local search for the bicriteria tsp (1, 2) problem,\u201d Theor. Comput. Sci., vol.310, no.1-3, pp.135-146, 2004. 10.1016\/s0304-3975(03)00376-1","DOI":"10.1016\/S0304-3975(03)00376-1"},{"key":"20","unstructured":"[21] F. Amigoni, A. Castelletti, and M. Giuliani, \u201cModeling the management of water resources systems using multi-objective DCOPs,\u201d Proc. 2015 International Conference on Autonomous Agents and Multiagent Systems, pp.821-829, International Foundation for Autonomous Agents and Multiagent Systems, 2015."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[22] R. Marinescu, \u201cBest-first vs. depth-first and\/or search for multi-objective constraint optimization,\u201d Proc. 22nd IEEE International Conference on Tools with Artificial Intelligence, pp.439-446, 2010. 10.1109\/ictai.2010.69","DOI":"10.1109\/ICTAI.2010.69"},{"key":"22","unstructured":"[23] P. Perny and O. Spanjaard, \u201cNear admissible algorithms for multiobjective search,\u201d Proc. 18th European Conference on Artificial Intelligence, pp.490-494, 2008."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[24] M.M. Drugan and D. Thierens, \u201cStochastic pareto local search: Pareto neighbourhood exploration and perturbation strategies,\u201d J. Heuristics., vol.18, no.5, pp.727-766, 2012. 10.1007\/s10732-012-9205-7","DOI":"10.1007\/s10732-012-9205-7"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[25] M. Inja, C. Kooijman, M. de Waard, D.M. Roijers, and S. Whiteson, \u201cQueued pareto local search for multi-objective optimization,\u201d Proc. 13th International Conference on Parallel Problem Solving from Nature, pp.589-599, 2014. 10.1007\/978-3-319-10762-2_58","DOI":"10.1007\/978-3-319-10762-2_58"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/12\/E100.D_2016AGP0006\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:17:42Z","timestamp":1751062662000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/12\/E100.D_2016AGP0006\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016agp0006","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}