Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions

•The existing studies assume identical behavior for all candidate solutions.•In nature, we know that individuals do not react similarly to the same stimulus.•This is called character and it is lacking from existing implementations.•In this paper, we emulate the corresponding human social analogue.•W...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 292; no. 3; pp. 1019 - 1036
Main Authors Liagkouras, Konstantinos, Metaxiotis, Konstantinos
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:•The existing studies assume identical behavior for all candidate solutions.•In nature, we know that individuals do not react similarly to the same stimulus.•This is called character and it is lacking from existing implementations.•In this paper, we emulate the corresponding human social analogue.•We implement the different behaviors with the assistance of a novel mutation operator. The fundamental unit of each evolutionary algorithm is the individual. Each individual represents a potential solution to the problem at hand. Despite the importance of individual solution for multi-objective algorithms’ performance the majority of the existing implementations select a simplistic approach by assuming identical behavior for all candidate solutions of a population. However, from the biological analogue we know that individuals do not react similarly to the same stimulus. This is called character and it is lacking from existing implementations. In this paper, we emulate the corresponding human social analogue by generating individuals that exhibit different behavior when are subject to the same stimulus. The implementation of different behaviors is facilitated through a novel mutation operator. The experimental results favor the proposed approach when compared with other state-of-the-art algorithms for a number of test instances.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2020.11.028