Stochastic global optimization is a very important subject, that has applications in virtually all areas of science and technology. Therefore there is nothing more opportune than writing a book about a successful and mature algorithm that turned out to be a good tool in solving difficult problems. Here we present some techniques for solving several problems by means of Fuzzy Adaptive Simulated ...

Experts of chance discovery have faced a new problem, where the previous methods fail to visualize a latent structure behind observation. Invisible events play an important role in the dynamics of visible events. They are called “dark events”. This paper proposes a new method named “human-interactive annealing” for revealing a latent structure and understanding dark events and illustrates pract...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

the advent of e-commerce has prompted many manufacturers to redesign their traditional channel structure by engaging in direct sales. in this paper, we present a dual channel inventory model based on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retail channel and a direct channel which stocks are kept in both upper and lower echelon. the system receives st...

‎this paper proposes a multi-supplier multi-product inventory model in which the suppliers have unlimited production capacity, allow delayed payment, and offer either an all-unit or incremental discount. the retailer can delay payment until after they have sold all the units of the purchased product. the retailer’s warehouse is limited, but the surplus can be stored in a rented warehouse at a...

Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...

We study errors of quantum annealing and simulated annealing to highlight better performance of quantum annealing over simulated annealing. Quantum annealing and simulated annealing perform optimization through a quantum adiabatic evolution and a quasi-static evolution respectively. In both methods, dynamics across a phase transition plays a crucial role. The Kibble-Zurek mechanism is known as ...