A note on "A LP-based heuristic for a time-constrained routing problem"
Muter, İbrahim and Birbil, Ş. İlker and Bülbül, Kerem and Şahin, Güvenç (2012) A note on "A LP-based heuristic for a time-constrained routing problem". European Journal of Operational Research, 221 (2). pp. 306-307. ISSN 0377-2217
This is the latest version of this item.
Official URL: http://dx.doi.org/10.1016/j.ejor.2012.03.048
In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this linear program optimally, and an optimality condition is presented to terminate the column-and-row generation algorithm. We demonstrate by using Lagrangian duality that this optimality condition is incorrect and may lead to a suboptimal solution at termination.
Available Versions of this Item
Repository Staff Only: item control page