|
|
|
|
|
Jianying Wei, Yuming Liu, Xiaochun Lu, Yu Feng and Yadi Wang
Tunnel construction projects are a classic type of repetitive project, and hold a crucial position in the construction industry. The linear scheduling method (LSM) has been in the spotlight in scheduling optimization for repetitive construction projects ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chunyu Song, Teer Guo, Jianghua Sui and Xianku Zhang
In order to solve the problem of the dynamic positioning control of large ships in rough sea and to meet the need for fixed-point operations, this paper proposes a dynamic positioning controller that can effectively achieve large ships? fixed-point contr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Derek H. Smith, Roberto Montemanni and Stephanie Perkins
Let ??=(??,??)
G
=
(
V
,
E
)
be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kai Xue, Zhiqin Huang, Ping Wang and Zeyu Xu
Task allocation of unmanned surface vehicles (USVs) with low task cost is an important research area which assigns USVs from starting points to different target points to complete tasks. Most of the research lines of task allocation are using heuristic a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Enrico Romanschek, Christian Clemen and Wolfgang Huhnt
A novel approach for a robust computation of positional relations of two-dimensional geometric features is presented which guarantees reliable results, provided that the initial data is valid. The method is based on the use of integer coordinates and a m...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tamer F. Abdelmaguid
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Borislav Slavchev, Evelina Masliankova and Steven Kelk
We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-the-ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Haojian Liang, Shaohua Wang, Huilai Li, Huichun Ye and Yang Zhong
The spatial optimization method between combinatorial optimization problems and GIS has many geographical applications. The p-center problem is a classic NP-hard location modeling problem, which has essential applications in many real-world scenarios, su...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ade Candra, Mohammad Andri Budiman, Dian Rachmawati
Pág. 30 - 37
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Irina Polyakova,Svetlana Burdukovskaya
Pág. 28 - 37
The article deals with algorithm for linking the coordinates of an object to a road graph. Similar algorithms are used in every application due to the widespread use of electronic devices. Such algorithms may have some inaccuracies, which makes it diffic...
ver más
|
|
|
|
|
|
|
|
|
|
|
Irina Polyakova,Svetlana Burdukovskaya
Pág. 28 - 37
The article deals with algorithm for linking the coordinates of an object to a road graph. Similar algorithms are used in every application due to the widespread use of electronic devices. Such algorithms may have some inaccuracies, which makes it diffic...
ver más
|
|
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sai Prashanth Josyula, Johanna Törnquist Krasemann and Lars Lundberg
In railway traffic systems, whenever disturbances occur, it is important to effectively reschedule trains while optimizing the goals of various stakeholders. Algorithms can provide significant benefits to support the traffic controllers in train reschedu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Oscar Danilo Montoya, Luis Fernando Grisales-Noreña and Carlos Andres Ramos-Paja
The problem of optimal siting and dimensioning of photovoltaic (PV) generators in medium-voltage distribution networks is addressed in this research from the perspective of combinatorial optimization. The exact mixed-integer programming (MINLP) model is ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Yulia Terentyeva
Pág. 13 - 21
The paper deals with the development of the topology of ultra-large communication networks, i.e. networks containing several thousand vertices. In this case, the coordinates of the vertices of the undirected graph are somehow predetermined and a set of e...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chunming Tang, Yanni Li, Xiaoxia Dong and Bo He
In this paper, we consider a class of structured optimization problems whose objective function is the summation of two convex functions: f and h, which are not necessarily differentiable. We focus particularly on the case where the function f is general...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuncheng Shen, Bing Guo, Yan Shen, Fan Wu, Hong Zhang, Xuliang Duan and Xiangqian Dong
Data have become an important asset. Mining the value contained in personal data, making personal data an exchangeable commodity, has become a hot spot of industry research. Then, how to price personal data reasonably becomes a problem we have to face. B...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patcharin Buayen and Jeeraporn Werapun
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chandra Agung, Natalia Christine
Pág. 69 - 75
The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem...
ver más
|
|
|
|
|
|
|
|
|
|
|
Narisara Khamsing, Kantimarn Chindaprasert, Rapeepan Pitakaso, Worapot Sirirak and Chalermchat Theeraviriya
This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the fou...
ver más
|
|
|
|
|
|