Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Kokonaislukualkio-ohjelmointi× | Tabu Search× | |
|---|---|---|
| Tieteenala | Optimointi | Optimointi |
| Menetelmäperhe | Process / pipeline | Process / pipeline |
| Syntyvuosi≠ | 1958 | 1989 |
| Kehittäjä≠ | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Fred Glover |
| Tyyppi≠ | Mathematical optimisation — exact combinatorial method | Local-search metaheuristic |
| Alkuperäislähde≠ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Rinnakkaisnimet≠ | IP, MIP, mixed-integer programming, mixed-integer linear programming | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Liittyvät | 4 | 4 |
| Tiivistelmä≠ | Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems. | Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems. |
| ScholarGateAineisto ↗ |
|
|