Track: Simulation Competition

Abstract

The chicken farm operations in Nakhon Ratchasima Province, Thailand, prioritize stringent hygiene standards across production, transportation, and employee protocols. One critical regulation prohibits employees from bringing or consuming external food within farm premises to prevent contamination risks. Consequently, centralized meal preparation with strict cleanliness control is mandated, and meals are delivered to various farm units within the supply chain. Daily food transportation involves delivering three meals to 12 farms, necessitating 36 trips per day. Drivers work 8 hours daily, with a 1-hour break and a 1-hour vehicle maintenance post-delivery, and they are legally entitled to one day off per week. This results in driver shortages and the absence of decision-support tools for optimal route planning, leading to delivery delays and overtime work. This study aims to develop a mathematical model to optimize driver allocation and route planning, ensuring minimal total travel distance using principles from the Traveling Salesman Problem (TSP). The results demonstrate a reduction in each driver's trips from 4 to 3 per day, achieving the minimum total travel distance. Additionally, the model successfully allocates the daily workforce to 3 drivers and facilitates weekly rest day scheduling. This approach significantly enhances operational efficiency and adherence to hygiene protocols in the chicken farming industry.