This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class and is very difficult to solve within practical time limits using systematic optimization techniques. In conventional evolution strategies, a schema with a high degree-of-fitness produced in the process of evolution ma...

The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improv...

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on ...

The Vehicle Routing Problem with Time Windows relates to frequently occuring real world problems in logistics. Much work has been done on solving static routing problems but solving the dynamic variants has not been given an equal amount of attention, while these are even more relevant to most companies in logistics and transportation. In this work an Ant Colony Optimization algorithm for solvi...

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

Most of the studies on vehicle routing problem with time windows (VRPTW) aim to minimize total travel distance or travel time. This paper presents the VRPTW with a new objective function of minimizing the total fuel consumption. A mathematical model is proposed to formulate this problem. Then, a novel tabu search algorithm with a random variable neighborhood descent procedure (RVND) is given, w...

In this paper, we formulate the vehicle routing problem with time windows and temporal dependencies. The problem is an extension of the well studied vehicle routing problem with time windows. In addition to the usual constraints, a scheduled time of one visit may restrain the scheduling options of other visits. Special cases of temporal dependencies are synchronization and precedence constraint...

This paper documents our investigation into various heuristic methods to solve the vehicle routing problem with time windows (VRPTW) to near optimal solutions. The objective of the VRPTW is to serve a number of customers within prede®ned time windows at minimum cost (in terms of distance travelled), without violating the capacity and total trip time constraints for each vehicle. Combinatorial o...

A of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into vehicle routes when consecutive driving or working time exceeds certain limits. This paper proposes a large neighborhood search method for the vehicle routing problem with time windows and driver regulations. In this method, neighborhoods are explored...

The vehicle routing problem with time windows (VRPTW) is the problem of minimizing the total travel distance of a number of vehicles, under capacity and time window constraints, where every customer must be visited exactly once by a vehicle. We consider two generalizations of the VRPTW and propose local search algorithms. The first one treats traveling times as variables and introduce cost func...