Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands

被引:25
|
作者
Latorre-Biel, Juan I. [1 ]
Ferone, Daniele [2 ]
Juan, Angel A. [3 ]
Faulin, Javier [1 ]
机构
[1] Univ Publ Navarra, Inst Smart Cities, Pamplona, Spain
[2] Univ Calabria, Dept Mech Energet & Management Engn, Calabria, Italy
[3] Univ Oberta Catalunya, Comp Sci Dept, IN3, Barcelona, Spain
关键词
Simheuristics; Vehicle Routing Problem; Petri Nets; Correlated Demands; WASTE COLLECTION; ALGORITHM; SIMULATION; UNCERTAINTY; LOGISTICS; DEPOT;
D O I
10.1016/j.eswa.2020.114240
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper analyzes a stochastic version of the vehicle routing problem in which customers' demands are not only stochastic but also correlated. In order to solve this stochastic and correlated optimization problem, a simheuristic approach is combined with an adaptive demand predictor. This predictor is based on the use of machine learning methods and Petri nets. The information on real demands, provided by the vehicles as they visit the nodes of the logistic network, allows for a real-time forecast of the demand, as well as for an updated estimate of the correlation between them. A constrained prediction is provided by our hybrid algorithm, which is able to forecast an increase of 50% in the mean value of the demands of all nodes. With a very limited amount of information and reduced computational requirements, our algorithm provides a forecast with a high degree of reliability and a balanced capacity to reject false positives as well as false negatives. To illustrate its effectiveness, the methodology is applied to a wide range of benchmarks. The results show the benefits of applying this methodology in a context of correlated variation of the demands.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
    Panadero, Javier
    Juan, Angel A.
    Ghorbani, Elnaz
    Faulin, Javier
    Pages-Bernaus, Adela
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 3036 - 3060
  • [42] Reliable vehicle routing problem in stochastic networks with correlated travel times
    Mojtaba Rajabi-Bahaabadi
    Afshin Shariat-Mohaymany
    Mohsen Babaei
    Daniele Vigo
    Operational Research, 2021, 21 : 299 - 330
  • [43] Reliable vehicle routing problem in stochastic networks with correlated travel times
    Rajabi-Bahaabadi, Mojtaba
    Shariat-Mohaymany, Afshin
    Babaei, Mohsen
    Vigo, Daniele
    OPERATIONAL RESEARCH, 2021, 21 (01) : 299 - 330
  • [44] Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
    Florio, Alexandre M.
    Hartl, Richard F.
    Minner, Stefan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (01) : 172 - 182
  • [45] On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
    Zhang, Junlong
    Lam, William H. K.
    Chen, Bi Yu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (01) : 144 - 154
  • [46] A novel location-routing problem in electric vehicle transportation with stochastic demands
    Zhang, Shuai
    Chen, Mingzhou
    Zhang, Wenyu
    JOURNAL OF CLEANER PRODUCTION, 2019, 221 : 567 - 581
  • [47] A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
    Christiansen, Christian H.
    Lysgaard, Jens
    OPERATIONS RESEARCH LETTERS, 2007, 35 (06) : 773 - 781
  • [48] A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
    Gauvin, Charles
    Desaulniers, Guy
    Gendreau, Michel
    COMPUTERS & OPERATIONS RESEARCH, 2014, 50 : 141 - 153
  • [49] A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
    Jorge E. Mendoza
    Juan G. Villegas
    Optimization Letters, 2013, 7 : 1503 - 1516
  • [50] Solving a Vehicle Routing Problem with Ant Colony Optimisation and Stochastic Ranking
    Haemmerle, Alexander
    Ankerl, Martin
    COMPUTER AIDED SYSTEMS THEORY, PT 1, 2013, 8111 : 259 - 266