An important stage in circuit design is placement where components are assigned to physical locations on a chip A popular contemporary method for placement is the use of simulated annealing While this approach has been shown to produce good placement solutions recent work in genetic algorithms has produced promising results The purpose of this study is to determine which approach will result in...

The Nose! ± Hoover chain thermostat of Martyna, Klein and Tuckerman has been adapted to work with our generalized valence bond ab initio molecular dynamics (AIMD) method, allowing us to perform AIMD in the canonical ensemble (constant number of particles, temperature, and volume). The canonical ensemble is ideal for simulated annealing, which can be used to ® nd global potential energy minima. ...

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...

One way to alleviate the heavy computation required by simulated annealing placement algorithms is to replace a significant fraction of the higher or middle temperatures with a faster heuristic, and then follow it with simulated annealing. A crucial issue in this approach is the determination of the starting temperature for the simulated annealing phase-a temperature should be chosen that cause...