The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. A...

We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from the literature on vehicle routing problem with time windows (VRPTW) to conduct this computational s...

Marcus Poggi de Aragão Dep.de Informática Pontif́ıcia Universidade Católica do Rio de Janeiro [email protected] Eduardo Uchoa Dep. Eng. de Produção Universidade Federal Fluminense [email protected] January 15th, 2005 The Capacitated Vehicle Routing Problem (CVRP) is the most basic variant of a vehicle routing problem: homogeneous fleet, single depot, only deliveries, no time-windows, and ...

The purpose of this paper is to present a coalition based multi-agent model for the Vehicle Routing Problem with Time Windows, which is one of the most important ones in distribution and transportation. The VRPTW objective is to design least cost routes from one depot to a set of customers. A fleet of homogeneous vehicles performs the routes to serve all the customers, while respecting capacity...

Abstract Given automated order systems, detailed characteristics of items and vehicles enable the planning deliveries including more efficient safer loading distribution vehicles. Many vehicle routing approaches ignore complex constraints. This paper focuses on comprehensive evaluation constraints in context combined Capacitated Vehicle Routing Problem 3D Loading (3L-CVRP) its extension with ti...

State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW) usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and th...

The research evaluates the vehicular routing problem for distributing refrigerated products. mathematical model corresponds to vehicle with hard time windows and a stochastic service (VRPTW-ST) applied in Santiago de Chile. For optimization, we used tabu search, chaotic search general algebraic modeling. model’s objective function is minimize total distance traveled number of vehicles using wai...

In this paper a Memetic Algorithm (MA) is proposed for solving the Vehicles Routing Problem with Time Windows (VRPTW) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions. An evolutionary heuristic is applied in order to establish the crossover and mutation between sub-routes. The results of MA demonstrate t...