Next Article in Journal
Development of Entrepreneurial Activity in the Czech Republic over the Years 2005–2017
Previous Article in Journal
What Dynamic Managerial Capabilities Are Needed for Greater Strategic Alliance Performance?
Article Menu

Export Article

Open AccessArticle

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

1
Faculty of Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
2
Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40002, Thailand
3
Faculty of Engineering Management, Poznan University of Technology, Poznań 61-704, Poland
4
Department of Computer Science, Faculty of Informatics, Mahasarakham University, Maha Sarakham 44150, Thailand
5
Faculty of Engineering, Nakhon Phanom University, Nakhon Phanom 48000, Thailand
*
Author to whom correspondence should be addressed.
J. Open Innov. Technol. Mark. Complex. 2019, 5(3), 37; https://doi.org/10.3390/joitmc5030037
Received: 30 May 2019 / Revised: 21 June 2019 / Accepted: 24 June 2019 / Published: 26 June 2019
  |  
PDF [1188 KB, uploaded 9 July 2019]
  |  

Abstract

This research aimed to present a solution to the problem of production scheduling and assignment in broiler farms, which thus enabled the farms to achieve maximum profit. In the operation of farms, there are many factors that affect profits, such as the number of broilers being consistent with the demand of production plants, including profits from the sales and transportation costs. Therefore, we formulated a mathematical model and tested it while using three problem groups through the Lingo v.11 program. The results indicated that this mathematical model could find a suitable solution. However, finding the best solution had time constraints, which resulted in various other problems that prevented a search for an optimal solution due to time consumption exceeding 72 h. We developed an algorithm using the Adaptive Large Neighborhood Search (ALNS) method in order to find another possible solution using a shorter time period, which consisted of ALNS1, ALNS2, and ALNS3. These algorithms are based on a combination of the method of destruction solutions and methods accepting different solutions. We aimed to effectively solve the problems and ensure that they are appropriate for the case study, a broiler farm in Buriram. When comparing the algorithm efficiency with the Lingo v.11 program, it was found that the ALNS1 algorithm was the most suitable for finding the optimal solution in the shortest time, which resulted in a 5.74% increase in operating profits. View Full-Text
Keywords: adaptive large neighborhood search; broiler farm management; scheduling and assignment problems; Adaptive Large Neighborhood Search (ALNS) adaptive large neighborhood search; broiler farm management; scheduling and assignment problems; Adaptive Large Neighborhood Search (ALNS)
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Praseeratasang, N.; Pitakaso, R.; Sethanan, K.; Kosacka-Olejnik, M.; kaewman, S.; Theeraviriya, C. Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms. J. Open Innov. Technol. Mark. Complex. 2019, 5, 37.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
J. Open Innov. Technol. Mark. Complex. EISSN 2199-8531 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top