Memetic algorithms and memetic computing optimization: A literature review
Memetic computing is a subject in computer science which considers complex structures
such as the combination of simple agents and memes, whose evolutionary interactions lead …
such as the combination of simple agents and memes, whose evolutionary interactions lead …
Multi-objective vehicle routing problems
Routing problems, such as the traveling salesman problem and the vehicle routing problem,
are widely studied both because of their classic academic appeal and their numerous real …
are widely studied both because of their classic academic appeal and their numerous real …
[LIBRO][B] Evolutionary algorithms for solving multi-objective problems
CAC Coello - 2007 - Springer
Problems with multiple objectives arise in a natural fashion in most disciplines and their
solution has been a challenge to researchers for a long time. Despite the considerable …
solution has been a challenge to researchers for a long time. Despite the considerable …
Benchmarking in optimization: Best practice and open issues
This survey compiles ideas and recommendations from more than a dozen researchers with
different backgrounds and from different institutes around the world. Promoting best practice …
different backgrounds and from different institutes around the world. Promoting best practice …
Distributed constraint optimization problems and applications: A survey
The field of multi-agent system (MAS) is an active area of research within artificial
intelligence, with an increasingly important impact in industrial and other real-world …
intelligence, with an increasingly important impact in industrial and other real-world …
[LIBRO][B] Handbook of memetic algorithms
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …
various operators in order to address optimization problems. The combination and …
Multiobjective combinatorial optimization using a single deep reinforcement learning model
This article proposes utilizing a single deep reinforcement learning model to solve
combinatorial multiobjective optimization problems. We use the well-known multiobjective …
combinatorial multiobjective optimization problems. We use the well-known multiobjective …
[LIBRO][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
A two-stage multiobjective evolutionary algorithm for multiobjective multidepot vehicle routing problem with time windows
J Wang, T Weng, Q Zhang - IEEE Transactions on Cybernetics, 2018 - ieeexplore.ieee.org
This paper proposes a multiobjective multidepot vehicle routing problem with time windows
and designs some real-world test instances. It develops a two-stage multiobjective …
and designs some real-world test instances. It develops a two-stage multiobjective …
The multiobjective multidimensional knapsack problem: a survey and a new approach
T Lust, J Teghem - International Transactions in Operational …, 2012 - Wiley Online Library
The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in
combinatorial optimization. In this paper, we consider their multiobjective extension (MOKP …
combinatorial optimization. In this paper, we consider their multiobjective extension (MOKP …