IDEAS home Printed from https://ideas.repec.org/a/eme/mscrap/mscra-05-2023-0016.html
   My bibliography  Save this article

Integrated optimization of logistics routing problem considering chance preference

Author

Listed:
  • Liang Ren
  • Zerong Zhou
  • Yaping Fu
  • Ao Liu
  • Yunfeng Ma

Abstract

Purpose - This study aims to examine the impact of the decision makers’ risk preference on logistics routing problem, contributing to logistics behavior analysis and route integration optimization under uncertain environment. Due to the unexpected events and complex environment in modern logistics operations, the logistics process is full of uncertainty. Based on the chance function of satisfying the transportation time and cost requirements, this paper focuses on the fourth party logistics routing integrated optimization problem considering the chance preference of decision makers from the perspective of satisfaction. Design/methodology/approach - This study used the quantitative method to investigate the relationship between route decision making and human behavior. The cumulative prospect theory is used to describe the loss, gain and utility function based on confidence levels. A mathematical model and an improved ant colony algorithm are employed to solve the problems. Numerical examples show the effectiveness of the proposed model and algorithm. Findings - The study’s findings reveal that the dual-population improvement strategy enhances the algorithm’s global search capability and the improved algorithm can solve the risk model quickly, verifying the effectiveness of the improvement method. Moreover, the decision-maker is more sensitive to losses, and the utility obtained when considering decision-makers' risk attitudes is greater than that obtained when the decision-maker exhibits risk neutrality. Practical implications - In an uncertain environment, the logistics decision maker’s risk preference directly affects decision making. Different parameter combinations in the proposed model could be set for decision-makers with different risk attitudes to fit their needs more accurately. This could help managers design effective transportation plans and improve service levels. In addition, the improved algorithm can solve the proposed problem quickly, stably and effectively, so as to help the decision maker to make the logistics path decision quickly according to the required confidence level. Originality/value - Considering the uncertainty in logistics and the risk behavior of decision makers, this paper studies integrated routing problem from the perspective of opportunity preference. Based on the chance function of satisfying the transportation time and cost requirements, a fourth party logistics routing integrated optimization problem model considering the chance preference of decision makers is established. According to the characteristics of the problem, an improved dual-population ant colony algorithm is designed to solve the proposed model. Numerical examples show the effectiveness the proposed methods.

Suggested Citation

  • Liang Ren & Zerong Zhou & Yaping Fu & Ao Liu & Yunfeng Ma, 2024. "Integrated optimization of logistics routing problem considering chance preference," Modern Supply Chain Research and Applications, Emerald Group Publishing Limited, vol. 6(4), pages 376-392, September.
  • Handle: RePEc:eme:mscrap:mscra-05-2023-0016
    DOI: 10.1108/MSCRA-05-2023-0016
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/MSCRA-05-2023-0016/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: no

    File URL: https://www.emerald.com/insight/content/doi/10.1108/MSCRA-05-2023-0016/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: no

    File URL: https://libkey.io/10.1108/MSCRA-05-2023-0016?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
    ---><---

    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:eme:mscrap:mscra-05-2023-0016. 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: Emerald Support (email available below). General contact details of provider: .

    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.