research-article

Constraint-based local search for fields partitioning problem

Authors:

Quoc Trung Bui,

Quang-Dung Pham,

Yves DevilleAuthors Info & Claims

SoICT '11: Proceedings of the 2nd Symposium on Information and Communication Technology

Pages 19 - 28

https://doi.org/10.1145/2069216.2069224

Published: 13 October 2011 Publication History

Get Access

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.

References

[1]

Bac Ninh News. Hieu qua don dien doi thua o yen phong. http://www.bacninh.gov.vn/Story/NongNghiepKhuyen-Nong/2010/10/22698.html, 2010.

Google Scholar

[2]

Dan Viet. Hoan thanh don dien doi thua. http://www.baomoi.com/Home/DauTu-QuyHoach/danviet.vn/Hoan-thanh-don-dien-doi-thua/5928264.epi, 2011.

Google Scholar

[3]

T. Nguyen. What is the solution for regrouping and exchanging the agricultural parcels. http://www.kinhtenongthon.com.vn/printContent.aspx?ID=10990, 2008.

Google Scholar

[4]

K. Pruhs and G. J. Woeginger. Approximation schemes for a class of subset selection problems. Theor. Comput. Sci., 382(2):151--156, 2007.

Digital Library

Google Scholar

[5]

P. Van Hentenryck and L. Michel. Constraint-based local search. The MIT Press, London, England, 2005.

Digital Library

Google Scholar

Cited By

View all

Quoc Trung BThi-Mai-Anh BViet Chinh NQuang Dung PManh Cuong N(2023)Metaheuristic for a soft-rectangle packing problem with guillotine constraintsProceedings of the 12th International Symposium on Information and Communication Technology10.1145/3628797.3628918(715-722)Online publication date: 7-Dec-2023
https://dl.acm.org/doi/10.1145/3628797.3628918
Bui QPham QDeville Y(2013)Solving the Agricultural Land Allocation Problem by Constraint-Based Local SearchPrinciples and Practice of Constraint Programming10.1007/978-3-642-40627-0_55(749-757)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40627-0_55

Index Terms

Constraint-based local search for fields partitioning problem

Recommendations

Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem

Backtracking search is frequently applied to solve a constraint-based search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have ...
Study on the local search ability of particle swarm optimization
ICSI'10: Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I

Particle swarm optimization (PSO) has been shown to perform well on many optimization problems However, the PSO algorithm often can not find the global optimum, even for unimodal functions It is necessary to study the local search ability of PSO The ...
A hybrid of particle swarm optimization and local search for multimodal functions
ICSI'10: Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I

The standard PSO has problems with consistently converging to good solutions, especially for multimodal functions The reason for PSO failing to find (global) optima is premature convergence Also, it has been shown in many empirical studies that PSO ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SoICT '11: Proceedings of the 2nd Symposium on Information and Communication Technology

October 2011

225 pages

ISBN:9781450308809

DOI:10.1145/2069216

General Chairs:
Thang Huynh Quyet
Hanoi University of Science and Technology, Vietnam
,
Dinh Khang Tran
Hanoi University of Science and Technology, Vietnam

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SoICT '11

SoICT '11: Symposium on Information and Communication Technology 2011

October 13 - 14, 2011

Hanoi, Vietnam

Acceptance Rates

Overall Acceptance Rate 147 of 318 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
44
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Quoc Trung BThi-Mai-Anh BViet Chinh NQuang Dung PManh Cuong N(2023)Metaheuristic for a soft-rectangle packing problem with guillotine constraintsProceedings of the 12th International Symposium on Information and Communication Technology10.1145/3628797.3628918(715-722)Online publication date: 7-Dec-2023
https://dl.acm.org/doi/10.1145/3628797.3628918
Bui QPham QDeville Y(2013)Solving the Agricultural Land Allocation Problem by Constraint-Based Local SearchPrinciples and Practice of Constraint Programming10.1007/978-3-642-40627-0_55(749-757)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40627-0_55

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem

Study on the local search ability of particle swarm optimization

A hybrid of particle swarm optimization and local search for multimodal functions