Solving CCVRPTW using biased random key genetic algorithm (BRKGA) with multiple parent

2017 1st International Conference on Engineering and Applied Technology

Prasetyo, H.^1 ; Qoyyiimah, M.^1 ; Fauza, G.^2

Dept. of Industrial Engineering, Universitas Muhammadiyah Surakarta, Jl. A Yani Tromol Pos I, Pabelan Surakarta, Indonesia^1

Dept. of Food Science and Technology, Universitas Sebelas Maret, Jl. Ir. Sutami 36A, Kentingan Surakarta, Indonesia^2

关键词: Capacitated vehicle routing problem;    Delivery time;    Random keys;    Soft drinks;    Vehicle routing problem;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/403/1/012045/pdf
DOI  :  10.1088/1757-899X/403/1/012045

来源: IOP

【 摘 要 】

This research addresses a Capacitated Vehicle Routing Problem with Time Windows (CCVRPTW) which is a Vehicle Routing Problem (VRP) with fleet capacity and delivery time constraints. In the research, a Biased Random Key Genetic Algorithm (BRKGA) is proposed to solve the problem. The standard BRKGA is improved by modifying the crossover process accommodating Multiple-Parent. The proposed BRKGA is coded using the Matlab programming language. A case of soft drink distribution is used to evaluate the performance of the algorithm. From the research, it can be concluded that (1) The proposed BRKGA is better than the heuristic method proposed by previous research for dealing with the same case; (2) the Multiple-Parent BRKGA can further improve the general BRKGA; (3) The Multiple-Parent BRKGA with third parent selected randomly from NON-ELITE group results in a better solution than that of selected randomly from the whole population.