Article ID: | iaor20053138 |
Country: | Cuba |
Volume: | 25 |
Issue: | 2 |
Start Page Number: | 148 |
End Page Number: | 157 |
Publication Date: | May 2004 |
Journal: | Revista de Investigacin Operacional |
Authors: | Miln Esteban Lpez, Fernndez Silvia Miquel, Aragons Lluis Miquel Pl |
Keywords: | transportation: general, programming: linear |
In this work an approximation to the problem of cost minimization of sugar cane removal from the fields to the sugar mill, is demonstrated. The complexity of the problem is basically determined by the system approach used. It results in the generation of a great number of variables and constraints. Constraints refer to the necessity of continued supply to the sugar mill, cutting means involved in the cane harvesting, transportation vehicles and providing routes. The routes are characterized by the existence of storage places at the beginning of the railroad routes.