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

The Modified Particle Swarm Optimization for a Special Case of the Assignment Problem: A Case Study in Chicken Transportation

Author

Listed:
  • Naratip Supattananon
  • Raknoi Akararungruangkul

Abstract

This research aims at solving the special case of multistate assignment problem. The problem includes many special characteristics which are not normally included in the assignment problem. There are many types and conditions of vehicles included in the planning and different road conditions of traveling, which would have different effects on fuel consumption, which is the objective function of the study. The proposed problem is determined as a large and complicated problem making the optimization software unable to find an optimal solution within the proper time. Therefore, the researchers had developed a method for determining the optimal solution by using particle swarm optimization (PSO) in which the methods were developed for solving the proposed problem. This method is called the modified particle swarm optimization (modified PSO). The proposed method was tested with three groups of tested instances, i.e., small, medium, and large groups. The computational result shows that, in small-sized and medium-sized problems, the proposed method performed not significantly different from the optimization software, and in the large-sized problems, the modified PSO method gave 3.61% lower cost than the cost generated from best solution generated from optimization software within 72 hours and it gave 11.03% better solution than that of the best existing heuristics published so far (differential evolution algorithm).

Suggested Citation

  • Naratip Supattananon & Raknoi Akararungruangkul, 2020. "The Modified Particle Swarm Optimization for a Special Case of the Assignment Problem: A Case Study in Chicken Transportation," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-15, July.
  • Handle: RePEc:hin:jnlmpe:5716985
    DOI: 10.1155/2020/5716985
    as

    Download full text from publisher

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

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

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