Next Article in Journal
The Average Hull Dimension of Negacyclic Codes over Finite Fields
Next Article in Special Issue
A (p,q)-Averaged Hausdorff Distance for Arbitrary Measurable Sets
Previous Article in Journal
Rapid Modeling and Parameter Estimation of Partial Differential Algebraic Equations by a Functional Spreadsheet Paradigm
Previous Article in Special Issue
Modified Differential Evolution Algorithm Solving the Special Case of Location Routing Problem

## Printed Edition

A printed edition of this Special Issue is available at MDPI Books....
Open AccessArticle

# An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand

1
Metaheuristics for Logistics Optimization Laboratory, Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
2
Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40000, Thailand
3
Department of Economics, Faculty of Business Administration, Rajamangala University of Technology Thanyaburi, Patumthani 10900, Thailand
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2018, 23(3), 40; https://doi.org/10.3390/mca23030040
Received: 14 July 2018 / Revised: 5 August 2018 / Accepted: 9 August 2018 / Published: 10 August 2018
This research aimed to solve the economic crop planning problem, considering transportation logistics to maximize the profit from cultivated activities. Income is derived from the selling price and production rate of the plants; costs are due to operating and transportation expenses. Two solving methods are presented: (1) developing a mathematical model and solving it using Lingo v.11, and (2) using three improved Differential Evolution (DE) Algorithms—I-DE-SW, I-DE-CY, and I-DE-KV—which are DE with swap, cyclic moves (CY), and K-variables moves (KV) respectively. The algorithms were tested by 16 test instances, including this case study. The computational results showed that Lingo v.11 and all DE algorithms can find the optimal solution eight out of 16 times. Regarding the remaining test instances, Lingo v.11 was unable to find the optimal solution within 400 h. The results for the DE algorithms were compared with the best solution generated within that time. The DE solutions were 1.196–1.488% better than the best solution generated by Lingo v.11 and used 200 times less computational time. Comparing the three DE algorithms, MDE-KV was the DE that was the most flexible, with the biggest neighborhood structure, and outperformed the other DE algorithms. View Full-Text
Show Figures

Figure 1

MDPI and ACS Style

Ketsripongsa, U.; Pitakaso, R.; Sethanan, K.; Srivarapongse, T. An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand. Math. Comput. Appl. 2018, 23, 40.