A real delivery problem dealt with Monte Carlo techniques

DOI10.1007/BF02564828zbMath0969.90011MaRDI QIDQ1592629

A. Mayado, José María Sanchis, Lluís Miquel Garcia Raffi, Pedro Fernández de Córdoba

Publication date: 4 October 2001

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

Monte Carlo methodsheuristic algorithmstime windowsvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Randomized algorithms (68W20)

Related Items (2)

Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ The ALGACEA‐1 method for the capacitated vehicle routing problem

Uses Software

• VRP

Cites Work

• The vehicle routing problem: An overview of exact and approximate algorithms
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• Optimal Routing under Capacity and Distance Restrictions
• Unnamed Item

This page was built for publication: A real delivery problem dealt with Monte Carlo techniques