Although evolutionary algorithms have often been used to address VRPs and VRPTWs [1], applications to other routing problems such as period routing and inventory routing are less common. In this paper, a versatile hybrid evolutionary algorithm is developed that can be used for cyclic inventory routing and a variety of capacitated and periodic vehicle routing problems. First, a random insertion ...

The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the CARP-RP, the vehicle servicing arcs must be refilled on the spot by using a second vehic...

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 vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

Electric vehicle routing problems (E-VRPs) deal with a fleet of electric vehicles (EVs) to serve set customers while minimizing an operational criterion, for example, cost or time. The feasibility the routes is constrained by autonomy EVs, which may be recharged along route. Much E-VRP research neglects capacity charging stations (CSs) and thus implicitly assumes that unlimited number EVs can s...