A Solution Proposal to Vehicle Routing Problem with Integer Linear Programming: A Distributor Company Sample
Yazarlar (2)
Çağdaş Yıldız
Doç. Dr. Adem TÜZEMEN Tokat Gaziosmanpaşa Üniversitesi, Türkiye
| Makale Türü |
Özgün Makale
(ESCI dergilerinde yayınlanan tam makale)
|
||
| Dergi Adı | International Journal of Contemporary Economics and Administrative Sciences | ||
| Dergi ISSN | 1925-4423 Wos Dergi | ||
| Dergi Tarandığı Indeksler | Web of Science (WoS) Core Collection - Clarivate Analytics - ISI Indexes - Emerging Sources Citation Index (ESCI) | ||
| Makale Dili | İngilizce | Basım Tarihi | 06-2019 |
| Kabul Tarihi | 12-04-2026 | Yayınlanma Tarihi | – |
| Cilt / Sayı / Sayfa | 9 / 1 / 46–78 | DOI | 10.5281/zenodo.3262231 |
| Makale Linki | http://www.ijceas.com/index.php/ijceas/article/view/257 | ||
| Özet |
| It was aimed to minimize the total distance of the routes under the capacity constraint of the routes that a distributor company has drawn in the direction of the demands. To this end, a route to Gebze-based steel production and distribution was drawn up to meet all the demands of a fabrication plant. In order to determine the minimum total distance routes, the solution recommendation by adapting the Capacity Constrained Vehicle Routing Problem (CVRP) which is one of the basic route problems using Branch and Cut algorithm of 0-1 Integer Linear Programming (ILP) was introduced. Distances between the nodes that make up the route are measured via Google Maps. Optimal solutions were obtained by using LINDO computer software to solve the problem. |
| Anahtar Kelimeler |
| Vehicle Routing Problem | Branch-Cutting Algorithm | Integer Linear Programming | Distribution | Basic Route Problem |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Google Scholar | 6 |
| Web of Science | 1 |