<p>Route optimization problem using vehicle routing (VRP) and time window constraint is explained as finding paths for a finite count of vehicles to provide service huge number customers hence, optimizing the path in given duration window. The loop have restricted intake capacity. This initiates from depot, delivers goods, stops at depot. Each customer serve exactly once. If arrival befor...

The mechanism of route search problem is applied to various engineering fields. The various researches for the dynamic routing only revile the shortest path from source to destination but not vice versa. Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when stagnation behavior is avoided. Several approaches have been integrated wit...

Gate resizing for minimum circuit delay is a fundamental problem in the performance optimization of gate-level circuits. In this paper , we study the complexity of two diierent minimum-delay gate resizing problems for combinational circuits composed of single-output gates. The rst problem is that of gate resizing for minimum circuit delay under the load-dependent delay model. The second problem...