Optimization benchmarks are tools for the validation and comparison of algorithms. Routing particularly relevant to industry. However, there few available VRP based on realistic situations. This research creates a set multi-objective (three objectives) instances length- constrained variant VRP. The model case mail delivery performed by carriers foot in Brazilian city Rio Claro. A new graph road...

Since the Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser, it became one of the most studied problems in Combinatorial Optimization. Different solution approaches were proposed over the past decades to solve the VRP and its variants. In this thesis, we discuss about two VRP variants, resulting from the integration of VRPs with distribution problems. The first problem takes pl...

This work was supported in part by the Army Research Lab as part of the CTA in Decisi 01-2-0009, the Army Research Institute W91WAW07C0063, and the National Science Foundation IGERT 9972762 in CASOS. Additional support was provided by CASOS and ISR at Carnegie Mellon University. The views and conclusions contained in this document are those of the authors and should not be interpreted as repres...

Given two pick-up and delivery points, the best path chosen does not necessarily follow criteria of minimum travel time or generalized cost evaluated with a deterministic approach. criterion, perceived is for many reasons (congestion, incomplete information on state system, inexact prediction system state, etc.). The same consideration applies to best-chosen route, assuming that route an ordere...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

This paper presents an exact solution framework for solving some variants of the vehicle routing problem (VRP) that can be modeled as set partitioning (SP) problems with additional constraints. The method consists in combining different dual ascent procedures to find a near optimal dual solution of the SP model. Then, a column-and-cut generation algorithm attempts to close the integrality gap l...

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allows one to quickly generate solutions to VRP ...

Traditional solution concepts for the vehicle routing problem (VRP) are pushed to their limits, when applied on dynamically changing vehicle routing scenarios—which are more close to reality than the static formulation. By contrast, the introduced distributed routing concept is designed to match packages and vehicles and to continuously make route decisions especially within a dynamic environme...

This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function is provided to test the feasibility of a route. This function is considered of non-linear complexity (in the length of the route). The complexity of the probl...

In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliveries are both fast and fair to those being served, it is not clear that the classic cost-minimizing routing problems properly reflect the priorities relevant in disaster relief. In this paper, we take the first steps ...