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

Tian, Peng; Ma, Jian; Zhang, Dongmo

doi:10.1016/s0377-2217(98)00308-7

Cited by 82 publications

(46 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These moving types are the most commonly used types of perturbation schemes. Detailed analysis of them can be found in Tian et al 19 for SA algorithm. Solution representation examples for VRP, PFSP, and QAP are given in Table 3.…”

Section: Permutation Solution Representationmentioning

confidence: 99%

A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems

Alabaş-Uslu

Dengız

2014

IJCIS

View full text Add to dashboard Cite

This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem. For this purpose, a modified local search algorithm free from parameter tuning, called SelfAdaptive Local Search (SALS), is proposed for obtaining qualified solutions to combinatorial problems within reasonable amount of computer times. SALS is applied to several combinatorial optimization problems, namely, classical vehicle routing, permutation flow-shop scheduling, quadratic assignment, and topological design of networks. It is observed that self-adaptive structure of SALS provides implementation simplicity and flexibility to the considered combinatorial optimization problems. Detailed computational studies confirm the performance of SALS on the suit of test problems for each considered problem type especially in terms of solution quality.

show abstract

Section: Permutation Solution Representationmentioning

confidence: 99%

A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems

Alabaş-Uslu

Dengız

2014

IJCIS

View full text Add to dashboard Cite

show abstract

“…The following presents the implementation of SA algorithm. For detailed description of the SA method, the reader is referred to the literature of Aarts and Lenstra (2003), Kirkpatrick et al (1983) and Tian et al (1999).…”

Section: Simulated Annealing (Sa)mentioning

confidence: 99%

An imperialist competitive algorithm mixed model assembly line sequencing problem on just in time system

Hemmati¹,

Hemmati²,

Ahmadifard³

2012

Sci. Res. Essays

View full text Add to dashboard Cite

Mixed-model lines are used to produce several kinds of models in small lots without carrying large inventories. The production sequence for the mixed-model sequencing problem depends on the goals of the production facility. In order to enjoy the useful application of these lines, it is vital to devise a schedule for assembling the different products to be determined. Based on the NP-hardness of the problem, this present paper introduces an imperialist competitive algorithm (ICA) in three phases so as to solve a just-in-time (JIT) sequencing problem where the diversity of production rates to be optimized. Performance of the ICA was compared against two other search heuristics genetic algorithm (GA) and simulated annealing (SA) in small, medium and large problems. To compare presented algorithm with previous ones, an extensive computational study on 3 sets of benchmark problems has been conducted. Experimental results showed that our algorithm outperforms the previous algorithms, in respect of comparison metric.

show abstract

“…Where, f is a perturbation function [9]. Then, calculate a new value of objective function and assign it to variable ITAE new ; Step 3: calculate the accepting probability of the new parameters:…”

Section: Self-optimization Of Fuzzy Control Systemmentioning

confidence: 99%

A Fuzzy Control-Based Service Configuration Approach for Ubiquitous Computing Applications

Zhang

Han

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis paper proposes a novel service configuration approach that can realize dynamic critical Quality of Service (QoS) adaptation to ever-changing and resource-limited ubiquitous computing environments. In the approach, service configuration is reduced to a Fuzzy Control System (FCS) which aims to achieve critical QoS variations on minimal level with less power cost. Two configuration strategies, service chain reconfiguration and QoS parameters adjustment, along with a configuration algorithm, are implemented to handle different types of QoS variations. A self-optimizing algorithm is designed to enhance the adaptation of the FCS. Simulation results validate the proposed approach.

show abstract

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

Cited by 82 publications

References 15 publications

A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems

A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems

An imperialist competitive algorithm mixed model assembly line sequencing problem on just in time system

A Fuzzy Control-Based Service Configuration Approach for Ubiquitous Computing Applications

Contact Info

Product

Resources

About