Greedy algorithms for the freight consolidation problem

DOI10.4230/OASICS.ATMOS.2022.4MaRDI QIDQ6570891zbMATH OpenFDO

Authors Zuguang Gao, John R. Birge, Richard Li-Yang Chen, Maurice Cheung

Publication date 10 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2022.4

zbMATH Keywords

freight consolidationgreedy algorithmheuristics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving a Freight Transport Problem Using Facility Location Techniques
• A new simulated annealing algorithm for the Freight Consolidation Problem
• Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
• A MIP model for freight consolidation in road transportation considering outsourced fleet

This page was built for publication: Greedy algorithms for the freight consolidation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570891)