The multi-product vehicle routing problem with cross-docking: a novel strategy hybrid bat algorithm for Industry 3.5 in Thailand's food industry

This paper presents a multi-product vehicle routing problem with cross-docking operations for food industry to ensure products which can be delivered in time and with minimum transportation and hiring costs to perform for both supplier side and customer side. The problem was formulated as a special multi-product vehicle routing problem with cross-docking and time window constraints (MPVRPCDTW). A novel strategy hybrid based on the Bat algorithm (NSHBA) is presented to solve the MPVRPCDTW for the sustainable food industry by minimising the transportation cost and the number of vehicles, using the poultry industry as a case study. Additionally, a new disturbance algorithm (DA) was developed to find the best neighbourhood strategy to increase the efficiency and quality of solutions in the NSHBA. The computational results revealed that the NSHBA-DA outperformed the Bat algorithm, the differential evolution algorithm, and the particle swarm optimisation algorithm. The MATLAB App architecture based on all eight algorithms was designed and developed. The overall result of this study should prove to benefit the logistics staff in making the right decisions on cross-docking transportation by employing real-time data.