VANET, short for Vehicle Ad-hoc Network, is an emerging technology with unique characteristics that differentiate it from previous ad-hoc networks. Designing effective routing protocol V2V (vehicle-to-vehicle) communication and V2I (vehicle-to-roadside infrastructure) particularly challenging due to the dynamic nature of topology frequent disconnections. VANET plays a crucial role in developmen...

Qasim Ali Arain Beijing University of Posts and Telecommunications (BUPT), P.R, China Abstract— The road networks, vehicle users could enjoy numerous kind of services such as location based service in vehicle users can connected to Internet and communication of different users. Therefore, in order to acquire adequate privacy level and quality of service, one must have to wisely place mix zones ...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

Traditionally, there are two methods to implement anonymous channels: free-route networks like onion routing and cascade networks like mix network. Each of them has its merits and is suitable for some certain applications of anonymous communication. Both of them have their own drawbacks, so neither of them can satisfy some applications. A third solution to anonymous channels, Klein bottle routi...

Safety critical applications for recently proposed vehicle to vehicle ad-hoc networks (VANETs) rely on a beacon signal, which poses a threat to privacy since it could allow a vehicle to be tracked. Mix-zones, where vehicles encrypt their transmissions and then change their identifiers, have been proposed as a solution to this problem. In this work, we describe a formal analysis of mix-zones. We...

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...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...

This paper provides an indepth review on evolution of vehicle routing problems from savings matrix to time dependent vehicle routing problems. It is suggested that as to how VRPBH framework of Goetschalckx and Jacobs-Blecha has offered better solution to routing problems that Clarke-Wright Savings matrix and with the introduction of time -window concept the result of heuristic has improved dras...

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VAN...