In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. There...

We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution randomization. It requires order 1/sqrt delta steps to find an optimal solution with bounded error probability, where delta is the minimum spectral gap of the stocha...

Simulated annealing (SA) presents an optimization technique with several striking positive and negative features. Perhaps its most salient feature, statistically promising to deliver an optimal solution, in current practice is often spurned to use instead modified faster algorithms, “simulated quenching” (SQ). Using the author’s Adaptive Simulated Annealing (ASA) code, some examples are given w...

This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...

In this article, since the year 2003, many heuristic methods have been applied in parallel machine scheduling problem with the simulated annealing method in the literature review. Performing a detailed literature research has revealed that there are numerous heuristic methods applied to parallel machine problems. It is seen that, among these heuristics, simulated annealing yields the best solut...

The aim of this paper is to examine two new simulated annealing approaches for Uncapacitated Facility Location (UFL) problems with some useful comparisons with the latest genetic algorithm approach (Jaramillo et al, 2002) to the problem. As it is mentioned in various publications, the simulated annealing approach may be very successful in terms of quality of the solution but not so impressive w...

Two well known stochastic optimization algorithms, simulated annealing and genetic algorithm are compared when using a sample to minimize an objective function which is the expectation of a random variable. Since they lead to minimum depending on the sample, a weighted version of simulated annealing is proposed in order to reduce this kind of overt bias. The algorithms are implemented on an opt...

This paper reports on the application of a simulated annealing algorithm to the minimum cost design of reinforced concrete retaining structures. Cantilever retaining walls are investigated, being representative of reinforced concrete retaining structures that are required to resist a combination of earth and hydrostatic loading. To solve such a constrained optimisation problem, a modified simul...