Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations

被引:93
作者
Sethanan, Kanchana [1 ]
Neungmatcha, Woraya [2 ]
机构
[1] Khon Kaen Univ, Dept Ind Engn, Res Unit Syst Modeling Ind, Fac Engn, Khon Kaen 40002, Thailand
[2] Kasetsart Univ, Dept Ind Engn Logist, Fac Engn Kamphaeng Saen, Kamphaeng Saen Campus, Nakhon Pathom 73140, Thailand
关键词
Sugarcane; Harvester planning; Particle swarm optimization; Multi-objective; SHORTEST-PATH PROBLEM; GENETIC ALGORITHM; TRANSPORT; SELECTION; MODEL;
D O I
10.1016/j.ejor.2016.01.043
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
One of the important aspects to increasing sugarcane mechanical harvesting efficiency is the path planning of the harvester, involving direction and field accessibility constraints. Moreover, in real-life applications, the two objective functions pertaining to minimization of harvested distance and maximization of sugarcane yield are conflicting and must be considered simultaneously. This paper presents a multi-objective with the variant of the particle swarm optimization combined gbest, lbest and nbest social structures (MO-GLNPSO), to solve sugarcane mechanical harvester route planning (MHRP). A new particle encoding/decoding scheme has been devised for combining the path planning with the accessibility and split harvesting constraints. Numerical computation results on several networks with sugarcane field topologies illustrate the efficiency of the proposed MO-GLNPSO method for computation of MHRP, which is compared with other methods such as the traditional particle swarm optimization (PSO) and Non-dominated Sorting Genetic Algorithm-II (NSGAII) by the values (C) over tilde metric indicator. The solutions found in this work can offer a decision maker a choice of trade-off solutions, providing sufficient options to give planners the power to make an informed choice that balances the important objectives. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:969 / 984
页数:16
相关论文
共 37 条
[1]  
Ahmed Adam E., 2014, J SAUDI SOC AGR SCI, V14, P160
[2]   A genetic algorithm for shortest path routing problem and the sizing of populations [J].
Ahn, CW ;
Ramakrishna, RS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :566-579
[3]  
Ai TJ, 2007, IEEE C EVOL COMPUTAT, P3264
[4]  
[Anonymous], 2012, FAO STAT YB WORLD FO
[5]   Dynamic shortest path in stochastic dynamic networks: Ship routing problem [J].
Azaron, A ;
Kianfar, F .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) :138-156
[6]   Path planning for in-field navigation-aiding of service units [J].
Bochtis, D. D. ;
Sorensen, C. G. ;
Vougioukas, S. G. .
COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2010, 74 (01) :80-90
[7]   A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry [J].
Boonmee, Atiwat ;
Sethanan, Kanchana .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (02) :652-665
[8]   A new multi-objective particle swarm optimization algorithm based on decomposition [J].
Dai, Cai ;
Wang, Yuping ;
Ye, Miao .
INFORMATION SCIENCES, 2015, 325 :541-557
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   The bi-objective Pollution-Routing Problem [J].
Demir, Emrah ;
Bektas, Tolga ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) :464-478