Toward TransfORmers: Revolutionizing the Solution of Mixed Integer Programs with Transformers

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Cooper, Joshua F., Choi, Seung Jin, Buyuktahtakin, I. Esra
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913360606396416
author Cooper, Joshua F.
Choi, Seung Jin
Buyuktahtakin, I. Esra
author_facet Cooper, Joshua F.
Choi, Seung Jin
Buyuktahtakin, I. Esra
contents In this study, we introduce an innovative deep learning framework that employs a transformer model to address the challenges of mixed-integer programs, specifically focusing on the Capacitated Lot Sizing Problem (CLSP). Our approach, to our knowledge, is the first to utilize transformers to predict the binary variables of a mixed-integer programming (MIP) problem. Specifically, our approach harnesses the encoder decoder transformer's ability to process sequential data, making it well-suited for predicting binary variables indicating production setup decisions in each period of the CLSP. This problem is inherently dynamic, and we need to handle sequential decision making under constraints. We present an efficient algorithm in which CLSP solutions are learned through a transformer neural network. The proposed post-processed transformer algorithm surpasses the state-of-the-art solver, CPLEX and Long Short-Term Memory (LSTM) in solution time, optimal gap, and percent infeasibility over 240K benchmark CLSP instances tested. After the ML model is trained, conducting inference on the model, reduces the MIP into a linear program (LP). This transforms the ML-based algorithm, combined with an LP solver, into a polynomial-time approximation algorithm to solve a well-known NP-Hard problem, with almost perfect solution quality.
format Preprint
id arxiv_https___arxiv_org_abs_2402_13380
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Toward TransfORmers: Revolutionizing the Solution of Mixed Integer Programs with Transformers
Cooper, Joshua F.
Choi, Seung Jin
Buyuktahtakin, I. Esra
Artificial Intelligence
Machine Learning
Combinatorics
Optimization and Control
In this study, we introduce an innovative deep learning framework that employs a transformer model to address the challenges of mixed-integer programs, specifically focusing on the Capacitated Lot Sizing Problem (CLSP). Our approach, to our knowledge, is the first to utilize transformers to predict the binary variables of a mixed-integer programming (MIP) problem. Specifically, our approach harnesses the encoder decoder transformer's ability to process sequential data, making it well-suited for predicting binary variables indicating production setup decisions in each period of the CLSP. This problem is inherently dynamic, and we need to handle sequential decision making under constraints. We present an efficient algorithm in which CLSP solutions are learned through a transformer neural network. The proposed post-processed transformer algorithm surpasses the state-of-the-art solver, CPLEX and Long Short-Term Memory (LSTM) in solution time, optimal gap, and percent infeasibility over 240K benchmark CLSP instances tested. After the ML model is trained, conducting inference on the model, reduces the MIP into a linear program (LP). This transforms the ML-based algorithm, combined with an LP solver, into a polynomial-time approximation algorithm to solve a well-known NP-Hard problem, with almost perfect solution quality.
title Toward TransfORmers: Revolutionizing the Solution of Mixed Integer Programs with Transformers
topic Artificial Intelligence
Machine Learning
Combinatorics
Optimization and Control
url https://arxiv.org/abs/2402.13380