The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Towards optimal formwork pairing on construction sites”

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

Maric, Miroslav (2013)

Serdica Journal of Computing

Similarity:

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...

On the minimum cost multiple-source unsplittable flow problem

Meriema Belaidouni, Walid Ben-Ameur (2007)

RAIRO - Operations Research

Similarity:

The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions...

A branch-and-price-and-cut algorithm for the pattern minimization problem

Cláudio Alves, J. M. Valério de Carvalho (2008)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In cutting stock problems, after an optimal (minimal stock usage) cutting plan has been devised, one might want to further reduce the operational costs by minimizing the number of setups. A setup operation occurs each time a different cutting pattern begins to be produced. The related optimization problem is known as the Pattern Minimization Problem, and it is particularly hard to solve exactly. In this paper, we present different techniques to strengthen a formulation proposed in the...

The inverse maximum flow problem considering norm

Adrian Deaconu (2008)

RAIRO - Operations Research

Similarity:

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...