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
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2016年 / 86卷
关键词：
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 条
  • [21] A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
    Wang, Mengtong
    Zhang, Canrong
    Bell, Michael G. H.
    Miao, Lixin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303 (03) : 1258 - 1276
  • [22] Capacitated location-routing problem with time windows under uncertainty
    Zarandi, Mohammad Hossein Fazel
    Hemmati, Ahmad
    Davari, Soheil
    Turksen, I. Burhan
    KNOWLEDGE-BASED SYSTEMS, 2013, 37 : 480 - 489
  • [23] A column generation approach for the location-routing problem with time windows
    Farham, Mohammad Saleh
    Sural, Haldun
    Iyigun, Cem
    COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 249 - 263
  • [24] The Single-Stage Location-Routing Problem with Time Windows
    Guenduez, Halil Ibrahim
    COMPUTATIONAL LOGISTICS, 2011, 6971 : 44 - 58
  • [25] The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm
    Koc, Cagri
    Bektas, Tolga
    Jabali, Ola
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 248 (01) : 33 - 51
  • [26] A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
    Touati-Moungla, Nora
    Belotti, Pietro
    Jost, Vincent
    Liberti, Leo
    NETWORK OPTIMIZATION, 2011, 6701 : 439 - 449
  • [27] A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes
    Muter, Ibrahim
    Cordeau, Jean-Francois
    Laporte, Gilbert
    TRANSPORTATION SCIENCE, 2014, 48 (03) : 425 - 441
  • [28] A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows
    Liu, Shixin
    Qin, Shujin
    Zhang, Ruiyou
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 116 : 25 - 41
  • [29] A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
    Ozbaygin, Gizem
    Karasan, Oya Ekin
    Savelsbergh, Martin
    Yaman, Hande
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 100 : 115 - 137
  • [30] Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
    Ghilas, Veaceslav
    Cordeau, Jean-Francois
    Demir, Emrah
    Van Woensel, Tom
    TRANSPORTATION SCIENCE, 2018, 52 (05) : 1191 - 1210
12345