A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
From MaRDI portal
Publication:363596
DOI10.1007/s10479-013-1322-7zbMath1271.90015OpenAlexW2056274416MaRDI QIDQ363596
Publication date: 3 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/28284/
Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- Nonlinear multiobjective optimization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A survey of combinatorial optimization problems in multicast routing
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- Finding the k Shortest Paths
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Genetic local search for multi-objective combinatorial optimization
- Steiner tree problems
This page was built for publication: A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems