IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8184254.html
   My bibliography  Save this article

Sine Cosine Algorithm with Multigroup and Multistrategy for Solving CVRP

Author

Listed:
  • Qingyong Yang
  • Shu-Chuan Chu
  • Jeng-Shyang Pan
  • Chien-Ming Chen

Abstract

Sine Cosine Algorithm (SCA) has been proved to be superior to some existing traditional optimization algorithms owing to its unique optimization principle. However, there are still disadvantages such as low solution accuracy and poor global search ability. Aiming at the shortcomings of the sine cosine algorithm, a multigroup multistrategy SCA algorithm (MMSCA) is proposed in this paper. The algorithm executes multiple populations in parallel, and each population executes a different optimization strategy. Information is exchanged among populations through intergenerational communication. Using 19 different types of test functions, the optimization performance of the algorithm is tested. Numerical experimental results show that the performance of the MMSCA algorithm is better than that of the original SCA algorithm, and it also has some advantages over other intelligent algorithms. At last, it is applied to solving the capacitated vehicle routing problem (CVRP) in transportation. The algorithm can get better results, and the practicability and feasibility of the algorithm are also proved.

Suggested Citation

  • Qingyong Yang & Shu-Chuan Chu & Jeng-Shyang Pan & Chien-Ming Chen, 2020. "Sine Cosine Algorithm with Multigroup and Multistrategy for Solving CVRP," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-10, March.
  • Handle: RePEc:hin:jnlmpe:8184254
    DOI: 10.1155/2020/8184254
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8184254.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8184254.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8184254?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:8184254. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.