IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v17y2025i11p488-d1779367.html

TRIDENT-DE: Triple-Operator Differential Evolution with Adaptive Restarts and Greedy Refinement

Author

Listed:
  • Vasileios Charilogis

    (Department of Informatics and Telecommunications, University of Ioannina, Kostaki, 47150 Artas, Greece)

  • Ioannis G. Tsoulos

    (Department of Informatics and Telecommunications, University of Ioannina, Kostaki, 47150 Artas, Greece)

  • Anna Maria Gianni

    (Department of Informatics and Telecommunications, University of Ioannina, Kostaki, 47150 Artas, Greece)

Abstract

This paper introduces TRIDENT-DE, a novel ensemble-based variant of Differential Evolution (DE) designed to tackle complex continuous global optimization problems. The algorithm leverages three complementary trial vector generation strategies best/1/bin, current-to-best/1/bin, and pbest/1/bin executed within a self-adaptive framework that employs jDE parameter control. To prevent stagnation and premature convergence, TRIDENT-DE incorporates adaptive micro-restart mechanisms, which periodically reinitialize a fraction of the population around the elite solution using Gaussian perturbations, thereby sustaining exploration even in rugged landscapes. Additionally, the algorithm integrates a greedy line-refinement operator that accelerates convergence by projecting candidate solutions along promising base-to-trial directions. These mechanisms are coordinated within a mini-batch update scheme, enabling aggressive iteration cycles while preserving diversity in the population. Experimental results across a diverse set of benchmark problems, including molecular potential energy surfaces and engineering design tasks, show that TRIDENT-DE consistently outperforms or matches state-of-the-art optimizers in terms of both best-found and mean performance. The findings highlight the potential of multi-operator, restart-aware DE frameworks as a powerful approach to advancing the state of the art in global optimization.

Suggested Citation

  • Vasileios Charilogis & Ioannis G. Tsoulos & Anna Maria Gianni, 2025. "TRIDENT-DE: Triple-Operator Differential Evolution with Adaptive Restarts and Greedy Refinement," Future Internet, MDPI, vol. 17(11), pages 1-30, October.
  • Handle: RePEc:gam:jftint:v:17:y:2025:i:11:p:488-:d:1779367
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/17/11/488/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/17/11/488/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    2. Trevor Hastie & Robert Tibshirani, 1987. "Non‐Parametric Logistic and Proportional Odds Regression," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 36(3), pages 260-276, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
    2. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    3. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    4. H. A. J. Crauwels & C. N. Potts & L. N. Van Wassenhove, 1998. "Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 341-350, August.
    5. Eva K. Lee & Siddhartha Maheshwary & Jacquelyn Mason & William Glisson, 2006. "Large-Scale Dispensing for Emergency Response to Bioterrorism and Infectious-Disease Outbreak," Interfaces, INFORMS, vol. 36(6), pages 591-607, December.
    6. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    7. Lucic, Panta & Teodorovic, Dusan, 1999. "Simulated annealing for the multi-objective aircrew rostering problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 33(1), pages 19-45, January.
    8. Ramesh Teegavarapu & Slobodan Simonovic, 2002. "Optimal Operation of Reservoir Systems using Simulated Annealing," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 16(5), pages 401-428, October.
    9. Agasse-Duval, Marius & Lawford, Steve, 2025. "Subgraphs and motifs in a dynamic airline network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 673(C).
    10. Samer Hanoun & Asim Bhatti & Doug Creighton & Saeid Nahavandi & Phillip Crothers & Celeste Gloria Esparza, 2016. "Target coverage in camera networks for manufacturing workplaces," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1221-1235, December.
    11. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    12. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    13. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    14. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
    15. Iwona Paprocka & Damian Krenczyk, 2023. "On Energy Consumption and Productivity in a Mixed-Model Assembly Line Sequencing Problem," Energies, MDPI, vol. 16(20), pages 1-19, October.
    16. Gino Lim & Laleh Kardar & Wenhua Cao, 2014. "A hybrid framework for optimizing beam angles in radiation therapy planning," Annals of Operations Research, Springer, vol. 217(1), pages 357-383, June.
    17. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    18. Ho, Sin C. & Leung, Janny M.Y., 2010. "Solving a manpower scheduling problem for airline catering using metaheuristics," European Journal of Operational Research, Elsevier, vol. 202(3), pages 903-921, May.
    19. Vasileios Charilogis & Ioannis G. Tsoulos, 2025. "Healing Intelligence: A Bio-Inspired Metaheuristic Optimization Method Using Recovery Dynamics," Future Internet, MDPI, vol. 17(10), pages 1-46, September.
    20. Nwana, V. & Darby-Dowman, K. & Mitra, G., 2005. "A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound," European Journal of Operational Research, Elsevier, vol. 164(1), pages 12-23, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:17:y:2025:i:11:p:488-:d:1779367. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.