Abstract
In recent years, many researchers focus on metha-heuristics as a method to large-scale and complicated optimization problems. in these problems, an optimization method requires versatility and applicability to a characteristic of design space by combining appropriate global and local searches. Multi-Agent Optimization (MAO) is a method based on Multi-Agent System, and it has been proposed to satisfy these requirements. in this method, agents which represent solution candidates evolve by their autonomous actions and interaction with each other. through these features, it is expected that MAO can perform global search with whole agents and local search with each agent efficiently. However, it is not clear what parameters are more effective to the evolution of MAO. in this paper, an attempt is made to verify the applicability of MAO to optimization problems by clarifying effects of its parameters with numerical experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
