We consider two covering variants of the network design problem. are given a set origin/destination pairs, called O/D and each such pair is covered if there exists path in from origin to destination whose length not larger than threshold. In first problem, Maximal Covering Network Design one must determine that maximizes total fulfilled demand pairs subject budget constraint on costs network. s...

We study an assignment type resource-constrained project scheduling problem with resources being multi-skilled personnel to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective c...

This paper presents the first stochastic mixed integer programming model for a comprehensive hybrid power system design, including renewable energy generation, storage device, transmission network, and thermal generators, in remote areas. Given the computational complexity of the model, we developed a Benders’ decomposition algorithm with Pareto-optimal cuts. Computational results show signific...

We consider the 3-staged Strip Packing Problem, in which rectangular items have to be arranged onto a rectangular strip of fixed width, such that the items can be obtained by three stages of guillotine cuts while the required strip height is to be minimized. We propose a new logic-based Benders decomposition with two kinds of Benders cuts and compare it with a compact integer linear programming...

We report a computational study of two-stage SP models on a large set of benchmark problems and consider the following methods: (i) Solution of the deterministic equivalent problem by the simplex method and an interior point method, (ii) Benders decomposition (L-shaped method with aggregated cuts), (iii) Regularised decomposition of Ruszczyński (Math Program 35:309–333, 1986), (iv) Benders deco...

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

When solving combinatorial optimization problems it can happen that using a single technique is not efficient enough. In this case, simplifying assumptions can transform a huge and hard to solve problem in a manageable one, but they can widen the gap between the real world and the model. Heuristic approaches can quickly lead to solutions that can be far from optimality. For some problems, that ...

We propose a heuristic adaptation of logic-based Benders decomposition to the home health care problem. The objective is design routes and schedules for health care workers who visit patient homes, so as to minimize cost while meeting all patient needs and work requirements. We solve the Benders master problem by a greedy heuristic that is enhanced by the propagation facilities of constraint pr...