The vehicle routing with pickups and deliveries (VRPD) problem is de6ned over a graph G=(V; E). Some vertices in G represent delivery customers who expect deliveries from a depot, and other vertices in G represent pickup customers who have available supply to be picked up and transported to a depot. The objective is to 6nd a minimum length tour for a capacitated vehicle, which starts at a depot...

In this paper, we propose a new routing problem to model a highly relevant planning task in small package shipping. We consider the Prize-Collecting Vehicle Routing Problem with Non-Linear cost (PCVRPNL) in its single and multi-depot version, which integrates the option of outsourcing customers to subcontractors instead of serving them with the private fleet. Thereby, a lower bound on the total...

This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...

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

This paper presents an advanced hybrid meta-heuristic algorithm (HMA) to solve the vehicle routing problem with backhauls and time windows (VRPBTW). The VRPBTW is an extension of the vehicle routing problem with time windows (VRPTW) and the vehicle routing problem with backhauls (VRPB) that includes capacity, backhaul and time window constraints. In this problem, the customers are divided into ...

In this chapter we are going to study metaheuristics based on the Automata Theory for the Multi-objective Optimization of Combinatorial Problems. As well known, Combinatorial Optimization is a branch of optimization. Its domain is optimization problems where the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution(Yong-Fa ...

In Multi-Echelon Vehicle Routing Problems the delivery from one or more depots to the customers is managed by routing and consolidating the freight through intermediate depots, called satellites. This family of problems differs from Multi-Echelon Distribution Systems present in the literature. In the latter the attention is focused on the flow assignment among the levels only, while we also con...

<p>Route optimization problem using vehicle routing (VRP) and time window constraint is explained as finding paths for a finite count of vehicles to provide service huge number customers hence, optimizing the path in given duration window. The loop have restricted intake capacity. This initiates from depot, delivers goods, stops at depot. Each customer serve exactly once. If arrival befor...