Minimum-cost maximum-satisfaction bi-objective integer programming optimization for empty containers repositioning

This paper first analyzes the flow of the empty containers repositioning (ECR). A total of three key issues of the ECR: where, how many, and when the empty containers should be transported, are next discussed, which are the most important factors directly influencing the dispatching strategy. A minimum-cost maximum-satisfaction bi-objective integer programming optimization model for the ECR: MCMSM, is further proposed. Two performance indicators: total operational cost of ECR and customers’ satisfaction, are introduced to verify its effectiveness. Simulation results show that it can successfully satisfy the practical empty containers demands of customers while minimizing the total operational cost of the ECR.