Optimizing of ready-mixed concrete vehicle scheduling problem by hybrid heuristic algorithm

Optimizing of ready-mixed concrete vehicle scheduling problem by hybrid heuristic algorithm

Guochen Zhang1, Jianchao Zeng2

COMPUTER MODELLING & NEW TECHNOLOGIES 2014 18(12C) 562-569

1 College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou, 730050, China
2 Division of Industrial and System Engineering, Taiyuan University of Science and Technology, Taiyuan, 030024, China

RMC (Ready-mixed concrete) vehicle scheduling problem is a complex combinatorial optimization problem with intersection of several research areas, such as logistics, just-in-time production and supply chains etc. We integrates RMC production scheduling and vehicle dispatch problems in the same framework by network flow techniques and establishes a mixed integer programming model for ready-mixed concrete vehicle scheduling problem. Then, we put forward a hybrid heuristic algorithm to optimize the RMC vehicle scheduling problem based on the characteristics of ready-mixed concrete vehicle fleet operations. The main idea of proposed hybrid heuristic algorithm is decomposing complex RMC vehicle scheduling problem into simple problems. Finally, the algorithm is used to solve specific simulation examples and to verify the effectiveness of the proposed hybrid heuristic algorithm.