Ant algorithms and simulated annealing for multicriteria dynamic programming
DOI10.1016/J.COR.2007.09.011zbMATH Open1163.90743OpenAlexW2047511944MaRDI QIDQ954043FDOQ954043
Authors: 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
Recommendations
simulated annealingant colony optimizationdynamic programminghybrid algorithmsmulticriteria programming
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- Performance of the MOSA method for the bicriteria assignment problem
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- 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
- Vector-Valued Dynamic Programming
- Title not available (Why is that?)
- Discrete dynamic programming with outcomes in random variable structures
- Title not available (Why is that?)
Cited In (9)
- Hybrid methods in multi-criteria dynamic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Title not available (Why is that?)
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- 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
This page was built for publication: Ant algorithms and simulated annealing for multicriteria dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954043)