Chebyshev center based column generation

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 374
  • Download : 0
The classical column generation approach often shows a very slow convergence. Many different acceleration techniques have been proposed recently to improve the convergence. Here, we briefly survey these methods and propose a novel algorithm based on the Chebyshev center of the dual polyhedron. The Chebyshev center can be obtained by solving a linear program; consequently, the proposed method can be applied with small modifications on the classical column generation procedure. We also show that the performance of our algorithm can be enhanced by introducing proximity parameters which enable the position of the Chebyshev center lobe adjusted. Numerical experiments are conducted on the binpacking, vehicle routing problem with time windows, and the generalized assignment problem. The computational results of these experiments demonstrate the effectiveness of our proposed method. (C) 2011 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2011-12
Language
English
Article Type
Article
Keywords

CUTTING-PLANE METHOD; BRANCH-AND-PRICE; MULTICOMMODITY FLOW PROBLEMS; VEHICLE-ROUTING PROBLEM; SCHEDULING PROBLEMS; ALGORITHM; OPTIMIZATION; PROGRAMS; STABILIZATION

Citation

DISCRETE APPLIED MATHEMATICS, v.159, no.18, pp.2251 - 2265

ISSN
0166-218X
URI
http://hdl.handle.net/10203/93798
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0