Optimization Grand Challenge 2026
Seulgi Joung via dmanet <[email protected]> Thu, 4 Jun 2026 09:03:24 +0900
| Newsgroups | gmane.science.mathematics.discrete |
|---|---|
| Message-ID | <CAMqBo4C=gorzcxmHxBbQ1gThpg6JtoZHU16x9SoJK6QKb-zFbg@mail.gmail.com> |
[OGC 2026] The Grand Shipyard Puzzle: Pack the Block, Beat the Clock! The shipbuilding industry represents one of the world's most massive optimization puzzles. In a high-stakes environment where thousands of mega-blocks move within constrained spaces and complex schedules intertwine, even a minor inefficiency can ripple through the entire production line. This year, the Optimization Grand Challenge (OGC) 2026 invites you to tackle this real-world complexity: Shipyard Block Spatial Allocation and Movement Optimization. * Why Join the Grand Shipyard Puzzle? True optimization isn't just about "crunching numbers"—it’s about structuring messy, real-world constraints into a framework for superior decision-making. Last year, the majority of winning teams leveraged Gurobi to model complex industrial problems rapidly and execute large-scale computations reliably. As an official partner of OGC 2026, Gurobi continues to empower participants to solve the industry's toughest challenges. * Competition Details Theme: Shipyard Block Packing & Movement Optimization Eligibility: Open to students, professionals, and optimization enthusiasts worldwide. Team: 1 to 3 members per team. Open Source: To contribute to the field, all finalist algorithm codes will be released as open source. * Important Dates (2026) Registration: May 25 – June 07 Preliminary Round: June 15 – July 28 Final Round: August 03 – August 14 Final Presentation & Awards: September 04 * Total Prize Pool : KRW 200 million (Approximately $130,000) 1st Prize (1 team) : KRW 70M/team 2nd Prize (2 teams) : KRW 25M/team 3rd Prize (3 teams) : KRW 10M/team 4th Prize (4 teams) : KRW 3M/team Additional prizes for up to 20 teams LG CNS internship opportunities will be offered to award winners. (Details will be announced separately) "Great optimization is the art of finding the best possible path amidst a sea of infinite choices." Are you ready to test your algorithms against real industrial data? Join the challenge and showcase your expertise on a global stage! Learn more and register: https://optichallenge.com Sender: Seulgi Joung (email: [email protected], [email protected]) ==================================================== Seulgi Joung, Ph.D Associate Professor Department of Industrial Engineering, Ajou University Department of Artificial Intelligence, Ajou University email: [email protected] website: sgjoung.github.io ==================================================== ********************************************************** * * Contributions to be spread via DMANET are submitted to * * [email protected] * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************