Sharing loading costs for multi compartment vehicles
Summary: Supply chains for goods that must be kept cool -- cold chains -- are of increasing importance in world trade. The goods must be kept within well-defined temperature limits to preserve their quality. One technique for reducing logistics costs is to load cold items into multiple compartment vehicles (MCVs), which have several spaces within that can be set for different temperature ranges. These vehicles allow better consolidation of loads. However, constructing the optimal load is a difficult problem, requiring heuristics for solution. In addition, the cost determined must be allocated to the different items being shipped, most often with different owners who need to pay, and this should be done in a stable manner so that firms will continue to combine loads. We outline the basic structure of the MCV loading problem, and offer the view that the optimization and cost allocation problems must be solved together. Doing so presents the opportunity to solve the problem inductively, reducing the size of the feasible set using constraints generated inductively from the inductive construction of minimal balanced collections of subsets. These limits may help the heuristics find a good result faster than optimizing first and allocating later.
- Vehicle selection for a multi-compartment vehicle routing problem
- A multi-product loading problem: A model and solution method
- A multi-compartment vehicle routing problem in cold-chain distribution
- Classification, models and exact algorithms for multi-compartment delivery problems
- Optimizing routing and delivery patterns with multi-compartment vehicles
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A review on cost allocation methods in collaborative transportation
- An inductive method for constructing mimmal balanced collections of finite sets
- Analytic solution for the nucleolus of a three-player cooperative game
- Characterization sets for the nucleolus in balanced games
- Cost allocation in continuous-review inventory models
- Finding the nucleolus of any n-person cooperative game by a single linear program
- scientific article; zbMATH DE number 3197630 (Why is no real title available?)
- Introduction to the Theory of Cooperative Games
- Shipment consolidation: who pays for it and how much?
- Stability and Endogenous Formation of Inventory Transshipment Networks
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The freight consolidation and containerization problem
- The Nucleolus of a Characteristic Function Game
- The Price of Stability for Network Design with Fair Cost Allocation
- Three-dimensional container loading models with cargo stability and load bearing constraints
This page was built for publication: Sharing loading costs for multi compartment vehicles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1651904)
