17 research outputs found

    Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

    Get PDF
    This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research attention within the meta-heuristics community. The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches. Many interesting research issues still remain to be investigated, for example, the inclusion of different constraints, such as delay bounds, when finding multicast trees with minimum cost. In this paper, we develop a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, 2007), and also propose two novel local search heuristics within our JPSO framework. A path replacement operator has been used in particle moves to improve the positions of the particle with regard to the structure of the tree. We test the performance of our JPSO algorithm, and the effect of the integrated local search heuristics by an extensive set of experiments on multicast routing benchmark problems and Steiner tree problems from the OR library. The experimental results show the superior performance of the proposed JPSO algorithm over a number of other state-of-the-art approaches

    Linking finite-element analysis and computer-aided drafting processes

    No full text
    SIGLEAvailable from British Library Lending Division - LD:D57937/85 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

    Simulating the arm movements of a stepper motor controlled pick - and - place robot using the stepper motor model

    No full text
    This paper describes the simulation of arm movements of a stepper motor controlled pick-and-place robot using the mathematical model of a stepper motor. The model includes: a) a model of the stepper model driver board, b) a model of the hybrid stepper motor and load combination, and c) the interconnection of the two models which is used to simulate the motions of the base, shoulder, elbow, and wrist (pitch) motions of the pick-and-place robot. The model is simulated using Simulink and the results of angular displacement from the simulation and actual measurements show good uniformity

    Automating the process of work - piece recognition and location for a pick - and - place robot in a SFMS

    No full text
    This paper reports the development of a vision system to automatically classify work-pieces with respect to their shape and color together with determining their location for manipulation by an in-house developed pick-and-place robot from its work-plane. The vision-based pick-and-place robot has been developed as part of a smart flexible manufacturing system for unloading work-pieces for drilling operations at a drilling workstation from an automatic guided vehicle designed to transport the work-pieces in the manufacturing work-cell. Work-pieces with three different shapes and five different colors are scattered on the work-plane of the robot and manipulated based on the shape and color specification by the user through a graphical user interface. The number of corners and the hue, saturation, and value of the colors are used for shape and color recognition respectively in this work. Due to the distinct nature of the feature vectors for the fifteen work-piece classes, all work-pieces were successfully classified using minimum distance classification during repeated experimentations with work-pieces scattered randomly on the work-plane
    corecore