Please use this identifier to cite or link to this item:
|Title:||Optimizing wheat storage and transportation system using a mixed integer programming model and genetic algorithm: A case study|
|Authors:||Farahani, R.Z. |
Mixed integer programming
|Source:||Farahani, R.Z., Asgari, N., Hojabri, H., Jaafari, A.A. (2009). Optimizing wheat storage and transportation system using a mixed integer programming model and genetic algorithm: A case study. IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management : 2109-2113. ScholarBank@NUS Repository. https://doi.org/10.1109/IEEM.2009.5373152|
|Abstract:||The investigated case is a vast country with a variety of climates. Due to this diversity in climate and therefore different farming conditions in different areas of the country, wheat is produced at different times of year all over the country. Therefore, wheat production rate is not constant during year all around the country. Lack of balance between wheat production and consumption in different provinces during different periods necessitates storage and transportation of wheat. In this paper, we intend to find the answer to the following question: "How much wheat in each month of year must be transported from each province to other provinces?" A mixed integer programming (MIP) model is developed for the problem and a genetic algorithm (GA) is designed because optimization solvers cannot solve the real-size problem in a reasonable time. To show efficiency, GA results are compared with those of LINGO 8.00 for randomly generated small-sized test problems. ©2009 IEEE.|
|Source Title:||IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 8, 2018
WEB OF SCIENCETM
checked on Feb 13, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.