- -

A real delivery problem dealt with Monte Carlo techniques

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A real delivery problem dealt with Monte Carlo techniques

Show full item record

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/100402

Files in this item

Item Metadata

Title: A real delivery problem dealt with Monte Carlo techniques
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[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, ...[+]
Subjects: Vehicle Routing Problem , Time Windows , Monte Carlo Methods , Heuristic Algorithms
Copyrigths: Reserva de todos los derechos
Source:
Top. (issn: 1134-5764 )
DOI: 10.1007/BF02564828
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/BF02564828
Thanks:
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.
Type: Artículo

References

Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1998), A heuristic algorithm based on Monte Carlo methods for the Rural Postman Problem.Computers and Op. Research,25, No. 12, pp. 1097–1106, 1998.

Fernández de Córdoba, P. and L.M. García-Raffi, E. Nieto and J.M. Sanchis Llopis (1999a), Aplicación de técnicas Monte Carlo a un problema real de Rutas de Vehículos.Anales de Ingeniería, Colombia. In press.

Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1999b), A Constructive Parallel Algorithm based on Monte Carlo techniques for Routing Problems, Submitted toParallel Computers. [+]
Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1998), A heuristic algorithm based on Monte Carlo methods for the Rural Postman Problem.Computers and Op. Research,25, No. 12, pp. 1097–1106, 1998.

Fernández de Córdoba, P. and L.M. García-Raffi, E. Nieto and J.M. Sanchis Llopis (1999a), Aplicación de técnicas Monte Carlo a un problema real de Rutas de Vehículos.Anales de Ingeniería, Colombia. In press.

Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1999b), A Constructive Parallel Algorithm based on Monte Carlo techniques for Routing Problems, Submitted toParallel Computers.

Laporte, G. (1992), The Vehicle Routing Problem: an overview of exact and approximate algorithms,European Journal of Operations Research,59, 345.

Laporte, G., M. Desrochers and Y. Nobert (1985), “Optimal Routing under Capacity and Distance Restrictions.Operations Research,33, pp. 1050–1073.

Laporte G. and Y. Nobert (1987), Exact algorithms for The Vehicle Routing Problem,Surveys in Combinatorial Optimization (S. Martello, G. Laporte, M. Minoux and C. Ribeiro Eds.). North-HollandAmsterdam

Mayado, A. (1998), Organización de los itinerarios de la flota de camiones de reparto de una sociedad cooperativa. Optimización mediante técnicas de simulación Monte Carlo. Proyecto Fin de Carrera. E.T.S.I.I. Universidad Politécnica de Valencia.

[-]

This item appears in the following Collection(s)

Show full item record