Using global search heuristics for the capacity vehicle routing problem.
From MaRDI portal
Publication:1406639
DOI10.1016/S0305-0548(98)00045-8zbMath1040.90571MaRDI QIDQ1406639
Patricio Rodríguez, Miguel Nussbaum, Rodrigo Baeza, Gerardo León, Marcos Sepúlveda, Agustín Cobián
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- Optimization by Simulated Annealing
- On the Distance Constrained Vehicle Routing Problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item