Constraint-based local search for fields partitioning problem

  • Authors:

  • Quoc Trung Bui;Quang-Dung Pham;Yves Deville

  • Affiliations:

  • Institut de la Francophonie, pour l'Informatique (IFI), Hanoi, Vietnam;Université catholique de, Louvain, Louvain-la-Neuve, Belgium;Université catholique de, Louvain, Louvain-la-Neuve, Belgium

  • Venue:
  • Proceedings of the Second Symposium on Information and Communication Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partitioning a field into parcels is one step of the project of merging and repartitioning agricultural lands which emerges in many provinces in Vietnam. Historically, this problem has been conducted based on human experiences and without using optimization technology nor computer science. In this paper, we propose a model for the problem of fields partitioning taking into account real issues. We also propose local search algorithms for solving this problem with typical shapes of fields i.e., rectangle, trapezium, triangle. Experimental results show that our local search approach gives better solutions than those realized by human experiences.