EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3146. Two-Phase Matheuristic for Assignment and Packing
Invited abstract in session MA-7: Cutting and Packing 1 - 2D rectangular, stream Cutting and Packing (ESICUP).
Monday, 8:30-10:00Room: 1019 (building: 202)
Authors (first author is the speaker)
| 1. | Jakob Schulte
|
| Decision Analytics Group, Bielefeld University | |
| 2. | Daniel Wetzel
|
| Decision and Operation Technologies, Bielefeld University |
Abstract
We introduce a novel two-phase matheuristic for assignment and packing (2P-MAP) designed to address large-scale assignment and truck loading problems. The scope of our approach involves scenarios with an extensive amount of items requiring assignment to a heterogeneous fleet of trucks and subsequent transportation. The proposed matheuristic strategically tackles the assignment problem in its first phase, followed by a complex truck loading algorithm to validate the assignment solution in the second phase. A distinguishing feature of our heuristic lies in its comprehensive exploration of the solution space, enabling the identification of optimal solutions. Moreover, our approach exhibits seamless adaptability to diverse use cases, given that subproblems are optimized in isolation before being integrated. This approach is motivated by the ROADEF/EURO challenge 2022, where we demonstrate superior performance on select instances, showcasing the potential for significant cost reduction in Renault's Supply Chains.
Keywords
- Cutting and Packing
- Large Scale Optimization
- Supply Chain Management
Status: accepted
Back to the list of papers