Reloading problem

from Wikipedia, the free encyclopedia

The transshipment problem ( English transshipment problem ) is a logistical optimization problem with the goal of transport costs to be minimized by transhipment of goods between vehicles of transfer points. Goods are produced at different locations and should be transported to different customers, whereby one or more locations can be used as reloading points.

Depending on the complexity of the problem, transfer points are specified, or the determination of the transfer points is part of the task. A special case is the transport problem that manages without a reloading point.

A flow formulation (e.g. in linear programming or as a graph-theoretical problem) or a pickup-and-delivery formulation with refinement of the transshipment (local search heuristics) offers possible solutions for the transshipment problem .

Special reloading problems

  • Transport problem: there are no reloading nodes
  • Assignment problem : all supply and demand quantities are exactly 1
  • St-flow problem: there is exactly one supplier and one demand node
    • Notes: Any transshipment problem can be converted into an st flow problem.