This paper applies the elitist genetic algorithm to electric vehicle routing problem with time window. In initialization, proposes an improved neighbor initialization method for adaptive algorithm. The is used select nearest EV customer as next route be scheduled and make start from suitable first in of GA. It makes begins a neighboring directionality, which can inherited selection, crossover, ...

The use of wireless sensor networks in home automation (WSNHA) is attractive due to their characteristics of self-organization, high sensing fidelity, low cost, and potential for rapid deployment. Although the AODVjr routing algorithm in IEEE 802.15.4/ZigBee and other routing algorithms have been designed for wireless sensor networks, not all are suitable for WSNHA. In this paper, we propose a ...

In the literature we have studied each packet is routed along a possibly different path by using Back Pressure based adaptive routing algorithm. So there is poor delay performance and involve high implementation complexity. After studied Back Pressure algorithm with clearly, we have developed a new adaptive routing algorithm. Here we have designed probabilistic routing table that is used to rou...

In the last few years research on WDM optical packet-switching has mainly concentrated on issues at the single node level. The goal of this paper is to discuss about the problems arising when the focus is moved toward a network-wide scope. In particular, an overview of routing techniques that may be adopted in an optical packet-switched backbone is presented, showing the effects of adaptive mul...

Network-on-chip (NoC) performance largely depends on the underlying deadlock-free and efficient routing algorithm. The effectiveness of any adaptive routing algorithm strongly depends on the underlying selection strategy. When the routing function returns a set of admissible output channels with cardinality greater than one, a selection function is used to select the output channel to which the...

High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally foc...

Fully adaptive routing with less virtual channels is of technical trend in MPP interconnection network design. However, imbalance of load offsets performances of many schemes. In this paper we give a fully adaptive load balanced routing algorithm called VBMAR. A new design tool called crossed turn model (CTM) is proposed to solve complex deadlock problems across virtual networks while keep the ...

The Adaptive Core Multicast Routing Protocol (ACMRP) is proposed for multicast routing in ad hoc networks. ACMRP is on demand core-based multicast routing protocol and uses a multicast mesh. In ACMRP, a core is not well-known and it adapts to the current network topology and group membership. The enhanced adaptivity minimizes the core dependency and, accordingly, improves performance and robust...