Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. There are works exploiting tree decomposition for complete search methods. In this paper, we show how tree decomposition can be used to efficiently guide local search methods that use large neighborhoods like VNS. We propose DGVNS (Decomposition Guided VNS) which uses the graph of clusters in order to build neighborhood structures enabling better diversification and intensification....
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
To cope with its development, a French operator of mobile telephone network
must periodically plan the purchase and the installation of new hardware,
in such a way that a hierarchy of constraints (required and preferred)
is satisfied.
This paper presents the “constructive repair” method we used to solve
this problem within the allowed computing time (1 min). This method repairs
the planning during its construction. A sequence of repair procedures is
defined: if a given repair cannot be achieved...
Download Results (CSV)