75 research outputs found

    Ant colony system: a cooperative learning approach to the traveling salesman problem

    Full text link

    Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem

    Get PDF
    International audienceContinuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers for transportation and storage operations. We assume that straddle carriers are shared among maritime and inland transport modes (truck, train, barge). The problem is thus to decide how many resources to allocate to each transport mode in order to minimize vehicle (vessel, truck, train, barge) delays. We present a mixed integer linear programming model, based on a network flow representation, to solve this allocation problem. The modular structure of the model enables us to represent different container terminals, transport modes and service strategies. We present parts of our model and exemplary applications for a terminal at the Grand Port Maritime de Marseille in France

    Experimental Critical Current Patterns in Josephson Junction Ladders

    Full text link
    We present an experimental and theoretical study of the magnetic field dependence of the critical current of Josephson junction ladders. At variance with the well-known case of a one-dimensional (1D) parallel array of Josephson junctions the magnetic field patterns display a single minimum even for very low values of the self-inductance parameter βL\beta_{\rm L}. Experiments performed changing both the geometrical value of the inductance and the critical current of the junctions show a good agreement with numerical simulations. We argue that the observed magnetic field patterns are due to a peculiar mapping between the isotropic Josephson ladder and the 1D parallel array with the self-inductance parameter βLeff=βL+2\beta_{\rm L}^{\rm eff}=\beta_{\rm L}+2.Comment: 4 pages, 4 picture

    SWARM Robotics: A Different Approach to Service Robotics

    Get PDF
    Service robotics, as it has been intended so far, views the accomplishment of a service mission mainly as the result of the action of a single robot. Swarm robotics tackles the very same problem from a different stance, \\ie as the result of a team effort of simple units. The project described here shows this particular approach. It defines first one simple unit (s-bot) capable of independently moving about on the ground and of dynamically establishing rigid or semi-rigid connections with other fellow units, and then it shows how a large group of them can, as a whole entity (swarm-bot), carry out a given task. Thanks to the ductility in assembling and forming its connections, a swarm-bot can readily cope with occasional failures of some components and promptly reshape the remaining swarm so as to replace the role of the failing units. Given such a plasticity, their possible applications is rather large ranging from harsh environment exploration to goods harvesting or goods transportation. At the moment, the project is at the stage of having defined a first simulating environment to be used both for the on-going hardware design and for the software control. The present paper describes this particular aspect of the project

    SWARM-BOT: Pattern Formation in a Swarm of Self-Assembling Mobile Robots

    Get PDF
    In this paper we introduce a new robotic system, called swarm-bot. The system consists of a swarm of mobile robots with the ability to connect to/disconnect from each other to self-assemble into different kinds of structures. First, we describe our vision and the goals of the project. Then we present preliminary results on the formation of patterns obtained from a grid-world simulation of the system

    The Business Model: Recent Developments and Future Research

    Get PDF
    This article provides a broad and multifaceted review of the received literature on business models in which the authors examine the business model concept through multiple subject-matter lenses. The review reveals that scholars do not agree on what a business model is and that the literature is developing largely in silos, according to the phenomena of interest of the respective researchers. However, the authors also found emerging common themes among scholars of business models. Specifically, (1) the business model is emerging as a new unit of analysis; (2) business models emphasize a system-level, holistic approach to explaining how firms “do business”; (3) firm activities play an important role in the various conceptualizations of business models that have been proposed; and (4) business models seek to explain how value is created, not just how it is captured. These emerging themes could serve as catalysts for a more unified study of business models

    Strategies for Controlled Placement of Nanoscale Building Blocks

    Get PDF
    The capability of placing individual nanoscale building blocks on exact substrate locations in a controlled manner is one of the key requirements to realize future electronic, optical, and magnetic devices and sensors that are composed of such blocks. This article reviews some important advances in the strategies for controlled placement of nanoscale building blocks. In particular, we will overview template assisted placement that utilizes physical, molecular, or electrostatic templates, DNA-programmed assembly, placement using dielectrophoresis, approaches for non-close-packed assembly of spherical particles, and recent development of focused placement schemes including electrostatic funneling, focused placement via molecular gradient patterns, electrodynamic focusing of charged aerosols, and others

    Application of Soft Computing Techniques to Rescue Operation Planning

    No full text

    A Branch and Bound Algorithm for the Robust Spanning Tree Problem With Interval Data

    No full text
    The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs are interval numbers instead of fixed values
    • …
    corecore