title   
  

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.

[thumbnail of This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing)] PDF (This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing))
Shortnote_R3.pdf
Download (109kB)

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
Divisions: Faculty of Engineering and Natural Sciences
Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Depositing User: Kerem Bülbül
Date Deposited: 04 Jul 2012 15:39
Last Modified: 26 Apr 2022 08:56
URI: https://research.sabanciuniv.edu/id/eprint/19146

Available Versions of this Item

Actions (login required)

View Item
View Item