A note on “A LP-based heuristic for a time-constrained routing problem” |
| |
Authors: | İbrahim Muter,Ş. İlker BirbilKerem Bü lbü l,Gü venç Şahin |
| |
Affiliation: | Sabanc? University, Manufacturing Systems and Industrial Engineering, Orhanl?-Tuzla, 34956 Istanbul, Turkey |
| |
Abstract: | 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. |
| |
Keywords: | Large-scale optimization Column generation Column-and-row generation Time-constrained routing |
本文献已被 ScienceDirect 等数据库收录! |
|