Warehouse / aircraft landing in loco

[maacl]

How would one go about solving the Choco warehouse/aircraft landing problems using loco? http://choco-tuto.readthedocs.io/en/latest/src/501.description.html http://choco-tuto.readthedocs.io/en/latest/src/401.description.html

In general what would be the strategy for finding maximizing / minimizing solutions based on a value which is not itself constrained, eg. a cost associated with a variable having a certain value?

[Engelberg]

These seem like they would have straightforward solutions to Loco. In the Choco examples, they always put some kind of bound on the thing they are optimizing. It doesn't have to be a particularly tight bound, but it needs some kind of upper/lower bound. Loco can sometimes do that automatically for you for arithmetic expressions, for example:

http://programming-puzzler.blogspot.com/2014/03/optimization-with-loco.html

Also, see:

http://programming-puzzler.blogspot.com/2014/03/appointment-scheduling-in-clojure-with.html

[maacl]

Thanks for the feedback. I looked at both articles which were very helpful, but the general challenge outlined in original issue still escapes me. I have posted an example of the problem on stackoverflow here. There is even a bounty :-)

[Engelberg]

I answered on stackoverflow.

[maacl]

Thanks.

On Sat, Jul 15, 2017, 08:12 Mark Engelberg ***@***.***> wrote: I answered on stackoverflow. — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub <#17 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AAD6XOfPleCsX41vfQK9yioQPbwqpMJkks5sOFhngaJpZM4ONisn> .

-- Martin Clausen Mob. +45 61 55 50 95 <https://www.vyte.in/martin.clausen>