scientific article; zbMATH DE number 7247582

zbMath1463.90016MaRDI QIDQ5120561

Kanokon Leungsubthawee, Supalin Saranwong, Chulin Likasiri

Publication date: 15 September 2020

Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3186

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmcluster problemmultiple depot vehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Uses Software

• VRP

Cites Work

• Unnamed Item
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• The multi-depot vehicle routing problem with inter-depot routes
• Clustering search algorithm for the capacitated centered clustering problem
• Clustering to minimize the maximum intercluster distance
• A unified exact method for solving different classes of vehicle routing problems
• The capacitated centred clustering problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Some Simple Applications of the Travelling Salesman Problem

This page was built for publication: