multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

mobile-ad-hoc-networks (manets) are self-configuring networks of mobile nodes, which communicate through wireless links. the infrastructure of a mobile ad hoc network (manet) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. the main issues in manets include the mobility of the network nodes, the scarcity of computati...

Existing hierarchical routing schemes, employing distance vector and link state routing algorithms, require the exchange of routing information for the construction and maintenance of routing tables [1]. As networks increase in size, the memory requirements for the routing tables and the time taken to search the tables increase proportionally [11]. Further, as the popularity of computer network...

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

In this paper, we discussed current limitation in the electronic-design-automotation (EDA) tool on tracing the always on routing. We developed an algorithm to efficiently track the secondary power routing and accurately estimate the routing quality using approximate voltage drop as the criteria. The fast check can identify potential hotspot issues without going through sign-off checks. It helps...

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

nowadays network-on-chips is used instead of system-on-chips for better performance. this paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.