A. Unzueta Inchaurbe, L. F. Escudero Bueno, M. A. GARIN MARTIN
The Cross-dock Door Assignment problem (CDAP) consists of using a distribution-docking terminal for helping on supply chain distribution. Given a set of commodities to deliver from origin nodes to destination ones, the products are unloaded using a set of inbound doors, handled in the terminal, and reloaded using a set of outbound doors. The goal consists of assigning the origin and destination nodes to the inbound and outbound doors, so that the cost is minimized. The CDAP includes the Generalized Assignment Problem as a subproblem and, it is NP-hard. Starting from the binary quadratic formulation of the CDAP model, some Linearized mixed Integer Programming formulations are proposed. A Lagrangean relaxation and decomposition scheme, and an ad-hoc matheuristic based on local search are proposed for obtaining tight lower bounds and feasible solutions of the original problem, respectively. A computational study, which shows the efficiency of the proposed joint scheme is presented.
Palabras clave: Generalized Assignment Problem, Lagrangean Dualization, Lazy heuristic.
Programado
Optimización Entera y Combinatoria
8 de noviembre de 2023 17:20
CC2: Sala Conferencias