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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteurs: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Formaat: Artigo
Taal:Indonésio
Gepubliceerd in: Universitas Serang Raya 2020-07-01
Reeks:Jurnal Sistem dan Manajemen Industri
Onderwerpen:
vrp
nearest neighbour
simulated annealing
heuristic method
Online toegang:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items