Ordinal-Optimization Concept Enabled Decomposition and Coordination of Mixed-Integer Linear Programming Problems

Many important optimization problems, such as manufacturing scheduling and power system unit commitment, are formulated as Mixed-Integer Linear Programming (MILP) problems. Such problems are generally difficult to solve because of their combinatorial nature, and may subject to strict computation tim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE robotics and automation letters Ročník 5; číslo 4; s. 5051 - 5058
Hlavní autori: Liu, An-Bang, Luh, Peter B., Bragin, Mikhail A., Yan, Bing
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Combinatorial analysis
Complexity theory
Computing time
Convergence
Coordination
Decomposition
Generalized assignment problems (GAPs)
Integer programming
Integers
Linear programming
Linearity
Manufacturing
Mathematical programming
Mixed integer linear programming
Mixed-integer linear programming (MILP)
Optimization
Ordinal optimization (OO)
Planning
Scheduling and Coordination
Surrogate absolute-value Lagrangian relaxation (SAVLR)
Unit commitment
ISSN:2377-3766, 2377-3766
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Many important optimization problems, such as manufacturing scheduling and power system unit commitment, are formulated as Mixed-Integer Linear Programming (MILP) problems. Such problems are generally difficult to solve because of their combinatorial nature, and may subject to strict computation time limitations. Recently, our decomposition-and-coordination method "Surrogate Absolute Value Lagrangian Relaxation" (SAVLR) exploits the exponential reduction of complexity upon problem decomposition and effectively coordinates subproblem solutions. In the method, subproblems are generally solved by using Branch-and-Cut (B&C). When subproblems are complicated, however, the approach might not be able to generate high-quality solutions within time limitations. In this paper, motivated by the "Ordinal Optimization" concept, this difficulty is resolved through exploiting a specific property of SAVLR that subproblem solutions only need to be "good enough" to satisfy a convergence condition. Time consuming B&C is eliminated in many iterations through obtaining "good enough" subproblem solutions based on "crude models" (e.g., LP-relaxed problems) or from heuristics. Testing results on generalized assignment problems demonstrate that the approach obtains high-quality solutions in a computationally efficient manner and significantly outperforms other approaches. This approach also opens up a new way to solve practical MILP problems that are subject to strict computation time limitations.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2377-3766
2377-3766
DOI:10.1109/LRA.2020.3005125