An LP-based heuristic for the fixed charge transportation problem

    Research output: Contribution to book/anthology/report/proceedingConference abstract in proceedingsResearch

    Abstract

    The fixed charge transportation problem consists in finding a minimum cost network flow from a set of suppliers
    to a set of customers. Beside costs proportional to quantities transported, transportation costs also include a
    fixed charge. The paper describes a linear programming based heuristic approach for computing lower and
    upper bounds on the minimal cost. To this end, the LP relaxation is iteratively strengthened by means of adding
    cuts; in each iteration the current LP solution is then used to guide a local search heuristic. In addition to
    standard polyhedral cuts as lifted cover inequalities and flow cover inequalities, the approach also employs
    Fenchel cuts that are based on embedded 0-1 single node flow sets. Computational results obtained for a
    set of standard test problem instances are reported.
    Original languageEnglish
    Title of host publicationOperations Research in the Service Industry : International Annual Conference of the German Operations Research Society
    Number of pages1
    PublisherUniversitaet des Saarlandes
    Publication date2007
    Pages103
    Publication statusPublished - 2007
    EventInternational Annual Scientific Conference of the German Operations Research Society - Saarbruecken, Germany
    Duration: 5 Sept 20077 Sept 2007

    Conference

    ConferenceInternational Annual Scientific Conference of the German Operations Research Society
    Country/TerritoryGermany
    CitySaarbruecken
    Period05/09/200707/09/2007

    Fingerprint

    Dive into the research topics of 'An LP-based heuristic for the fixed charge transportation problem'. Together they form a unique fingerprint.

    Cite this