Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
From MaRDI portal
Publication:1307811
DOI10.1016/S0377-2217(98)00308-7zbMath0945.90051MaRDI QIDQ1307811
Jian Ma, Peng Tian, Dong-Mo Zhang
Publication date: 11 October 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
convergence; simulated annealing; combinatorial optimisation; permutation property; generation mechanism
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Genetic algorithms and simulated annealing for scheduling in agile manufacturing, A survey for the quadratic assignment problem, Multiprogramming genetic algorithm for optimization problems with permutation property, Hybrid flow-shop scheduling problems with multiprocessor task systems., Hybrid genetic algorithm for optimization problems with permutation property, Minimizing total tardiness in a scheduling problem with a learning effect, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
Cites Work
- Optimization by Simulated Annealing
- Quadratic assignment problems
- An improved annealing scheme for the QAP
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Simulated annealing: A tool for operational research
- Optimizing simulated annealing schedules with genetic programming
- Applied simulated annealing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item