A non-diffident combinatorial optimization algorithm
Branch and bound is a well known, all-purpose optimization strategy. It relies on the availability of a search space evaluation function and maintains an upper bound cost as a reference for the pruning. This upper bound is updated each time a better solution is encountered. In this paper, we propose a non-diffident optimization strategy that imposes this value. The computation of the bound is based on some heuristics that use probabilistic knowledge of the problem. Setting an arbitrary low bound enables a faster convergence towards the best solution. The counterpart is that the search space might be traversed more than once. However, we show in an experimental evaluation that our approach remains beneficial.
Unable to display preview. Download preview PDF.
- [Chip 91]Cosytec. Chip Users' Reference Manual, 1991.Google Scholar
- [IlogSolver 94]ILOG, 2 Av. Galliéni, F-94253 Gentilly. Ilog Solver Users' Reference Manual, 1994.Google Scholar
- [Lee 91]K. Lee, H. Leong. An improved lower bound for channel routing problems. In IEEE International Symposium on Circuits and Systems, 1991.Google Scholar
- [Malik 93]
- [Prosser 94]P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Proc. ECAI, pages 95–99, Amsterdam, the Netherlands, 1994.Google Scholar
- [Sabin 94]D. Sabin, E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI, Amsterdam, Netherlands, 1994.Google Scholar