TY - GEN
T1 - A Prize Collecting problem applied to a Real Milk Collection problem in Chile
AU - Montero, Elizabeth
AU - Canales, Dario
AU - PAREDES BELMAR, GERMAN ENRIQUE
AU - Soto, Raul
N1 - Funding Information:
Supported by Fondecyt Project 11150787, Fondecyt Project 11170102 and UNAB DI-2-17/RG grant
Funding Information:
Germán Paredes-Belmar acknowledges the FONDECYT Initiation into Research project no. 11170102 and UNAB DI-2-17/RG grants for their support.
Publisher Copyright:
© 2019 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2019/6
Y1 - 2019/6
N2 - In this work, a real world milk collection problem is introduced. A milk processing company, located in south of Chile, needs to collect milk to elaborate their products. To this work, the company has a heterogeneous truck fleet. The farms are scattered in a large geographical area. In this problem, the company buys only the minimum quantity of milk required to its daily operation. Exceeding this minimum quantity of milk generates a cost of over demand. The objective is to find efficient collection routes, satisfying the minimum required quantity and minimizing the over demand and transportation costs. To solve this version of the prize collection problem we propose an integer programming model to solve simpler instances and a GRASP metaheuristic to solve more complex instances in reduced time. Real world problem instances can consider up to 500 farmers. We tested our approaches using small real world cases and possible expansion scenarios. We concluded about the key components of our approaches and their capabilities to solve the problem at hand.
AB - In this work, a real world milk collection problem is introduced. A milk processing company, located in south of Chile, needs to collect milk to elaborate their products. To this work, the company has a heterogeneous truck fleet. The farms are scattered in a large geographical area. In this problem, the company buys only the minimum quantity of milk required to its daily operation. Exceeding this minimum quantity of milk generates a cost of over demand. The objective is to find efficient collection routes, satisfying the minimum required quantity and minimizing the over demand and transportation costs. To solve this version of the prize collection problem we propose an integer programming model to solve simpler instances and a GRASP metaheuristic to solve more complex instances in reduced time. Real world problem instances can consider up to 500 farmers. We tested our approaches using small real world cases and possible expansion scenarios. We concluded about the key components of our approaches and their capabilities to solve the problem at hand.
KW - Milk collection
KW - prize collecting
KW - vehicle routing problem
UR - http://www.scopus.com/inward/record.url?scp=85071303254&partnerID=8YFLogxK
U2 - 10.1109/CEC.2019.8789999
DO - 10.1109/CEC.2019.8789999
M3 - Conference contribution
AN - SCOPUS:85071303254
T3 - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
SP - 1415
EP - 1422
BT - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 10 June 2019 through 13 June 2019
ER -