A branch-cut-and-price algorithm for the piecewise linear transportation problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2015

A branch-cut-and-price algorithm for the piecewise linear transportation problem

Résumé

In this paper we present an exact solution method for the transportation problem with piecewise linear costs. This problem is fundamental within supply chain management and is a straightforward extension of the fixed-charge transportation problem. We consider two Dantzig–Wolfe reformulations and investigate their relative strength with respect to the linear programming (LP) relaxation, both theoretical and practical, through tests on a number of instances. Based on one of the proposed formulations we derive an exact method by branching and adding generalized upper bound constraints from violated cover inequalities. The proposed solution method is tested on a set of randomly generated instances and compares favorably to solving the model using a standard formulation solved by a state-of-the-art commercial solver.
Fichier non déposé

Dates et versions

hal-01255518 , version 1 (13-01-2016)

Identifiants

Citer

Tue R.L. Christensen, Martine Labbé. A branch-cut-and-price algorithm for the piecewise linear transportation problem. European Journal of Operational Research, 2015, 245 (3), pp.645-655. ⟨10.1016/j.ejor.2015.03.039⟩. ⟨hal-01255518⟩
110 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More