The increasing complexity of circuit design needs to be managed with appropriate optimization algorithms and accurate statistical description of design models in order to reach the design specifics, guaranteeing ’’zero defects’’. In the Design for Yield open problems are the design of effective optimization algorithms and statistical analysis for yield design, which require time consuming techn...

Deception problems are among the hardest problems to solve using ordinary genetic algorithms. Designed to simulate a high degree of epistasis, these deception problems imitate extremely difficult real world problems. [1]. Studies show that Bayesian optimization and explicit building block manipulation algorithms, like the fast messy genetic algorithm (fmGA), can help in solving these problems. ...

Transportation on demand does not stop facilitating our daily life. In fact, for 40 years the research has contributed to the resolution of the Dial a Ride Problem to improve the service offered to customers. In this research, we contributed to the resolution of a Stochastic Dial a Ride Problem while consider four problems that may inhibit the proper functioning of service Transport on Demand ,...

The main methodologies and recent patents on test wrapper design have been reviewed in this paper. The design of three-dimension test wrapper for IP module in System on Chip is a NP Hard problem. As the test time of an IP module is determined by the longest wrapper scan chain and each TSV has area costs and is a potential source of defects, it is necessary to shorten the longest wrapper chain a...

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...