Branch-and-price algorithm for the location-routing problem with time windows

被引:48
|
作者
Ponboon, Sattrawut [1 ]
Qureshi, Ali Gul [1 ]
Taniguchi, Eiichi [1 ]
机构
[1] Kyoto Univ, Dept Urban Management, Nishikyo Ku, Kyoto 6158540, Japan
关键词
Location-routing problem; Time windows; Branch-and-price; Column generation; Labeling algorithm; Exact solution; NEIGHBORHOOD SEARCH; MODELS; DEPOTS;
D O I
10.1016/j.tre.2015.12.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
This study proposes a branch-and-price algorithm to solve the Location-Routing Problem with Time Windows (LRPTW) which has never been attempted with the exact solutions before. The problem is solved by the simplex algorithm in the master problem and elementary shortest path problems with resource constraint corresponding to column generation in the subproblem until only the non-negative reduced cost columns remain. The proposed algorithm can solve many testing instances effectively. The computational results and the effect of time windows are also compared and discussed. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 19
页数:19
相关论文
共 50 条
  • [31] A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
    Christiansen, Christian H.
    Lysgaard, Jens
    Wohlk, Sanne
    OPERATIONS RESEARCH LETTERS, 2009, 37 (06) : 392 - 398
  • [32] 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
  • [33] A branch-and-price algorithm for a targeting problem
    Kwon, Ojeong
    Lee, Kyungsik
    Kang, Donghan
    Park, Sungsoo
    NAVAL RESEARCH LOGISTICS, 2007, 54 (07) : 732 - 741
  • [34] A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem
    Abe, Fabio H. N.
    Hoshino, Edna A.
    Hill, Alessandro
    Baldacci, Roberto
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 3 - 14
  • [35] A branch-and-price algorithm for the single source capacitated plant location problem
    Diaz, JA
    Fernández, E
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (07) : 728 - 740
  • [36] A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
    Karaoglan, Ismail
    Altiparmak, Fulya
    Kara, Imdat
    Dengiz, Berna
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) : 318 - 332
  • [37] A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions
    Akca, Z.
    Berger, R. T.
    Ralphs, T. K.
    OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 309 - +
  • [38] A branch-and-price algorithm for two-echelon electric vehicle routing problem
    Zhiguo Wu
    Juliang Zhang
    Complex & Intelligent Systems, 2023, 9 : 2475 - 2490
  • [39] A branch-and-price algorithm for two-echelon electric vehicle routing problem
    Wu, Zhiguo
    Zhang, Juliang
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (03) : 2475 - 2490
  • [40] A branch-and-price algorithm for the two-echelon inventory-routing problem
    Charaf, Sara
    Tas, Duygu
    Flapper, Simme Douwe P.
    Van Woensel, Tom
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 196