Heuristic Procedures

  • Patricia Domínguez-Marín
Part of the Combinatorial Optimization book series (COOP, volume 15)


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.


Genetic Algorithm Current Solution Heuristic Approach Genetic Operator Variable Neighbourhood 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Patricia Domínguez-Marín

There are no affiliations available

Personalised recommendations