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

Data-Driven Robust Optimization for Solving the Heterogeneous Vehicle Routing Problem with Customer Demand Uncertainty

Author

Listed:
  • Jingling Zhang
  • Mengfan Yu
  • Qinbing Feng
  • Longlong Leng
  • Yanwei Zhao
  • Matilde Santos

Abstract

In practice, the parameters of the vehicle routing problem are uncertain, which is called the uncertain vehicle routing problem (UVRP). Therefore, a data-driven robust optimization approach to solve the heterogeneous UVRP is studied. The uncertain parameters of customer demand are introduced, and the uncertain model is established. The uncertain model is transformed into a robust model with adjustable parameters. At the same time, we use a least-squares data-driven method combined with historical data samples to design a function of robust adjustable parameters related to the maximum demand, demand range, and given vehicle capacity to optimize the robust model. We improve the deep Q-learning-based reinforcement learning algorithm for the fleet size and mix vehicle routing problem to solve the robust model. Through test experiments, it is proved that the robust optimization model can effectively reduce the number of customers affected by the uncertainty, greatly improve customer satisfaction, and effectively reduce total cost and demonstrate that the improved algorithm also exhibits good performance.

Suggested Citation

  • Jingling Zhang & Mengfan Yu & Qinbing Feng & Longlong Leng & Yanwei Zhao & Matilde Santos, 2021. "Data-Driven Robust Optimization for Solving the Heterogeneous Vehicle Routing Problem with Customer Demand Uncertainty," Complexity, Hindawi, vol. 2021, pages 1-19, June.
  • Handle: RePEc:hin:complx:6634132
    DOI: 10.1155/2021/6634132
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6634132.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6634132.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6634132?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:complx:6634132. 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.