Comparing MILP, CP, and A* for Multiple Stacker Crane Scheduling
Paper i proceeding, 2016
This paper describes an optimisation model for the scheduling of a system consisting of three stacker cranes that are restricted to the same track. To improve the efficiency of the solution methods, a novel simplification of the model is presented, which has a low impact on the quality of the solution but greatly decreases its complexity. This model is then used to benchmark several popular solution methods, including both optimal and approximate methods. Some are based on monolithic models, whereas others solve the problem in phases by using sub-problem formulations. The result presented in this paper shows that evaluated solution methods have complementary strengths and weaknesses. Constraint Programming (CP) is very efficient on small scale problems, while Mixed Integer Linear Programming (MILP) scales much better when the number of movement orders increases. However, none of these methods are able to solve large instances of the problem to optimality. To handle the complexity of the problem, approximate solution methods are the only viable option. In this paper we show that promising results can be obtained even with simple methods using well known search algorithms such as A* and Tabu-search. However, preliminary results on more advanced search algorithms show that further improvements may be achieved, allowing the solution of very large problem instances.