### Abstract

Language | English |
---|---|

Journal | Operations Research |

Volume | 51 |

Issue number | 6 |

Pages | 922-939 |

ISSN | 0030-364X |

DOIs | |

State | Published - 2003 |

Externally published | Yes |

### Keywords

### Cite this

*Operations Research*,

*51*(6), 922-939. DOI: 10.1287/opre.51.6.922.24914

}

*Operations Research*, vol. 51, no. 6, pp. 922-939. DOI: 10.1287/opre.51.6.922.24914

**A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem.** / Freling, Richard; Romeijn, H. Edwin; Morales, Dolores Romero; Wagelmans, Albert P. M.

Research output: Contribution to journal › Journal article › Research › peer-review

TY - JOUR

T1 - A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem

AU - Freling,Richard

AU - Romeijn,H. Edwin

AU - Morales,Dolores Romero

AU - Wagelmans,Albert P. M.

PY - 2003

Y1 - 2003

N2 - In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes both transportation and inventory into consideration, suitable for evaluating the performance of a logistics distribution network in a dynamic environment. We reformulate the MPSSP as a Generalized Assignment Problem (GAP) with a convex objective function. We then extend a branch-and-price algorithm that was developed for the GAP to this problem. The pricing problem is a so-called Penalized Knapsack Problem (PKP), which is a knapsack problem where the objective function includes an additional convex term penalizing the total use of capacity of the knapsack. The optimal solution of the relaxation of the integrality constraints in the PKP shows a similar structure to the optimal solution of the knapsack problem, that allows for an efficient solution procedure for the pricing problem. We perform an extensive numerical study of the branch-and-price algorithm.

AB - In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes both transportation and inventory into consideration, suitable for evaluating the performance of a logistics distribution network in a dynamic environment. We reformulate the MPSSP as a Generalized Assignment Problem (GAP) with a convex objective function. We then extend a branch-and-price algorithm that was developed for the GAP to this problem. The pricing problem is a so-called Penalized Knapsack Problem (PKP), which is a knapsack problem where the objective function includes an additional convex term penalizing the total use of capacity of the knapsack. The optimal solution of the relaxation of the integrality constraints in the PKP shows a similar structure to the optimal solution of the knapsack problem, that allows for an efficient solution procedure for the pricing problem. We perform an extensive numerical study of the branch-and-price algorithm.

KW - Production/distribution: integrating production distribution and inventory

KW - Integer programming: Branch-and-price algorithm and penalized knapsack problem

U2 - 10.1287/opre.51.6.922.24914

DO - 10.1287/opre.51.6.922.24914

M3 - Journal article

VL - 51

SP - 922

EP - 939

JO - Operations Research

T2 - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 6

ER -