2026-07-23T04:53:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17108 2024-03-06T10:31:51Z ddc:004 open_access

Greedy Algorithms for the Freight Consolidation Problem Gao, Zuguang Birge, John R. Chen, Richard Li-Yang Cheung, Maurice Freight consolidation heuristics greedy algorithm We define and study the (ocean) freight consolidation problem (FCP), which plays a crucial role in solving today’s supply chain crisis. Roughly speaking, every day and every hour, a freight forwarder sees a set of shipments and a set of containers at the origin port. There is a shipment cost associated with assigning each shipment to each container. If a container is assigned any shipment, there is also a procurement cost for that container. The FCP aims to minimize the total cost of fulfilling all the shipments, subject to capacity constraints of the containers. In this paper, we show that no constant factor approximation exists for FCP, and propose a series of greedy based heuristics for solving the problem. We also test our heuristics with simulated data and show that our heuristics achieve small optimality gaps. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Zuguang Gao and John R. Birge and Richard Li-Yang Chen and Maurice Cheung 2022 Is Part Of OASIcs, Volume 106, 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2022.4 urn:nbn:de:0030-drops-171086 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.4 eng https://creativecommons.org/licenses/by/4.0/legalcode