A Unified Column Generation and Elimination Method for Solving Large-Scale Set Partitioning Problems
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912285599989760 |
|---|---|
| author | Ihara, Yasuyuki |
| author_facet | Ihara, Yasuyuki |
| contents | The Set Partitioning Problem is a combinatorial optimization problem with wide-ranging applicability, used to model various real-world tasks such as facility location and crew scheduling. However, real-world applications often require solving large-scale instances that involve hundreds of thousands of variables. Although the conventional Column Generation method is popular for its computational efficiency, it lacks a guarantee for exact solutions. This paper proposes a novel solution method integrating relaxation of Column Generation conditions and automatic elimination of redundant columns, aimed at overcoming the limitations of conventional Column Generation methods in guaranteeing exact optimal solutions. Numerical experiments using actual bus route data reveal that while the traditional method achieves an exact solution rate of only about 3%, the proposed method attains a rate of approximately 99% and remarkably improves solution accuracy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_16652 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Unified Column Generation and Elimination Method for Solving Large-Scale Set Partitioning Problems Ihara, Yasuyuki Optimization and Control The Set Partitioning Problem is a combinatorial optimization problem with wide-ranging applicability, used to model various real-world tasks such as facility location and crew scheduling. However, real-world applications often require solving large-scale instances that involve hundreds of thousands of variables. Although the conventional Column Generation method is popular for its computational efficiency, it lacks a guarantee for exact solutions. This paper proposes a novel solution method integrating relaxation of Column Generation conditions and automatic elimination of redundant columns, aimed at overcoming the limitations of conventional Column Generation methods in guaranteeing exact optimal solutions. Numerical experiments using actual bus route data reveal that while the traditional method achieves an exact solution rate of only about 3%, the proposed method attains a rate of approximately 99% and remarkably improves solution accuracy. |
| title | A Unified Column Generation and Elimination Method for Solving Large-Scale Set Partitioning Problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.16652 |