earticle

논문검색

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

초록

영어

The main problem of empty containers repositioning (ECR) is to dispatch the empty containers among the ports meanwhile cut the costs as possible as. According to the actual operations, the stock policy and various constrains are considered together in this paper firstly. Then we build a multiple periods minimal cost programming optimization model with stock to solve this problem. Furthermore, we adopt the heuristic rule to effectively operate the empty containers since there is a large amount of calculation. Finally, some simulate data are given to assess the model. The results show that our proposed model is feasible and efficient to minimize the operation cost as well as satisfy the demand of customers. Moreover by analyzing the data it can guide us to set the inventory of empty containers of ports in different supply and demand scenarios.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Problem Description
  2.2. Model Assumptions
  2.3. Model variables
 3. ECR Model
  3.1. f1: MP-MCMS
  3.2. Decision Variables
  3.3. Objective Function
  3.4. The Constraints Conditions
 4. Simulations and Analysis
  4.1. Dataset
  4.2. Strategies for Comparison
  4.3. Experimental Results and Analysis
 5. Conclusion
 Acknowledgment
 References

저자정보

  • Lihua Lu School of Electronic Information Engineering, Shanghai Dianji University, Shanghai, China
  • Hengzhen Zhang College of Information Engineering, Shanghai Maritime University, Shanghai China
  • Xiaofeng Wang Department of Electrical Engineering and Automation, Aalto University School of Electrical Engineering, 00076 Finland
  • Xiao-Zhi Gao Department of Electrical Engineering and Automation, Aalto University School of Electrical Engineering, 00076 Finland

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.