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.

Preview

PDF (This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
106Kb

Official URL: http://dx.doi.org/10.1016/j.ejor.2012.03.048

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.

Item Type:	Article
Uncontrolled Keywords:	Large-scale optimization; Column generation; Column-and-row generation; Time-constrained routing
Subjects:	T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:	19146
Deposited By:	Kerem Bülbül
Deposited On:	04 Jul 2012 15:39
Last Modified:	31 Jul 2019 11:08

Available Versions of this Item

A note on “A LP-based heuristic for a time-constrained routing problem”. (deposited 23 Nov 2010 12:45)
- A note on "A LP-based heuristic for a time-constrained routing problem". (deposited 04 Jul 2012 15:39) [Currently Displayed]

Repository Staff Only: item control page