In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP)
problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time....
AMS Subj. Classification: 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 significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow 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...
In this paper a variable neighborhood search (VNS) approach
for the task assignment problem (TAP) is considered. An appropriate neighborhood
scheme along with a shaking operator and local search procedure
are constructed specifically for this problem. The computational results are
presented for the instances from the literature, and compared to optimal
solutions obtained by the CPLEX solver and heuristic solutions generated
by the genetic algorithm. It can be seen that the proposed VNS approach
reaches...
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and
a genetic algorithm is
proposed to solve this problem. By using the developed
algorithm it is possible to solve SPLP
with more than 1000 facility sites and customers.
Computational results are presented and
compared to dual based algorithms.
Download Results (CSV)