Developing cross entropy genetic algorithm for solving Two-Dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP)

International Conference on Industrial and Systems Engineering 2017

Paramestha, D.L.^1 ; Santosa, B.^1

Department of Industrial Engineering, Institut Teknologi Sepuluh Nopember, Kampus ITS, Sukolilo-Surabaya

60111, Indonesia^1

关键词: Algorithm for solving;    Bin packing problem;    Heterogeneous fleet;    Objective functions;    Probability transition matrix;    Transportation cost;    Two-dimensional rectangular;    Vehicle Routing Problems;   

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

来源: IOP

【 摘 要 】

Two-dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP) is a combination of Heterogeneous Fleet VRP and a packing problem well-known as Two-Dimensional Bin Packing Problem (BPP). 2L-HFVRP is a Heterogeneous Fleet VRP in which these costumer demands are formed by a set of two-dimensional rectangular weighted item. These demands must be served by a heterogeneous fleet of vehicles with a fix and variable cost from the depot. The objective function 2L-HFVRP is to minimize the total transportation cost. All formed routes must be consistent with the capacity and loading process of the vehicle. Sequential and unrestricted scenarios are considered in this paper. We propose a metaheuristic which is a combination of the Genetic Algorithm (GA) and the Cross Entropy (CE) named Cross Entropy Genetic Algorithm (CEGA) to solve the 2L-HFVRP. The mutation concept on GA is used to speed up the algorithm CE to find the optimal solution. The mutation mechanism was based on local improvement (2-opt, 1-1 Exchange, and 1-0 Exchange). The probability transition matrix mechanism on CE is used to avoid getting stuck in the local optimum. The effectiveness of CEGA was tested on benchmark instance based 2L-HFVRP. The result of experiments shows a competitive result compared with the other algorithm.