IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i18p2233-d633572.html
   My bibliography  Save this article

An Improved Genetic Algorithm for the Optimal Distribution of Fresh Products under Uncertain Demand

Author

Listed:
  • Hao Zhang

    (School of Business, Beijing Technology and Business University, Beijing 100048, China)

  • Yan Cui

    (School of Business, Beijing Technology and Business University, Beijing 100048, China)

  • Hepu Deng

    (School of Accounting, Information Systems and Supply Chain, RMIT University, Melbourne, VIC 3149, Australia)

  • Shuxian Cui

    (School of Business, Beijing Technology and Business University, Beijing 100048, China)

  • Huijia Mu

    (School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China)

Abstract

There are increasing challenges for optimally distributing fresh products while adequately considering the uncertain demand of customers and maintaining the freshness of products. Taking the nature of fresh products and the characteristics of urban logistics systems into consideration, this paper proposes an improved genetic algorithm for effectively solving this problem in a computationally efficient manner. Such an algorithm can adequately account for the uncertain demand of customers to select the optimal distribution route to ensure the freshness of the product while minimizing the total distribution cost. Iterative optimization procedures are utilized for determining the optimal route by reducing the complexity of the computation in the search for an optimal solution. An illustrative example is presented that shows the improved algorithm is more effective with respect to the distribution cost, the distribution efficiency, and the distribution system’s reliability in optimally distributing fresh products.

Suggested Citation

  • Hao Zhang & Yan Cui & Hepu Deng & Shuxian Cui & Huijia Mu, 2021. "An Improved Genetic Algorithm for the Optimal Distribution of Fresh Products under Uncertain Demand," Mathematics, MDPI, vol. 9(18), pages 1-18, September.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:18:p:2233-:d:633572
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/18/2233/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/18/2233/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Liu, Shuguang & Huang, Weilai & Ma, Huiming, 2009. "An effective genetic algorithm for the fleet size and mix vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(3), pages 434-445, May.
    2. Wu, Xin & Nie, Lei & Xu, Meng & Yan, Fei, 2018. "A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 186-209.
    3. Meena, P.L. & Sarmah, S.P., 2013. "Multiple sourcing under supplier failure risk and quantity discount: A genetic algorithm approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 84-97.
    4. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.
    5. Zhang, Guoqing & Shi, Jianmai & Chaudhry, Sohail S. & Li, Xindan, 2019. "Multi-period multi-product acquisition planning with uncertain demands and supplier quantity discounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 117-140.
    6. J Berger & M Barkaoui, 2003. "A new hybrid genetic algorithm for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1254-1262, December.
    7. Zhou, Yan & Chan, Chi Kin & Wong, Kar Hung, 2018. "A multi-period supply chain network equilibrium model considering retailers’ uncertain demands and dynamic loss-averse behaviors," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 51-76.
    8. Dimitris J. Bertsimas, 1992. "A Vehicle Routing Problem with Stochastic Demand," Operations Research, INFORMS, vol. 40(3), pages 574-585, June.
    9. Neves-Moreira, Fábio & Pereira da Silva, Diogo & Guimarães, Luís & Amorim, Pedro & Almada-Lobo, Bernardo, 2018. "The time window assignment vehicle routing problem with product dependent deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 163-183.
    10. Allahviranloo, Mahdieh & Chow, Joseph Y.J. & Recker, Will W., 2014. "Selective vehicle routing problems under uncertainty without recourse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 68-88.
    11. Soysal, Mehmet & Bloemhof-Ruwaard, Jacqueline M. & Haijema, Rene & van der Vorst, Jack G.A.J., 2015. "Modeling an Inventory Routing Problem for perishable products with environmental considerations and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 164(C), pages 118-133.
    12. Georgieva, A. & Jordanov, I., 2009. "Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms," European Journal of Operational Research, Elsevier, vol. 196(2), pages 413-422, July.
    13. Florent Hernandez & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A local branching matheuristic for the multi-vehicle routing problem with stochastic demands," Journal of Heuristics, Springer, vol. 25(2), pages 215-245, April.
    14. Zegordi, S.H. & Beheshti Nia, M.A., 2009. "A multi-population genetic algorithm for transportation scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 946-959, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ponte, Borja & Puche, Julio & Rosillo, Rafael & de la Fuente, David, 2020. "The effects of quantity discounts on supply chain performance: Looking through the Bullwhip lens," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    2. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    3. Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
    4. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.
    5. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    6. Kumar, V.N.S.A. & Kumar, V. & Brady, M. & Garza-Reyes, Jose Arturo & Simpson, M., 2017. "Resolving forward-reverse logistics multi-period model using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 458-469.
    7. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    8. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    9. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    10. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
    11. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    12. Rafael Tordecilla-Madera & Andrés Polo & Adrián Cañón, 2018. "Vehicles Allocation for Fruit Distribution Considering CO 2 Emissions and Decisions on Subcontracting," Sustainability, MDPI, vol. 10(7), pages 1-21, July.
    13. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    14. Gia-Shie Liu & Kuo-Ping Lin, 2020. "The Online Distribution System of Inventory-Routing Problem with Simultaneous Deliveries and Returns Concerning CO 2 Emission Cost," Mathematics, MDPI, vol. 8(6), pages 1-27, June.
    15. Zhou, Wei & Zhang, Keang & Zhang, Ying & Duan, Yunlong, 2021. "Operation strategies with respect to insurance subsidy optimization for online retailers dealing with large items," International Journal of Production Economics, Elsevier, vol. 232(C).
    16. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    17. Yuan, Jun & Shi, Xunpeng & He, Junliang, 2024. "LNG market liberalization and LNG transportation: Evaluation based on fleet size and composition model," Applied Energy, Elsevier, vol. 358(C).
    18. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    19. Oscar Dominguez & Angel A. Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    20. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.

    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:gam:jmathe:v:9:y:2021:i:18:p:2233-:d:633572. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.