Using global search heuristics for the capacity vehicle routing problem.

DOI10.1016/S0305-0548(98)00045-8zbMath1040.90571OpenAlexW1980540561MaRDI QIDQ1406639

Gerardo León, Marcos Sepúlveda, Miguel Nussbaum, Rodrigo Baeza, Patricio Rodríguez, Agustín Cobián

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00045-8

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Using global search heuristics for the capacity vehicle routing problem.