An Application of Simulated Annealing to Maze Routing
نویسنده
چکیده
The simulated annealing optimisation technique is used to provide a framework for controlling ripup and rerouting transformations within an implementation of Lee‘s routing algorithm. The performance of the optimised router is compared with a more traditional implementation of Lee’s algorithm. The results show a significant improvement in completion rate obtained by the optimised router. In addition, the versatility of the optimised router is confirmed by the diverse nature of the experimental data.
منابع مشابه
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملA Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips
Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...
متن کاملAPHYDS: The Academic Physical Design Skeleton
Physical Design is a complex CAD topic, which is difficult to teach to electrical and computer engineers. I have developed a complete skeleton for teaching basic algorithms such as Fiduccia-Mattheyses partitioning, variable node size sliceable floorplanning, simulated annealing placement, maze router based global routing, and left-edge algorithm channel routing. The Java-based toolset is portab...
متن کامل