IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i4p857-d494836.html
   My bibliography  Save this article

A Modified Niching Crow Search Approach to Well Placement Optimization

Author

Listed:
  • Jahedul Islam

    (Fundamental and Applied Sciences Department, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Perak Darul Ridzuan, Malaysia)

  • Md Shokor A. Rahaman

    (Shale Gas Research Group, Institute of Hydrocarbon Recovery, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Perak Darul Ridzuan, Malaysia)

  • Pandian M. Vasant

    (Fundamental and Applied Sciences Department, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Perak Darul Ridzuan, Malaysia)

  • Berihun Mamo Negash

    (Petroleum Engineering Department, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Perak Darul Ridzuan, Malaysia)

  • Ahshanul Hoqe

    (Electrical & Electronic Engineering Department, Chittagong University of Engineering and Technology, Chittagong 4349, Bangladesh)

  • Hitmi Khalifa Alhitmi

    (College of Business and Economics, Qatar University, Doha 00974, Qatar)

  • Junzo Watada

    (Department of Computer & Information Sciences, Universiti Teknologi Petronas, Seri Iskandar 32610, Perak, Malaysia)

Abstract

Well placement optimization is considered a non-convex and highly multimodal optimization problem. In this article, a modified crow search algorithm is proposed to tackle the well placement optimization problem. This article proposes modifications based on local search and niching techniques in the crow search algorithm (CSA). At first, the suggested approach is verified by experimenting with the benchmark functions. For test functions, the results of the proposed approach demonstrated a higher convergence rate and a better solution. Again, the performance of the proposed technique is evaluated with well placement optimization problem and compared with particle swarm optimization (PSO), the Gravitational Search Algorithm (GSA), and the Crow search algorithm (CSA). The outcomes of the study revealed that the niching crow search algorithm is the most efficient and effective compared to the other techniques.

Suggested Citation

  • Jahedul Islam & Md Shokor A. Rahaman & Pandian M. Vasant & Berihun Mamo Negash & Ahshanul Hoqe & Hitmi Khalifa Alhitmi & Junzo Watada, 2021. "A Modified Niching Crow Search Approach to Well Placement Optimization," Energies, MDPI, vol. 14(4), pages 1-33, February.
    • Handle: RePEc:gam:jeners:v:14:y:2021:i:4:p:857-:d:494836
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/4/857/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/14/4/857/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Primitivo Díaz & Marco Pérez-Cisneros & Erik Cuevas & Omar Avalos & Jorge Gálvez & Salvador Hinojosa & Daniel Zaldivar, 2018. "An Improved Crow Search Algorithm Applied to Energy Problems," Energies, MDPI, vol. 11(3), pages 1-22, March.
    2. Mao, Kun & Pan, Quan-ke & Pang, Xinfu & Chai, Tianyou, 2014. "A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process," European Journal of Operational Research, Elsevier, vol. 236(1), pages 51-60.
    Full references (including those not matched with items on IDEAS)

    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. Ünal, Yusuf Ziya & Uysal, Özgür, 2014. "A new mixed integer programming model for curriculum balancing: Application to a Turkish university," European Journal of Operational Research, Elsevier, vol. 238(1), pages 339-347.
    2. Ruilin Pan & Qiong Wang & Zhenghong Li & Jianhua Cao & Yongjin Zhang, 2022. "Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs," Annals of Operations Research, Springer, vol. 310(1), pages 119-151, March.
    3. Urbani, Michele & Brunelli, Matteo & Punkka, Antti, 2023. "An approach for bi-objective maintenance scheduling on a networked system with limited resources," European Journal of Operational Research, Elsevier, vol. 305(1), pages 101-113.
    4. Asma Meddeb & Nesrine Amor & Mohamed Abbes & Souad Chebbi, 2018. "A Novel Approach Based on Crow Search Algorithm for Solving Reactive Power Dispatch Problem," Energies, MDPI, vol. 11(12), pages 1-16, November.
    5. Liu, Ming & Yang, Xuenan & Chu, Feng & Zhang, Jiantong & Chu, Chengbin, 2020. "Energy-oriented bi-objective optimization for the tempered glass scheduling," Omega, Elsevier, vol. 90(C).
    6. Shahbaa I. Khaleel, 2023. "Building a Tool for Optimal Test Cases Selection using Artificial Intelligence Techniques," Technium, Technium Science, vol. 8(1), pages 1-11.
    7. Shahbaa I. Khaleel, 2023. "Constructing a Tool for Software Regression Testing Based on Crow Search Method," Technium, Technium Science, vol. 8(1), pages 60-71.
    8. G. Rius-Sorolla & J. Maheut & Jairo R. Coronado-Hernandez & J. P. Garcia-Sabater, 2020. "Lagrangian relaxation of the generic materials and operations planning model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 105-123, March.
    9. Pieter Moerloose & Broos Maenhout, 2023. "A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints," Operational Research, Springer, vol. 23(1), pages 1-43, March.
    10. Pan, Quan-Ke, 2016. "An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling," European Journal of Operational Research, Elsevier, vol. 250(3), pages 702-714.
    11. Ovidiu Ivanov & Bogdan-Constantin Neagu & Gheorghe Grigoras & Mihai Gavrilas, 2019. "Optimal Capacitor Bank Allocation in Electricity Distribution Networks Using Metaheuristic Algorithms," Energies, MDPI, vol. 12(22), pages 1-36, November.
    12. Ursavas, Evrim, 2017. "A benders decomposition approach for solving the offshore wind farm installation planning at the North Sea," European Journal of Operational Research, Elsevier, vol. 258(2), pages 703-714.
    13. Liu, Min & Jiang, Shenglong & Wu, Cheng, 2015. "A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting processAuthor-Name: Hao, Jinghua," European Journal of Operational Research, Elsevier, vol. 244(3), pages 966-979.
    14. Elena Niculina Dragoi & Vlad Dafinescu, 2021. "Review of Metaheuristics Inspired from the Animal Kingdom," Mathematics, MDPI, vol. 9(18), pages 1-52, September.
    15. Jianyu Long & Zhong Zheng & Xiaoqiang Gao & Panos M Pardalos, 2016. "A hybrid multi-objective evolutionary algorithm based on NSGA-II for practical scheduling with release times in steel plants," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1184-1199, September.
    16. Hector Carreon-Ortiz & Fevrier Valdez & Oscar Castillo, 2023. "Comparative Study of Type-1 and Interval Type-2 Fuzzy Logic Systems in Parameter Adaptation for the Fuzzy Discrete Mycorrhiza Optimization Algorithm," Mathematics, MDPI, vol. 11(11), pages 1-38, May.
    17. Songsong Chen & Feixiang Gong & Mingqiang Zhang & Jindou Yuan & Siyang Liao & Hongyin Chen & Dezhi Li & Shiming Tian & Xiaojian Hu, 2021. "Planning and Scheduling for Industrial Demand-Side Management: State of the Art, Opportunities and Challenges under Integration of Energy Internet and Industrial Internet," Sustainability, MDPI, vol. 13(14), pages 1-18, July.

    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:gam:jeners:v:14:y:2021:i:4:p:857-:d:494836. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.