### Skapa referens, olika format (klipp och klistra)

**Harvard**

Hagebring, F., Wigström, O., Lennartson, B., Ware, S. och Su, R. (2016) *Comparing MILP, CP, and A* for Multiple Stacker Crane Scheduling*. New York : IEEE

** BibTeX **

@conference{

Hagebring2016,

author={Hagebring, Fredrik and Wigström, Oskar and Lennartson, Bengt and Ware, S. I. and Su, R.},

title={Comparing MILP, CP, and A* for Multiple Stacker Crane Scheduling},

booktitle={Proc. 13th International Workshop on Discrete Event Systems (WODES’16), Xi’an, China, May},

isbn={978-1-5090-4190-9},

pages={63-70},

abstract={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.},

publisher={IEEE},

place={New York},

year={2016},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 243392

A1 Hagebring, Fredrik

A1 Wigström, Oskar

A1 Lennartson, Bengt

A1 Ware, S. I.

A1 Su, R.

T1 Comparing MILP, CP, and A* for Multiple Stacker Crane Scheduling

YR 2016

T2 Proc. 13th International Workshop on Discrete Event Systems (WODES’16), Xi’an, China, May

SN 978-1-5090-4190-9

SP 63

OP 70

AB 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.

PB IEEE

LA eng

DO 10.1109/WODES.2016.7497827

LK http://dx.doi.org/10.1109/WODES.2016.7497827

OL 30