Načítá se...

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Médium: Artigo
Jazyk:Indonésio
Vydáno: Universitas Serang Raya 2020-07-01
Edice:Jurnal Sistem dan Manajemen Industri
Témata:
vrp
On-line přístup:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!