Research Article | 27-September-2018
Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode KL-median heuristic (TMKLMedH) seeks to optimize the same criterion as the RH for deterministic blockmodeling. The
Michael Brusco,
Hannah J. Stolze,
Michaela Hoffman,
Douglas Steinley,
Patrick Doreian
Journal of Social Structure, Volume 19 , ISSUE 1, 1–22
Research Article | 21-April-2017
scenarios. We present MILP formulation of the problem and the solution method based on exchange MILP heuristic. The cluster of each median is presented by rooted tree with the median as root. The performance of the proposed heuristic is compared to the optimal solution found via Gurobi solver for MILP models through some illustrative instances of Slovak road network in Ţilina.
Štefan PEŠKO,
Tomáš MAJER
Transport Problems, Volume 10 , ISSUE 3, 125–130
Article | 10-April-2018
The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible clusters through an improved density-based clustering algorithm. Phase II assigns
Jiashan Zhang
International Journal of Advanced Network, Monitoring and Controls, Volume 2 , ISSUE 4, 161–165
Article | 10-April-2018
based on network coding and multi-access point collaboration. The program will first divide each video segment into the same segment and divide the access point completely and not completely interfere with the two models. The video multicast problem when the transmission range between the access points is overlapped is modeled as Linear programming optimization problem, a two-stage heuristic algorithm is designed to solve the problem. By using multiple access points to get the gain of space and time
Wang Tao
International Journal of Advanced Network, Monitoring and Controls, Volume 2 , ISSUE 4, 72–75
research-article | 31-October-2020
Luis CORTÉS-MESEGUER,
Igor FERNÁNDEZ-PLAZAOLA
Architecture, Civil Engineering, Environment, Volume 13 , ISSUE 3, 13–20
Article | 01-April-2018
Yuexian Wang,
Cheng Chew Lim
International Journal of Advanced Network, Monitoring and Controls, Volume 1 , ISSUE 1, –
Research Article | 21-April-2017
Optimization and profitability approaches play a crucial and central role in airline industry today. The main problem is how to overcome complexity by providing effective route schedule with minimal empty seats. So we need capable tools to re-optimize existing flight routes or to offer new one instead. This research deals about the efficient heuristic algorithm for optimal transportation of N different passenger contingents between ending points. We want to find out better transport plan with
Srećko KRILE,
Marina KRILE
Transport Problems, Volume 10 , ISSUE 1, 87–96
Article | 01-March-2016
, results show that using heuristic order-decreasing first-fit algorithm as the pre-allocation algorithm can distribute base band resource properly and realize dynamic scheduling under C-RAN, which is practical and feasible to improve utilization of base band resource and reduce power consumption.
Yanrong Niu
International Journal on Smart Sensing and Intelligent Systems, Volume 9 , ISSUE 1, 289–308
Research Article | 24-October-2017
The aim of the study is to reduce idle times of mining trucks and shovels in an open-pit coal mine. A heuristic algorithm for making dispatching decisions in conditions of dynamic allocation of trucks is developed. Priority parameters for choosing the shovel after the end-of-truck unloading are introduced. Also, an algorithm for searching for the optimal priority parameters to satisfy the required efficiency criterion is developed. This algorithm is based on a simulation model of a shovel-truck
Mark KORYAGIN,
Artyom VORONOV
Transport Problems, Volume 12 , ISSUE 2, 113–122
Article | 31-July-2018
freight traffic. The algorithm for creating a model of freight transportation is based on the analysis of the qualitative and quantitative indicators of the operator company in the considered region with the use of analytical, heuristic, and graphic capabilities of math software. The theoretical substantiation of the territorial picture, the freight transportation market in the region is obtained. The carried-out research allows to specify possible ways of optimization of freight traffic distribution.
Oleg Chislov,
Viktor Bogachev,
Vyacheslav Zadorozhniy,
Taras Bogachev
Transport Problems, Volume 13 , ISSUE 2, 39–48
Review | 06-August-2019
optimization algorithm to find a range of high-performance projects. The optimization problem can be solved through two approaches: deterministic (direct application of a set of defined steps) or stochastic (introducing a certain level of randomness). In architecture, where the optimization problems are particularly complex, designers generally use meta-heuristic algorithms, which are stochastic algorithms based on the principle of the weak law of large numbers [7].
Among these, the oldest and popular
Marco Giorgio BEVILACQUA,
Filippo IARDELLA,
Marco PALAZZUOLI,
Rodrigo Rubio CUADRADO
Architecture, Civil Engineering, Environment, Volume 12 , ISSUE 2, 17–26
Article | 09-April-2018
experiments are carried out and the conclusions are made for it. The algorithm can obtain the optimal solution through the continuous updating of pheromone. The main consideration is the Service level contract violation rate(S), Resource loss(W),Power consumption (P). Experimental results show that ,compared with the traditional heuristic method and genetic algorithm, the algorithm is advantageous to the parallel computation, and it’s able to achieve the optimal tradeoff and compromise between
Sun Hong,
Tang Qing,
Xu Liping,
Chen Shiping
International Journal of Advanced Network, Monitoring and Controls, Volume 2 , ISSUE 2, 120–129
Article | 01-September-2012
degradation of the control action. The main purpose of this paper is to provide an intelligent approach for improving the functionality of conventional PID controller in the problem of trajectory tracking in permanent magnet stepper motor (PMSM). Combination of a meta-heuristic algorithm called imperialist competitive algorithm (ICA) and fuzzy logic is employed for online tuning of PID controller. This, consequently, establishes an intelligent structure, fuzzy-PID controller (FPID), which is more flexible
Amir Mehdi Yazdani,
Ahmadreza Ahmadi,
Salinda Buyamin,
Mohd Fua’ad Rahmat,
Farshad Davoudifar,
Herlina Abd Rahim
International Journal on Smart Sensing and Intelligent Systems, Volume 5 , ISSUE 3, 717–741
Article | 01-December-2015
or heuristic methods. Most of these routing approaches haven’t considered the impact of heterogeneity of sensor nodes, in terms of their energy which is equipped with additional energy resources. In this paper, we propose stable election using three fuzzy parameters approach (SEFP) using fuzzy logic system for heterogeneous WSNs. The main purpose of this routing approach is to improve the network lifetime and particularly the stability period of the network. In the SEFP approach, the sensor node
hassan EL ALAMI,
Abdellah NAJID
International Journal on Smart Sensing and Intelligent Systems, Volume 8 , ISSUE 4, 2286–2306