Abstract The Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it a natural extension of the Problem. In ADVRP problem, each customer visited exactly once by vehicle; every tour starts and ends at depot; traveled distance vehicle not allowed to exceed predetermined limit. We propose hybrid metaheuristic algorithm combining Randomized Variable Neighborhood Search (RVN...

Vehicular Networks, including Vehicular Adhoc Networks (VANETs) and Vehicular Sensor Networks (VSNs), stimulate a brand new variety of services, ranging from driver safety services, traffic information and warnings regarding traffic jams and accidents, to providing weather or road condition, parking availability, and advertisement. 3G networks and sophisticated Intelligent Transportation System...

While traditional routing protocols try to minimize the end-to-end delay or maximize the throughput, most energyaware routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. In this paper, we introduce a new energy-aware routing protocol that tries to minimize the energy consumption and...

One of the major issues that affect the performance of mobile ad hoc networks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promising routing strategy for inter-vehicular communication systems (IVCS). However, position-based routing for IVCS in a built-up city environment faces greater challenges because of potentially more uneven distribution of vehicular...

One of the major issues that affect the performance of Mobile Ad hoc NETworks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promising routing strategy for inter-vehicular communication systems (IVCS). However, position-based routing for IVCS in a built-up city environment faces greater challenges because of potentially more uneven distribution of vehicular...