Although evolutionary algorithms have often been used to address VRPs and VRPTWs [1], applications to other routing problems such as period routing and inventory routing are less common. In this paper, a versatile hybrid evolutionary algorithm is developed that can be used for cyclic inventory routing and a variety of capacitated and periodic vehicle routing problems. First, a random insertion ...

Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. However, the performance of geographic routing is impacted by physical voids, and localization errors. Accordingly, virtual coordinate systems (VCS) were proposed as an alternative approach that is resilient to localization errors...

In routing, a source vertex sends a message to a target vertex and the routing algorithm decides a path from the source vertex to the target vertex. In 2013, Wang and Juan proposed a simple version of the WK-recursive pyramid networks, is called the basic WK-recursive pyramid network, which have received much attention recently. There are many literatures that study on this topology. This paper...

A wireless sensor network (WSN) consists of sensor nodes (SNs) with wireless communication capabilities for specific sensing tasks. Each SN maintains connectivity and exchanges messages between the decentralized nodes in the multi-hop manners. A source node can communicate with its destination via a certain number of relaying nodes, which consequently enlarges the wireless coverage of the sourc...

Position-based routing algorithms use the geographic position of the nodes in a network to make the forwarding decisions. Recent research in this field primarily addresses such routing algorithms in two dimensional (2D) space. However, in real applications, nodes may be distributed in three dimensional (3D) environments. In this paper, we propose several randomized position-based routing algori...

Here we proposed lithography based layer decomposition for reduced wire length three-layer routing solution using Double Patterning Technology (DPT). First we proposed a routing algorithm of three-layer (HVH) restricted dogleg routing solution to minimize the wire length of the chip to be designed. Next we designed a layer decomposition algorithm of the obtained routing solution using DPT to in...

This paper presents a simulation analysis of the algorithm presented in “Routing without Flow Control,” by Busch, Herlihy and Wattenhoffer, 2001, [1]. The hot-potato routing algorithm is simulated using Rensselaer’s Optimistic Simulation System. The simulation uses a novel reverse computation approach to efficiently and optimistically parallelize the system simulation. In addition to simulating...

In this paper, we propose and analyze three routing algorithms for anycast packets: i) source-destination based routing with weighted random selection (SD/WRS), ii) destination based routing with weighted random selection (D/WRS), and iii) the shortest shortest path first (SSPF) algorithms. The SSPF algorithm is a simple extension to the traditional SPF algorithm for routing unicast packets. Th...

This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...