IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v252y2016i3p969-984.html
   My bibliography  Save this article

Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operationsAuthor-Name: Sethanan, Kanchana

Author

Listed:
  • Neungmatcha, Woraya

Abstract

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 of C˜ 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.

Suggested Citation

  • Neungmatcha, Woraya, 2016. "Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operationsAuthor-Name: Sethanan, Kanchana," European Journal of Operational Research, Elsevier, vol. 252(3), pages 969-984.
    • Handle: RePEc:eee:ejores:v:252:y:2016:i:3:p:969-984
    DOI: 10.1016/j.ejor.2016.01.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716000886
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.01.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    2. Azaron, Amir & Kianfar, Farhad, 2003. "Dynamic shortest path in stochastic dynamic networks: Ship routing problem," European Journal of Operational Research, Elsevier, vol. 144(1), pages 138-156, January.
    3. Cai Dai & Yuping Wang & Wei Yue, 2015. "A new orthogonal evolutionary algorithm based on decomposition for multi-objective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1686-1698, October.
    4. Iannoni, Ana Paula & Morabito, Reinaldo, 2006. "A discrete simulation analysis of a logistics supply system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(3), pages 191-210, May.
    5. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    6. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    7. S. Nguyen & V. Kachitvichyanukul, 2010. "Movement Strategies for Multi-Objective Particle Swarm Optimization," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 1(3), pages 59-79, July.
    8. Gabrel, Virginie & Vanderpooten, Daniel, 2002. "Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite," European Journal of Operational Research, Elsevier, vol. 139(3), pages 533-542, June.
    9. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2014. "The bi-objective Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 464-478.
    10. Higgins, Andrew, 2006. "Scheduling of road vehicles in sugarcane transport: A case study at an Australian sugar mill," European Journal of Operational Research, Elsevier, vol. 170(3), pages 987-1000, May.
    11. Pisut Pongchairerks & Voratas Kachitvichyanukul, 2009. "Particle Swarm Optimization algorithm with multiple social learning structures," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(2), pages 176-194.
    12. Goh, C.K. & Tan, K.C. & Liu, D.S. & Chiam, S.C., 2010. "A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design," European Journal of Operational Research, Elsevier, vol. 202(1), pages 42-54, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Ruochen & Li, Jianxia & fan, Jing & Mu, Caihong & Jiao, Licheng, 2017. "A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1028-1051.
    2. Qiu, Rui & Xu, Jiuping & Ke, Ruimin & Zeng, Ziqiang & Wang, Yinhai, 2020. "Carbon pricing initiatives-based bi-level pollution routing problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 203-217.
    3. Martin Filip & Tomas Zoubek & Roman Bumbalek & Pavel Cerny & Carlos E. Batista & Pavel Olsan & Petr Bartos & Pavel Kriz & Maohua Xiao & Antonin Dolan & Pavol Findura, 2020. "Advanced Computational Methods for Agriculture Machinery Movement Optimization with Applications in Sugarcane Production," Agriculture, MDPI, vol. 10(10), pages 1-20, September.
    4. Chih, Mingchang, 2023. "Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy," European Journal of Operational Research, Elsevier, vol. 305(2), pages 562-593.
    5. Jakubik, Johannes & Binding, Adrian & Feuerriegel, Stefan, 2021. "Directed particle swarm optimization with Gaussian-process-based function forecasting," European Journal of Operational Research, Elsevier, vol. 295(1), pages 157-169.
    6. William Pettersson & Melih Ozlen, 2020. "Multiobjective Integer Programming: Synergistic Parallel Approaches," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 461-472, April.
    7. Pinar, Mehmet & Stengos, Thanasis & Topaloglou, Nikolas, 2020. "On the construction of a feasible range of multidimensional poverty under benchmark weight uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 415-427.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. D. G. Mogale & Sri Krishna Kumar & Manoj Kumar Tiwari, 2020. "Green food supply chain design considering risk and post-harvest losses: a case study," Annals of Operations Research, Springer, vol. 295(1), pages 257-284, December.
    2. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    3. Rafael Paiva & Reinaldo Morabito, 2009. "An optimization model for the aggregate production planning of a Brazilian sugar and ethanol milling company," Annals of Operations Research, Springer, vol. 169(1), pages 117-130, July.
    4. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
    5. Jena, Sanjay Dominik & Poggi, Marcus, 2013. "Harvest planning in the Brazilian sugar cane industry via mixed integer programming," European Journal of Operational Research, Elsevier, vol. 230(2), pages 374-384.
    6. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    7. Thomas Vempiliyath & Maitri Thakur & Vincent Hargaden, 2021. "Development of a Hybrid Simulation Framework for the Production Planning Process in the Atlantic Salmon Supply Chain," Agriculture, MDPI, vol. 11(10), pages 1-17, September.
    8. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    9. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    10. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    11. Yagcitekin, Bunyamin & Uzunoglu, Mehmet, 2016. "A double-layer smart charging strategy of electric vehicles taking routing and charge scheduling into account," Applied Energy, Elsevier, vol. 167(C), pages 407-419.
    12. Lee, Jisun & Joung, Seulgi & Lee, Kyungsik, 2022. "A fully polynomial time approximation scheme for the probability maximizing shortest path problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 35-45.
    13. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    14. Majid Eskandarpour & Pierre Dejax & Olivier Péton, 2019. "Multi-Directional Local Search for Sustainable Supply Chain Network Design," Post-Print hal-02407741, HAL.
    15. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    16. Yu, Yang & Wu, Yuting & Wang, Junwei, 2019. "Bi-objective green ride-sharing problem: Model and exact method," International Journal of Production Economics, Elsevier, vol. 208(C), pages 472-482.
    17. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    18. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    19. Hamed Farrokhi-Asl & Ahmad Makui & Armin Jabbarzadeh & Farnaz Barzinpour, 2020. "Solving a multi-objective sustainable waste collection problem considering a new collection network," Operational Research, Springer, vol. 20(4), pages 1977-2015, December.
    20. Shesh Narayan Sahu & Yuvraj Gajpal & Swapan Debbarma, 2018. "Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives," Annals of Operations Research, Springer, vol. 269(1), pages 623-640, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:252:y:2016:i:3:p:969-984. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.