Perancangan Biased Random Key Genetic Algorithm dengan Multiple Populations untuk Menyelesaikan Capacitated Vehicle Routing Problem with Time Windows
This research deals with a variation of Vehicle Routing Problem (VRP) by accommodating capacity and time constraints, also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). Soft drink distribution from depot to a number of outlets is an example of CTWVRP where every vehicle us...
Saved in:
Main Authors: | Putri, Anandistya Lisa (Author), , Hari Prasetyo, ST, MT, Ph.D (Author) |
---|---|
Format: | Book |
Published: |
2016.
|
Subjects: | |
Online Access: | Connect to this object online |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Pendekatan Biased Random Key Genetic Algorithm dengan Multiple-Parent untuk Kasus Capacitated Closed Vehicle Routing Problem With Time Windows
by: Qoyyiimah, Milati, et al.
Published: (2016) -
Penyelesaian Capacitated Closed Vehicle Routing Problem With Time Windows Menggunakan Biased Random Key Genetic Algorithm dengan PopulasiTerdegradasi (BRKGA-PD)
by: Christiana, Listy Avri, et al.
Published: (2016) -
Biased Random Key Genetic Algorithm Dengan Insertion Dan Gender Selection Untuk Capacitated Vehicle Routing Problem With Time Windows
by: Rochman, Auliya Noor, et al.
Published: (2016) -
Penyelesaian Capacitated Closed Vehicle Routing Problem With Time Windows (Ccvrptw) Menggunakan Brkga Dengan Local Search
by: Alfatsani, Musyahida Azmy, et al.
Published: (2016) -
IMPLEMENTASI ALGORITMA GENETIKA PADA CAPACITATED VEHICLE ROUTING PROBLEM
by: Lukman Nur Rahman, -
Published: (2018)