Combined Monte Carlo simulation and memetic algorithm for a stochastic multi-trip inventory routing problem

被引:0
作者
Khoukhi, Saadia [1 ]
Yaakoubi, Othmane El [1 ]
Bojji, Chakib [1 ]
Bensouda, Yahya [2 ]
机构
[1] Mohammed V Univ, Higher Sch Tech Educ, Moroccan Lab Innovat & Ind Performance, Rabat, Morocco
[2] Mohammed V Univ, Fac Med, Lab Galen Pharm & Ind Pharmaceut Technol, Pharm, Rabat, Morocco
关键词
inventory routing problem; stochastic demand; multi-trip; time windows; simultaneous pick-up and delivery; Monte Carlo simulation; memetic algorithm; pharmaceutical supply chain; PSC; MANAGEMENT; COORDINATION; OPTIMIZATION; DELIVERY; POLICY;
D O I
10.1504/IJSTL.2023.128548
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The present paper introduced, modelled, and solved a real-life logistics problem arising in the hospital complex of Rabat (Morocco). To manage efficiently the distribution process, hospital managers propose to adopt a vendor managed inventory system that involves the establishment of a central pharmacy, which will control the inventories of hospitals. The central pharmacy will also be responsible for delivering full roll containers of medicines to hospitals and the collection of empty ones for reuse in the next period. All deliveries and returns are performed simultaneously by a homogeneous fleet of vehicles that may perform several trips per period. Each hospital defines a time window wherein the service can begin. This problem is known in the literature as the multi-trip inventory routing problem with time windows and simultaneous pickup and delivery. Given the complexity of the problem, we propose a combined simulation-heuristic problem, which combines Monte Carlo simulation and memetic algorithm. The performance and effectiveness of the proposed approach are clarified by computational experiments.
引用
收藏
页码:19 / 53
页数:36
相关论文
共 42 条
  • [1] Industrial aspects and literature survey: Combined inventory management and routing
    Andersson, Henrik
    Hoff, Arild
    Christiansen, Marielle
    Hasle, Geir
    Lokketangen, Arne
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) : 1515 - 1536
  • [2] Andre V., 2011, C PAPER IESM 1
  • [3] [Anonymous], 2000, SUPPLY CHAIN MANAGEM
  • [4] A branch-and-cut algorithm for a vendor-managed inventory-routing problem
    Archetti, Claudia
    Bertazzi, Luca
    Laporte, Gilbert
    Speranza, Maria Grazia
    [J]. TRANSPORTATION SCIENCE, 2007, 41 (03) : 382 - 391
  • [5] Supply chain coordination: Perspectives, empirical studies and research directions
    Arshinder, S.
    Kanda, Arun
    Deshmukh, S. G.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 115 (02) : 316 - 335
  • [6] ROUTE 1ST - CLUSTER 2ND METHODS FOR VEHICLE-ROUTING
    BEASLEY, JE
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (04): : 403 - 408
  • [7] IMPROVING THE DISTRIBUTION OF INDUSTRIAL GASES WITH AN ONLINE COMPUTERIZED ROUTING AND SCHEDULING OPTIMIZER
    BELL, WJ
    DALBERTO, LM
    FISHER, ML
    GREENFIELD, AJ
    JAIKUMAR, R
    KEDIA, P
    MACK, RG
    PRUTZMAN, PJ
    [J]. INTERFACES, 1983, 13 (06) : 4 - 23
  • [8] Bertazzi L, 2008, OPER RES COMPUT SCI, V43, P49, DOI 10.1007/978-0-387-77778-8_3
  • [9] Inventory control for point-of-use locations in hospitals
    Bijvank, M.
    Vis, I. F. A.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (04) : 497 - 510
  • [10] Bramham J., 2004, Manufacturing Engineer, V83, P30, DOI 10.1049/me:20040308