Refinements of the column generation process for the Vehicle Routing Problem with Time Windows

被引:6
|
作者
Jesper Larsen
机构
[1] Technical University of Denmark,Informatics and Mathematical Modelling
关键词
Vehicle routing; time windows; column generation; shortest path; branch-and-bound;
D O I
10.1007/s11518-006-0168-9
中图分类号
学科分类号
摘要
The Vehicle Routing Problem with Time Windows is a generalization of the well known capacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of customers. The service of the customers can only start within a well-defined time interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance). Currently the best approaches for determining optimal solutions are based on column generation and Branch-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for run-time refinements when speeding up an exact approach without compromising optimality.
引用
收藏
页码:326 / 341
页数:15
相关论文
共 50 条
  • [31] A Vehicle Routing Problem with Flexible Time Windows
    Tas, Duygu
    Jabali, Ola
    Van Woensel, Tom
    COMPUTERS & OPERATIONS RESEARCH, 2014, 52 : 39 - 54
  • [32] The Vehicle Routing Problem with Time Windows and Time Costs
    Wang, Zhao
    Nakano, Yuusuke
    Nishimatsu, Ken
    21ST IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS ICDMW 2021, 2021, : 278 - 287
  • [33] A hybrid column generation and clustering approach to the school bus routing problem with time windows
    Lopez Santana, Eduyn Ramiro
    Romero Carvajal, Jose de Jesus
    INGENIERIA, 2015, 20 (01): : 111 - 127
  • [34] A Column Generation Heuristic for the General Vehicle Routing Problem
    Goel, Asvin
    LEARNING AND INTELLIGENT OPTIMIZATION, 2010, 6073 : 1 - 9
  • [35] Cumulative Vehicle Routing Problem: A Column Generation Approach
    Gaur, Daya Ram
    Singh, Rishi Ranjan
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS (CALDAM 2015), 2015, 8959 : 262 - 274
  • [36] The cumulative vehicle routing problem with arc time windows
    Kritikos, Manolis N.
    Metzidakis, Theocharis
    Ioannou, George
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 240
  • [37] A hybrid algorithm for the Vehicle Routing Problem with Time Windows
    Ribas, Sabir
    Subramanian, Anand
    Coelho, Igor Machado
    Ochi, Luiz Satoru
    Freitas Souza, Marcone Jamilson
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1243 - 1252
  • [38] Lagrangian Relaxation for the Vehicle Routing Problem with time windows
    Aggarwal, Divya
    Kumar, Vijay
    Girdhar, Ashish
    2017 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING, INSTRUMENTATION AND CONTROL TECHNOLOGIES (ICICICT), 2017, : 1601 - 1606
  • [39] A Hybrid Metaheuristic for the Vehicle Routing Problem with Time Windows
    Hifi, Mhand
    Wu, Lei
    2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2014, : 188 - 194
  • [40] Heuristic methods for vehicle routing problem with time windows
    Tan, KC
    Lee, LH
    Zhu, QL
    Ou, K
    ARTIFICIAL INTELLIGENCE IN ENGINEERING, 2001, 15 (03): : 281 - 295