EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3606. Vehicle routing problem to optimize pig deliveries to the abattoir

Invited abstract in session TC-12: DSS in Agriculture, stream OR in Agriculture and Forestry .

Tuesday, 12:30-14:00
Room: 13 (building: 116)

Authors (first author is the speaker)

1. LluisM Pla
Mathematics, University of Lleida
2. Yun Bao
University of Lleida
3. Pol Llagostera Blasco
Mathematics, University of Lleida

Abstract

Nowadays, pigs are raised in large industrial-scale operations. The fattening farms operates under an all-in–all-out management policy. In general, the fattening period depends on the starting weight, batch homogeneity, feeding system, growth curve, reward system and chain management policies. Although pigs are fed with the same diet, not all of them reach market weight at the same time. Hence, partial sales produce better economic rewards. Once the old batch leaves, and before the new batch arrives, the facilities are cleaned and sanitized.
The viewpoint of an abattoir collecting fattened pig from many different farms belonging to the same supply chain has not yet been considered. Farms vertically integrated sell their entire production to a single abattoir in agreement with the supplier contract signed with the integrator company in a long-term relationship. The routes to collect pigs and the arrival to the abattoir need to be balanced over time and scheduled beforehand with uncertainty in pigs’ liveweight to avoid workload peaks and a fair operation for the PSC. The problem is a vehicle routing problem with uncertain demand since the deliveries depend on the inventory of pigs. Thus, the objective is to formulate a mixed-integer linear-programming (MILP) model to optimize daily routes of trucks and transports of fattened pigs to the abattoir. A metaheuristic algorithm is proposed to approximate the solution of the model and to efficiently plan transportation.

Keywords

Status: accepted

Back to the list of papers