The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combinatio...

The vehicle routing problem with time windows (VRPTW) is an extension of the vehicle routing problem (VRP) with earliest, latest, and service times for customers. The VRPTW routes a set of vehicles to service customers having earliest, latest service times. The objective of the problem is to minimize the number of vehicles and the distance travelled to service the customers. The constraints of ...

This study presents a developed hybrid electrical air-cushion tracked vehicle (HETAV) for the transportation operation of agricultural and industrial goods on the swamp peat terrain bearing capacity of 5 kN/m. The vehicle’s design parameters are optimized by using the developed mathematical models which are made based on the kinematics and dynamics behaviors of the vehicle. A set of sensors are...

background in iranian folk medicine ruta graveolens has been used for female and male contraceptive. there are few studies about the effect of this plant on spermatogenesis. objectives in this study the effect of long term administration of aqueous extract of rg on spermatogenesis has been investigated. materials and methods animals were allocated into 1) control: which did not receive anything...

Vehicular Delay Tolerant Networks (DTN) use moving vehicles to sample and relay sensory data for urban areas, making it a promising low-cost solution for the urban sensing and infotainment applications. However, routing in the DTN in real vehicle fleet is a great challenge due to uneven and fluctuant node density caused by vehicle mobility patterns. Moreover, the high vehicle density in urban a...

In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k—the capacity of the vehicle used for making the deliveries. The goal is to compute a shortest tour for the vehicle in which all objects can be delivered from their sources to their destinations while ensuring that the vehicle carries a...

Purpose: On pursue of economic revenue, the second life of electric vehicle batteries is closer to reality. Common electric vehicles reach the end of life when their batteries loss between a 20 or 30% of its capacity. However, battery technology is evolving fast and the next generation of electric vehicles will have between 300 and 400 km range. This study analyzes different End of Life scenari...

The paper [1] has three main contributions: • Modeling VRP (Vehicle Routing Problem) into the minimum cost Ktree problem. • Dualizing the side constraints to obtain a Lagrangian problem which provides lower-bounds in B&B. • Performing the algorithm on real problems. 1. Problem Definition and Lagrangian Relaxation The vehicle routing problem has the following parameters: • K = the number of vehi...