A real delivery problem dealt with Monte Carlo techniques
| Autor: | José M. Sanchis, L. M. García-Raffi, A. Mayado, P.F. de Cordoba |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2000 |
| Předmět: |
Statistics and Probability
Vehicle Routing Problem Mathematical optimization Information Systems and Management Computer science Time Windows Monte Carlo method Management Science and Operations Research Food company Heuristic Algorithms Set (abstract data type) Monte Carlo Methods Time windows Modeling and Simulation Vehicle routing problem Discrete Mathematics and Combinatorics MATEMATICA APLICADA Algorithm |
| Zdroj: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname |
| Popis: | [EN] 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 research was partially supported by MICINN, Project MTM2013-43540-P and by UPV, Project Programa de Apoyo a la Investigación y Desarrollo de la UPV PAID-06-12. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|