Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

Hyak Jin Kim, John N. Hooker

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0-1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak.

Original languageEnglish
Pages (from-to)95-124
Number of pages30
JournalAnnals of Operations Research
Volume115
Issue number1-4
DOIs
Publication statusPublished - 2002 Dec 1

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach'. Together they form a unique fingerprint.

  • Cite this