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

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Format: Artigo
Idioma:Indonésio
Publicat: Universitas Serang Raya 2020-07-01
Col·lecció:Jurnal Sistem dan Manajemen Industri
Matèries:
vrp
nearest neighbour
simulated annealing
heuristic method
Accés en línia:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars