The freight consolidation and containerization problem
From MaRDI portal
Publication:2256168
Recommendations
- scientific article; zbMATH DE number 3873082
- The multiple container loading cost minimization problem
- A new approach to freight consolidation for a real-world pickup-and-delivery problem
- An integrated approach to the vehicle routing and container loading problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- The airline container loading problem with pickup and delivery
- A truck scheduling problem arising in intermodal container transportation
Cites work
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A memetic algorithm for graph coloring
- Accelerating column generation for variable sized bin-packing problems
- Algorithms for the variable sized bin packing problem
- An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Approximation algorithms for NP-hard problems.
- Distribution Coordination Between Suppliers and Customers with a Consolidation Center
- Heuristics for the variable sized bin-packing problem
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Introduction to Genetic Algorithms
- Local search algorithms for the bin packing problem and their relationships to various construction heuristics
- Network flows. Theory, algorithms, and applications.
- Relaxations and exact solution of the variable sized bin packing problem
- Shipment consolidation: who pays for it and how much?
- Solving a Freight Transport Problem Using Facility Location Techniques
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Solving the variable size bin packing problem with discretized formulations
- The latest arrival hub location problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Variable Sized Bin Packing
Cited in
(10)- Sharing loading costs for multi compartment vehicles
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- A MIP model for freight consolidation in road transportation considering outsourced fleet
- Determining the best shipper sizes for sending products to customers
- A dual-response strategy for global logistics under uncertainty: a case study of a third-party logistics company
- Airfreight forwarder's shipment planning: shipment consolidation and containerization
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- International multimodal transportation optimization considering bulk cargo containerization
- The first mile is the hardest: a deep learning-assisted matheuristic for container assignment in first-mile logistics
This page was built for publication: The freight consolidation and containerization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256168)
