Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

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

wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...

Ad-hoc networking is a concept in computer communications, which means that users wanting to communicate with each other form a temporary network, without any form of centralized administration. Each node participating in the network acts both as a host and as a router. The study of distributed network and mobile ad hoc network (MANET) are currently two hotspots in distributed computing and mob...

In current scenario of Internet, the demand of real time multimedia applications has been increased. These applications are bandwidth greedy, impose strict delay guarantees, stable jitter and low packet loss probabilities, which require a fixed Quality-of-Service (QoS) assurance in transmission. The present Internet routing methods, based on the besteffort paradigm, is not able to provide any p...

The routing algorithms can be classi®ed into source, distributed and hierarchical routing. Source routing algorithms are conceptually simple, but they suffer from scalability problem. Distributed routing algorithms are more scalable, but loops may occur, which make the routing to fail. Hierarchical routing has been used to cope with the scalability problems of source routing in large internetwo...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

MANET routing protocol based on P2P has become a hot topic, but mainly researches on small or medium MANET did not take full advantage of P2P distributed share theory, there still exist detour and inefficiency problems. This paper presents large-scale MANET distributed share routing model based on P2P. It introduces layered mechanism based on network physical topology to enhance network scalabi...