科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper studies a real case of bin packing problems. The problem is inspired from a car manufacturer that aims at improving logistic activities of its engine assembly line. It is to plan transportations of parts from a warehouse to workstations. The first objective is to find the minimum possible motorized vehicles to conduct all the transportations. The second objective is to smooth the workload of vehickles to the maximum extent possible. To tackle the problem, it is first formulated in form of a mixed integer linear programming model. Then, a local-based greedy heuristic is proposed to solve the problem in large-sized cases.
- 出版日期2014-6
