Next Article in Journal
Incentive Systems for Risky Investment Decisions Under Unknown Preferences: Ortner et al. Revisited
Previous Article in Journal
Personal-Data Disclosure in a Field Experiment: Evidence on Explicit Prices, Political Attitudes, and Privacy Preferences
Previous Article in Special Issue
Dynamic Pricing Decisions and Seller-Buyer Interactions under Capacity Constraints
Article Menu

Export Article

Open AccessArticle
Games 2018, 9(2), 25; https://doi.org/10.3390/g9020025

Sharing Loading Costs for Multi Compartment Vehicles

International Business and Logistics Department, California State University Maritime, Vallejo, CA 94590, USA
Received: 13 February 2018 / Revised: 3 April 2018 / Accepted: 7 May 2018 / Published: 14 May 2018
(This article belongs to the Special Issue Logistic Games)
View Full-Text   |   Download PDF [685 KB, uploaded 14 May 2018]   |  

Abstract

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. View Full-Text
Keywords: cooperative games; multi compartment vehicles; loading problems; logistics cooperative games; multi compartment vehicles; loading problems; logistics
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Hartman, B.C. Sharing Loading Costs for Multi Compartment Vehicles. Games 2018, 9, 25.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top