Displaying similar documents to “An alternative method for construction of optimal sequential questionnaires”

On improving a solution to the ATSP with fixed origin and precedence relationships.

Laureano F. Escudero (1988)

Trabajos de Investigación Operativa

Similarity:

Given the directed graph G = (N, A) with a node origin and a penalty matrix C, the ATSP with fixed origin and precedence relationships (hereafter, ASTP-PR) consists of finding the permutation of the nodes from the set N, such that it minimizes a matrix C based function and does not violate the precedence relationships given by the set A. In this work we present an algorithm for improving a given feasible solution to the problem, by performing a local search that uses 3- and 4-change...

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...