Ant algorithms and simulated annealing for multicriteria dynamic programming
type: Item
instance of: scholarly article
title: Ant algorithms and simulated annealing for multicriteria dynamic programming
zbMATH Open document ID: 1163.90743
author: Sebastian Sitarz
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5363310
zbMATH Keywords: multicriteria programming
zbMATH Keywords: dynamic programming
zbMATH Keywords: ant colony optimization
zbMATH Keywords: simulated annealing
zbMATH Keywords: hybrid algorithms
describes a project that uses: MACS-VRPTW
MaRDI profile type: Publication
full work available at URL: j.cor.2007.09.011
OpenAlex ID: W2047511944
cites work: Q3241581
cites work: Dynamic programming in multiplicative lattices
cites work: Vector-Valued Dynamic Programming
cites work: Q4789015
cites work: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
cites work: Q3785827
cites work: Discrete dynamic programming with outcomes in random variable structures
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: A new rank based version of the ant system. -- A computational study
cites work: Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
cites work: Q4365126
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Performance of the MOSA method for the bicriteria assignment problem
cites work: MOSA method: a tool for solving multiobjective combinatorial optimization problems
DOI: 10.1016/J.COR.2007.09.011
description: scientific article; zbMATH DE number 5363310