2 research outputs found

    Matheuristics:survey and synthesis

    Get PDF
    In integer programming and combinatorial optimisation, people use the term matheuristics to refer to methods that are heuristic in nature, but draw on concepts from the literature on exact methods. We survey the literature on this topic, with a particular emphasis on matheuristics that yield both primal and dual bounds (i.e., upper and lower bounds in the case of a minimisation problem). We also make some comments about possible future developments

    An Adaptive Memory-Based Approach Based on Partial Enumeration

    No full text
    We propose an iterative memory-based algorithm for solving a class of combinatorial optimization problems. The algorithm generates a sequence of gradually improving solutions by exploiting at each iteration the knowledge gained in previous iterations. At each iteration, the algorithm builds an enumerative tree and stores at each tree level a set of promising partial solutions that will be used to drive the tree exploration in the following iteration. We tested the effectiveness of the proposed method on an hard combinatorial optimization problem arising in the design of telecommunication networks, the Non Bifurcated Network Design Problem, and we report computational results on a set of test problems simulating real life instances
    corecore