Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Fformat: Artigo
Iaith:Indonésio
Cyhoeddwyd: Universitas Serang Raya 2020-07-01
Cyfres:Jurnal Sistem dan Manajemen Industri
Pynciau:
vrp
nearest neighbour
simulated annealing
heuristic method
Mynediad Ar-lein:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg