Clusters with minimum transportation cost to centers: a case study in corn production management

DOI10.3390/g8020024zbMath1410.91369OpenAlexW2621401892MaRDI QIDQ1656940

Sittipong Dankrakul, Chulin Likasiri, Sirilak Phonin

Publication date: 13 August 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/g8020024

zbMATH Keywords

clustering problemscapacitated vehicle routing problems with centersnorthern Thailandwaste management system

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Uses Software

• Matlab
• AIMMS

Cites Work

• Unnamed Item
• A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
• The capacitated centred clustering problem
• A Location Based Heuristic for General Routing Problems

This page was built for publication: Clusters with minimum transportation cost to centers: a case study in corn production management