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

DOI10.22436/JNSA.009.06.19MaRDI QIDQ2812433zbMATH OpenOpenAlexFDO

Authors Tao Zhang, Zhong Chen, Yue Zheng, Jiawei Chen

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

Pareto optimal solutionsimulated annealing algorithmbilevel multiobjective programmingelite strategy

Mathematics Subject Classification ID

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

Recommendations

• An improved particle swarm optimization for solving bilevel multiobjective programming problem
• An algorithm based on particle swarm optimization for multiobjective bilevel linear problems
• An enhanced differential evolution based algorithm with simulated annealing for solving multiobjective optimization problems
• Solving a type of biobjective bilevel programming problem using NSGA-II
• Hybrid genetic algorithm for several classes of nonlinear bilevel programming problems

Cited in

(6)

• A comparative study of two optimization approaches for solving bi-level multi-objective linear fractional programming problem
• Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
• Metaheuristics for bilevel optimization: a comprehensive review
• Computational Science – ICCS 2005
• Solving a type of biobjective bilevel programming problem using NSGA-II
• An efficient chemical reaction algorithm for multi-objective combinatorial bi-level optimization

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)