Ant algorithms and simulated annealing for multicriteria dynamic programming

Authors:
Sebastian Sitarz
Affiliations:
Institute of Mathematics, University of Silesia, ul. Bankowa 14, 40-007 Katowice, Poland
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 2

Simulated annealing: theory and applications

Simulated annealing: theory and applications
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Performance of the MOSA Method for the Bicriteria Assignment Problem

Journal of Heuristics
Dynamic Programming

Dynamic Programming
A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain

Computers and Industrial Engineering
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Dynamic programming with ordered structures: Theory, examples and applications

Fuzzy Sets and Systems
Interactive procedure for a multiobjective stochastic discrete dynamic problem

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper presents a comparison of ant algorithms and simulated annealing as well as their applications in multicriteria discrete dynamic programming. The considered dynamic process consists of finite states and decision variables. In order to describe the effectiveness of multicriteria algorithms, four measures of the quality of the nondominated set approximations are used.