Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » Dynamic inventory routing problem: Policies considering network disruptions

Journals

  • IJIEC (747)
  • MSL (2643)
  • DSL (668)
  • CCL (508)
  • USCM (1092)
  • ESM (413)
  • AC (562)
  • JPM (271)
  • IJDS (912)
  • JFS (96)
  • HE (32)
  • SCI (26)

IJIEC Volumes

    • Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)
    • Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • Volume 3 (76)
      • Issue 1 (9)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • Volume 17 (21)
      • Issue 1 (21)

Keywords

Supply chain management(166)
Jordan(161)
Vietnam(149)
Customer satisfaction(120)
Performance(113)
Supply chain(111)
Service quality(98)
Competitive advantage(95)
Tehran Stock Exchange(94)
SMEs(87)
optimization(86)
Trust(83)
TOPSIS(83)
Financial performance(83)
Sustainability(82)
Job satisfaction(80)
Factor analysis(78)
Social media(78)
Artificial intelligence(77)
Knowledge Management(77)


» Show all keywords

Authors

Naser Azad(82)
Mohammad Reza Iravani(64)
Zeplin Jiwa Husada Tarigan(63)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(39)
Jumadil Saputra(36)
Dmaithan Almajali(36)
Muhammad Turki Alshurideh(35)
Barween Al Kurdi(32)
Ahmad Makui(32)
Basrowi Basrowi(31)
Hassan Ghodrati(31)
Mohammad Khodaei Valahzaghard(30)
Sautma Ronni Basana(29)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)
Haitham M. Alzoubi(27)


» Show all authors

Countries

Iran(2184)
Indonesia(1290)
India(788)
Jordan(786)
Vietnam(504)
Saudi Arabia(453)
Malaysia(441)
United Arab Emirates(220)
China(206)
Thailand(153)
United States(111)
Turkey(106)
Ukraine(104)
Egypt(98)
Canada(92)
Peru(88)
Pakistan(85)
United Kingdom(80)
Morocco(79)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 9 Issue 4 pp. 523-534 , 2018

Dynamic inventory routing problem: Policies considering network disruptions Pages 523-534 Right click to download the paper Download PDF

Authors: Francisco Morales, Carlos Franco, Germán Méndez-Giraldo

DOI: 10.5267/j.ijiec.2017.11.001

Keywords: Inventory routing problem, Network disruption, Dynamic programming

Abstract: In this paper, we introduce an inventory routing problem with network disruptions. In this problem, not only decisions on inventory levels and vehicle routing are made simultaneously, but also, we consider disruptions over the networks in which a number of arcs are vulnerable to these disruptions, leading to an increase in travel times. We develop a dynamic programming approach to deal with this situation, and we also evaluate some policies adapting well-known instances from the literature.

How to cite this paper
Morales, F., Franco, C & Méndez-Giraldo, G. (2018). Dynamic inventory routing problem: Policies considering network disruptions.International Journal of Industrial Engineering Computations , 9(4), 523-534.

Refrences
Ahmadi-Javid, A., & Seddighi, A. H. (2013). A location-routing problem with disruption risk. Transportation Research Part E: Logistics and Transportation Review, 53, 63–82. https://doi.org/10.1016/j.tre.2013.02.002
Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. G. (2007). A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transportation Science, 41(3), 382–391.
Asl-Najafi, J., Zahiri, B., Bozorgi-Amiri, A., & Taheri-Moghaddam, A. (2015). A dynamic closed-loop location-inventory problem under disruption risk. Computers & Industrial Engineering, 90, 414–428.
Azadeh, A., Elahi, S., Hosseinabadi Farahani, M., & Nasirian, B. (2017). A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Computers & Industrial Engineering, 104, 124–133.
Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2012). Consistency in multi-vehicle inventory-routing. Transportation Research Part C: Emerging Technologies, 24, 270–287.
Coelho, L. C., & Laporte, G. (2013). The exact solution of several classes of inventory-routing problems. Computers and Operations Research, 40(2), 558–565. https://doi.org/10.1016/j.cor.2012.08.012
Federgruen, A., & Zipkin, P. (1984). A Combined Vehicle Routing and Inventory Allocation Problem. Operations Research, 32(5), 1019–1037.
Franco, C., & Figueroa-García, J. C. (2016). A column generation-based algorithm for solving combined inventory and routing problems. Ingeniare, 24(2), 305–313.
Ng, K.K.H., Lee, C.K.M., Zhang, S.Z., Wu, K., & Ho, W. (2017). A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Computers & Industrial Engineering, 109, 151–168.
Kaligari, E., & Guerrero, W. (2015). Métodos de optimización para el problema de ruteo de vehículos con inventarios y ventanas de tiempo duras. Revista Ingeniería Industrial, 14(3), 31–49.
Li, J.-Q., Borenstein, D., & Mirchandani, P. B. (2007). A decision support system for the single-depot vehicle rescheduling problem. Computers & Operations Research, 34(4), 1008–1032.
Mohammadi, M., Tavakkoli-Moghaddam, R., Siadat, A., & Dantan, J.-Y. (2016). Design of a reliable logistics network with hub disruption under uncertainty. Applied Mathematical Modelling, 40(9–10), 5621–5642.
Mu, Q., Fu, Z., Lysgaard, J., & Eglese, R. (2011). Disruption management of the vehicle routing problem with vehicle breakdown. Journal of the Operational Research Society, 62(62), 742–749.
Psaraftis, H. (1988). Vehicle Routing: Methods and Studies. In Dynamic Vehicle Routing Problems. B.V: North Holland.: Elsevier Science Publishers.
Rahimi, Y., Tavakkoli-Moghaddam, R., Mohammadi, M., & Sadeghi, M. (2016). Multi-objective hub network design under uncertainty considering congestion: An M/M/c/K queue system. Applied Mathematical Modelling, 40(5–6), 4179–4198.
Rayat, F., Musavi, M., & Bozorgi-Amiri, A. (2017). Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: A modified AMOSA approach. Applied Soft Computing, 59, 622–643.
Sever, D., Dellaert, N., Van Woensel, T., & De Kok, T. (2013). Dynamic shortest path problems: Hybrid routing policies considering network disruptions. Computers and Operations Research, 40(12), 2852–2863.
Teodorovic, D., & Guberinic, S. (1984). Optimal dispatching strategy on an airline network after a schedule perturbation. European Journal of Operational Research, 15(2), 178–182.
Wang, X., Ruan, J., Shang, H., & Ma, C. (2011). A Combinational Disruption Recovery Model for Vehicle Routing Problem with Time Windows. In Intelligent Decision Technologies (Vol. 10, pp. 3–12).
Xiangpei, H., & Lijun, S. (2012). Knowledge-based modeling for disruption management in urban distribution. Expert Systems with Applications, 39, 906–916.
Zhang, Y., Qi, M.-Y., Lin, W.-H., & Miao, L.-X. (2015). A metaheuristic approach to the reliable location routing problem under disruptions. Transportation Research Part E, 83, 90–110.
Yu, G., & Qi, X. (2004). Disruption Management. World Scientific. https://doi.org/10.1142/5632
Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., & Mohammadi, M. (2016). Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty. Transportation Research Part E: Logistics and Transportation Review, 89, 182–214.

  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2018 | Volume: 9 | Issue: 4 | Views: 2422 | Reviews: 0

Related Articles:
  • A stochastic time-dependent green capacitated vehicle routing and schedulin ...
  • A sustainable transportation-location-routing problem with soft time window ...
  • Variable neighborhood search algorithm for the green vehicle routing proble ...
  • A heuristic algorithm based on tabu search for vehicle routing problems wit ...
  • A multi-objective location routing problem using imperialist competitive al ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com