Simulating Dynamic Vehicle Routing Problems with Athos

被引:0
|
作者
Hoffmann, Benjamin [1 ]
Guckert, Michael [1 ]
Chalmers, Kevin [2 ]
Urquhart, Neil [2 ]
机构
[1] Tech Hsch Mittelhessen, KITE Kompetenzzentrum Informat Technol, Giessen, Germany
[2] Edinburgh Napier Univ, Sch Comp, Edinburgh, Midlothian, Scotland
来源
PROCEEDINGS OF THE 33RD INTERNATIONAL ECMS CONFERENCE ON MODELLING AND SIMULATION (ECMS 2019) | 2019年 / 33卷 / 01期
关键词
Domain-specific language; Agent-based modelling; Evolutionary Algorithms; Vehicle Routing With Time Windows;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Complex routing problems, such as vehicle routing problems with additional constraints, are both hard to solve and hard to express in a form that is accessible to the human expert and at the same time processible by a computer system that is supposed to produce a solution of sufficient quality. The formulation must be formal enough to avoid ambiguities and also comprehensible enough to be created, discussed and shared by domain experts. In this paper, we present the domain specific language Athos in which complex routing problems can be expressed in a computationally independent, human-readable form. Athos is then transformed into code that can be run in an adequate target platform. Suitable methods for solving problems are available and applied to the given problem. We present a case study in which we use a genetic algorithm to solve instances of a vehicle routing problem with time windows and demonstrate the end to end process to produce a solution in the Athos environment. Moreover, we show how the Athos system goes beyond optimisation of static routes and can be used as a tool to simulate the impact of traffic and congestion on the tours. We call this extended problem a dynamic vehicle routing problem with time windows.
引用
收藏
页码:296 / 302
页数:7
相关论文
共 50 条
  • [21] Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization
    Xu, Haitao
    Pu, Pan
    Duan, Feng
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2018, 2018
  • [22] An MILP framework for dynamic vehicle routing problems with time windows
    Dondo, R.
    Cerda, J.
    LATIN AMERICAN APPLIED RESEARCH, 2006, 36 (04) : 255 - 261
  • [23] A hybrid genetic algorithm for vehicle routing problems with dynamic requests
    Yi, Ruikang
    Luo, Wenjian
    Bu, Chenyang
    Lin, Xin
    2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings, 2017, 2018-January : 1 - 8
  • [24] Simulating Dynamic Vehicle Routing Problem Using Agent-Based Modeling and Simulation
    Sopha, Bertha Maya
    Siagian, Afriana
    Asih, Anna Maria Sri
    2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 1335 - 1339
  • [25] Memetic algorithms and dynamic programming on vehicle routing problems in crisis situations
    Vasalakis, Stamatios
    Spyridakos, Athanasios
    OPERATIONAL RESEARCH, 2025, 25 (01)
  • [26] On solving periodic re-optimization dynamic vehicle routing problems
    AbdAllah, Abdel Monaem F. M.
    Essam, Daryl L.
    Sarker, Ruhul A.
    APPLIED SOFT COMPUTING, 2017, 55 : 1 - 12
  • [27] A hybrid Multi-objective algorithm for Dynamic Vehicle Routing Problems
    Jun, Qin
    Wang, Jiangqing
    Zheng, Bo-jin
    COMPUTATIONAL SCIENCE - ICCS 2008, PT 3, 2008, 5103 : 674 - 681
  • [28] Selecting a dynamic and stochastic path method for vehicle routing and scheduling problems
    Nakamura, Yuki
    Taniguchi, Eiichi
    Yamada, Tadashi
    Ando, Naoki
    6TH INTERNATIONAL CONFERENCE ON CITY LOGISTICS, 2010, 2 (03): : 6042 - 6052
  • [29] An adaptive large neighborhood search heuristic for dynamic vehicle routing problems
    Chen, Shifeng
    Chen, Rong
    Wang, Gai-Ge
    Gao, Jian
    Sangaiah, Arun Kumar
    COMPUTERS & ELECTRICAL ENGINEERING, 2018, 67 : 596 - 607
  • [30] A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems
    Hvatturn, Lars Magnus
    Lokketangen, Arne
    Laporte, Gilbert
    NETWORKS, 2007, 49 (04) : 330 - 340