Rolling-Horizon Approach for Kerosene Routing Problem

被引:0
作者
Ooe, Hirotaka [1 ]
Yokoyama, Soichiro [2 ]
Yamashita, Tomohisa [2 ]
Kawamura, Hidenori [2 ]
Tada, Mitsuo [3 ]
机构
[1] Hokkaido Univ, Grad Sch Informat Sci & Technol, Sapporo, Hokkaido, Japan
[2] Hokkaido Univ, Fac Informat Sci & Technol, Sapporo, Hokkaido, Japan
[3] ZeroSpec Inc, Sapporo, Hokkaido, Japan
来源
2024 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE, ISMSI 2024 | 2024年
关键词
Inventory Routing Problem; Rolling-Horizon; Kerosene Delivery; ALGORITHM;
D O I
10.1145/3665065.3665077
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Kerosene delivery is a service that regularly supplies kerosene to household tanks to prevent them from running dry. Delivery companies create kerosene delivery plans to maintain tank levels and implement deliveries based on these plans. This paper focuses on a heuristic using the Rolling-Horizon (RH) Approach, which is considered for daily kerosene delivery planning, due to the difficulty in solving existing heuristics within a reasonable time frame. The proposed method aims to shorten execution time while maintaining the accuracy of solutions. Experiments were conducted using two types of instances: benchmark instances and kerosene delivery instances based on real data, to examine whether the application of the RH Approach is effective in both problems and to clarify the conditions under which the method is effective. The results indicate the possibility of a trade-off relationship between solution accuracy and execution time through the application of the RH Approach only in the kerosene delivery planning problem. Furthermore, by considering the differences between inventory routing and kerosene delivery problems, it was shown that this trade-off relationship is more likely to occur when the ratio of consumption to inventory upper limit is small.
引用
收藏
页码:68 / 77
页数:10
相关论文
共 9 条
  • [1] Iterated local search and simulated annealing algorithms for the inventory routing problem
    Alvarez, Aldair
    Munari, Pedro
    Morabito, Reinaldo
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (06) : 1785 - 1809
  • [2] 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
  • [3] A Hybrid Heuristic for an Inventory Routing Problem
    Archetti, Claudia
    Bertazzi, Luca
    Hertz, Alain
    Speranza, M. Grazia
    [J]. INFORMS JOURNAL ON COMPUTING, 2012, 24 (01) : 101 - 116
  • [4] Thirty Years of Inventory Routing
    Coelho, Leandro C.
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. TRANSPORTATION SCIENCE, 2014, 48 (01) : 1 - 19
  • [5] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
    LIN, S
    KERNIGHAN, BW
    [J]. OPERATIONS RESEARCH, 1973, 21 (02) : 498 - 516
  • [6] Waste collection inventory routing with non-stationary stochastic demands
    Markov, Iliya
    Bierlaire, Michel
    Cordeau, Jean-Francois
    Maknoon, Yousef
    Varone, Sacha
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 113 (113)
  • [7] Ooe Hirotaka, 2022, INFORM PROCESSING SO
  • [8] Heuristics for an oil delivery vehicle routing problem
    Prescott-Gagnon, Eric
    Desaulniers, Guy
    Rousseau, Louis-Martin
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2014, 26 (04) : 516 - 539
  • [9] Zhaobang Liu, 2023, WORKSH SOC SYST INF