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ón completa

Guardado en:
Detalles Bibliográficos
Autores principales: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Formato: Artigo
Lenguaje:Indonésio
Publicado: Universitas Serang Raya 2020-07-01
Colección:Jurnal Sistem dan Manajemen Industri
Materias:
vrp
nearest neighbour
simulated annealing
heuristic method
Acceso en línea:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares