• Graduate Program
    • Why study Business Data Science?
    • Program outline
    • Courses
    • Course registration
    • Admissions
    • Facilities
  • Research
  • News
  • Events
    • Summer School
      • Summer school
      • Deep Learning
      • Econometrics and Data Science Methods for Business, Economics and Finance
      • Foundations of Machine Learning with Applications in Python
      • Networks in Micro- and Macroeconomics
      • Tinbergen Institute Summer School Program
    • Events Calendar
    • Events archive
    • Conference: Consumer Search and Markets
    • Tinbergen Institute Lectures
  • Summer School
  • Alumni

Buson, E., Roberti, R. and Toth, P. (2014). A reduced-cost iterated local search heuristic for the fixed-charge transportation problem Operations Research, 62(5):1095--1106.

  • Journal
    Operations Research

The fixed-charge transportation problem (FCTP) is a generalization of the transportation problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an iterated local search heuristic based on the utilization of reduced costs for guiding the restart phase. The reduced costs are obtained by applying a lower bounding procedure that computes a sequence of nondecreasing lower bounds by solving a three-index mathematical formulation of the problem strengthened with valid inequalities. The proposed method was tested on two sets of benchmark instances from the literature. The first set was used to evaluate the state-of-the-art heuristics for the problem; the proposed heuristic was able to provide new best-knownupper bounds on all 124 open instances. On the second set of instances, which was recently introduced for testing the currently best exact method for the problem, the new heuristic was able to provide provably good upper bounds within short computing times.