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

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, an efficient fault-tolerant routing algorithm for mobile ad-hoc networks (manets) is presented. the proposed algorithm increases the network fault-tolerance using natural redundancy of ad-hoc networks. this algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). in the first stage, the proposed algorithm chooses nodes with the...

in this paper, we present a novel algorithm for vanet using cloud computing. we accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. each car or node is considered a client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...

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

vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...