An improved simulated annealing algorithm for bilevel multiobjective programming problems with application

DOI10.22436/JNSA.009.06.19zbMATH Open1338.65173OpenAlexW2793740761MaRDI QIDQ2812433

Zhong Chen, Yue Zheng, Jiawei Chen, Tao Zhang

Publication date: 16 June 2016

Published in: Journal of Nonlinear Science and Applications (Search for Journal in Brave)

Full work available at URL: http://www.tjnsa.com/includes/files/articles/Vol9_Iss6_3672--3685_An_improved_simulated_annealing_alg.pdf

zbMATH Keywords

simulated annealing algorithmPareto optimal solutionbilevel multiobjective programmingelite strategy

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10)

Related Items (4)

Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem ⋮ A comparative study of two optimization approaches for solving bi-level multi-objective linear fractional programming problem ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Computational Science – ICCS 2005

This page was built for publication: An improved simulated annealing algorithm for bilevel multiobjective programming problems with application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2812433)