• Home
  • Search
  • Pareto Local Search Guided by Archive Entropy
  • https://doi.org/10.3390/app16020964Copy DOI Icon

Pareto Local Search Guided by Archive Entropy

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Pareto local search (PLS) serves as an important component in multi-objective combinatorial optimization. Nevertheless, achieving a balance between convergence and diversity remains a challenge, as few studies have leveraged knowledge from the search archive to effectively guide the PLS process. This paper proposes an archive entropy-guided Pareto local search algorithm (AEG-PLS). In the proposed method, the objective space is partitioned into subregions using a set of reference vectors. The archive entropy is then computed for each subregion to assess population diversity. To enhance diversity in less explored areas, a PLS is initiated using a well-performing solution selected from the subregion with the lowest entropy, thus indicating the weakest diversity. This approach promotes a more balanced trade-off between convergence and diversity throughout the optimization process. Experimental results on 25 multi-objective combinatorial optimization benchmark instances demonstrate that the proposed AEG-PLS achieves competitive performance in terms of both Inverted Generational Distance and Hypervolume metrics when compared to nine state-of-the-art multi-objective evolutionary algorithms.

Similar Papers
  • Conference Article
  • Citations10

A Fitness-based Selection Method for Pareto Local Search for Many-Objective Job Shop Scheduling

  • Jul 01, 2020
  • Atiya Masood +4
  • Research Article
  • Citations73

Anytime Pareto local search

  • Jun 01, 2015
  • European Journal of Operational Research
  • Jérémie Dubois-Lacoste +2
  • Conference Article
  • Citations7

Sets of interacting scalarization functions in local search for multi-objective combinatorial optimization problems

  • Apr 01, 2013
  • Madalina M Drugan
  • Research Article
  • Citations6

Hybrid algorithms for the twin–screw extrusion configuration problem

  • Jun 26, 2014
  • Applied Soft Computing
  • Cristina Teixeira +3
  • PDF
  • Research Article
  • Citations7

Online Knowledge Extraction and Preference Guided Multi-Objective Optimization in Manufacturing

  • Jan 01, 2021
  • IEEE Access
  • Ingemar Karlsson +2
  • Book Chapter

Combining Two-Phase Local Search with Multi-objective Ant Colony Optimization

  • Jan 01, 2018
  • Chun-Wa Leung +2
  • Conference Article
  • Citations6

Up-grading the physical topology of transparent optical networks using a multiobjective evolutionary algorithm considering quality of service and capital cost

  • Nov 01, 2009
  • Daniel A R Chaves +2
  • Research Article
  • Citations46

Combining Crowding Estimation in Objective and Decision Space With Multiple Selection and Search Strategies for Multi-Objective Evolutionary Optimization

  • May 27, 2013
  • IEEE Transactions on Cybernetics
  • Hu Xia +2
  • Research Article
  • Citations10

Multioperator search strategy for evolutionary multiobjective optimization

  • Jun 01, 2022
  • Swarm and Evolutionary Computation
  • Xiangzhou Gao +3
  • Research Article
  • Citations54

A fast sampling based evolutionary algorithm for million-dimensional multiobjective optimization

  • Dec 01, 2022
  • Swarm and Evolutionary Computation
  • Lianghao Li +5
  • Research Article
  • Citations33

Manifold Learning-Inspired Mating Restriction for Evolutionary Multiobjective Optimization With Complicated Pareto Sets.

  • May 18, 2021
  • IEEE Transactions on Cybernetics
  • Linqiang Pan +4
  • Research Article
  • Citations131

An improved multi-objective population-based extremal optimization algorithm with polynomial mutation

  • Oct 16, 2015
  • Information Sciences
  • Guo-Qiang Zeng +6
  • Conference Article
  • Citations1

Multi-objective evolutionary algorithm with non-stationary search space

  • May 27, 2001
  • E.F Khor +2
  • Research Article
  • Citations657

Multiobjective evolutionary algorithms for electric power dispatch problem

  • Jun 01, 2006
  • IEEE Transactions on Evolutionary Computation
  • M.A Abido
  • PDF
  • Research Article
  • Citations3

Retracted] Biobjective UAV/UGV Collaborative Rendezvous Planning in Persistent Intelligent Task‐Based Wireless Communication

  • Jan 01, 2021
  • Wireless Communications and Mobile Computing
  • Qin Wang +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.