Ant algorithms and simulated annealing for multicriteria dynamic programming

DOI10.1016/j.cor.2007.09.011zbMath1163.90743OpenAlexW2047511944MaRDI QIDQ954043

Sebastian Sitarz

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.09.011

zbMATH Keywords

dynamic programmingsimulated annealinghybrid algorithmsant colony optimizationmulticriteria programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (3)

Interactive procedure for a multiobjective stochastic discrete dynamic problem ⋮ Dynamic programming with ordered structures: Theory, examples and applications ⋮ Multiple criteria dynamic programming and multiple knapsack problem

Uses Software

• MACS-VRPTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete dynamic programming with outcomes in random variable structures
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• A new rank based version of the ant system. -- A computational study
• Dynamic programming in multiplicative lattices
• Performance of the MOSA method for the bicriteria assignment problem
• Vector-Valued Dynamic Programming
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
• MOSA method: a tool for solving multiobjective combinatorial optimization problems

This page was built for publication: Ant algorithms and simulated annealing for multicriteria dynamic programming