IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v9y2017i3p188-202.html
   My bibliography  Save this article

A combined genetic algorithm and simulated annealing approach for solving competitive hub location and pricing problem

Author

Listed:
  • Mehdi Abbasi
  • Raziyeh Niknam

Abstract

The competitive hub location and pricing problem (CHLPP) describes a situation in which the incumbent firm has already established an optimal hub network with existing hubs for cost minimisation to satisfy all demands. The entrant designs a network to maximise its profit and applies optimal pricing, considering that the existing firm applies mill pricing. Customer's choice factor is solely price modelled using logit function. According to the literature, CHLPP is a NP-hard problem and genetic algorithm (GA) has been previously applied for solving it. In this paper, we propose a more efficient algorithm through combining GA and simulated annealing (SA) algorithm (GA-SA) to solve the mentioned problem. We test the algorithm on the Australia post (AP) data set. Comparing GA-SA and GA computational results indicates that the hybrid GA-SA method outperforms the GA approach in terms of both solution quality (on average 10%) and run time (on average 9%).

Suggested Citation

  • Mehdi Abbasi & Raziyeh Niknam, 2017. "A combined genetic algorithm and simulated annealing approach for solving competitive hub location and pricing problem," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 9(3), pages 188-202.
    • Handle: RePEc:ids:injams:v:9:y:2017:i:3:p:188-202
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=86639
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:injams:v:9:y:2017:i:3:p:188-202. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    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.