Multiobjective Simulated Annealing: Principles and Algorithm Variants

Amine, Khalil

doi:10.1155/2019/8134674

Cited by 65 publications

(41 citation statements)

References 79 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There have been several works with regard to the application of simulated annealing (SA)-based metaheuristics for multiobjective optimisation. A review of the state of the art of multiobjective SA algorithms is presented by [3]. Tekinalp and Karsli [44] develops a multiobjective SA for continuous optimisation problems.…”

Section: Related Workmentioning

confidence: 99%

A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals

Nourmohammadzadeh

Voß

2021

Ann Math Artif Intell

View full text Add to dashboard Cite

The ever increasing demand for container transportation has led to the congestion of maritime container terminals in the world. In this work, the two interrelated problems of berth and quay crane scheduling are considered in an integrated multiobjective mathematical model. A special character of this model is that the arrival times of vessels and the failure (working) times of quay cranes are not deterministic and can vary based on some scenarios. Hence, a robust model is devised for the problem having three objectives of minimising the deviations from target berthing locations and times as well as departure delays of all vessels. This robust optimisation seeks to minimise the value of the objectives regarding all the scenarios. An exact solution approach based on the 𝜖-constraint method by the Gurobi software is applied. Moreover, regarding the complexity of the problem, two Simulated Annealing (SA) based metaheuristics, namely a Multi-Objective Simulated Annealing (MOSA) and a Pareto Simulated Annealing (PSA) approach are adapted with a novel solution encoding scheme. The three methods are compared based on some multiobjective metrics and a statistical test. The advantage of the integration of berth and quay crane scheduling is examined as well.

show abstract

Section: Related Workmentioning

confidence: 99%

A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals

Nourmohammadzadeh

Voß

2021

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…In this paper, the Simulated Annealing (SA) optimization method [16] is employed, initially conditioned with a proposed analytic model, to extract perturbed tapers' modal content solely from its spectral measures. First, we introduce a method to characterize the fabrication imperfections through a curvature function phenomenologically and model the taper's perturbation outline.…”

Section: Introductionmentioning

confidence: 99%

Spectral Modal Decomposition of Abrupt Fiber Tapers Based on Simulated Annealing Method

Ghasemi

Yam

2021

J. Lightwave Technol.

View full text Add to dashboard Cite

“…Compared to other heuristic algorithms, MSAA is a probabilistic local search method. It can efficiently find the approximate optimal solution of the problem due to its asymptotic convergence [20]. In this paper, the chaotic S-box set is generated iteratively by digital cascaded chaotic mapping, and the composite objective function is constructed based on the analysis of the S-box performance index.…”

Section: Introductionmentioning

confidence: 99%

Construction Method and Performance Analysis of Chaotic S-Box Based on a Memorable Simulated Annealing Algorithm

et al. 2020

View full text Add to dashboard Cite

The substitution box (S-box) is the only nonlinear components in the symmetric block cipher. Its performance directly determines the security strength of the block cipher. With the dynamic characteristics degradation and the local periodic phenomenon of digital chaos, and the security problems caused by them becoming more and more prominent, how to efficiently generate an S-box with security guarantee based on chaos has gradually attracted the attention of cryptographers. In this paper, a chaotic S-box construction method is proposed based on a memorable simulated annealing algorithm (MSAA). The chaotic S-box set is produced by using the nonlinearity and randomness of the dynamic iteration of digital cascaded chaotic mapping. The composite objective function is constructed based on the analysis of the performance indexes of S-box. The MSAA is used to efficiently optimize the S-box set. The matrix segmentation and scrambling operations are carried out on the optimized S-box. The cryptographic performance of chaotic S-box is tested and analyzed, and compared with the mainstream chaotic S-box of the same kind. The results show that the S-box constructed in this paper can not only stably and efficiently generate chaotic S-box with better performance, but also make an effective exploration of the construction of chaotic S-boxes based on intelligent algorithms.

show abstract

Multiobjective Simulated Annealing: Principles and Algorithm Variants

Cited by 65 publications

References 79 publications

A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals

A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals

Spectral Modal Decomposition of Abrupt Fiber Tapers Based on Simulated Annealing Method

Construction Method and Performance Analysis of Chaotic S-Box Based on a Memorable Simulated Annealing Algorithm

Contact Info

Product

Resources

About