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

AMS Subj. Classiﬁcation: 90C57; 90C10;
Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very signiﬁcant impact on a rail company proﬁt considering the fact that from the quality of a train timetable depends a ﬂow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem...

This research was partially supported by the Serbian Ministry of Science and Ecology under
project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments.
In this paper a genetic algorithm (GA) for the task assignment
problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances
from the literature, and compared to optimal solutions...

Download Results (CSV)