This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
en:dydaktyka:csp:lab3 [2018/03/17 18:22] msl [Constraint Programming: Practical Use Case] |
en:dydaktyka:csp:lab3 [2018/03/17 18:23] msl |
||
|---|---|---|---|
| Line 33: | Line 33: | ||
| - Compare solving time of the problem using different stragies. | - Compare solving time of the problem using different stragies. | ||
| - Don't worry, be happy. | - Don't worry, be happy. | ||
| - | ===== Warming Up: Packing Problem ====== | ||
| - | First we will deal with a simple problem that is strictly related to the real problem we are interested in. The packing problem is a problem of fitting n-dimensionals solids in the n-dimensional container. We will discuss the simple case --- packing squares into a rectangle. | + | ===== Packing Problem ====== |
| + | |||
| + | The packing problem is a problem of fitting n-dimensional solids in the n-dimensional container. We will discuss the simple case --- packing squares into a rectangle. | ||
| {{ :en:dydaktyka:csp:square_packing.png?nolink&300|}} | {{ :en:dydaktyka:csp:square_packing.png?nolink&300|}} | ||
| Line 92: | Line 93: | ||
| ["area = " ++ show(width) ++ " * " ++ show(height) ++ " = " ++ show(area)] | ["area = " ++ show(width) ++ " * " ++ show(height) ++ " = " ++ show(area)] | ||
| </code> | </code> | ||
| - | |||
| - | <wrap lo>{{:en:dydaktyka:csp:csp_packing.zip|Here}} is a complete model for <del>lazy</del> overworked people. </wrap> | ||
| - | |||
| - | ===== Real Problem: Port Scheduling ===== | ||
| - | |||
| - | ==== Short Description ==== | ||
| - | The real problem we have to deal with is much less abstract --- we have to schedule coal loading in the Australian port. The problem is a relaxed version of a real problem, the University of Melbourne had to deal with. | ||
| - | |||
| - | ==== Schedule ==== | ||
| - | |||
| - | During the first class student is expected to finish the ''A'' stage, which is nothing more than packing problem with a plot. During the second class student should finish the model. In case there is no enough time, student is encouraged to work on the problem at home between the classes. | ||
| - | |||
| - | ==== Materials ==== | ||
| - | |||
| - | - Please download and extract {{:en:dydaktyka:csp:portschedule.zip|the data}}. | ||
| - | - ''handout.pdf'' contains the detailed description of the problem | ||
| - | - ''portschedule.mzp'' is a MiniZincIDE project. There are numerous helpful comments inside. | ||
| - | |||
