In Chapters 3 and 4 different exact approaches were proposed for solving the DOMP; From the results presented in Section 4.3 we can conclude that the specific branch-and-bound (B&B) algorithm needs much less computing time than the linearisations derived in Chapter 3, see also Appendices B.2 and C.2. Moreover, this B&B method can solve problems that are almost twice as large as the ones solved by the best linearisation (see footnote 1 on page 73). Nevertheless, although we are able to solve exactly problems up to M = 35 existing facilities, these are still far from real problem sizes.
KeywordsGenetic Algorithm Current Solution Heuristic Approach Genetic Operator Variable Neighbourhood
Unable to display preview. Download preview PDF.