• Title/Summary/Keyword: problem solving path

Search Result 146, Processing Time 0.027 seconds

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

General evolutionary path for fundamental natural frequencies of structural vibration problems: towards optimum from below

  • Zhao, Chongbin;Steven, G.P.;Xie, Y.M.
    • Structural Engineering and Mechanics
    • /
    • v.4 no.5
    • /
    • pp.513-527
    • /
    • 1996
  • In this paper, both an approximate expression and an exact expression for the contribution factor of an element to the natural frequency of the finite element discretized system of a structure in general and a membrane in particular have been derived from the energy conservation principle and the finite element formulation of structural eigenvalue problems. The approximate expression for the contribution factor of an element is used to predict and determine the elements to be removed in an iteration since it depends only on the quantities associated with the old system in the iteration. The exact expression for the contribution factor of an element makes it possible to check whether the element is correctly removed at the end of an iteration because it depends on both the old system and the new system in the iteration. Thus, the combined use of the approximate expression and the exact expression allows a considerable number of elements to be removed in a single iteration so that the efficiency of the evolutionary structural optimization method can be greatly improved for solving the natural frequency optimization problem of a structure. A square membrane with different boundary supports has been chosen to investigate the general evolutionary path for the fundamental natural frequency of the structure. The related results indicated that if the objective of a structural optimization is to raise the fundamental natural frequency of the structure to an optimal value, the general evolutionary path during its optimization is that the elements are gradually removed along the direction from the area surrounded by the contour of the highest value to that surrounded by the contour of the lowest value.

Cubes with lattics-point vertices (수격자점을 꼭지점으로 갖는 정육면체의 개수 -지오보드의 활용-)

  • 이만근
    • Journal of Educational Research in Mathematics
    • /
    • v.8 no.1
    • /
    • pp.137-144
    • /
    • 1998
  • A common geoboard puzzel serves as the point of departure for an investigation that lends itself to whole-group discussion with a class of prospective secondary school teachers. Students are provided with opportunities to devise and carry out problem-solving strategies (called 'heuristics' by Polya); exploit inerrelationships among geometry, arithmetic and algebra; formulate generalizations and conjectures; plan and execute an computational project; construct mathematical arguments to establish theorems; and find counter-examples to dispose of a false conjecture. In recent tears, Eugene F. Krause wrote two papers having the same title except for the numeral In that papers he arrives at an theorem about the sizes of squares with lattice point vertices in the coordinate plane, In this paper we follow a different path genearlization to coordinate 3-space

  • PDF

Servo control of mobile robot using vision system (비젼시스템을 이용한 이동로봇의 서보제어)

  • 백승민;국태용
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.540-543
    • /
    • 1997
  • In this paper, a precise trajectory tracking method for mobile robot using a vision system is presented. In solving the problem of precise trajectory tracking, a hierarchical control structure is used which is composed of the path planer, vision system, and dynamic controller. When designing the dynamic controller, non-ideal conditions such as parameter variation, frictional force, and external disturbance are considered. The proposed controller can learn bounded control input for repetitive or periodic dynamics compensation which provides robust and adaptive learning capability. Moreover, the usage of vision system makes mobile robot compensate the cumulative location error which exists when relative sensor like encoder is used to locate the position of mobile robot. The effectiveness of the proposed control scheme is shown through computer simulation.

  • PDF

Evaluation of Tool Paths and NC Codes Generation for PCB Drilling Operations (PCB 홀 천공순서의 평가 및 NC 코드의 생성)

  • Choi, Hoo-Gon;Lee, Ho-Chan;Seo, Jun-Sung
    • IE interfaces
    • /
    • v.10 no.1
    • /
    • pp.223-235
    • /
    • 1997
  • The process of determining the optimal tool path in PCB(printed circuit board) drilling operations is identical with that of solving a TSP(traveling salesman problem). However, the optimal solution will be ruined when a drill bit needs tracking back in its tool paths. The back tracking occurrences shorten a life of the main spindle and result in inaccurate mechanical movements. In this study, the performances of four heuristics(Nearest Neighbor, Convex Hull, Greatest Angle and Most Eccentric Ellipse) are evaluated to obtain feasible tool paths along with less number of back trackings for a large number of holes(more than 2000holes/bit) and to generate corresponding NC codes for a given CNC drill. Also, the operations of these algorithms are visualized to show a user the graphic image of tool visitation with PCB holes on a computer screen.

  • PDF

Design of Sliding Mode Controller for Ship Position Control (선박위치제어를 위한 슬라이딩모드 제어기 설계)

  • Bui, Van Phuoc;Kim, Young-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.9
    • /
    • pp.869-874
    • /
    • 2011
  • This paper addresses the trajectory tracking problem for ship berthing by using sliding mode technique. With significant potential advantages: insensitivity to plant nonlinearities, parameter variations, remarkable stability and robust performance with environmental disturbances, the multivariable sliding modes controller is proposed for solving trajectory tracking of ship in harbor area. In this study, the ship position and heading angle are simultaneously tracked to guarantees that the ship follows a given path (geometric task) with desired velocities (dynamic task). The stability of the proposed control law is proved based on Lyapunov theory. The proposed approach has been simulated on a computer model of a supply vessel with good results.

Unit Commitment Using Parallel Tabu Search (병렬 타부 탐색법을 이용한 발전기 기동정지계획)

  • Kim, H.S.;Mun, K.J.;Cho, D.H.;Hwang, G.H.;Park, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 2001.05a
    • /
    • pp.84-88
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search (PTS). The TS is efficient optimization method using meta-heuristic. In this paper, to reduce the computation time for evaluating the neighborhoods, an evaluating method only on changed part and a path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with conventional methods. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

  • PDF

Unit Commitment Using Tabu Search (Tabu Search를 이용한 발전기 기동정지계획)

  • Chun, H.J.;Kim, H.S.;Mun, K.J.;Hwang, G.H.;Lee, H.S.;Park, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • pp.1098-1100
    • /
    • 1999
  • This paper proposes a method of solving a unit commitment problem using tabu search (TS). The TS is efficient optimization method using meta-heuristic. To improve the diversification properties of TS, path relinking method is introduced. To show the usefulness of the proposed method, we performed an experiment for the system of 10 units. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

  • PDF

Joint Radio Selection and Relay Scheme through Optimization Model in Multi-Radio Sensor Networks

  • Lee, HyungJune
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4451-4466
    • /
    • 2014
  • We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

Toward A Totally Solving Interference Problem for Ultrasound Localization System (초음파 위치인지 시스템의 간섭 문제의 해결을 위한 연구)

  • Song, Byung-Hun;Ham, Kyung-Sun;Lee, Hyung-Su
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.177-178
    • /
    • 2006
  • The real-time tracking system is an essential factor for the development of low cost sensor networks for use in pervasive computing and ubiquitous networking. In this paper, we address the interference problems of the sensor network platform with ultrasonic for location tracking system. Ubiquitous indoor environments often contain substantial amounts of metal and other such reflective materials that affect the propagation of radio frequency signals in non-trivial ways, causing severe multi-path effects, dead-spots, noise, and interference. Especially we present a novel reducing interference location system that is particularly well suited to support context-aware computing. The system called Pharos, aims to combine the advantages of real-time tracking systems that implement distributed environment with regardless of infrastructure or infrastructure-less wireless sensor networks.

  • PDF