<p>Hybrid metaheuristics can effectively tackle multi-objective optimization problems. Recently, researchers gained interest in procedures, referred to as <i>architectures</i>, that can provide generic functionalities and features for hybridizing arbitrary metaheuristics. Although a previously proposed multi-agent architecture, <i>MO-MAHM</i>, achieved high-quality solutions for bi-objective problems, its application for more than two objectives requires further discussions. To this end, <i>MO</i>-<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12293_2025_460_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\hbox {MAHM}_E\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>MAHM</mtext> <mi>E</mi> </msub> </math></EquationSource> </InlineEquation>, a <i>MO-MAHM</i> extension for handling two or more objectives, is proposed in this paper. <i>MO</i>-<InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12293_2025_460_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\hbox {MAHM}_E\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>MAHM</mtext> <mi>E</mi> </msub> </math></EquationSource> </InlineEquation> maintains concepts from particle swarm optimization and multi-agent paradigms, including particle movement and agent intelligence. Further, it uses a decomposition-based velocity operator prescinding from aggregation functions and reinforcement learning automata scheme for supporting the decisions of the agents. This paper shows that these algorithmic components can significantly improve the architectural performance. We apply <i>MO</i>-<InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12293_2025_460_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\hbox {MAHM}_E\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>MAHM</mtext> <mi>E</mi> </msub> </math></EquationSource> </InlineEquation> to the quadratic assignment problem with up to four objectives. Hybridization combines three evolutionary algorithms and a local search. A comparison of the experimental results of <i>MO</i>-<InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12293_2025_460_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\hbox {MAHM}_E\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mtext>MAHM</mtext> <mi>E</mi> </msub> </math></EquationSource> </InlineEquation> and ten algorithms (including hybrid approaches, hyper-heuristics, and algorithms from the quadratic assignment problem literature) is presented.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A novel multi-agent architecture based on decomposition and learning automata to hybridize multi-objective metaheuristics

  • Islame F. C. Fernandes,
  • Elizabeth F. G. Goldbarg,
  • Silvia M. D. M. Maia

摘要

Hybrid metaheuristics can effectively tackle multi-objective optimization problems. Recently, researchers gained interest in procedures, referred to as architectures, that can provide generic functionalities and features for hybridizing arbitrary metaheuristics. Although a previously proposed multi-agent architecture, MO-MAHM, achieved high-quality solutions for bi-objective problems, its application for more than two objectives requires further discussions. To this end, MO- \(\hbox {MAHM}_E\) MAHM E , a MO-MAHM extension for handling two or more objectives, is proposed in this paper. MO- \(\hbox {MAHM}_E\) MAHM E maintains concepts from particle swarm optimization and multi-agent paradigms, including particle movement and agent intelligence. Further, it uses a decomposition-based velocity operator prescinding from aggregation functions and reinforcement learning automata scheme for supporting the decisions of the agents. This paper shows that these algorithmic components can significantly improve the architectural performance. We apply MO- \(\hbox {MAHM}_E\) MAHM E to the quadratic assignment problem with up to four objectives. Hybridization combines three evolutionary algorithms and a local search. A comparison of the experimental results of MO- \(\hbox {MAHM}_E\) MAHM E and ten algorithms (including hybrid approaches, hyper-heuristics, and algorithms from the quadratic assignment problem literature) is presented.