Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling

被引:14
|
作者
Brunner, Jens O. [1 ]
Stolletz, Raik [2 ]
机构
[1] Univ Augsburg, Chair Hlth Care Operat Hlth Informat Management, D-86135 Augsburg, Germany
[2] Univ Mannheim, Sch Business, Chair Prod Management, D-68131 Mannheim, Germany
关键词
Shift scheduling; Integer programming; Branch and price; Stabilized column generation; Check-in counter agents; COLUMN GENERATION;
D O I
10.1016/j.cor.2013.11.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we address the problem of staff scheduling at check-in counters with time varying demand. The main objective is to minimize a cost function based on the assigned shifts for a given workforce subject to flexible labor regulations and flexible assignments of lunch breaks. To solve the problem we developed a branch and price algorithm that uses master variable branching. However, since convergence of the column generation subroutine was really slow, we integrated stabilization techniques to speed up the algorithm. We introduced a new dynamic parameter updating procedure for the stabilized column generation. Our computational results show the superior behavior of stabilized column generation compared to the non-stabilized version. Since slow convergence might occur at each node in the search tree and consequently reductions are realized at each node investigated. Furthermore, we perform an in-depth investigation of the updating parameters and give useful insights to choose them. Finally, we tackle realistic problem instances with up to 65 service workers and show the efficiency of the algorithm. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:137 / 145
页数:9
相关论文
共 50 条
  • [1] Branch-and-Price for Personalized Multiactivity Tour Scheduling
    Restrepo, Maria I.
    Gendron, Bernard
    Rousseau, Louis-Martin
    [J]. INFORMS JOURNAL ON COMPUTING, 2016, 28 (02) : 334 - 350
  • [2] Flexible weekly tour scheduling for postal service workers using a branch and price
    Jens O. Brunner
    Jonathan F. Bard
    [J]. Journal of Scheduling, 2013, 16 : 129 - 149
  • [3] Flexible weekly tour scheduling for postal service workers using a branch and price
    Brunner, Jens O.
    Bard, Jonathan F.
    [J]. JOURNAL OF SCHEDULING, 2013, 16 (01) : 129 - 149
  • [4] A branch-and-price approach for large-scale employee tour scheduling problems
    Ni, Hua
    Abeledo, Hernan
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 155 (01) : 167 - 176
  • [5] A branch-and-price approach for large-scale employee tour scheduling problems
    Hua Ni
    Hernán Abeledo
    [J]. Annals of Operations Research, 2007, 155 : 167 - 176
  • [6] Tour scheduling with dynamic service rates
    Goodale, JC
    Tunc, E
    [J]. INTERNATIONAL JOURNAL OF SERVICE INDUSTRY MANAGEMENT, 1998, 9 (03): : 226 - +
  • [7] A sequential integer programming method for discontinuous labor tour scheduling
    Brusco, MJ
    Johns, TR
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (03) : 537 - 548
  • [8] A Branch-and-Price Algorithm for the Multivehicle Covering Tour Problem
    Jozefowiez, Nicolas
    [J]. NETWORKS, 2014, 64 (03) : 160 - 168
  • [9] The profitable arc tour problem: Solution with a branch-and-price algorithm
    Feillet, D
    Dejax, P
    Gendreau, M
    [J]. TRANSPORTATION SCIENCE, 2005, 39 (04) : 539 - 552
  • [10] Constrained shortest path tour problem: Branch-and-Price algorithm
    Martin, Sebastien
    Magnouche, Youcef
    Juvigny, Corentin
    Leguay, Jeremie
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 144