A Parallel Heuristic Method for Optimizing a Real Life Problem (Agricultural Land Investment Problem)

  • Sagvan A. Saleh College of Agriculture, University of Duhok, Duhok, Kurdistan region, Iraq


This paper proposed a parallel method for solving the Agricultural Land Investment Problem (ALIP), the problem that has an important impact on the agriculture issues. The author is first represent mathematically the problem by introducing a mathematical programming model. Then, a parallel method is proposed for optimizing the problem. The proposed method based on principles of parallel computing and neighborhood search methods. Neighborhood search techniques explore a series of solutions spaces with the aim of finding the best one. This is exploited in parallel computing, where several search processes are performed simultaneously. The parallel computing is designed using Message Passing Interface (MPI) which allows to build a flexible parallel program that can be executed in multicore and/or distributed environment. The method is competitive since it is able to solve a real life problem and yield high quality results in a fast solution runtime.


1. Aarts , E., & Lenstra, J. (2003), Local search in combinatorial optimization. New Jersey: Princeton University Press.
2. Balas, E., & Zemel, E. (1980), An algorithm for large zero-one knapsack problems. Operations Research 28, 1130-1154.
3. Hifi, M., & Otmani, N. (2012 ), An algorithm for the disjunctively constrained knapsack problem. International Journal of Operational Research , 13(1): 22-43.
4. Hifi, M., Negre, S., Saadi, T., Saleh, S., & Wu, L. (2014), A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. IEEE International Parallel & Distributed Processing Symposium Workshops. Phoenix, AZ, USA: IEEE.
5. Horowitz , E., & Sahni, S. (1974), Computing partitions with applications to the knapsack problem. Journal of the ACM (JACM), 21 (2): 277–292.
6. Kellerer, H., Pferschy, U., & Pisinger, D. (2014), Knapsack Problems. New Yourk: Springer-Verlag Berlin Heidelberg.
7. Martello , S., & Paolo, T. (1990), Knapsack problems. New York: Wiley .
8. Pacheco, P. (2011), An Introduction to Parallel Programming. USA: Morgan Kaufmann Publishers.
9. Wittwer, T. (2006), An Introduction to Parallel Programming. The Netherlands: VSSD.
10. Yamada, T., Kataoka, S., & Watanabe., K. (2002), Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Information Processing Society of Japan Journal, 43: 2864-2870.
How to Cite
SALEH, Sagvan A.. A Parallel Heuristic Method for Optimizing a Real Life Problem (Agricultural Land Investment Problem). Academic Journal of Nawroz University, [S.l.], v. 7, n. 4, p. 168-172, dec. 2018. ISSN 2520-789X. Available at: <http://journals.nawroz.edu.krd/index.php/ajnu/article/view/286>. Date accessed: 20 jan. 2019. doi: https://doi.org/10.25007/ajnu.v7n4a286.