• Title/Summary/Keyword: Linear search algorithm

Search Result 199, Processing Time 0.029 seconds

Multi-objective Optimization of Vehicle Routing with Resource Repositioning (자원 재배치를 위한 차량 경로계획의 다목적 최적화)

  • Kang, Jae-Goo;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.2
    • /
    • pp.36-42
    • /
    • 2021
  • This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

Characterizing nonlinear oscillation behavior of an MRF variable rotational stiffness device

  • Yu, Yang;Li, Yancheng;Li, Jianchun;Gu, Xiaoyu
    • Smart Structures and Systems
    • /
    • v.24 no.3
    • /
    • pp.303-317
    • /
    • 2019
  • Magneto-rheological fluid (MRF) rotatory dampers are normally used for controlling the constant rotation of machines and engines. In this research, such a device is proposed to act as variable stiffness device to alleviate the rotational oscillation existing in the many engineering applications, such as motor. Under such thought, the main purpose of this work is to characterize the nonlinear torque-angular displacement/angular velocity responses of an MRF based variable stiffness device in oscillatory motion. A rotational hysteresis model, consisting of a rotatory spring, a rotatory viscous damping element and an error function-based hysteresis element, is proposed, which is capable of describing the unique dynamical characteristics of this smart device. To estimate the optimal model parameters, a modified whale optimization algorithm (MWOA) is employed on the captured experimental data of torque, angular displacement and angular velocity under various excitation conditions. In MWOA, a nonlinear algorithm parameter updating mechanism is adopted to replace the traditional linear one, enhancing the global search ability initially and the local search ability at the later stage of the algorithm evolution. Additionally, the immune operation is introduced in the whale individual selection, improving the identification accuracy of solution. Finally, the dynamic testing results are used to validate the performance of the proposed model and the effectiveness of the proposed optimization algorithm.

An Efficient Algorithm for Localizing 3D Narrowband Multiple Sources (협대역 다중표적의 효과적인 3차원 위치추정 알고리듬)

  • 이철목;이종환;윤경식;이균경
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.61-66
    • /
    • 2000
  • In this paper, we are proposing an efficient 3D source localization algorithm using 3 uniform linear subarrays. The proposed algorithm replaces 3D search required in conventional 3D MUSIC algorithm with 3 1D searches, and thus reduces computational burden. The estimate of the 1D conic angle obtained from a subarray under the far-field assumption satisfies a nonlinear algebraic equation of the true source bearing angle, elevation angle, and range. The proposed algorithm estimates source location by solving 3 algebraic equations obtained from 3 subarrays. Comparing 3D MUSIC spectrums of the estimated source locations, the proposed algorithm solves pairing problem for multiple sources localization.

  • PDF

Joint Antenna Selection and Multicast Precoding in Spatial Modulation Systems

  • Wei Liu;Xinxin Ma;Haoting Yan;Zhongnian Li;Shouyin Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.11
    • /
    • pp.3204-3217
    • /
    • 2023
  • In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

Incorporation of Scene Geometry in Least Squares Correlation Matching for DEM Generation from Linear Pushbroom Images

  • Kim, Tae-Jung;Yoon, Tae-Hun;Lee, Heung-Kyu
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.182-187
    • /
    • 1999
  • Stereo matching is one of the most crucial parts in DEM generation. Naive stereo matching algorithms often create many holes and blunders in a DEM and therefore a carefully designed strategy must be employed to guide stereo matching algorithms to produce “good” 3D information. In this paper, we describe one such a strategy designed by the use of scene geometry, in particular, the epipolarity for generation of a DEM from linear pushbroom images. The epipolarity for perspective images is a well-known property, i.e., in a stereo image pair, a point in the reference image will map to a line in the search image uniquely defined by sensor models of the image pair. This concept has been utilized in stereo matching by applying epipolar resampling prior to matching. However, the epipolar matching for linear pushbroom images is rather complicated. It was found that the epipolarity can only be described by a Hyperbola- shaped curve and that epipolar resampling cannot be applied to linear pushbroom images. Instead, we have developed an algorithm of incorporating such epipolarity directly in least squares correlation matching. Experiments showed that this approach could improve the quality of a DEM.

  • PDF

Design Optimization of Linear Synchronous Motors for Overall Improvement of Thrust, Efficiency, Power Factor and Material Consumption

  • Vaez-Zadeh, Sadegh;Hosseini, Monir Sadat
    • Journal of Power Electronics
    • /
    • v.11 no.1
    • /
    • pp.105-111
    • /
    • 2011
  • By having accurate knowledge of the magnetic field distribution and the thrust calculation in linear synchronous motors, assessing the performance and optimization of the motor design are possible. In this paper, after carrying out a performance analysis of a single-sided wound secondary linear synchronous motor by varying the motor design parameters in a layer model and a d-q model, machine single- and multi-objective design optimizations are carried out to improve the thrust density of the motor based on the motor weight and the motor efficiency multiplied by its power factor by defining various objective functions including a flexible objective function. A genetic algorithm is employed to search for the optimal design. The results confirm that an overall improvement in the thrust mean, efficiency multiplied by the power factor, and thrust to the motor weight ratio are obtained. Several design conclusions are drawn from the motor analysis and the design optimization. Finally, a finite element analysis is employed to evaluate the effectiveness of the employed machine models and the proposed optimization method.

Analysis and Optimization of Air-Core Permanent Magnet Linear Synchronous Motors with Overlapping Concentrated Windings for Ultra-precision Applications

  • Li, Liyi;Tang, Yongbin;Ma, Mingna;Pan, Donghua
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.2 no.1
    • /
    • pp.16-22
    • /
    • 2013
  • This paper presents the analysis and optimization of air-core permanent magnet linear synchronous motor with overlapping concentrated windings to achieve high thrust density, high thrust per copper losses and low thrust ripple. For the motor design, we adopt equivalent magnetizing current (EMC) method to analyze the magnetic field and give analytical formulae for calculation of motor parameters such as no-load back EMF, dynamic force, thrust density and thrust per copper losses. Further, we proposed a multi-objective optimization by genetic algorithm to search for the optimum parameters. The design optimization is verified by 2-D Finite Element analysis (FEA).

Study of New Control Method for Linear Periodic System

  • Jo, Janghyen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1999.10a
    • /
    • pp.83-87
    • /
    • 1999
  • The purpose of this study is to provide the new method for selection of a close to optimal scalar control of linear time-periodic system. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T. The form of gain matrix may have various kinds but must have same period, for example, one of each element being represented by Fourier series. As the optimal gain matrix I consider the matrix ensuring the minimum value of the larger real part of the Poincare exponents of the system. Finally we present a pole placement algorithm to make the given system be stable. It is possible to determine the stability of the given periodic system without get the analytic solution. The application of the method does not require the construction of the Floquet solution. At present state of determination of the gain matrix for this case will be done only by systematic numerical search procedures.

  • PDF

Edge Router Selection and Traffic Engineering in LISP-Capable Networks

  • Li, Ke;Wang, Sheng;Wang, Xiong
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.612-620
    • /
    • 2011
  • Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

Implementation of GA Processor with Multiple Operators, Based on Subpopulation Architecture (분할구조 기반의 다기능 연산 유전자 알고리즘 프로세서의 구현)

  • Cho Min-Sok;Chung Duck-Jin
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.5
    • /
    • pp.295-304
    • /
    • 2003
  • In this paper, we proposed a hardware-oriented Genetic Algorithm Processor(GAP) based on subpopulation architecture for high-performance convergence and reducing computation time. The proposed architecture was applied to enhancing population diversity for correspondence to premature convergence. In addition, the crossover operator selection and linear ranking subpop selection were newly employed for efficient exploration. As stochastic search space selection through linear ranking and suitable genetic operator selection with respect to the convergence state of each subpopulation was used, the elapsed time of searching optimal solution was shortened. In the experiments, the computation speed was increased by over $10\%$ compared to survival-based GA and Modified-tournament GA. Especially, increased by over $20\%$ in the multi-modal function. The proposed Subpop GA processor was implemented on FPGA device APEX EP20K600EBC652-3 of AGENT 2000 design kit.