Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

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

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...

It is well known that the final cost of commercial products is mostly due to expenses than to their transport. In this context, the vehicle routing problem appears aiming to optimize the routes of a fleet which is responsible for providing pick-up and delivery services. In face of the necessity in attending requests that come during the fleet operation time, the dynamic vehicle routing problem ...

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

Time-dependent vehicle routing problem (TDVRP) is concerned with vehicle routing optimization in road networks with fluctuant link travel time. Firstly, Time-dependent functions about routing time indicator and routing threat indicator are introduced. Secondly, a time-dependent heuristic function including routing distance indicator, routing time indicator and routing threat indicator is constr...