A real delivery problem dealt with Monte Carlo Techniques |
| |
Authors: | P F de Córdoba L M García-Raffi A Mayado J M Sanchis |
| |
Institution: | (1) Departmento de Matemática Aplicada, Universidad Politécnica de Valencia, E-46071 Valencia, Spain |
| |
Abstract: | In this paper we use Monte Carlo Techniques to deal with a real world delivery problem of a food company in Valencia (Spain).
The problem is modeled as a set of 11 instances of the well known Vehicle Routing Problem, VRP, with additional time constraints.
Given that VRP is a NP-hard problem, a heuristic algorithm, based on Monte Carlo techniques, is implemented. The solution
proposed by this heuristic algorithm reaches distance and money savings of about 20% and 5% respectively.
This work has been partially supported by thePlan de Incentivo a la Investigación/98 of the Universidad Politécnica de Valencia, under the project “Técnicas Monte Carlo aplicadas a Problemas de Rutas de Vehículos”. |
| |
Keywords: | Vehicle Routing Problem Time Windows Monte Carlo Methods Heuristic Algorithms |
本文献已被 SpringerLink 等数据库收录! |
|