Savings based ants for large-scale vehicle routing problems

zbMATH Open1162.90338MaRDI QIDQ5301733FDOQ5301733

Authors: Marc Reimann, K. F. Doerner 

Publication date: 20 January 2009

Recommendations

• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• scientific article; zbMATH DE number 2079884
• scientific article; zbMATH DE number 1488087
• scientific article; zbMATH DE number 2144496
• Efficiently solving very large-scale routing problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.

This page was built for publication: Savings based ants for large-scale vehicle routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301733)