Name
Abstract | ||
|---|---|---|
Large-scale discrete optimization problems are difficult to solve, especially when different kinds of real constraints are considered. Conventionally, standard mathematical programming is a general approach for discrete optimization, but may suffer from the unacceptable long solution time in applications. On the other hand, some heuristics/metaheuristics methods are more powerful in finding approximate solutions efficiently, but mostly are problem and constraint dependent. In this paper, we develop a new hybrid nested partitions and mathematical programming approach, which creates compliance between mathematical programming and the heuristics/metaheuristics methods. Potentially applicable to many different types of problems, the hybrid approach can provide approximate solutions efficiently, and in the meantime can easily handle different kinds of constraints. The applications of the hybrid approach to the local pickup and delivery problem (LPDP) and the discrete facility location problem (DFLP) are presented in this paper. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/TASE.2008.916761 | IEEE T. Automation Science and Engineering |
Keywords | Field | DocType |
Mathematical programming,Constraint optimization,Partitioning algorithms,Systems engineering and theory,Algorithm design and analysis,Contracts,Intelligent systems,Intelligent networks,Electronic mail,Large-scale systems | Mathematical optimization,Algorithm design,Computer science,Discrete optimization,Facility location problem,Combinatorial optimization,Heuristics,Local search (optimization),Metaheuristic,Constrained optimization | Journal |
Volume | Issue | ISSN |
5 | 4 | 1545-5955 |
Citations | PageRank | References |
16 | 0.93 | 28 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Pi | 1 | 24 | 2.26 |
| Yunpeng Pan | 2 | 175 | 13.01 |
| Leyuan Shi | 3 | 361 | 51.32 |