Speaker: Vu Duc Minh (Hanoi University of Science, VNU)
Time: 9h30 Thursday, October 16, 2014
Location: Room 201, Building A5, Institute of Mathematics, Hanoi, Vietnam
Abstract: In this talk, we present a three-phase matheuristic solution strategy for the capacitated multi-commodity fixed-cost network design problem with design-balance constraints. The proposed matheuristic combines exact and neighbourhood-based methods. Tabu search and restricted path relinking meta-heuristics cooperate to generate as many feasible solutions as possible. The two meta-heuristics incorporate new neighbourhoods, and computationally efficient exploration procedures. The feasible solutions generated by the two procedures are then used to identify an appropriate part of the solution space where an exact solver intensifies the search. Computational experiments on benchmark instances show that the proposed algorithm finds good solutions to large-scale problems in a reasonable amount of time. |
