Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism

DOI10.1016/S0377-2217(98)00308-7zbMath0945.90051OpenAlexW1977033367MaRDI 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)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00308-7

zbMATH Keywords

convergencesimulated annealingcombinatorial optimisationpermutation propertygeneration mechanism

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A relative position-coded differential evolution for loop-based station sequencing problem, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, Hybrid genetic algorithm for optimization problems with permutation property, A survey for the quadratic assignment problem, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, Multiprogramming genetic algorithm for optimization problems with permutation property, Hybrid flow-shop scheduling problems with multiprocessor task systems., A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles, Minimizing total tardiness in a scheduling problem with a learning effect, A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times, Genetic algorithms and simulated annealing for scheduling in agile manufacturing, Threshold accepting heuristic for fair flow optimization in wireless mesh networks, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

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