WorldWideScience

Sample records for network scheduling plans

  1. Planning and scheduling for maritime container yards supporting and facilitating the global supply network

    CERN Document Server

    Li, Wenkai; Goh, Mark

    2015-01-01

    Maximizing reader insights into the challenges facing maritime supply chains and container port logistics service providers in Asia, this book highlights their innovative responses to these challenges through real-world case studies. With a focus on mathematical modeling, simulation and heuristics approaches, this book provides academics, engineers, container terminal operators, students in logistics and supply chain management with the latest approaches that can be used to address the planning and scheduling problem in large container terminal yards. This book can be used on a self-contained basis as teaching cases in an undergraduate or specialist class setting, or on techniques applied to maritime container operations for port operations.

  2. Charlo Class Scheduling Plan.

    Science.gov (United States)

    Fiebiger, Leo J.

    The design and implementation of a rotating class schedule which was put into effect in the Charlo High School, Charlo, Montana in September 1969 is discussed in this paper. The schedule, described in this report, consists of a 75-minute period followed by 2, 60-minute periods in the morning and 4, 45-minute afternoon periods. The program…

  3. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...

  4. System/360 Computer Assisted Network Scheduling (CANS) System

    Science.gov (United States)

    Brewer, A. C.

    1972-01-01

    Computer assisted scheduling techniques that produce conflict-free and efficient schedules have been developed and implemented to meet needs of the Manned Space Flight Network. CANS system provides effective management of resources in complex scheduling environment. System is automated resource scheduling, controlling, planning, information storage and retrieval tool.

  5. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig......, interior point stabilization is used to decrease the number of columns generated in the branch-and-price algorithm. The algorithm is experimentally evaluated on job scheduling instances for a Grid network. The Dantzig- Wolfe algorithm with stabilization is clearly superior, being able to solve large...

  6. A planning language for activity scheduling

    Science.gov (United States)

    Zoch, David R.; Lavallee, David; Weinstein, Stuart; Tong, G. Michael

    1991-01-01

    Mission planning and scheduling of spacecraft operations are becoming more complex at NASA. Described here are a mission planning process; a robust, flexible planning language for spacecraft and payload operations; and a software scheduling system that generates schedules based on planning language inputs. The mission planning process often involves many people and organizations. Consequently, a planning language is needed to facilitate communication, to provide a standard interface, and to represent flexible requirements. The software scheduling system interprets the planning language and uses the resource, time duration, constraint, and alternative plan flexibilities to resolve scheduling conflicts.

  7. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

  8. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

  9. Schedule optimization study implementation plan

    Energy Technology Data Exchange (ETDEWEB)

    1993-11-01

    This Implementation Plan is intended to provide a basis for improvements in the conduct of the Environmental Restoration (ER) Program at Hanford. The Plan is based on the findings of the Schedule Optimization Study (SOS) team which was convened for two weeks in September 1992 at the request of the U.S. Department of Energy (DOE) Richland Operations Office (RL). The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit (OU) Remedial Investigation/Feasibility Study (RI/FS) Work Plan. The SOS team was comprised of independent professionals from other federal agencies and the private sector experienced in environmental restoration within the federal system. The objective of the team was to examine reasons for the lengthy RI/FS process and recommend ways to expedite it. The SOS team issued their Final Report in December 1992. The report found the most serious impediments to cleanup relate to a series of management and policy issues which are within the control of the three parties managing and monitoring Hanford -- the DOE, U.S. Environmental Protection Agency (EPA), and the State of Washington Department of Ecology (Ecology). The SOS Report identified the following eight cross-cutting issues as the root of major impediments to the Hanford Site cleanup. Each of these eight issues is quoted from the SOS Report followed by a brief, general description of the proposed approach being developed.

  10. Floyd-A∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

    Directory of Open Access Journals (Sweden)

    Yu Zhang

    2014-01-01

    Full Text Available We consider an ad hoc Floyd-A∗ algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT network. The network is bimodal (i.e., USPT lines and walking and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A∗ algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A∗-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A∗ algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, “just boarding” and “just missing” cases are identified.

  11. Enabling a New Planning and Scheduling Paradigm

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

    The Flight Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called "tasks models," from the scientists and technologists for the tasks that they want to be done. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, another cadre further modifies the models to be compatible with the scheduling engine. This last cadre also submits the models to the scheduling engine or builds the timeline manually to accommodate requirements that are expressed in notes. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components. (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphics methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models

  12. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn R.K.; van der Heijden, Matthijs C.; van Harten, Aart

    2004-01-01

    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule

  13. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

    MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

  14. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

    This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit

  15. Project orientated planning, scheduling and controlling technique ...

    African Journals Online (AJOL)

    Project orientated planning, scheduling and controlling technique. ... In the past several years, there has been an explosive growth of management technique to be used for planning and controlling projects. ... Comparison of actual times with available times enables control to be exerted in the performance of the project.

  16. Planning, scheduling, and control for automatic telescopes

    Science.gov (United States)

    Drummond, Mark; Swanson, Keith; Philips, Andy; Levinson, Rich; Bresina, John

    1992-01-01

    This paper presents an argument for the appropriateness of Entropy Reduction Engine (ERE) technology to the planning, scheduling, and control components of Automatic Photoelectric Telescope (APT) management. The paper is organized as follows. In the next section, we give a brief summary of the planning and scheduling requirements for APTs. Following this, in section 3, we give an ERE project precis, couched primarily in terms of project objectives. Section 4 gives a sketch of the match-up between problem and technology, and section 5 outlines where we want to go with this work.

  17. Integrated network design and scheduling problems :

    Energy Technology Data Exchange (ETDEWEB)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  18. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-07-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis.

  19. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-06-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis

  20. Scheduling maintenance of electrical power transmission networks using genetic programming

    Energy Technology Data Exchange (ETDEWEB)

    Langdon, W.B.; Treleaven, P.C.

    1997-12-31

    The National Grid Company plc is responsible for the maintenance of the high voltage electricity transmission network in England and Wales. It must plan maintenance so as to minimise costs taking into account: (i) location and size of demand, (ii) generator capacities and availabilities, (iii) electricity carrying capacity of the remainder of the network, i.e. that part not undergoing maintenance. Previous work showed the combination of a genetic algorithm using an order or permutation chromosome combined with hand coded ``greedy`` optimisers can readily produce an optimal schedule for a four node test problem [10]. Following this the same GA has been used to find low cost schedules for the South Wales region of the UK high voltage power network. This paper describes the evolution of the best known schedule for the base South Wales problem using genetic programming starting from the hand coded heuristics used with the GA. (Author)

  1. Integrating job scheduling and constrained network routing

    DEFF Research Database (Denmark)

    Gamst, Mette

    2010-01-01

    This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...

  2. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

    van Kleunen, W.A.P.; Meratnia, Nirvana; Havinga, Paul J.M.

    The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this

  3. An Enabling Technology for New Planning and Scheduling Paradigms

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

    The Night Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called ?ask models," from the scientists and technologists for the tasks that are to be scheduled. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next, a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, the models are modified to be compatible with the scheduling engine. Then the models are submitted to the scheduling engine for automatic scheduling or, when requirements are expressed in notes, the timeline is built manually. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components: (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphical methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the

  4. A Data Scheduling and Management Infrastructure for the TEAM Network

    Science.gov (United States)

    Andelman, S.; Baru, C.; Chandra, S.; Fegraus, E.; Lin, K.; Unwin, R.

    2009-04-01

    currently partnering with the San Diego Super Computer Center to build the data management infrastructure. Data collected from the three core protocols as well as others are currently made available through the TEAM Network portal, which provides the content management framework, the data scheduling and management framework, an administrative framework to implement and manage TEAM sites, collaborative tools and a number of tools and applications utilizing Google Map and Google Earth products. A critical element of the TEAM Network data management infrastructure is to make the data publicly available in as close to real-time as possible (the TEAM Network Data Use Policy: http://www.teamnetwork.org/en/data/policy). This requires two essential tasks to be accomplished, 1) A data collection schedule has to be planned, proposed and approved for a given TEAM site. This is a challenging process since TEAM sites are geographically distributed across the tropics and hence have different seasons where they schedule field sampling for the different TEAM protocols. Capturing this information and ensuring that TEAM sites follow the outlined legal contract is key to the data collection process and 2) A stream-lined and efficient information management system to ensure data collected from the field meet the minimum data standards (i.e. are of the highest scientific quality) and are securely transferred, archived, processed and be rapidly made publicaly available, as a finished consumable product via the TEAM Network portal. The TEAM Network is achieving these goals by implementing an end-to-end framework consisting of the Sampling Scheduler application and the Data Management Framework. Sampling Scheduler The Sampling Scheduler is a project management, calendar based portal application that will allow scientists at a TEAM site to schedule field sampling for each of the TEAM protocols implemented at that site. The sampling scheduler addresses the specific requirements established in the

  5. Scheduling language and algorithm development study. Volume 2, phase 2: Introduction to plans programming. [user guide

    Science.gov (United States)

    Cochran, D. R.; Ishikawa, M. K.; Paulson, R. E.; Ramsey, H. R.

    1975-01-01

    A user guide for the Programming Language for Allocation and Network Scheduling (PLANS) is presented. Information is included for the construction of PLANS programs. The basic philosophy of PLANS is discussed, and access and update reference techniques are described along with the use of tree structures.

  6. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

    Broadcasts and timelines are the primary mechanism of information exchange in online social platforms today. Services like Facebook, Twitter and Instagram have enabled ordinary people to reach large audiences spanning cultures and countries, while their massive popularity has created increasingly competitive marketplaces of attention. Timing broadcasts to capture the attention of such geographically diverse audiences has sparked interest from many startups and social marketing gurus. However, formal study is lacking on both the timing and frequency problems. In this thesis, we introduce, motivate and solve the broadcast scheduling problem of specifying the timing and frequency of publishing content to maximise the attention received. We validate and quantify three interacting behavioural phenomena to parametrise social platform users: information overload, bursty circadian rhythms and monotony aversion, which is defined here for the first time. Our analysis of the influence of monotony refutes the common assumption that posts on social network timelines are consumed piecemeal independently. Instead, we reveal that posts are consumed in chunks, which has important consequences for any future work considering human behaviour over social network timelines. Our quantification of monotony aversion is also novel, and has applications to problems in various domains such as recommender list diversification, user satiation and variety-seeking consumer behaviour. Having studied the underlying behavioural phenomena, we link schedules, timelines, attention and behaviour by formalising a timeline information exchange process. Our formulation gives rise to a natural objective function that quantifies the expected collective attention an arrangement of posts on a timeline will receive. We apply this formulation as a case-study on real-data from Twitter, where we estimate behavioural parameters, calculate the attention potential for different scheduling strategies and, using the

  7. Integrated multi-resource planning and scheduling in engineering project

    Directory of Open Access Journals (Sweden)

    Samer Ben Issa

    2017-01-01

    Full Text Available Planning and scheduling processes in project management are carried out sequentially in prac-tice, i.e. planning project activities first without visibility of resource limitation, and then schedul-ing the project according to these pre-planned activities. This is a need to integrate these two pro-cesses. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called “the Minimum Moments of Resources Required around X-Y axes (MMORR”, we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

  8. VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

    Science.gov (United States)

    Wang, Song; Gupta, Chetan; Mehta, Abhay

    There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans.

  9. A subjective scheduler for subjective dedicated networks

    Science.gov (United States)

    Suherman; Fakhrizal, Said Reza; Al-Akaidi, Marwan

    2017-09-01

    Multiple access technique is one of important techniques within medium access layer in TCP/IP protocol stack. Each network technology implements the selected access method. Priority can be implemented in those methods to differentiate services. Some internet networks are dedicated for specific purpose. Education browsing or tutorial video accesses are preferred in a library hotspot, while entertainment and sport contents could be subjects of limitation. Current solution may use IP address filter or access list. This paper proposes subjective properties of users or applications are used for priority determination in multiple access techniques. The NS-2 simulator is employed to evaluate the method. A video surveillance network using WiMAX is chosen as the object. Subjective priority is implemented on WiMAX scheduler based on traffic properties. Three different traffic sources from monitoring video: palace, park, and market are evaluated. The proposed subjective scheduler prioritizes palace monitoring video that results better quality, xx dB than the later monitoring spots.

  10. Computation and evaluation of scheduled waiting time for railway networks

    DEFF Research Database (Denmark)

    Landex, Alex

    2010-01-01

    Timetables are affected by scheduled waiting time (SWT) that prolongs the travel times for trains and thereby passengers. SWT occurs when a train hinders another train to run with the wanted speed. The SWT affects both the trains and the passengers in the trains. The passengers may be further...... affected due to longer transfer times to other trains. SWT can be estimated analytically for a given timetable or by simulation of timetables and/or plans of operation. The simulation of SWT has the benefit that it is possible to examine the entire network. This makes it possible to improve the future...

  11. Vehicle Scheduling with Network Flow Models

    Directory of Open Access Journals (Sweden)

    Gustavo P. Silva

    2010-04-01

    Full Text Available

    Este trabalho retrata a primeira fase de uma pesquisa de doutorado voltada para a utilização de modelos de fluxo em redes para programação de veículos (de ônibus, em particular. A utilização de modelos deste tipo ainda e muito pouco explorada na literatura, principalmente pela dificuldade imposta pelo grande numero de variáveis resultante. Neste trabalho são apresentadas formulações para tratamento do problema de programação de veículos associados a um único depósito (ou garagem como problema de fluxo em redes, incluindo duas técnicas para reduzir o numero de arcos na rede criada e, conseqüentemente, o numero de variáveis a tratar. Uma destas técnicas de redução de arcos foi implementada e o problema de fluxo resultante foi direcionado para ser resolvido, nesta fase da pesquisa, por uma versão disponível do algoritmo Simplex para redes. Problemas teste baseados em dados reais da cidade de Reading, UK, foram resolvidos com a utilização da formulação de fluxo em redes adotada, e os resultados comparados com aqueles obtidos pelo método heurístico BOOST, o qual tem sido largamente testado e comercializado pela School of Computer Studies da Universidade de Leeds, UK. Os resultados alcançados demonstram a possibilidade de tratamento de problemas reais com a técnica de redução de arcos.

    ABSTRACT

    This paper presents the successful results of a first phase of a doctoral research addressed to solving vehicle (bus, in particular scheduling problems through network flow formulations. Network flow modeling for this kind of problem is a promising, but not a well explored approach, mainly because of the large number of variables related to number of arcs of real case networks. The paper presents and discusses some network flow formulations for the single depot bus vehicle scheduling problem, along with two techniques of arc reduction. One of these arc reduction techniques has been implemented and the underlying

  12. Technology for planning and scheduling under complex constraints

    Science.gov (United States)

    Alguire, Karen M.; Pedro Gomes, Carla O.

    1997-02-01

    Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

  13. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

    In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

  14. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  15. The Single And Multi Project Approach To Planning And Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas

    2008-01-01

    The fragmentation of the construction industry in Denmark is reflected in the organisation of construction projects, which typically involves a large number of subcontractors. The main contractor, being responsible for the planning and scheduling of construction work, is thus faced...

  16. Distributed Plug-and-Play Planning and Scheduling System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Planning and scheduling (P&S) is an essential task for managing current and future NASA missions. P&S systems are used in many areas of spacecraft operations...

  17. 12 CFR 345.45 - Publication of planned examination schedule.

    Science.gov (United States)

    2010-01-01

    ... STATEMENTS OF GENERAL POLICY COMMUNITY REINVESTMENT Records, Reporting, and Disclosure Requirements § 345.45 Publication of planned examination schedule. The FDIC publishes at least 30 days in advance of the beginning...

  18. Space network scheduling benchmark: A proof-of-concept process for technology transfer

    Science.gov (United States)

    Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy

    1993-01-01

    This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

  19. Stochastic project networks temporal analysis, scheduling and cost minimization

    CERN Document Server

    Neumann, Klaus

    1990-01-01

    Project planning, scheduling, and control are regularly used in business and the service sector of an economy to accomplish outcomes with limited resources under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network techniques CPM and PERT and which represent acyclic weighted directed graphs, are able to describe only projects whose evolution in time is uniquely specified in advance. Here every event of the project is realized exactly once during a single project execution and it is not possible to return to activities previously carried out (that is, no feedback is permitted). Many practical projects, however, do not meet those conditions. Consider, for example, a production process where some parts produced by a machine may be poorly manufactured. If an inspection shows that a part does no...

  20. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

    Full Text Available Reliability and safety in flight is extremely necessary and that depend on the adoption of proper maintenance system. Therefore, it is essential for aircraft maintenance companies to perform the manpower scheduling efficiently. One of the objectives of this paper is to provide an Integer Programming approach to determine the optimal solutions to aircraft maintenance planning and scheduling and hence the planning and scheduling processes can become more efficient and effective. Another objective is to develop a set of computational schedules for maintenance manpower to cover all scheduled flights. In this paper, a sequential methodology consisting of 3 stages is proposed. They are initial maintenance demand schedule, the maintenance pairing and the maintenance group(s assignment. Since scheduling would split up into different stages, different mathematical techniques have been adopted to cater for their own problem characteristics. Microsoft Excel would be used. Results from the first stage and second stage would be inputted into integer programming model using Microsoft Excel Solver to find the optimal solution. Also, Microsoft Excel VBA is used for devising a scheduling system in order to reduce the manual process and provide a user friendly interface. For the results, all can be obtained optimal solution and the computation time is reasonable and acceptable. Besides, the comparison of the peak time and non-peak time is discussed.

  1. Joint opportunistic scheduling and network coding for bidirectional relay channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-07-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users\\' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.

  2. Scheduling and Topology Design in Networks with Directional Antennas

    Science.gov (United States)

    2017-05-19

    Wireless Mesh Networks , IEEE ICC 2006. [7] E. Gelal, et. al., “Topology Management in Directional Antenna-Equipped Ad Hoc Networks , IEEE Trans. Mobile...Scheduling and Topology Design in Networks with Directional Antennas Thomas Stahlbuhk, Nathaniel M. Jones, Brooke Shrader Lincoln Laboratory...Massachusetts Institute of Technology Lexington, Massachusetts 02420–9108 Abstract—In multihop wireless networks equipped with direc- tional antennas, network

  3. WiMax network planning and optimization

    CERN Document Server

    Zhang, Yan

    2009-01-01

    This book offers a comprehensive explanation on how to dimension, plan, and optimize WiMAX networks. The first part of the text introduces WiMAX networks architecture, physical layer, standard, protocols, security mechanisms, and highly related radio access technologies. It covers system framework, topology, capacity, mobility management, handoff management, congestion control, medium access control (MAC), scheduling, Quality of Service (QoS), and WiMAX mesh networks and security. Enabling easy understanding of key concepts and technologies, the second part presents practical examples and illu

  4. Integrated schedule planning with supply-demand interactions

    OpenAIRE

    Atasoy, Bilge; Salani, Matteo; Bierlaire, Michel

    2011-01-01

    We present an integrated schedule planning model where the decisions of schedule design, fleeting and pricing are made simultaneously. Pricing is integrated through a logit demand model where itinerary choice is modeled by defining the utilities of the alternative itineraries. Utilities are explained with the fare price, departure time and number of stops. Spill and recapture effects are incorporated in the model to better represent the demand. For the recapture ratios we use a logit formulat...

  5. Automating Mid- and Long-Range Scheduling for NASA's Deep Space Network

    Science.gov (United States)

    Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Sorensen, Sugi; Tay, Peter; Carruth, Butch; Coffman, Adam; Wallace, Mike

    2012-01-01

    NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system is architected as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users who utilize the DSN (representing 37 projects including international partners and ground-based science and calibration users). The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. S(sup 3) has been used for negotiating schedules since April 2011, including the baseline schedules for three launching missions in late 2011. S(sup 3) supports a distributed scheduling model, in which changes can potentially be made by multiple users based on multiple schedule "workspaces" or versions of the schedule. This has led to several challenges in the design of the scheduling database, and of a change proposal workflow that allows users to concur with or to reject proposed schedule changes, and then counter-propose with alternative or additional suggested changes. This paper describes some key aspects of the S(sup 3) system and lessons learned from its operational deployment to date, focusing on the challenges of multi-user collaborative scheduling in a practical and mission-critical setting. We will also describe the ongoing project to extend S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.

  6. Intelligent Planning and Scheduling for Controlled Life Support Systems

    Science.gov (United States)

    Leon, V. Jorge

    1996-01-01

    Planning in Controlled Ecological Life Support Systems (CELSS) requires special look ahead capabilities due to the complex and long-term dynamic behavior of biological systems. This project characterizes the behavior of CELSS, identifies the requirements of intelligent planning systems for CELSS, proposes the decomposition of the planning task into short-term and long-term planning, and studies the crop scheduling problem as an initial approach to long-term planning. CELSS is studied in the realm of Chaos. The amount of biomass in the system is modeled using a bounded quadratic iterator. The results suggests that closed ecological systems can exhibit periodic behavior when imposed external or artificial control. The main characteristics of CELSS from the planning and scheduling perspective are discussed and requirements for planning systems are given. Crop scheduling problem is identified as an important component of the required long-term lookahead capabilities of a CELSS planner. The main characteristics of crop scheduling are described and a model is proposed to represent the problem. A surrogate measure of the probability of survival is developed. The measure reflects the absolute deviation of the vital reservoir levels from their nominal values. The solution space is generated using a probability distribution which captures both knowledge about the system and the current state of affairs at each decision epoch. This probability distribution is used in the context of an evolution paradigm. The concepts developed serve as the basis for the development of a simple crop scheduling tool which is used to demonstrate its usefulness in the design and operation of CELSS.

  7. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    Science.gov (United States)

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  8. New Scheduling Algorithms for Agile All-Photonic Networks

    Science.gov (United States)

    Mehri, Mohammad Saleh; Ghaffarpour Rahbar, Akbar

    2017-12-01

    An optical overlaid star network is a class of agile all-photonic networks that consists of one or more core node(s) at the center of the star network and a number of edge nodes around the core node. In this architecture, a core node may use a scheduling algorithm for transmission of traffic through the network. A core node is responsible for scheduling optical packets that arrive from edge nodes and switching them toward their destinations. Nowadays, most edge nodes use virtual output queue (VOQ) architecture for buffering client packets to achieve high throughput. This paper presents two efficient scheduling algorithms called discretionary iterative matching (DIM) and adaptive DIM. These schedulers find maximum matching in a small number of iterations and provide high throughput and incur low delay. The number of arbiters in these schedulers and the number of messages exchanged between inputs and outputs of a core node are reduced. We show that DIM and adaptive DIM can provide better performance in comparison with iterative round-robin matching with SLIP (iSLIP). SLIP means the act of sliding for a short distance to select one of the requested connections based on the scheduling algorithm.

  9. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

    Baruch Awerbuch while at MIT, and I thank him for serving on my thesis committee as well. My fellow students Cliff Stein and David Williamson have both...least one processor per operation, this can be done in NC using the edge-coloring algorithm of Lev , Pippinger, and Valiant [84]. We can extend this to...scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990. [84] G. F. Lev , N. Pippenger, and L. G. Valiant. A fast parallel

  10. Scheduled Collision Avoidance in wireless sensor network using Zigbee

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2014-01-01

    Transmission reliability and energy consumptions are two critical concerns associated with wireless sensor network (WSN) design for a long time and continuous operation. With the increase in reliability of the transmission, the energy consumption increases by affecting the efficiency of the network...... of the channel providing efficient energy consumption. It analyses different scheduling schemes to provide an appropriate solution for reducing collisions and improving network lifetime....

  11. Automating Deep Space Network scheduling and conflict resolution

    Science.gov (United States)

    Johnston, Mark D.; Clement, Bradley

    2005-01-01

    The Deep Space Network (DSN) is a central part of NASA's infrastructure for communicating with active space missions, from earth orbit to beyond the solar system. We describe our recent work in modeling the complexities of user requirements, and then scheduling and resolving conflicts on that basis. We emphasize our innovative use of background 'intelligent' assistants' that carry out search asynchrnously while the user is focusing on various aspects of the schedule.

  12. Optimizing the Steel Plate Storage Yard Crane Scheduling Problem Using a Two Stage Planning/Scheduling Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    This paper presents the Steel Plate Storage Yard Crane Scheduling Problem. The task is to generate a schedule for two gantry cranes sharing tracks. The schedule must comply with a number of constraints and at the same time be cost efficient. We propose some ideas for a two stage planning...

  13. 32 CFR 644.8 - Planning and scheduling real estate activities.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 4 2010-07-01 2010-07-01 true Planning and scheduling real estate activities... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling real estate activities. (a) Normal scheduling. (1) The objective of a planned program is to provide for...

  14. Analysis of feeder bus network design and scheduling problems.

    Science.gov (United States)

    Almasi, Mohammad Hadi; Mirzapour Mounes, Sina; Koting, Suhana; Karim, Mohamed Rehan

    2014-01-01

    A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.

  15. Request-Driven Schedule Automation for the Deep Space Network

    Science.gov (United States)

    Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Call, Jared; Mercado, Marisol

    2010-01-01

    The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.

  16. Scheduled Controller Design of Congestion Control Considering Network Resource Constraints

    Science.gov (United States)

    Naito, Hiroyuki; Azuma, Takehito; Fujita, Masayuki

    In this paper, we consider a dynamical model of computer networks and derive a synthesis method for congestion control. First, we show a model of TCP/AQM (Transmission Control Protocol/Active Queue Management) as a dynamical model of computer networks. The dynamical model of TCP/AQM networks consists of models of TCP window size, queue length and AQM mechanisms. Second, we propose to describe the dynamical model of TCP/AQM networks as linear systems with self-scheduling parameters, which also depend on information delay. Here we focus on the constraints on the maximum queue length and TCP window-size, which are the network resources in TCP/AQM networks. We derive TCP/AQM networks as the LPV system (linear parameter varying system) with information delay and self-scheduling parameter. We design a memoryless state feedback controller of the LPV system based on a gain-scheduling method. Finally, the effectiveness of the proposed method is evaluated by using MATLAB and the well-known ns-2 (Network Simulator Ver.2) simulator.

  17. Flowshop Scheduling Using a Network Approach | Oladeinde ...

    African Journals Online (AJOL)

    In this paper, a network based formulation of a permutation flow shop problem is presented. Two nuances of flow shop problems with different levels of complexity are solved using different approaches to the linear programming formulation. Key flow shop parameters inclosing makespan of the flow shop problems were ...

  18. Refinery production planning and scheduling: the refining core business

    Directory of Open Access Journals (Sweden)

    M. Joly

    2012-06-01

    Full Text Available Intelligent production planning and scheduling are of paramount importance to ensure refinery profitability, logistic reliability and safety at the local and corporate levels. In Brazil, such activities play a particularly critical role, since the Brazilian downstream model is moving towards a demand-driven model rather than a supply-driven one. Moreover, new and specialized non-linear constraints are continuously being incorporated into these large-scale problems: increases in oil prices implying the need for processing poor quality crudes, increasing demand and new demand patterns for petroleum products, new stringent environmental regulations related to clean fuels and start-up of new production technologies embedded into more complex refining schemes. This paper aims at clarifying the central role of refinery planning and scheduling activities in the Petrobras refining business. Major past and present results are outlined and corporate long-term strategies to deal with present and future challenges are presented.

  19. Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network

    Directory of Open Access Journals (Sweden)

    Kazuhiko Hiramoto

    2018-01-01

    Full Text Available We propose an adaptive gain scheduled semiactive control method using an artificial neural network for structural systems subject to earthquake disturbance. In order to design a semiactive control system with high control performance against earthquakes with different time and/or frequency properties, multiple semiactive control laws with high performance for each of multiple earthquake disturbances are scheduled with an adaptive manner. Each semiactive control law to be scheduled is designed based on the output emulation approach that has been proposed by the authors. As the adaptive gain scheduling mechanism, we introduce an artificial neural network (ANN. Input signals of the ANN are the measured earthquake disturbance itself, for example, the acceleration, velocity, and displacement. The output of the ANN is the parameter for the scheduling of multiple semiactive control laws each of which has been optimized for a single disturbance. Parameters such as weight and bias in the ANN are optimized by the genetic algorithm (GA. The proposed design method is applied to semiactive control design of a base-isolated building with a semiactive damper. With simulation study, the proposed adaptive gain scheduling method realizes control performance exceeding single semiactive control optimizing the average of the control performance subject to various earthquake disturbances.

  20. Planning and Scheduling at ASD - A Review and Preliminary Assessment.

    Science.gov (United States)

    1980-12-01

    at a sumnary level, the quality of the planning and scheduling support that is necessary including the CMD/AFPRO support? Ten other questions are asked...planni% prescrcbes an approach and input 4dta, the analytical apprnach will be dependent upon the quality and quantity of availablc Gata. IT is highly... Contril organizations. The functions and respon- sibilities listed in this policy letter represent a minimum level of performance that must be met by all

  1. Planning and scheduling for petroleum refineries using mathematical programming

    Directory of Open Access Journals (Sweden)

    Joly M.

    2002-01-01

    Full Text Available The objective of this paper is the development and solution of nonlinear and mixed-integer (MIP optimization models for real-world planning and scheduling problems in petroleum refineries. Firstly, we present a nonlinear planning model that represents a general refinery topology and allows implementation of nonlinear process models as well as blending relations. The optimization model is able to define new operating points, thus increasing the production of the more valuable products and simultaneously satisfying all specification constraints. The second part addresses scheduling problems in oil refineries, which are formulated as MIP optimization models and rely on both continuous and discrete time representations. Three practical applications closely related to the current refinery scenario are presented. The first one addresses the problem of crude oil inventory management of a refinery that receives several types of crude oil delivered exclusively by a single oil pipeline. Subsequently, two optimization models intended to define the optimal production policy, inventory control and distribution are proposed and solved for the fuel oil and asphalt plant. Finally, the planning model of Moro et al. (1998 is extended in order to sequence decisions at the scheduling level in the liquefied petroleum gas (LPG area for maximization of the production of petrochemical-grade propane and product delivery.

  2. Automatic Scheduling and Planning (ASAP) in future ground control systems

    Science.gov (United States)

    Matlin, Sam

    1988-01-01

    This report describes two complementary approaches to the problem of space mission planning and scheduling. The first is an Expert System or Knowledge-Based System for automatically resolving most of the activity conflicts in a candidate plan. The second is an Interactive Graphics Decision Aid to assist the operator in manually resolving the residual conflicts which are beyond the scope of the Expert System. The two system designs are consistent with future ground control station activity requirements, support activity timing constraints, resource limits and activity priority guidelines.

  3. Optimal Sensor Networks Scheduling in Identification of Distributed Parameter Systems

    CERN Document Server

    Patan, Maciej

    2012-01-01

    Sensor networks have recently come into prominence because they hold the potential to revolutionize a wide spectrum of both civilian and military applications. An ingenious characteristic of sensor networks is the distributed nature of data acquisition. Therefore they seem to be ideally prepared for the task of monitoring processes with spatio-temporal dynamics which constitute one of most general and important classes of systems in modelling of the real-world phenomena. It is clear that careful deployment and activation of sensor nodes are critical for collecting the most valuable information from the observed environment. Optimal Sensor Network Scheduling in Identification of Distributed Parameter Systems discusses the characteristic features of the sensor scheduling problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, especially dedicated for networks with mobile and scanning nodes. Both researchers and practitioners will find the case studies, the proposed al...

  4. Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xi Jin

    2016-08-01

    Full Text Available Wireless sensor networks (WSNs have been widely used in industrial systems. Their real-time performance and reliability are fundamental to industrial production. Many works have studied the two aspects, but only focus on single criticality WSNs. Mixed criticality requirements exist in many advanced applications in which different data flows have different levels of importance (or criticality. In this paper, first, we propose a scheduling algorithm, which guarantees the real-time performance and reliability requirements of data flows with different levels of criticality. The algorithm supports centralized optimization and adaptive adjustment. It is able to improve both the scheduling performance and flexibility. Then, we provide the schedulability test through rigorous theoretical analysis. We conduct extensive simulations, and the results demonstrate that the proposed scheduling algorithm and analysis significantly outperform existing ones.

  5. Particle swarm optimization based space debris surveillance network scheduling

    Science.gov (United States)

    Jiang, Hai; Liu, Jing; Cheng, Hao-Wen; Zhang, Yao

    2017-02-01

    The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.

  6. Scheduling Data Access in Smart Grid Networks Utilizing Context Information

    DEFF Research Database (Denmark)

    Findrik, Mislav; Grønbæk, Jesper; Olsen, Rasmus Løvenstein

    2014-01-01

    managing this fast flexibility requires two-way data exchange between a controller and sensors/meters via communication networks. In this paper we investigated scheduling of data collection utilizing meta-data from sensors that are describing dynamics of information. We show the applicability...... of this approach for a constraint communication networks of the smart grid and compared three general data access mechanisms, namely, push, pull and event-based....

  7. Interval algebra - an effective means of scheduling surveillance radar networks

    CSIR Research Space (South Africa)

    Focke, RW

    2015-05-01

    Full Text Available Interval Algebra provides an effective means to schedule surveillance radar networks, as it is a temporal ordering constraint language. Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion...

  8. A Light-Weight Statically Scheduled Network-on-Chip

    DEFF Research Database (Denmark)

    Sørensen, Rasmus Bo; Schoeberl, Martin; Sparsø, Jens

    2012-01-01

    This paper investigates how a light-weight, statically scheduled network-on-chip (NoC) for real-time systems can be designed and implemented. The NoC provides communication channels between all cores with equal bandwidth and latency. The design is FPGA-friendly and consumes a minimum of resources...

  9. Improving Dense Network Performance through Centralized Scheduling and Interference Coordination

    DEFF Research Database (Denmark)

    Lopez, Victor Fernandez; Pedersen, Klaus I.; Alvarez, Beatriz Soret

    2017-01-01

    and the receiver sides. As a network coordination scheme, we apply a centralized joint cell association and scheduling mechanism based on dynamic cell switching, by which users are not always served by the strongest perceived cell. The method simultaneously resultsin more balanced loads and increased performance...

  10. Optimal server scheduling in hybrid P2P networks

    NARCIS (Netherlands)

    B. Zhang (Bo); S.C. Borst (Sem); M.I. Reiman

    2010-01-01

    htmlabstractWe consider the server scheduling problem in hybrid P2P networks in the context of a fluid model. Specifically, we examine how to allocate the limited amount of server upload capacity among competing swarms over time in order to optimize the download performance experienced by users. For

  11. MAC Scheduling in Large-scale Underwater Acoustic Networks

    NARCIS (Netherlands)

    van Kleunen, W.A.P.; Meratnia, Nirvana; Havinga, Paul J.M.

    2011-01-01

    The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Scheduling allows reducing the effects of long propagation delay of the acoustic signal and has significant impacts on throughput, energy

  12. GCF: Green Conflict Free TDMA Scheduling for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Pawar, Pranav M.; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

    2012-01-01

    The last few years have seen the promising growth in the application of wireless sensor networks (WSNs). The contribution of this paper is on a cluster-based time division multiple access (TDMA) scheduling algorithm to improve the performance of WSN applications in terms of energy efficiency, delay...

  13. Automating Mid- and Long-Range Scheduling for the NASA Deep Space Network

    Science.gov (United States)

    Johnston, Mark D.; Tran, Daniel

    2012-01-01

    NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system was designed and deployed as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users of the DSN. These users represent not only NASA's deep space missions, but also international partners and ground-based science and calibration users. The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. This paper describes some key aspects of the S(sup 3) system and on the challenges of modeling complex scheduling requirements and the ongoing extension of S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.

  14. Schedule-based sequential localization in asynchronous wireless networks

    Science.gov (United States)

    Zachariah, Dave; De Angelis, Alessio; Dwivedi, Satyam; Händel, Peter

    2014-12-01

    In this paper, we consider the schedule-based network localization concept, which does not require synchronization among nodes and does not involve communication overhead. The concept makes use of a common transmission sequence, which enables each node to perform self-localization and to localize the entire network, based on noisy propagation-time measurements. We formulate the schedule-based localization problem as an estimation problem in a Bayesian framework. This provides robustness with respect to uncertainty in such system parameters as anchor locations and timing devices. Moreover, we derive a sequential approximate maximum a posteriori (AMAP) estimator. The estimator is fully decentralized and copes with varying noise levels. By studying the fundamental constraints given by the considered measurement model, we provide a system design methodology which enables a scalable solution. Finally, we evaluate the performance of the proposed AMAP estimator by numerical simulations emulating an impulse-radio ultra-wideband (IR-UWB) wireless network.

  15. A NOVEL QOS SCHEDULING FOR WIRELESS BROADBAND NETWORKS

    Directory of Open Access Journals (Sweden)

    D. David Neels Pon Kumar

    2010-09-01

    Full Text Available During the last few years, users all over the world have become more and more familiar to the availability of broadband access. When users want broadband Internet service, they are generally restricted to a DSL (Digital Subscribers Line, or cable-modem-based connection. Proponents are advocating worldwide interoperability for microwave access (WiMAX, a technology based on an evolving standard for point-to multipoint wireless networking. Scheduling algorithms that support Quality of Service (QoS differentiation and guarantees for wireless data networks are crucial to the deployment of broadband wireless networks. The performance affecting parameters like fairness, bandwidth allocation, throughput, latency are studied and found out that none of the conventional algorithms perform effectively for both fairness and bandwidth allocation simultaneously. Hence it is absolutely essential for an efficient scheduling algorithm with a better trade off for these two parameters. So we are proposing a novel Scheduling Algorithm using Fuzzy logic and Artificial neural networks that addresses these aspects simultaneously. The initial results show that a fair amount of fairness is attained while keeping the priority intact. Results also show that maximum channel utilization is achieved with a negligible increment in processing time.

  16. On the Complexity of Scheduling in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Sharma Gaurav

    2010-01-01

    Full Text Available We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of -hop interference models, under which no two links within a -hop distance can successfully transmit at the same time. For a given , we can obtain a throughput-optimal scheduling policy by solving the well-known maximum weighted matching problem. We show that for , the resulting problems are NP-Hard that cannot be approximated within a factor that grows polynomially with the number of nodes. Interestingly, for geometric unit-disk graphs that can be used to describe a wide range of wireless networks, the problems admit polynomial time approximation schemes within a factor arbitrarily close to 1. In these network settings, we also show that a simple greedy algorithm can provide a 49-approximation, and the maximal matching scheduling policy, which can be easily implemented in a distributed fashion, achieves a guaranteed fraction of the capacity region for "all ." The geometric constraints are crucial to obtain these throughput guarantees. These results are encouraging as they suggest that one can develop low-complexity distributed algorithms to achieve near-optimal throughput for a wide range of wireless networks.

  17. Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation

    CERN Document Server

    Yang, Jing; Draper, Stark C

    2011-01-01

    In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a packet can be decoded within a single slot, the system can accumulate information across multiple slots, eventually decoding the packet. The result is an expanded stability region. The accumulation process over weak links is temporally coupled and therefore does not satisfy the independent and identically distributed (i.i.d) assumption that underlies many previous analysis in this area. Therefore the problem setting also poses new analytic challenges. We propose two dynamic scheduling algorithms to cope with the non-i.i.d nature of the decoding. The first performs scheduling every $T$ slots, and approaches the boundary of the stability region as $T$ gets large, but at the cost of increased average delay. The second introduces virtual queues for eac...

  18. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (United States)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

  19. Overcoming barriers to scheduling embedded generation to support distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Wright, A.J.; Formby, J.R.

    2000-07-01

    Current scheduling of embedded generation for distribution in the UK is limited and patchy. Some DNOs actively schedule while others do none. The literature on the subject is mainly about accommodating volatile wind output, and optimising island systems, for both cost of supply and network stability. The forthcoming NETA will lower prices, expose unpredictable generation to imbalance markets and could introduce punitive constraint payments on DNOs, but at the same time create a dynamic market for both power and ancillary services from embedded generators. Most renewable generators either run as base load (e.g. waste ) or according to the vagaries of the weather (e.g. wind, hydro), so offer little scope for scheduling other than 'off'. CHP plant is normally heat- led for industrial processes or building needs, but supplementary firing or thermal storage often allow considerable scope for scheduling. Micro-CHP with thermal storage could provide short-term scheduling, but tends to be running anyway during the evening peak. Standby generation appears to be ideal for scheduling, but in practice operators may be unwilling to run parallel with the network, and noise and pollution problems may preclude frequent operation. Statistical analysis can be applied to calculate the reliability of several generators compared to one; with a large number of generators such as micro-CHP reliability of a proportion of load is close to unity. The type of communication for generation used will depend on requirements for bandwidth, cost, reliability and whether it is bundled with other services. With high levels of deeply embedded, small-scale generation using induction machines, voltage control and black start capability will become important concerns on 11 kV and LV networks. This will require increased generation monitoring and remote control of switchgear. Examples of cost benefits from scheduling are given, including deferred reinforcement, increased exports on non

  20. AN OVERVIEW OF THE ADVANCED PLANNING AND SCHEDULING SYSTEMS

    Directory of Open Access Journals (Sweden)

    Thales Botelho de Sousa

    2014-12-01

    Full Text Available Currently, the activities of the planning and control of companies are becoming increasingly complex and the managers of this area are constantly pressured to reduce operating costs, maintain inventories at adequate levels, to fully meet the demand of customers, and to respond effectively to changes that occur. The planning and scheduling task is important for most companies, so according to some authors, there is a need for further analysis of the practical use of production planning and control systems. Within the context of production planning and control systems development, in the 1990s were launched the APS systems, which represent an innovation when compared to their predecessors. This paper intended to provide through a literature review, the concepts, structure, capabilities, implementation process and benefits of using APS systems in the companies production planning and control. The main contribution of this research is to show a strong conceptual understanding regarding APS systems, which can be used as a solid theoretical reference for future researches.

  1. A planning and scheduling system for the LHC project

    CERN Document Server

    Bachy, Gérard; Tarrant, M

    1995-01-01

    The purpose of this paper is to present modern ways to manage time, resources and progress in a large-scale project. Over the last ten years, new project management techniques and tools have appeared such as concurrent engineering, Continuous Acquisition Lifecycle Support (CALS) and Engineering Data Management System (EDMS). The world downturn of the early 90s influenced project management: increasing constraints on time and budget and more external direction on spending that, for example, requires sophisticated sub-contracting practises. However, the evolution of the software and hardware market makes project control tools cheaper and easier to use. All project groups want to have their scope of work considered as complete projects and to control them themselves. This has several consequences on project staff behaviour concerning project control, and has to be taken into account in every planning process designed today. The system described will be at the heart of the planning and scheduling procedures issue...

  2. A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

    KAUST Repository

    Elwhishi, Ahmed

    2013-05-01

    Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.

  3. ECS: Efficient Communication Scheduling for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Lu Hong

    2011-03-01

    Full Text Available TDMA protocols have attracted a lot of attention for underwater acoustic sensor networks (UWSNs, because of the unique characteristics of acoustic signal propagation such as great energy consumption in transmission, long propagation delay and long communication range. Previous TDMA protocols all allocated transmission time to nodes based on discrete time slots. This paper proposes an efficient continuous time scheduling TDMA protocol (ECS for UWSNs, including the continuous time based and sender oriented conflict analysis model, the transmission moment allocation algorithm and the distributed topology maintenance algorithm. Simulation results confirm that ECS improves network throughput by 20% on average, compared to existing MAC protocols.

  4. ECS: efficient communication scheduling for underwater sensor networks.

    Science.gov (United States)

    Hong, Lu; Hong, Feng; Guo, Zhongwen; Li, Zhengbao

    2011-01-01

    TDMA protocols have attracted a lot of attention for underwater acoustic sensor networks (UWSNs), because of the unique characteristics of acoustic signal propagation such as great energy consumption in transmission, long propagation delay and long communication range. Previous TDMA protocols all allocated transmission time to nodes based on discrete time slots. This paper proposes an efficient continuous time scheduling TDMA protocol (ECS) for UWSNs, including the continuous time based and sender oriented conflict analysis model, the transmission moment allocation algorithm and the distributed topology maintenance algorithm. Simulation results confirm that ECS improves network throughput by 20% on average, compared to existing MAC protocols.

  5. Enhancement of a model for Large-scale Airline Network Planning Problems

    NARCIS (Netherlands)

    Kölker, K.; Lopes dos Santos, B.F.; Lütjens, K.

    2016-01-01

    The main focus of this study is to solve the network planning problem based on passenger decision criteria including the preferred departure time and travel time for a real-sized airline network. For this purpose, a model of the integrated network planning problem is formulated including scheduling

  6. Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

    Science.gov (United States)

    Stottler, D.

    There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

  7. Incorporating High-Speed, Optimizing, Interleaving, Configurable/Composable Scheduling into NASA's EUROPA Planning Architecture Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Advanced, robust, autonomous planning systems have not focused on the scheduling decisions made by the planner. And high quality, optimizing schedulers have rarely...

  8. The Planning and Scheduling of HST: Improvements and Enhancements since Launch

    Science.gov (United States)

    Taylor, D. K.; Chance, D. R.; Jordan, I. J. E.; Patterson, A. P.; Stanley, M.; Taylor, D. C.

    2001-12-01

    The planning and scheduling (P&S) systems used in operating the Hubble Space Telescope (HST) have undergone such substantial and pervasive re-engineering that today they dimly resemble those used when HST was launched. Processes (i.e., software, procedures, networking, etc.) which allow program implementation, the generation of a Long Range Plan (LRP), and the scheduling of science and mission activities have improved drastically in nearly 12 years, resulting in a consistently high observing efficiency, a stable LRP that principal investigators can use, exceptionally clean command loads uplinked to the spacecraft, and the capability of a very fast response time due to onboard anomalies or targets of opportunity. In this presentation we describe many of the systems which comprise the P&S ("front-end") system for HST, how and why they were improved, and what benefits have been realized by either the HST user community or the STScI staff. The systems include the Guide Star System, the Remote Proposal Submission System - 2 (RPS2), Artificial Intelligence (AI) planning tools such as Spike, and the science and mission scheduling software. We also describe how using modern software languages such as Python and better development practices allow STScI staff to do more with HST (e.g., to handle much more science data when ACS is installed) without increasing the cost to HST operations.

  9. Optimal Workflow Scheduling in Critical Infrastructure Systems with Neural Networks

    Directory of Open Access Journals (Sweden)

    S. Vukmirović

    2012-04-01

    Full Text Available Critical infrastructure systems (CISs, such as power grids, transportation systems, communication networks and water systems are the backbone of a country’s national security and industrial prosperity. These CISs execute large numbers of workflows with very high resource requirements that can span through different systems and last for a long time. The proper functioning and synchronization of these workflows is essential since humanity’s well-being is connected to it. Because of this, the challenge of ensuring availability and reliability of these services in the face of a broad range of operating conditions is very complicated. This paper proposes an architecture which dynamically executes a scheduling algorithm using feedback about the current status of CIS nodes. Different artificial neural networks (ANNs were created in order to solve the scheduling problem. Their performances were compared and as the main result of this paper, an optimal ANN architecture for workflow scheduling in CISs is proposed. A case study is shown for a meter data management system with measurements from a power distribution management system in Serbia. Performance tests show that significant improvement of the overall execution time can be achieved by ANNs.

  10. Engineering Algorithms for Route Planning in Multimodal Transportation Networks

    OpenAIRE

    Dibbelt, Julian Matthias

    2016-01-01

    Practical algorithms for route planning in transportation networks are a showpiece of successful Algorithm Engineering. This has produced many speedup techniques, varying in preprocessing time, space, query performance, simplicity, and ease of implementation. This thesis explores solutions to more realistic scenarios, taking into account, e.g., traffic, user preferences, public transit schedules, and the options offered by the many modalities of modern transportation networks.

  11. Comparison of Different Approaches to the Cutting Plan Scheduling

    Directory of Open Access Journals (Sweden)

    Peter Bober

    2011-10-01

    Full Text Available Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial optimization problem. In this respect, various approaches and methods are used to arrive to a viable solution. The paper reports three approaches represented by three discreet optimization methods. The first one is back-tracing algorithm and serves as a reference to verify functionality of the other two ones. The second method is optimization using genetic algorithms, and the third one presents heuristic approach to optimization based on anticipated properties of an optimal solution. Research results indicate that genetic algorithms are demanding to calculate though not dependant on the selected objective function. Heuristic algorithm is fast but dependant upon anticipated properties of the optimal solution. Hence, at change of the objective function it has to be changed. When the scheduling by genetic algorithms is solvable in a sufficiently short period of time, it is more appropriate from the practical point than the heuristic algorithm. The back-tracing algorithm usually does not provide a result in a feasible period of time.

  12. INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2015-02-01

    Full Text Available The specificity of the yard work requires the particularly careful treatment of the issues of scheduling and budgeting in the production planning processes. The article presents the method of analysis of the assembly sequence taking into account the duration of individual activities and the demand for resources. A method of the critical path and resource budgeting were used. Modelling of the assembly was performed using the acyclic graphs. It has been shown that the assembly sequences can have very different feasible budget regions. The proposed model is applied to the assembly processes of large-scale welded structures, including the hulls of ships. The presented computational examples have a simulation character. They show the usefulness of the model and the possibility to use it in a variety of analyses.

  13. Opportunistic scheduling policies for improved throughput guarantees in wireless networks

    Directory of Open Access Journals (Sweden)

    Hassel Vegard

    2011-01-01

    Full Text Available Abstract Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. In this article, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise ratios are known, we find the solution to this problem for users with different channel quality distributions, for both the scenario where all the users have the same throughput guarantees, and the scenario where all the users have different throughput guarantees. Based on these solutions, we also propose two simple and low complexity adaptive scheduling algorithms that perform significantly better than other well-known scheduling algorithms. We further develop an expression for the approximate throughput guarantee violation probability for users in time-slotted networks with the given cumulants of the distribution of bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window.

  14. Automated scheduling and planning from theory to practice

    CERN Document Server

    Ozcan, Ender; Urquhart, Neil

    2013-01-01

      Solving scheduling problems has long presented a challenge for computer scientists and operations researchers. The field continues to expand as researchers and practitioners examine ever more challenging problems and develop automated methods capable of solving them. This book provides 11 case studies in automated scheduling, submitted by leading researchers from across the world. Each case study examines a challenging real-world problem by analysing the problem in detail before investigating how the problem may be solved using state of the art techniques.The areas covered include aircraft scheduling, microprocessor instruction scheduling, sports fixture scheduling, exam scheduling, personnel scheduling and production scheduling.  Problem solving methodologies covered include exact as well as (meta)heuristic approaches, such as local search techniques, linear programming, genetic algorithms and ant colony optimisation.The field of automated scheduling has the potential to impact many aspects of our lives...

  15. Schedule for the update of CERN telephone network

    CERN Document Server

    2003-01-01

    The continuation of ours tasks to update the network is scheduled as follows: May 12 Update of switch N7: Bldg. 39 and 40 We would like to remind you that disturbances or even interruptions of telephony services may occur from 18:30 to 00:00 on the above mentioned dates. CERN divisions are invited to avoid any change requests (set-ups, move or removals) of telephones and fax machines until 12th May. Should you need more details, please send us your questions by email to Standard.Telephone@cern.ch.

  16. Telecommunications network modelling, planning and design

    CERN Document Server

    Evans, Sharon

    2003-01-01

    Telecommunication Network Modelling, Planning and Design addresses sophisticated modelling techniques from the perspective of the communications industry and covers some of the major issues facing telecommunications network engineers and managers today. Topics covered include network planning for transmission systems, modelling of SDH transport network structures and telecommunications network design and performance modelling, as well as network costs and ROI modelling and QoS in 3G networks.

  17. Multiresolution Network Temporal and Spatial Scheduling Model of Scenic Spot

    Directory of Open Access Journals (Sweden)

    Peng Ge

    2013-01-01

    Full Text Available Tourism is one of pillar industries of the world economy. Low-carbon tourism will be the mainstream direction of the scenic spots' development, and the ω path of low-carbon tourism development is to develop economy and protect environment simultaneously. However, as the tourists' quantity is increasing, the loads of scenic spots are out of control. And the instantaneous overload in some spots caused the image phenomenon of full capacity of the whole scenic spot. Therefore, realizing the real-time schedule becomes the primary purpose of scenic spot’s management. This paper divides the tourism distribution system into several logically related subsystems and constructs a temporal and spatial multiresolution network scheduling model according to the regularity of scenic spots’ overload phenomenon in time and space. It also defines dynamic distribution probability and equivalent dynamic demand to realize the real-time prediction. We define gravitational function between fields and takes it as the utility of schedule, after resolving the transportation model of each resolution, it achieves hierarchical balance between demand and capacity of the system. The last part of the paper analyzes the time complexity of constructing a multiresolution distribution system.

  18. Scheduling for Emergency Tasks in Industrial Wireless Sensor Networks

    Science.gov (United States)

    Xia, Changqing; Kong, Linghe; Zeng, Peng

    2017-01-01

    Wireless sensor networks (WSNs) are widely applied in industrial manufacturing systems. By means of centralized control, the real-time requirement and reliability can be provided by WSNs in industrial production. Furthermore, many approaches reserve resources for situations in which the controller cannot perform centralized resource allocation. The controller assigns these resources as it becomes aware of when and where accidents have occurred. However, the reserved resources are limited, and such incidents are low-probability events. In addition, resource reservation may not be effective since the controller does not know when and where accidents will actually occur. To address this issue, we improve the reliability of scheduling for emergency tasks by proposing a method based on a stealing mechanism. In our method, an emergency task is transmitted by stealing resources allocated to regular flows. The challenges addressed in our work are as follows: (1) emergencies occur only occasionally, but the industrial system must deliver the corresponding flows within their deadlines when they occur; (2) we wish to minimize the impact of emergency flows by reducing the number of stolen flows. The contributions of this work are two-fold: (1) we first define intersections and blocking as new characteristics of flows; and (2) we propose a series of distributed routing algorithms to improve the schedulability and to reduce the impact of emergency flows. We demonstrate that our scheduling algorithm and analysis approach are better than the existing ones by extensive simulations. PMID:28726738

  19. Experimental demonstration of interference avoidance protocol (transmission scheduling) in O-CDMA networks.

    Science.gov (United States)

    Saghari, Poorya; Kamath, P; Arbab, Vahid R; Haghi, Mahta; Willner, Alan E; Bannister, Joe A; Touch, Joe D

    2007-12-10

    We experimentally demonstrate a transmission scheduling algorithm to avoid congestion collapse in O-CDMA networks. Our result shows that transmission scheduling increases the performance of the system by orders of magnitude.

  20. Network evolution of body plans.

    Directory of Open Access Journals (Sweden)

    Koichi Fujimoto

    Full Text Available One of the major goals in evolutionary developmental biology is to understand the relationship between gene regulatory networks and the diverse morphologies and their functionalities. Are the diversities solely triggered by random events, or are they inevitable outcomes of an interplay between evolving gene networks and natural selection? Segmentation in arthropod embryogenesis represents a well-known example of body plan diversity. Striped patterns of gene expression that lead to the future body segments appear simultaneously or sequentially in long and short germ-band development, respectively. Moreover, a combination of both is found in intermediate germ-band development. Regulatory genes relevant for stripe formation are evolutionarily conserved among arthropods, therefore the differences in the observed traits are thought to have originated from how the genes are wired. To reveal the basic differences in the network structure, we have numerically evolved hundreds of gene regulatory networks that produce striped patterns of gene expression. By analyzing the topologies of the generated networks, we show that the characteristics of stripe formation in long and short germ-band development are determined by Feed-Forward Loops (FFLs and negative Feed-Back Loops (FBLs respectively, and those of intermediate germ-band development are determined by the interconnections between FFL and negative FBL. Network architectures, gene expression patterns and knockout responses exhibited by the artificially evolved networks agree with those reported in the fly Drosophila melanogaster and the beetle Tribolium castaneum. For other arthropod species, principal network architectures that remain largely unknown are predicted. Our results suggest that the emergence of the three modes of body segmentation in arthropods is an inherent property of the evolving networks.

  1. A Network Scheduling Model for Distributed Control Simulation

    Science.gov (United States)

    Culley, Dennis; Thomas, George; Aretskin-Hariton, Eliot

    2016-01-01

    Distributed engine control is a hardware technology that radically alters the architecture for aircraft engine control systems. Of its own accord, it does not change the function of control, rather it seeks to address the implementation issues for weight-constrained vehicles that can limit overall system performance and increase life-cycle cost. However, an inherent feature of this technology, digital communication networks, alters the flow of information between critical elements of the closed-loop control. Whereas control information has been available continuously in conventional centralized control architectures through virtue of analog signaling, moving forward, it will be transmitted digitally in serial fashion over the network(s) in distributed control architectures. An underlying effect is that all of the control information arrives asynchronously and may not be available every loop interval of the controller, therefore it must be scheduled. This paper proposes a methodology for modeling the nominal data flow over these networks and examines the resulting impact for an aero turbine engine system simulation.

  2. Stochastic Optimization for Network-Constrained Power System Scheduling Problem

    Directory of Open Access Journals (Sweden)

    D. F. Teshome

    2015-01-01

    Full Text Available The stochastic nature of demand and wind generation has a considerable effect on solving the scheduling problem of a modern power system. Network constraints such as power flow equations and transmission capacities also need to be considered for a comprehensive approach to model renewable energy integration and analyze generation system flexibility. Firstly, this paper accounts for the stochastic inputs in such a way that the uncertainties are modeled as normally distributed forecast errors. The forecast errors are then superimposed on the outputs of load and wind forecasting tools. Secondly, it efficiently models the network constraints and tests an iterative algorithm and a piecewise linear approximation for representing transmission losses in mixed integer linear programming (MILP. It also integrates load shedding according to priority factors set by the system operator. Moreover, the different interactions among stochastic programming, network constraints, and prioritized load shedding are thoroughly investigated in the paper. The stochastic model is tested on a power system adopted from Jeju Island, South Korea. Results demonstrate the impact of wind speed variability and network constraints on the flexibility of the generation system. Further analysis shows the effect of loss modeling approaches on total cost, accuracy, computational time, and memory requirement.

  3. Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Heuristic

    OpenAIRE

    Dohn, Anders; Clausen, Jens

    2010-01-01

    Abstract In this paper, we present the Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem considered here is concerned with the generation of schedules for these cranes. The problem is decomposed and modeled in two parts, namely a planning problem and a scheduling proble...

  4. Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty

    NARCIS (Netherlands)

    Sel, Çağrı; Bilgen, Bilge; Bloemhof-Ruwaard, Jacqueline

    2017-01-01

    In the dairy processing, the rapid quality decay of milk-based intermediate mixture to make and pack restricts productivity and, forces organizations to carefully plan and schedule their production. Hereby, in this study, we consider a planning and scheduling problem encountered in the dairy

  5. Effects of Port Congestion in the Gate Control List Scheduling of Time Sensitive Networks

    DEFF Research Database (Denmark)

    Kentis, Angelos Mimidis; Berger, Michael Stübert; Soler, José

    Time Sensitive Networking (TSN) can provide deterministic traffic behavior over Ethernet networks, for time sensitive traffic, whilst also bound the delay/jitter. To do so, the IEEE TSN working group introduced a network-wide transmission port scheduling mechanism. The duration of this schedule...

  6. New schedule for the update of CERN telephone network

    CERN Multimedia

    2003-01-01

    The continuation of ours tasks to update the network is scheduled as follows: Date Change type Affected area April 28 Update of switch in LHC 1 LHC 1 Point April 29 Update of switch in LHC 5 LHC 5 Point May 6 Update of switch N4 Meyrin Ouest May 8 Update of switch N6 Prévessin Site May 12 Update of switch N7 Building 39 and 40 We would like to remind you that disturbances or even interruptions of telephony services may occur from 18:30 to 00:00 on the above mentioned dates. CERN divisions are invited to avoid any change requests (set-ups, move or removals) of telephones and fax machines until 12th May. Should you need more details, please send us your questions by email to Standard.Telephone@cern.ch.

  7. New schedule for the update of CERN telephone network

    CERN Multimedia

    2003-01-01

    The continuation of ours tasks to update the network is scheduled as follows: Date Change type Affected area May 6 Update of switch N4 Meyrin Ouest May 8 Update of switch N6 Prévessin Site May 12 Update of switch N7 Building 39 and 40 We would like to remind you that disturbances or even interruptions of telephony services may occur from 18:30 to 00:00 on the above mentioned dates. CERN divisions are invited to avoid any change requests (set-ups, move or removals) of telephones and fax machines until 12th May. Should you need more details, please send us your questions by email to Standard.Telephone@cern.ch.

  8. A Message-Passing Algorithm for Wireless Network Scheduling.

    Science.gov (United States)

    Paschalidis, Ioannis Ch; Huang, Fuzhuo; Lai, Wei

    2015-10-01

    We consider scheduling in wireless networks and formulate it as Maximum Weighted Independent Set (MWIS) problem on a "conflict" graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully distributed algorithm that yields high-quality feasible solutions. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing. The first phase solves a relaxation of the MWIS problem using a gradient projection method. The relaxation we consider is tighter than the simple linear programming relaxation and incorporates constraints on all cliques in the graph. The second phase of the algorithm starts from the solution of the relaxation and constructs a feasible solution to the MWIS problem. We show that our algorithm always outputs an optimal solution to the MWIS problem for perfect graphs. Simulation results compare our policies against Carrier Sense Multiple Access (CSMA) and other alternatives and show excellent performance.

  9. Dynamic Vehicle Scheduling for Working Service Network with Dual Demands

    Directory of Open Access Journals (Sweden)

    Bing Li

    2017-01-01

    Full Text Available This study aims to develop some models to aid in making decisions on the combined fleet size and vehicle assignment in working service network where the demands include two types (minimum demands and maximum demands, and vehicles themselves can act like a facility to provide services when they are stationary at one location. This type of problem is named as the dynamic working vehicle scheduling with dual demands (DWVS-DD and formulated as a mixed integer programming (MIP. Instead of a large integer program, the problem is decomposed into small local problems that are guided by preset control parameters. The approach for preset control parameters is given. By introducing them into the MIP formulation, the model is reformulated as a piecewise form. Further, a piecewise method by updating preset control parameters is proposed for solving the reformulated model. Numerical experiments show that the proposed method produces better solution within reasonable computing time.

  10. Effects of Port Congestion in the Gate Control List Scheduling of Time Sensitive Networks

    DEFF Research Database (Denmark)

    Kentis, Angelos Mimidis; Berger, Michael Stübert; Soler, José

    2017-01-01

    is directly related with the delay; hence reducing it can be beneficial within the TSN paradigm. This paper investigates the effects of port congestion, in the duration of the network wide schedule. A congested port can make scheduling more complex, leading to longer network-wide schedules. To verify this......, the same set of experiments was repeated, with and without considering port congestion during path allocation. The computed paths were given as input to an implementation of the shifting bottleneck heuristic algorithm. The shifting bottleneck heuristic, computed the network-wide gating schedule...

  11. A Systematic, Automated Network Planning Method

    DEFF Research Database (Denmark)

    Holm, Jens Åge; Pedersen, Jens Myrup

    2006-01-01

    This paper describes a case study conducted to evaluate the viability of a systematic, automated network planning method. The motivation for developing the network planning method was that many data networks are planned in an adhoc manner with no assurance of quality of the solution with respect...... to consistency and long-term characteristics. The developed method gives significant improvements on these parameters. The case study was conducted as a comparison between an existing network where the traffic was known and a proposed network designed by the developed method. It turned out that the proposed...... network performed better than the existing network with regard to the performance measurements used which reflected how well the traffic was routed in the networks and the cost of establishing the networks. Challenges that need to be solved before the developed method can be used to design network...

  12. SLS-PLAN-IT: A knowledge-based blackboard scheduling system for Spacelab life sciences missions

    Science.gov (United States)

    Kao, Cheng-Yan; Lee, Seok-Hua

    1992-01-01

    The primary scheduling tool in use during the Spacelab Life Science (SLS-1) planning phase was the operations research (OR) based, tabular form Experiment Scheduling System (ESS) developed by NASA Marshall. PLAN-IT is an artificial intelligence based interactive graphic timeline editor for ESS developed by JPL. The PLAN-IT software was enhanced for use in the scheduling of Spacelab experiments to support the SLS missions. The enhanced software SLS-PLAN-IT System was used to support the real-time reactive scheduling task during the SLS-1 mission. SLS-PLAN-IT is a frame-based blackboard scheduling shell which, from scheduling input, creates resource-requiring event duration objects and resource-usage duration objects. The blackboard structure is to keep track of the effects of event duration objects on the resource usage objects. Various scheduling heuristics are coded in procedural form and can be invoked any time at the user's request. The system architecture is described along with what has been learned with the SLS-PLAN-IT project.

  13. Models and Algorithms for Production Planning and Scheduling in Foundries – Current State and Development Perspectives

    Directory of Open Access Journals (Sweden)

    A. Stawowy

    2012-04-01

    Full Text Available Mathematical programming, constraint programming and computational intelligence techniques, presented in the literature in the field of operations research and production management, are generally inadequate for planning real-life production process. These methods are in fact dedicated to solving the standard problems such as shop floor scheduling or lot-sizing, or their simple combinations such as scheduling with batching. Whereas many real-world production planning problems require the simultaneous solution of several problems (in addition to task scheduling and lot-sizing, the problems such as cutting, workforce scheduling, packing and transport issues, including the problems that are difficult to structure. The article presents examples and classification of production planning and scheduling systems in the foundry industry described in the literature, and also outlines the possible development directions of models and algorithms used in such systems.

  14. Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product

    NARCIS (Netherlands)

    Li, C.; Akkermans, J.M.; Brinkkemper, S.; Diepen, G.

    2007-01-01

    This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of the requirements for the new release exactly in time so that the project span is minimized and the resource and

  15. Tourism-planning network knowledge dynamics

    DEFF Research Database (Denmark)

    Dredge, Dianne

    2014-01-01

    This chapter explores the characteristics and functions of tourism networks as a first step in understanding how networks facilitate and reproduce knowledge. A framework to progress understandings of knowledge dynamics in tourism networks is presented that includes four key dimensions: context......, network agents, network boundaries and network resources. A case study of the development of the Next Generation Tourism Handbook (Queensland, Australia), a policy initiative that sought to bring tourism and land use planning knowledge closer together is presented. The case study illustrates...... that the tourism policy and land use planning networks operate in very different spheres and that context, network agents, network boundaries and network resources have a significant influence not only on knowledge dynamics but also on the capacity of network agents to overcome barriers to learning and to innovate....

  16. Systematic Hybrid Network Scheduling for Multiple Traffic Classes with Host Timing and Phase Constraints

    Science.gov (United States)

    Varadarajan, Srivatsan (Inventor); Hall, Brendan (Inventor); Smithgall, William Todd (Inventor); Bonk, Ted (Inventor); DeLay, Benjamin F. (Inventor)

    2017-01-01

    Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

  17. Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding

    Directory of Open Access Journals (Sweden)

    Jin Wang

    2014-11-01

    Full Text Available Network coding techniques are usually applied upon network-layer protocols to improve throughput in wireless networks. In scenarios with multiple unicast sessions, fairness is also an important factor. Therefore, a network coding-aware packet-scheduling algorithm is required. A packet-scheduling algorithm determines which packet to send next from a node’s packet backlog. Existing protocols mostly employ a basic round-robin scheduling algorithm to give “equal” opportunities to different packet flows. In fact, this “equal”-opportunity scheduling is neither fair, nor efficient. This paper intends to accentuate the importance of a coding-aware scheduling scheme. With a good scheduling scheme, we can gain more control over the per-flow throughput and fairness. Specifically, we first formulate a static scheduling problem and propose an algorithm to find the optimal scheduling scheme. We then extend the technique to a dynamic setting and, later, to practical routing protocols. Results show that the algorithm is comparatively scalable, and it can improve the throughput gain when the network is not severely saturated. The fairness among flows is drastically improved as a result of this scheduling scheme.

  18. Capacity Limit, Link Scheduling and Power Control in Wireless Networks

    Science.gov (United States)

    Zhou, Shan

    2013-01-01

    The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different…

  19. On Cyclic Plans for Scheduling a Smart Card Personalisation System

    NARCIS (Netherlands)

    Nieberg, T.

    An industrial case study for scheduling the personalisation of smart cards is presented and analysed. Smart cards are personalised in several machines that are served by an underlying conveyor belt connecting these. As there are usually a very high number of smart cards to be personalised, the focus

  20. An efficient schedule based data aggregation using node mobility for wireless sensor network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Pawar, Pranav M.; Prasad, Neeli R.

    2014-01-01

    In the Wireless Sensor Networks, (WSNs) a key challenge is to schedule the activities of the mobile node for improvement in throughput, energy consumption and delay. This paper proposes efficient schedule based data aggregation algorithm using node mobility (SDNM). It considers the cluster-based...... myopic and non-myopic scheduling scheme for conflict free schedule based on the current and next state. It uses TDMA as the MAC layer protocol and schedules the aggregated packets with consecutive slots. Simulation results show that, SDNM is energy efficient, has less delay as compared with state...

  1. An adaptive random search for short term generation scheduling with network constraints.

    Directory of Open Access Journals (Sweden)

    J A Marmolejo

    Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

  2. DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations

    CERN Document Server

    Rosenberg, Arnold L; Sotteau, Dominique; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; Interconnection networks and mapping and scheduling parallel computations

    1995-01-01

    The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed pro...

  3. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-05-27

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  4. Land use planning in Safer Transportation Network Planning : safety principles, planning framework, and library information.

    OpenAIRE

    Hummel, T.

    2001-01-01

    This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information in the computer tool Safer-TNP. Safer-TNP is a design tool that guides network planners in designing safe transportation networks (or improving safety of existing transportation networks). It provid...

  5. A Metaheuristic Scheduler for Time Division Multiplexed Network-on-Chip

    DEFF Research Database (Denmark)

    Sørensen, Rasmus Bo; Sparsø, Jens; Pedersen, Mark Ruvald

    2014-01-01

    This paper presents a metaheuristic scheduler for inter-processor communication in multi-processor platforms using time division multiplexed (TDM) networks on chip (NOC). Compared to previous works, the scheduler handles a broader and more general class of platforms. Another contribution, which has...

  6. Using Optimization Models for Scheduling in Enterprise Resource Planning Systems

    National Research Council Canada - National Science Library

    Frank Herrmann

    2016-01-01

    .... As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System...

  7. National Contingency Plan (NCP) Subpart J Product Schedule Fact Sheet

    Science.gov (United States)

    This section of the National Oil and Hazardous Substances Pollution Contingency Plan stipulates the criteria for listing and managing the use of dispersants and other chemical and biological agents used to mitigate oil spills.

  8. Optical network design and planning

    CERN Document Server

    Simmons, Jane M

    2014-01-01

    This book takes a pragmatic approach to designing state-of-the-art optical networks for backbone, regional, and metro-core networks.   Algorithms and methodologies related to routing, regeneration, wavelength assignment, subrate-traffic grooming, and protection are presented, with an emphasis on optical-bypass-enabled (or all-optical) networks. There are numerous case studies throughout the text to illustrate the concepts, using realistic networks and traffic sets. A full chapter of economic studies offers guidelines as to when and how optical-bypass technology should be deployed. There is also extensive coverage of recent research to provide insight into how optical networks are likely to evolve. The second edition includes new chapters on dynamic optical networking and flexible/elastic optical networks. There is expanded coverage of new physical-layer technology and its impact on network design, along with enhanced coverage of ROADM architectures, including the colorless, directionless, contentionless, a...

  9. NEW BURST ASSEMBLY AND SCHEDULING TECHNIQUE FOR OPTICAL BURST SWITCHING NETWORKS

    OpenAIRE

    Kavitha, V.; V.Palanisamy

    2013-01-01

    The Optical Burst Switching is a new switching technology that efficiently utilizes the bandwidth in the optical layer. The key areas to be concentrated in Optical Burst Switching (OBS) networks are the burst assembly and burst scheduling i.e., assignment of wavelengths to the incoming bursts. This study presents a New Burst Assembly and Scheduling (NBAS) technique in a simultaneous multipath transmission for burst loss recovery in OBS networks. A Redundant Burst Segmentation (RBS) is used fo...

  10. A Metaheuristic Scheduler for Time Division Multiplexed Network-on-Chip

    DEFF Research Database (Denmark)

    Sørensen, Rasmus Bo; Sparsø, Jens; Pedersen, Mark Ruvald

    This report presents a metaheuristic scheduler for inter-processor communication in multi-core platforms using time division multiplexed (TDM) networks on chip (NOC). Input to the scheduler is a specification of the target multi-core platform and a specification of the application. Compared...... that this is possible with only negligible impact on the schedule period. We evaluate the scheduler with seven different applications from the MCSL NOC benchmark suite. We observe that the metaheuristics perform better than the greedy solution. In the special case of all-to-all communication with equal bandwidths...

  11. Fuzzy Networked Control Systems Design Considering Scheduling Restrictions

    Directory of Open Access Journals (Sweden)

    H. Benítez-Pérez

    2012-01-01

    known a priory but from a dynamic real-time behavior. To do so, the use of priority dynamic Priority exchange scheduling is performed. The objective of this paper is to show a way to tackle multiple time delays that are bounded and the dynamic response from real-time scheduling approximation. The related control law is designed considering fuzzy logic approximation for nonlinear time delays coupling, where the main advantage is the integration of this behavior through extended state space representation keeping certain linear and bounded behavior and leading to a stable situation during events presentation by guaranteeing stability through Lyapunov.

  12. Logical Link Control and Channel Scheduling for Multichannel Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jun Li

    2012-08-01

    Full Text Available With recent developments in terrestrial wireless networks and advances in acoustic communications, multichannel technologies have been proposed to be used in underwater networks to increase data transmission rate over bandwidth-limited underwater channels. Due to high bit error rates in underwater networks, an efficient error control technique is critical in the logical link control (LLC sublayer to establish reliable data communications over intrinsically unreliable underwater channels. In this paper, we propose a novel protocol stack architecture featuring cross-layer design of LLC sublayer and more efficient packetto- channel scheduling for multichannel underwater sensor networks. In the proposed stack architecture, a selective-repeat automatic repeat request (SR-ARQ based error control protocol is combined with a dynamic channel scheduling policy at the LLC sublayer. The dynamic channel scheduling policy uses the channel state information provided via cross-layer design. It is demonstrated that the proposed protocol stack architecture leads to more efficient transmission of multiple packets over parallel channels. Simulation studies are conducted to evaluate the packet delay performance of the proposed cross-layer protocol stack architecture with two different scheduling policies: the proposed dynamic channel scheduling and a static channel scheduling. Simulation results show that the dynamic channel scheduling used in the cross-layer protocol stack outperforms the static channel scheduling. It is observed that, when the dynamic channel scheduling is used, the number of parallel channels has only an insignificant impact on the average packet delay. This confirms that underwater sensor networks will benefit from the use of multichannel communications.

  13. Technical Report: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Approach

    OpenAIRE

    Hansen, Anders Dohn; Clausen, Jens

    2008-01-01

    In this paper, we present The Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem considered here, is concerned with the generation of schedules for these. The problem is decomposed and modeled in two parts, namely a planning problem and a scheduling problem. In the planning problem...

  14. Interval algebra: an effective means of scheduling surveillance radar networks

    CSIR Research Space (South Africa)

    Focke, RW

    2015-05-01

    Full Text Available by keeping track of the number of targets that could be measured simultaneously. It was found that nimble scheduling is important where the targets are moving fast enough to rapidly change the recognised surveillance picture during a scan. Two novel...

  15. Communication, knowledge, social network and family planning ...

    African Journals Online (AJOL)

    AJRH Managing Editor

    Family planning utilization in Tanzania is low. This study was cross sectional. It examined family planning use and socio demographic variables, social networks, knowledge and communication among the couples, whereby a stratified sample of 440 women of reproductive age (18-49), married or cohabiting was studied in ...

  16. Green Network Planning Model for Optical Backbones

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Jensen, Michael

    2010-01-01

    on the environment in general. In network planning there are existing planning models focused on QoS provisioning, investment minimization or combinations of both and other parameters. But there is a lack of a model for designing green optical backbones. This paper presents novel ideas to be able to define...

  17. Planning contract and networks of home services

    Directory of Open Access Journals (Sweden)

    José Eudoro Narváez Viteri

    2010-06-01

    Full Text Available This article highlights the worrying increase in public investment in infrastructure works due to deficiencies at the stage of study and design, particularly in public utility services networks. Some cities lack real technical drawings and updated underground networks, especially in the former. Hence, no reliable information is difficult to require contractors, consultants about study designs appropriate public service networks in evident contradiction with the principle of contractual planning.

  18. Design and architecture of the Mars relay network planning and analysis framework

    Science.gov (United States)

    Cheung, K. M.; Lee, C. H.

    2002-01-01

    In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

  19. Land use planning in Safer Transportation Network Planning : safety principles, planning framework, and library information.

    NARCIS (Netherlands)

    Hummel, T.

    2001-01-01

    This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

  20. Intersection planning in Safer Transportation Network Planning : safety principles, planning framework, and library information.

    NARCIS (Netherlands)

    Hummel, T.

    2001-01-01

    This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

  1. An intelligent scheduling method based on improved particle swarm optimization algorithm for drainage pipe network

    Science.gov (United States)

    Luo, Yaqi; Zeng, Bi

    2017-08-01

    This paper researches the drainage routing problem in drainage pipe network, and propose an intelligent scheduling method. The method relates to the design of improved particle swarm optimization algorithm, the establishment of the corresponding model from the pipe network, and the process by using the algorithm based on improved particle swarm optimization to find the optimum drainage route in the current environment.

  2. Optimal Charging Schedule Planning and Economic Analysis for Electric Bus Charging Stations

    Directory of Open Access Journals (Sweden)

    Rong-Ceng Leou

    2017-04-01

    Full Text Available The battery capacity of electric buses (EB used for public transportation is greater than that of electric cars, and the charging power is also several times greater than that used in electric cars; this can result in high energy consumption and negatively impact power distribution networks. This paper proposes a framework to determine the optimal contracted power capacity and charging schedule of an EB charging station in such a way that energy costs can be reduced. A mathematical model of controlled charging, which includes the capacity and energy charges of the station, was developed to minimize costs. The constraints of the model include the charging characteristics of an EB and the operational guidelines of the bus company. A practical EB charging station was used to verify the proposed model. The financial viability of this EB charging station is also studied in this paper. The economic analysis model for this charging station considers investment and operational costs, and the operational revenue. Sensitivity analyses with respect to some key parameters are also performed in this paper. Based on actual operational routes and EB charging schemes, test results indicate that the EB charging station investment is feasible, and the planning model proposed can be used to determine optimal station power capacity and minimize energy costs.

  3. Centralized mission planning and scheduling system for the Landsat Data Continuity Mission

    Science.gov (United States)

    Kavelaars, Alicia; Barnoy, Assaf M.; Gregory, Shawna; Garcia, Gonzalo; Talon, Cesar; Greer, Gregory; Williams, Jason; Dulski, Vicki

    2014-01-01

    Satellites in Low Earth Orbit provide missions with closer range for studying aspects such as geography and topography, but often require efficient utilization of space and ground assets. Optimizing schedules for these satellites amounts to a complex planning puzzle since it requires operators to face issues such as discontinuous ground contacts, limited onboard memory storage, constrained downlink margin, and shared ground antenna resources. To solve this issue for the Landsat Data Continuity Mission (LDCM, Landsat 8), all the scheduling exchanges for science data request, ground/space station contact, and spacecraft maintenance and control will be coordinated through a centralized Mission Planning and Scheduling (MPS) engine, based upon GMV’s scheduling system flexplan9 . The synchronization between all operational functions must be strictly maintained to ensure efficient mission utilization of ground and spacecraft activities while working within the bounds of the space and ground resources, such as Solid State Recorder (SSR) and available antennas. This paper outlines the functionalities that the centralized planning and scheduling system has in its operational control and management of the Landsat 8 spacecraft.

  4. H∞ Guaranteed Cost Control for Networked Control Systems under Scheduling Policy Based on Predicted Error

    Directory of Open Access Journals (Sweden)

    Qixin Zhu

    2014-01-01

    Full Text Available Scheduling policy based on model prediction error is presented to reduce energy consumption and network conflicts at the actuator node, where the characters of networked control systems are considered, such as limited network bandwidth, limited node energy, and high collision probability. The object model is introduced to predict the state of system at the sensor node. And scheduling threshold is set at the controller node. Control signal is transmitted only if the absolute value of prediction error is larger than the threshold value. Furthermore, the model of networked control systems under scheduling policy based on predicted error is established by taking uncertain parameters and long time delay into consideration. The design method of H∞ guaranteed cost controller is presented by using the theory of Lyapunov and linear matrix inequality (LMI. Finally, simulations are included to demonstrate the theoretical results.

  5. An Efficient Multitask Scheduling Model for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hongsheng Yin

    2014-01-01

    Full Text Available The sensor nodes of multitask wireless network are constrained in performance-driven computation. Theoretical studies on the data processing model of wireless sensor nodes suggest satisfying the requirements of high qualities of service (QoS of multiple application networks, thus improving the efficiency of network. In this paper, we present the priority based data processing model for multitask sensor nodes in the architecture of multitask wireless sensor network. The proposed model is deduced with the M/M/1 queuing model based on the queuing theory where the average delay of data packets passing by sensor nodes is estimated. The model is validated with the real data from the Huoerxinhe Coal Mine. By applying the proposed priority based data processing model in the multitask wireless sensor network, the average delay of data packets in a sensor nodes is reduced nearly to 50%. The simulation results show that the proposed model can improve the throughput of network efficiently.

  6. Scenario Based Network Infrastructure Planning

    DEFF Research Database (Denmark)

    Knudsen, Thomas Phillip; Pedersen, Jens Myrup; Madsen, Ole Brun

    2005-01-01

    The paper presents a method for IT infrastructure planning that take into account very long term developments in usages. The method creates a scenario for a final, time independent stage in the planning process. The method abstracts relevant modelling factors from available information; this incl......; this includes available statistical information and a short survey of emerging technologies. A scenario for Denmark is presented and consequences are discussed....

  7. Optimal trajectory planning and train scheduling for urban rail transit systems

    CERN Document Server

    Wang, Yihui; van den Boom, Ton; De Schutter, Bart

    2016-01-01

    This book contributes to making urban rail transport fast, punctual and energy-efficient –significant factors in the importance of public transportation systems to economic, environmental and social requirements at both municipal and national levels. It proposes new methods for shortening passenger travel times and for reducing energy consumption, addressing two major topics: (1) train trajectory planning: the authors derive a nonlinear model for the operation of trains and present several approaches for calculating optimal and energy-efficient trajectories within a given schedule; and (2) train scheduling: the authors develop a train scheduling model for urban rail systems and optimization approaches with which to balance total passenger travel time with energy efficiency and other costs to the operator. Mixed-integer linear programming and pseudospectral methods are among the new methods proposed for single- and multi-train systems for the solution of the nonlinear trajectory planning problem which involv...

  8. An alternate property tax program requiring a forest management plan and scheduled harvesting

    Science.gov (United States)

    D.F. Dennis; P.E. Sendak

    1991-01-01

    Vermont's Use Value Appraisal property tax program, designed to address problems such as tax inequity and forced development caused by taxing agricultural and forest land based on speculative values, requires a forest management plan and scheduled harvests. A probit analysis of enrollment provides evidence of the program's success in attracting large parcels...

  9. Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    2010-01-01

    In this paper, we present the Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem...

  10. Multi-bucket optimization for integrated planning and scheduling in the perishable dairy supply chain

    NARCIS (Netherlands)

    Sel, C.; Bilgen, B.; Bloemhof, J.M.; Vorst, van der J.G.A.J.

    2015-01-01

    This paper considers a dairy industry problem on integrated planning and scheduling of set yoghurt production. A mixed integer linear programming formulation is introduced to integrate tactical and operational decisions and a heuristic approach is proposed to decompose time buckets of the decisions.

  11. Sleep Scheduling in Critical Event Monitoring with Wireless Sensor Networks

    NARCIS (Netherlands)

    Guo, Peng; Jiang, Tao; Zhang, Qian; Zhang, Kui

    In this paper, we focus on the applications of wireless sensor networks (WSNs) for critical event monitoring, where normally there are only small number of packets need to be transmitted, while when urgent event occurs, the alarm should be broadcast to the entire network as soon as possible. During

  12. Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Katerina Papadaki

    2008-10-01

    Full Text Available The focus of this paper is on routing in wireless mesh networks (WMNs that results in spatial TDMA (STDMA schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP. Since this is an 𝒩𝒫-complete problem, we propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.

  13. Intergroup Joint Scheduling for Mitigating Asymmetric Uplink Interference in Self-Organizing Virtual Cell Networks

    Directory of Open Access Journals (Sweden)

    Ohyun Jo

    2016-01-01

    Full Text Available We introduce the concept of self-organizing VCN (virtual cell network. Here self-organizing VCN topology for efficient operation will be configured, and the functions of the each element will be defined. Also, the operation scenarios of VCN will be described. Then, we propose an efficient scheduling algorithm that considers the asymmetry of interference between downlink and uplink to mitigate intercell interference with little computing overhead. The basic concept is to construct scheduling groups that consist of several users. Each user in a scheduling group is affiliated with a different cell. Then, the intercell groups are managed efficiently in the proposed VCNs. There is no need for the exchange of a lot of information among base stations to schedule the users over the entire network.

  14. Energy Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation

    OpenAIRE

    Qi, Nan; Xiao, Ming; Tsiftsis, Theodoros A.; Skoglund, Mikael; Cao, Phuong L.; Li, Lixin

    2016-01-01

    The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \\emph{etc}) and optimize the transmitting power under the practical channel and power co...

  15. On the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...... transmissions cannot use the same edge in the same time period. An exact solution approach based on Dantzig-Wolfe decomposition is proposed along with several heuristics. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results...

  16. DLTAP: A Network-efficient Scheduling Method for Distributed Deep Learning Workload in Containerized Cluster Environment

    Directory of Open Access Journals (Sweden)

    Qiao Wei

    2017-01-01

    Full Text Available Deep neural networks (DNNs have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling data-parallel computation jobs like DNN over containerized clusters is critical for job performance, system throughput, and resource utilization. It becomes even more challenging with the complex workloads. We propose a scheduling method called Deep Learning Task Allocation Priority (DLTAP which performs scheduling decisions in a distributed manner, and each of scheduling decisions takes aggregation degree of parameter sever task and worker task into account, in particularly, to reduce cross-node network transmission traffic and, correspondingly, decrease the DNN training time. We evaluate the DLTAP scheduling method using a state-of-the-art distributed DNN training framework on 3 benchmarks. The results show that the proposed method can averagely reduce 12% cross-node network traffic, and decrease the DNN training time even with the cluster of low-end servers.

  17. Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

    KAUST Repository

    Douik, Ahmed

    2017-09-07

    Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

  18. Efficient Resource Scheduling by Exploiting Relay Cache for Cellular Networks

    Directory of Open Access Journals (Sweden)

    Chun He

    2015-01-01

    Full Text Available In relay-enhanced cellular systems, throughput of User Equipment (UE is constrained by the bottleneck of the two-hop link, backhaul link (or the first hop link, and access link (the second hop link. To maximize the throughput, resource allocation should be coordinated between these two hops. A common resource scheduling algorithm, Adaptive Distributed Proportional Fair, only ensures that the throughput of the first hop is greater than or equal to that of the second hop. But it cannot guarantee a good balance of the throughput and fairness between the two hops. In this paper, we propose a Two-Hop Balanced Distributed Scheduling (TBS algorithm by exploiting relay cache for non-real-time data traffic. The evolved Node Basestation (eNB adaptively adjusts the number of Resource Blocks (RBs allocated to the backhaul link and direct links based on the cache information of relays. Each relay allocates RBs for relay UEs based on the size of the relay UE’s Transport Block. We also design a relay UE’s ACK feedback mechanism to update the data at relay cache. Simulation results show that the proposed TBS can effectively improve resource utilization and achieve a good trade-off between system throughput and fairness by balancing the throughput of backhaul and access link.

  19. Advanced systems engineering and network planning support

    Science.gov (United States)

    Walters, David H.; Barrett, Larry K.; Boyd, Ronald; Bazaj, Suresh; Mitchell, Lionel; Brosi, Fred

    1990-01-01

    The objective of this task was to take a fresh look at the NASA Space Network Control (SNC) element for the Advanced Tracking and Data Relay Satellite System (ATDRSS) such that it can be made more efficient and responsive to the user by introducing new concepts and technologies appropriate for the 1997 timeframe. In particular, it was desired to investigate the technologies and concepts employed in similar systems that may be applicable to the SNC. The recommendations resulting from this study include resource partitioning, on-line access to subsets of the SN schedule, fluid scheduling, increased use of demand access on the MA service, automating Inter-System Control functions using monitor by exception, increase automation for distributed data management and distributed work management, viewing SN operational control in terms of the OSI Management framework, and the introduction of automated interface management.

  20. The Asymptotic Limits of Interference in Multicell Networks with Channel Aware Scheduling

    CERN Document Server

    de Kerret, P

    2011-01-01

    Interference is emerging as a fundamental bottleneck in many important wireless communication scenarios, including dense cellular networks and cognitive networks with spectrum sharing by multiple service providers. Although multipleantenna (MIMO) signal processing is known to offer useful degrees of freedom to cancel interference, extreme-value theoretic analysis recently showed that, even in the absence of MIMO processing, the scaling law of the capacity in the number of users for a multi-cell network with and without inter-cell interference was asymptotically identical provided a simple signal to noise and interference ratio (SINR) maximizing scheduler is exploited. This suggests that scheduling can help reduce inter-cell interference substantially, thus possibly limiting the need for multiple-antenna processing. However, the convergence limits of interference after scheduling in a multi-cell setting are not yet identified. In this paper1 we analyze such limits theoretically. We consider channel statistics ...

  1. Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks

    Directory of Open Access Journals (Sweden)

    Hu Shen

    2013-01-01

    Full Text Available This paper investigates the problem of the minimum length link scheduling (MLLS in multiuser MIMO (MU-MIMO networks. Generally, in the networks with MU-MIMO capability, the number of concurrent transmissions can be as large as that of antenna elements at the receiver. As a result, link interference is no longer binary but demonstrates a strong correlation among multiple links, which cannot be captured by the conventional conflict graph interference model. Hence, we propose a novel hypergraph interference model, which can accurately and efficiently characterize the relationship of multiple interferences induced by concurrent transmissions, and provide a tractable formalization of the minimum length link scheduling in MU-MIMO networks (MU-MIMO MLLS. Afterwards, we prove that the MU-MIMO MLLS problem is NP-hard and introduce two approximation algorithms to find the near-optimal feasible schedule. Finally, extensive simulation experiments are presented.

  2. A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks

    Directory of Open Access Journals (Sweden)

    Chih-Chiang Lin

    2010-01-01

    Full Text Available The broadcast scheduling problem (BSP in packet radio networks is a well-known NP-complete combinatorial optimization problem. The broadcast scheduling avoids packet collisions by allowing only one node transmission in each collision domain of a time division multiple access (TDMA network. It also improves the transmission utilization by assigning one transmission time slot to one or more nodes; thus, each node transmits at least once in each time frame. An optimum transmission schedule could minimize the length of a time frame while minimizing the number of idle nodes. In this paper, we propose a new iterated local search (ILS algorithm that consists of two special perturbation and local search operators to solve the BSPs. Computational experiments are applied to benchmark data sets and randomly generated problem instances. The experimental results show that our ILS approach is effective in solving the problems with only a few runtimes, even for very large networks with 2,500 nodes.

  3. Defining and representing events in a satellite scheduling system - The IEPS (Interactive Experimenter Planning System) approach

    Science.gov (United States)

    Mclean, David R.; Littlefield, Ronald G.; Macoughtry, William O.

    1987-01-01

    A methodology is described for defining and representing satellite events from the IEPS perspective. The task of doing this is divided into four categories and includes defining and representing resource windows, event parameters, event scheduling strategies, and event constraints. The description of each of these categories includes examples from the IEPS ERBS-TDRSS Contact Planning System. This is a system which is being used by the Earth Radiation Budget Satellite (ERBS) schedulers to request TDRSS contact times from the NCC. The system is written in the C programming language and uses a custom built inference engine (TIE1) to do constraint checking and a custom built strategies interpreter to derive the plan. The planning system runs on the IBM-PC/AT or on any similar hardware which has a C development environment and 640K of memory.

  4. A priority-based heuristic algorithm (PBHA for optimizing integrated process planning and scheduling problem

    Directory of Open Access Journals (Sweden)

    Muhammad Farhan Ausaf

    2015-12-01

    Full Text Available Process planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing the IPPS problem, there is still room for improvement in terms of quality of solution and algorithm efficiency, especially for more complicated problems. Dispatching rules have been successfully utilized for solving complicated scheduling problems, but haven’t been considered extensively for the IPPS problem. This approach incorporates dispatching rules with the concept of prioritizing jobs, in an algorithm called priority-based heuristic algorithm (PBHA. PBHA tries to establish job and machine priority for selecting operations. Priority assignment and a set of dispatching rules are simultaneously used to generate both the process plans and schedules for all jobs and machines. The algorithm was tested for a series of benchmark problems. The proposed algorithm was able to achieve superior results for most complex problems presented in recent literature while utilizing lesser computational resources.

  5. Road maintenance planning using network flow modelling

    OpenAIRE

    Yang, Chao; Remenyte-Prescott, Rasa; Andrews, John

    2015-01-01

    This paper presents a road maintenance planning model that can be used to balance out maintenance cost and road user cost, since performing road maintenance at night can be convenient for road users but costly for highway agency. Based on the platform of the network traffic flow modelling, the traffic through the worksite and its adjacent road links is evaluated. Thus, maintenance arrangements at a worksite can be optimized considering the overall network performance. In addition, genetic alg...

  6. Planning and management of cloud computing networks

    Science.gov (United States)

    Larumbe, Federico

    comprehensive vision. The first question to be solved is what are the optimal data center locations. We found that the location of each data center has a big impact on cost, QoS, power consumption, and greenhouse gas emissions. An optimization problem with a multi-criteria objective function is proposed to decide jointly the optimal location of data centers and software components, link capacities, and information routing. Once the network planning has been analyzed, the problem of dynamic resource provisioning in real time is addressed. In this context, virtualization is a key technique in cloud computing because each server can be shared by multiple Virtual Machines (VMs) and the total power consumption can be reduced. In the same line of location problems, we propose a Green Cloud Broker that optimizes VM placement across multiple data centers. In fact, when multiple data centers are considered, response time can be reduced by placing VMs close to users, cost can be minimized, power consumption can be optimized by using energy efficient data centers, and CO2 emissions can be decreased by choosing data centers provided with renewable energy sources. The third stage of the analysis is the short-term management of a cloud data center. In particular, a method is proposed to assign VMs to servers by considering communication traffic among VMs. Cloud data centers receive new applications over time and these applications need on-demand resource provisioning. Each application is composed of multiple types of VMs that interact among themselves. A program called scheduler must place each new VM in a server and that impacts the QoS and power consumption. Our method places VMs that communicate among themselves in servers that are close to each other in the network topology, thus reducing communication delay and increasing the throughput available among VMs. Furthermore, the power consumption of each type of server is considered and the most efficient ones are chosen to place the VMs

  7. Method and apparatus for scheduling broadcasts in social networks

    KAUST Repository

    Manzoor, Emaad Ahmed

    2016-08-25

    A method, apparatus, and computer readable medium are provided for maximizing consumption of broadcasts by a producer. An example method includes receiving selection of a total number of time slots to use for scheduling broadcasts, and receiving information regarding the producer\\'s followers. The example method further 5 includes identifying, by a processor and based on the received information, discount factors associated with the producer\\'s followers, and calculating, by the processor and based on the received information, a predicted number of competitor broadcasts during each time slot of the total number of time slots. Finally, the example method includes determining, by the processor and based on the discount factors and the predicted 10 number of competitor broadcasts during each time slot, a number of broadcasts for the producer to transmit in each time slot of the total number of time slots.

  8. A Gain-Scheduling PI Control Based on Neural Networks

    Directory of Open Access Journals (Sweden)

    Stefania Tronci

    2017-01-01

    Full Text Available This paper presents a gain-scheduling design technique that relies upon neural models to approximate plant behaviour. The controller design is based on generic model control (GMC formalisms and linearization of the neural model of the process. As a result, a PI controller action is obtained, where the gain depends on the state of the system and is adapted instantaneously on-line. The algorithm is tested on a nonisothermal continuous stirred tank reactor (CSTR, considering both single-input single-output (SISO and multi-input multi-output (MIMO control problems. Simulation results show that the proposed controller provides satisfactory performance during set-point changes and disturbance rejection.

  9. Energy-efficient scheduling under delay constraints for wireless networks

    CERN Document Server

    Berry, Randal; Zafer, Murtaza

    2012-01-01

    Packet delay and energy consumption are important considerations in wireless and sensor networks as these metrics directly affect the quality of service of the application and the resource consumption of the network; especially, for a rapidly growing class of real-time applications that impose strict restrictions on packet delays. Dynamic rate control is a novel technique for adapting the transmission rate of wireless devices, almost in real-time, to opportunistically exploit time-varying channel conditions as well as changing traffic patterns. Since power consumption is not a linear function

  10. TERRITORIAL NETWORKS AND PLANNING: LAND PLANNING IN METROPOLITAN BILBAO

    Directory of Open Access Journals (Sweden)

    Eunice Helena Sguizzardi Abascal

    2011-05-01

    Full Text Available The present article argues that the territorial planning is nowadays fundamental instrument to the definition of strategic areas of opportunity, and also, articulating instrument of distinct territory scales (from local to regional. It is restored the importance of distinct levels of planning, listed in chain, of a more general level of regional coverage to specific and local levels. It is demonstrated the importance of this articulation not only for dealing with urgencies in the intra-urban territory ordering to promote the compact city, but also, to develop cities and regions, enhancing the implementation of decentralized and solidary supply chains that characterize a network organization. It is proposed that, the planning instruments and strategic ordering of the territory, aimed at decentralization and creation of new towns or focusing on the redevelopment and recycling of uses and activities in cities and regions in decline with degraded areas, allowing decisions of strategic importance that determine lines, axes and opportunity areas, targets of economic, and social development, and therefore it starts to concentrate investment in infrastructure, serving to enhance the implementation of urban network centers and supply chains, which benefits with the larger planning of urban and regional territory. Because of it, the analysis object is the strategic territorial planning that has been developed and implemented specifically in Spain, underlying plans and actions of urban regeneration, as exemplified by the process is still ongoing in the city of Bilbao, the region north of the country.

  11. Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

    Science.gov (United States)

    Buchner, Johannes

    2011-12-01

    Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the

  12. Planning logistics network for recyclables collection

    Directory of Open Access Journals (Sweden)

    Ratković Branislava

    2014-01-01

    Full Text Available Rapid urbanization, intensified industrialization, rise of income, and a more sophisticated form of consumerism are leading to an increase in the amount and toxicity of waste all over the world. Whether reused, recycled, incinerated or put into landfill sites, the management of household and industrial waste yield financial and environmental costs. This paper presents a modeling approach that can be used for designing one part of recycling logistics network through defining optimal locations of collection points, and possible optimal scheduling of vehicles for collecting recyclables. [Projekat Ministarstva nauke Republike Srbije, br. TR36005

  13. AgRISTARS: Renewable resources inventory. Land information support system implementation plan and schedule. [San Juan National Forest pilot test

    Science.gov (United States)

    Yao, S. S. (Principal Investigator)

    1981-01-01

    The planning and scheduling of the use of remote sensing and computer technology to support the land management planning effort at the national forests level are outlined. The task planning and system capability development were reviewed. A user evaluation is presented along with technological transfer methodology. A land management planning pilot test of the San Juan National Forest is discussed.

  14. Using an ontology for network attack planning

    CSIR Research Space (South Africa)

    Van Heerden, R

    2016-09-01

    Full Text Available -1 International Journal of Cyber Warfare and Terrorism, vol. 6(3), 65-78 Using an Ontology for Network Attack Planning Renier van Heerden1,2, Peter Chan2 , Louise Leenen2,3 Jacques Theron4 1 Nelson Mandela Metropolitan University, South Africa 2...

  15. Social networks, big data and transport planning

    Energy Technology Data Exchange (ETDEWEB)

    Ruiz Sanchez, T.; Lidon Mars Aicart, M. del; Arroyo Lopez, M.R.; Serna Nocedal, A.

    2016-07-01

    The characteristics of people who are related or tied to each individual affects her activitytravel behavior. That influence is especially associated to social and recreational activities, which are increasingly important. Collecting high quality data from those social networks is very difficult, because respondents are asked about their general social life, which is most demanding to remember that specific facts. On the other hand, currently there are different potential sources of transport data, which is characterized by the huge amount of information available, the velocity with it is obtained and the variety of format in which is presented. This sort of information is commonly known as Big Data. In this paper we identify potential sources of social network related big data that can be used in Transport Planning. Then, a review of current applications in Transport Planning is presented. Finally, some future prospects of using social network related big data are highlighted. (Author)

  16. Optimizing Intermodal Train Schedules with a Design Balanced Network Design Model

    DEFF Research Database (Denmark)

    Pedersen, Michael Berliner; Crainic, Teodor Gabriel

    We present a modeling approach for optimizing intermodal trains schedules based on an infrastructure divided into time-dependent train paths. The formulation can be generalized to a capacitated multi commodity network design model with additional design balance constraints. We present a Tabu Sear...... based metaheuristic to solve large instances of the generalized problem and compare its results on standard network design problems to those obtained using the solver XpressMP....

  17. Collaborative Optimization of Stop Schedule Plan and Ticket Allotment for the Intercity Train

    Directory of Open Access Journals (Sweden)

    Xichun Chen

    2016-01-01

    Full Text Available As regards the ticket allotment issue of the intercity passenger corridor designed for different train grades, the matching relationship between the ticket allotment and the passenger flow demand is studied. The passenger flow conversion equation which is based on the collaborative optimization of the intercity train stop schedule plan and ticket allotment is established. Then the mathematical model aiming at the maximum revenue of intercity train system and the highest satisfaction from the passengers is established. The particle swarm harmony search algorithm is designed to solve the model. The example verifies the effectiveness of the model and algorithm, which indicates that, through the collaborative optimization of the stop schedule plan and ticket allotment for different grades intercity trains, the sectional utilization rate of the train can be improved; meanwhile, the optimum matching between the intercity train revenue and the passenger satisfaction can be realized.

  18. Heuristic algorithm for planning and scheduling of forged pieces heat treatment

    Directory of Open Access Journals (Sweden)

    R. Lenort

    2012-04-01

    Full Text Available The paper presents a heuristic algorithm for planning and scheduling of forged pieces heat treatment which allows maximizing the capacity exploitation of the heat treatment process and the entire forging process. Five Focusing Steps continuous improvement process was selected as a methodological basis for the algorithm design. Its application was supported by simulation experiments performed on a dynamic computer model of the researched process. The experimental work has made it possible to elicit the general rules for planning and scheduling of the heat treatment process of forged pieces which reduce losses caused by equipment conversion and setup times, and which increase the throughput of this process. The HIPO diagram was used to design the algorithm.

  19. A Scheduling Discipline for Latency and Bandwidth Guarantees in Asynchronous Network-on-Chip

    DEFF Research Database (Denmark)

    Bjerregaard, Tobias; Sparsø, Jens

    2005-01-01

    Guaranteed services (GS) are important in that they provide predictability in the complex dynamics of shared communication structures. This paper discusses the implementation of GS in asynchronous Network-on-Chip. We present a novel scheduling discipline called Asynchronous Latency Guarantee (ALG...

  20. Coordinated scheduling for the downlink of cloud radio-access networks

    KAUST Repository

    Douik, Ahmed S.

    2015-09-11

    This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.

  1. Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks

    NARCIS (Netherlands)

    Durmaz, O.; Ghosh, A.; Krishnamachari, B.; Chintalapudi, K.

    We explore the following fundamental question - how fast can information be collected from a wireless sensor network? We consider a number of design parameters such as, power control, time and frequency scheduling, and routing. There are essentially two factors that hinder efficient data collection

  2. Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

    Science.gov (United States)

    Lee, Charles H.; Cheung, Kar-Ming

    2012-01-01

    In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

  3. Dynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network

    Directory of Open Access Journals (Sweden)

    Farid Benhamida

    2013-01-01

    Full Text Available In this paper, a Dynamic Economic/Emission Dispatch (DEED problem is obtained by considering both the economy and emission objectives with required constraints dynamically. This paper presents an optimization algorithm for solving constrained combined economic emission dispatch (EED problem and DEED, through the application of neural network, which is a flexible Hopfield neural network (FHNN. The constrained DEED must not only satisfy the system load demand and the spinning reserve capacity, but some practical operation constraints of generators, such as ramp rate limits and prohibited operating zone, are also considered in practical generator operation. The feasibility of the proposed FHNN using to solve DEED is demonstrated using three power systems, and it is compared with the other methods in terms of solution quality and computation efficiency. The simulation results showed that the proposed FHNN method was indeed capable of obtaining higher quality solutions efficiently in constrained DEED and EED problems with a much shorter computation time compared to other methods.

  4. Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

    Science.gov (United States)

    Mourou, Pascal; Fade, Bernard

    1992-01-01

    This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

  5. An MILP approach to shelf life integrated planning and scheduling in scalded sausage production

    DEFF Research Database (Denmark)

    Günther, H.O.; van Beek, P.; Grunow, Martin

    2006-01-01

    In the production of perishable products such as dairy, meat, or bakery goods, the consideration of shelf life in production planning is of particular importance. Retail customers with relatively low inventory turns can benefit significantly from longer product shelf life as wastage and out......-of-stock rates decrease. However, in today’s production planning and control systems shelf life issues with regard to specific products or customers are seldom taken into account. Therefore the objective of this paper is to pay attention to these issues. The way to do that is by means of optimization models...... in which shelf life aspects are integrated into operational production planning and scheduling functions. Specifically we make use of so-called Mixed Integer Linear Programming (MILP) models. Our research is based on an industrial case study of yogurt production. Relying on the principle of block planning...

  6. Recurrent Spiking Networks Solve Planning Tasks.

    Science.gov (United States)

    Rueckert, Elmar; Kappel, David; Tanneberg, Daniel; Pecevski, Dejan; Peters, Jan

    2016-02-18

    A recurrent spiking neural network is proposed that implements planning as probabilistic inference for finite and infinite horizon tasks. The architecture splits this problem into two parts: The stochastic transient firing of the network embodies the dynamics of the planning task. With appropriate injected input this dynamics is shaped to generate high-reward state trajectories. A general class of reward-modulated plasticity rules for these afferent synapses is presented. The updates optimize the likelihood of getting a reward through a variant of an Expectation Maximization algorithm and learning is guaranteed to convergence to a local maximum. We find that the network dynamics are qualitatively similar to transient firing patterns during planning and foraging in the hippocampus of awake behaving rats. The model extends classical attractor models and provides a testable prediction on identifying modulating contextual information. In a real robot arm reaching and obstacle avoidance task the ability to represent multiple task solutions is investigated. The neural planning method with its local update rules provides the basis for future neuromorphic hardware implementations with promising potentials like large data processing abilities and early initiation of strategies to avoid dangerous situations in robot co-worker scenarios.

  7. Multi-layer service function chaining scheduling based on auxiliary graph in IP over optical network

    Science.gov (United States)

    Li, Yixuan; Li, Hui; Liu, Yuze; Ji, Yuefeng

    2017-10-01

    Software Defined Optical Network (SDON) can be considered as extension of Software Defined Network (SDN) in optical networks. SDON offers a unified control plane and makes optical network an intelligent transport network with dynamic flexibility and service adaptability. For this reason, a comprehensive optical transmission service, able to achieve service differentiation all the way down to the optical transport layer, can be provided to service function chaining (SFC). IP over optical network, as a promising networking architecture to interconnect data centers, is the most widely used scenarios of SFC. In this paper, we offer a flexible and dynamic resource allocation method for diverse SFC service requests in the IP over optical network. To do so, we firstly propose the concept of optical service function (OSF) and a multi-layer SFC model. OSF represents the comprehensive optical transmission service (e.g., multicast, low latency, quality of service, etc.), which can be achieved in multi-layer SFC model. OSF can also be considered as a special SF. Secondly, we design a resource allocation algorithm, which we call OSF-oriented optical service scheduling algorithm. It is able to address multi-layer SFC optical service scheduling and provide comprehensive optical transmission service, while meeting multiple optical transmission requirements (e.g., bandwidth, latency, availability). Moreover, the algorithm exploits the concept of Auxiliary Graph. Finally, we compare our algorithm with the Baseline algorithm in simulation. And simulation results show that our algorithm achieves superior performance than Baseline algorithm in low traffic load condition.

  8. Static-dynamic hybrid communication scheduling and control co-design for networked control systems.

    Science.gov (United States)

    Wen, Shixi; Guo, Ge

    2017-11-01

    In this paper, the static-dynamic hybrid communication scheduling and control co-design is proposed for the networked control systems (NCSs) to solve the capacity limitation of the wireless communication network. The analytical most regular binary sequences (MRBSs) are used as the communication scheduling function for NCSs. When the communication conflicts yielded in the binary sequence MRBSs, a dynamic scheduling strategy is proposed to on-line reallocate the medium access status for each plant. Under such static-dynamic hybrid scheduling policy, plants in NCSs are described as the non-uniform sampled-control systems, whose controller have a group of controller gains and switch according to the sampling interval yielded by the binary sequence. A useful communication scheduling and control co-design framework is proposed for the NCSs to simultaneously decide the controller gains and the parameters used to generate the communication sequences MRBS. Numerical example and realistic example are respectively given to demonstrate the effectiveness of the proposed co-design method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  9. Power Saving Scheduling Scheme for Internet of Things over LTE/LTE-Advanced Networks

    Directory of Open Access Journals (Sweden)

    Yen-Wei Kuo

    2015-01-01

    Full Text Available The devices of Internet of Things (IoT will grow rapidly in the near future, and the power consumption and radio spectrum management will become the most critical issues in the IoT networks. Long Term Evolution (LTE technology will become a promising technology used in IoT networks due to its flat architecture, all-IP network, and greater spectrum efficiency. The 3rd Generation Partnership Project (3GPP specified the Discontinuous Reception (DRX to reduce device’s power consumption. However, the DRX may pose unexpected communication delay due to missing Physical Downlink Control Channel (PDCCH information in sleep mode. Recent studies mainly focus on optimizing DRX parameters to manage the tradeoff between the energy consumption and communication latency. In this paper, we proposed a fuzzy-based power saving scheduling scheme for IoT over the LTE/LTE-Advanced networks to deal with the issues of the radio resource management and power consumption from the scheduling and resource allocation perspective. The proposed scheme considers not only individual IoT device’s real-time requirement but also the overall network performance. The simulation results show that our proposed scheme can meet the requirements of the DRX cycle and scheduling latency and can save about half of energy consumption for IoT devices compared to conventional approaches.

  10. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Swami Ananthram

    2007-01-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  11. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ananthram Swami

    2007-12-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  12. Low-Feedback Opportunistic Scheduling Schemes for Wireless Networks with Heterogenous Users

    KAUST Repository

    Rashid, Faraan

    2012-07-01

    Efficient implementation of resource sharing strategies in a multi-user wireless environment can improve the performance of a network significantly. In this thesis we study various scheduling strategies for wireless networks and handle the problem of opportunistically scheduling transmissions using channel aware schemes. First we propose a scheme that can handle users with asymmetric channel conditions and is opportunistic in the sense that it exploits the multi-user diversity of the network. The scheme requires the users to have a priori knowledge of their channel distributions. The associated overhead is limited meaning it offers reduced feedback load, that does not scale with the increasing number of users. The main technique used to shrink the feedback load is the contention based distributed implementation of a splitting algorithm that does not require explicit feedback to the scheduler from every user. The users find the best among themselves, in a distributed manner, while requiring just a ternary broadcast feedback from the scheduler at the end of each mini-slot. In addition, it can also handle fairness constraints in time and throughput to various degrees. Next we propose another opportunistic scheduler that offers most of the benefits of the previously proposed scheme but is more practical because it can also handle heterogenous users whose channel distributions are unknown. This new scheme actually reduces the complexity and is also more robust for changing traffic patterns. Finally we extend both these schemes to the scenario where there are fixed thresholds, this enables us to handle opportunistic scheduling in practical systems that can only transmit over finite number of discrete rates with the additional benefit that full feedback session, even from the selected user, is never required.

  13. Risk-based Inspection Scheduling Planning for Intelligent Agent in the Autonomous Fault Management

    Science.gov (United States)

    Hari Nugroho, Djoko; Sudarno

    2010-06-01

    This paper developed an autonomous fault management focusing to the inspection scheduling planning which was implemented to the advanced small nuclear reactor without on-site refuelling to assure the safety without human intervention. The inspection scheduling planning was developed optimally on the risk-based approach compromising between two important constraints related to the risk of action planning as such failure probability and shortest path. Performance was represented using computer simulation implemented to the DURESS components location and failure probability. It could be concluded that the first priority to be inspected was flow sensor FB2 which had the largest comparation value of 0.104233 comparing with the other components. The next route would be visited were sequentially FB1, FA2, FA1, FB, FA, VB, pump B, VA, pump A, VB2, VB1, VA2, VA1, reservoir 2, reservoir 1, FR2, and FR1. The movement route planning could be transferred to activate the robot arm which reflected as intelligent agent.

  14. Optimisation of the Planning of the Higher School Educational Process through Managing the Quality of the Term Schedule.

    Science.gov (United States)

    Buchvarov, S. I.; Ganashev, I. P.

    This paper discusses the merits of developing a high school semester time-table, or schedule, as the final planning stage in the educational process. Such a schedule would provide a weekly breakdown list of all academic subjects, grade levels, teachers for each subject and grade, rooms, laboratories and other facilities, and resources, thereby…

  15. A Scheduling Algorithm for Connected Target Coverage in Rotatable Directional Sensor Networks

    Science.gov (United States)

    Han, Youn-Hee; Kim, Chan-Myung; Gil, Joon-Min

    A key challenge in developing energy-efficient sensor networks is to extend network lifetime in resource-limited environments. As sensors are often densely distributed, they can be scheduled on alternative duty cycles to conserve energy while satisfying the system requirements. Directional sensor networks composed of a large number of directional sensors equipped with a limited battery and with a limited angle of sensing have recently attracted attention. Many types of directional sensors can rotate to face a given direction. Maximizing network lifetime while covering all of the targets in a given area and forwarding sensor data to the sink is a challenge in developing such rotatable directional sensor networks. In this paper, we address the maximum directional cover tree (MDCT) problem of organizing directional sensors into a group of non-disjoint subsets to extend network lifetime. One subset, in which the directional sensors cover all of the targets and forward the data to the sink, is activated at a time, while the others sleep to conserve energy. For the MDCT problem, we first present an energy-consumption model that mainly takes into account the energy expenditure for sensor rotation as well as for the sensing and relaying of data. We also develop a heuristic scheduling algorithm called directional coverage and connectivity (DCC)-greedy to solve the MDCT problem. To verify and evaluate the algorithm, we conduct extensive simulations and show that it extends network lifetime to a reasonable degree.

  16. Improvement to Airport Throughput Using Intelligent Arrival Scheduling and an Expanded Planning Horizon

    Science.gov (United States)

    Glaab, Patricia C.

    2012-01-01

    The first phase of this study investigated the amount of time a flight can be delayed or expedited within the Terminal Airspace using only speed changes. The Arrival Capacity Calculator analysis tool was used to predict the time adjustment envelope for standard descent arrivals and then for CDA arrivals. Results ranged from 0.77 to 5.38 minutes. STAR routes were configured for the ACES simulation, and a validation of the ACC results was conducted comparing the maximum predicted time adjustments to those seen in ACES. The final phase investigated full runway-to-runway trajectories using ACES. The radial distance used by the arrival scheduler was incrementally increased from 50 to 150 nautical miles (nmi). The increased Planning Horizon radii allowed the arrival scheduler to arrange, path stretch, and speed-adjust flights to more fully load the arrival stream. The average throughput for the high volume portion of the day increased from 30 aircraft per runway for the 50 nmi radius to 40 aircraft per runway for the 150 nmi radius for a traffic set representative of high volume 2018. The recommended radius for the arrival scheduler s Planning Horizon was found to be 130 nmi, which allowed more than 95% loading of the arrival stream.

  17. HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

    Science.gov (United States)

    Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.

    2012-01-01

    HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

  18. Perimeter Coverage Scheduling in Wireless Sensor Networks Using Sensors with a Single Continuous Cover Range

    Directory of Open Access Journals (Sweden)

    Hung Ka-Shun

    2010-01-01

    Full Text Available In target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem. We formally prove that the perimeter coverage scheduling problem is NP-hard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead.

  19. Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

    KAUST Repository

    Douik, Ahmed

    2015-12-01

    This paper addresses the joint coordinated scheduling and power control problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZ). The paper considers the problem of scheduling users to PZs and determining their power levels (PL), by maximizing the weighted sum-rate under the practical constraints that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximumweight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed crosslayer scheme provides appreciable performance improvement as compared to schemes from recent literature.

  20. The thematic plant life assessment network (PLAN)

    Energy Technology Data Exchange (ETDEWEB)

    Hurst, R.C.; McGarry, D. [EC/JRC Institute for Advanced Materials, Petten (Netherlands); Pedersen, H.H. [Brite Euram DG XII, Brussels (Belgium)

    1998-12-31

    The Plant Life Assessment Network (PLAN) is a Brite Euram Type II Thematic Network, initiated by the European Commission to facilitate structured co-operation between all cost shared action projects already funded by the Commission which fall under this common technical theme. The projects involved address a multiplicity of problems associated with plant life assessment and are drawn from Brite-Euram, Standards, Measurement and Testing, Nuclear Fission Safety and Esprit EC programmes. The main aim of the Network is to initiate, maintain and monitor a fruitful co-operation process between completed, ongoing and future EC R and D projects, thereby promoting improved cross fertilization and enhanced industrial exploitation of R and D results. As the project is in its infancy, this presentation covers the background to the initiative in some detail. In particular two key aspects are highlighted, namely, the requirement of the EC to launch such a network in the area of plant life assessment including its evolution from two small Thematic Research Actions and, secondly, the mechanism for structuring the Network in an ordered and proven way along the lines of the EC/JRC European Networks, PISC, NESC, AMES, ENIQ, ENAIS and EPERC. The operating and financial structure of the Network is detailed with reference made to the role of the executive Steering Committee, The Network Project Leader and the Network Financial Co-ordinator. Each of the 58 projects involved in the Network, representing a wide range of industrial sectors and disciplines, is distributed in terms of their efforts between 4 disciplinary Clusters covering Inspection, Instrumentation and Monitoring, Structural Mechanics and Maintenance. For each of these Clusters, an expert has been appointed as a Project Technical Auditor to support the elected Cluster Co-ordinator to define Cluster Tasks, which contribute to the overall objectives of the project. From the Project Representatives, Cluster Task Leaders and

  1. Two-Level Scheduling for Video Transmission over Downlink OFDMA Networks.

    Science.gov (United States)

    Tham, Mau-Luen; Chow, Chee-Onn; Xu, Yi-Han; Ramli, Nordin

    2016-01-01

    This paper presents a two-level scheduling scheme for video transmission over downlink orthogonal frequency-division multiple access (OFDMA) networks. It aims to maximize the aggregate quality of the video users subject to the playback delay and resource constraints, by exploiting the multiuser diversity and the video characteristics. The upper level schedules the transmission of video packets among multiple users based on an overall target bit-error-rate (BER), the importance level of packet and resource consumption efficiency factor. Instead, the lower level renders unequal error protection (UEP) in terms of target BER among the scheduled packets by solving a weighted sum distortion minimization problem, where each user weight reflects the total importance level of the packets that has been scheduled for that user. Frequency-selective power is then water-filled over all the assigned subcarriers in order to leverage the potential channel coding gain. Realistic simulation results demonstrate that the proposed scheme significantly outperforms the state-of-the-art scheduling scheme by up to 6.8 dB in terms of peak-signal-to-noise-ratio (PSNR). Further test evaluates the suitability of equal power allocation which is the common assumption in the literature.

  2. Quantized Synchronization of Chaotic Neural Networks With Scheduled Output Feedback Control.

    Science.gov (United States)

    Wan, Ying; Cao, Jinde; Wen, Guanghui

    In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control

  3. Minimum-Energy Wireless Real-Time Multicast by Joint Network Coding and Scheduling Optimization

    Directory of Open Access Journals (Sweden)

    Guoping Tan

    2015-01-01

    Full Text Available For real-time multicast services over wireless multihop networks, to minimize the energy of transmissions with satisfying the requirements of a fixed data rate and high reliabilities, we construct a conflict graph based framework by joint optimizing network coding and scheduling. Then, we propose a primal-dual subgradient optimization algorithm by random sampling K maximal stable sets in a given conflict graph. This method transforms the NP-hard scheduling subproblem into a normal linear programming problem to obtain an approximate solution. The proposed algorithm only needs to adopt centralized technique for solving the linear programming problem while all of the other computations can be distributed. The simulation results show that, comparing with the existing algorithm, this algorithm can not only achieve about 20% performance gain, but also have better performance in terms of convergence and robustness.

  4. Energy latency tradeoffs for medium access and sleep scheduling in wireless sensor networks

    Science.gov (United States)

    Gang, Lu

    Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. The central thesis of this work is that energy efficient medium access and sleep scheduling mechanisms can be designed without necessarily sacrificing application-specific latency performance. We validate this thesis through results from four case studies that cover various aspects of medium access and sleep scheduling design in wireless sensor networks. Our first effort, DMAC, is to design an adaptive low latency and energy efficient MAC for data gathering to reduce the sleep latency. We propose staggered schedule, duty cycle adaptation, data prediction and the use of more-to-send packets to enable seamless packet forwarding under varying traffic load and channel contentions. Simulation and experimental results show significant energy savings and latency reduction while ensuring high data reliability. The second research effort, DESS, investigates the problem of designing sleep schedules in arbitrary network communication topologies to minimize the worst case end-to-end latency (referred to as delay diameter). We develop a novel graph-theoretical formulation, derive and analyze optimal solutions for the tree and ring topologies and heuristics for arbitrary topologies. The third study addresses the problem of minimum latency joint scheduling and routing (MLSR). By constructing a novel delay graph, the optimal joint scheduling and routing can be solved by M node-disjoint paths algorithm under multiple channel model. We further extended the algorithm to handle dynamic traffic changes and topology changes. A heuristic solution is proposed for MLSR under single channel interference. In the fourth study, EEJSPC, we first formulate a fundamental optimization problem that provides tunable

  5. Joint Cell Association and User Scheduling in Carrier Aggregated Heterogeneous Networks

    Directory of Open Access Journals (Sweden)

    Jia Zhang

    2018-01-01

    Full Text Available This paper focuses on the network capacity maximization problem through joint cell association and user scheduling with multiple carrier aggregation (CA in the heterogeneous networks (HetNets. For the downlink transmission, the proposed joint maximization problem is reformulated from single data flow into multiple data flow through carrier aggregated HetNets, in which the users could associate with BSs on more than one carrier band. Such a flexible joint maximization problem could be solved by convex optimization solutions with reasonable complexity. Numerical analysis has confirmed the performance advantages of the proposed multi-flow solution under different carrier aggregation deployment.

  6. Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints

    Directory of Open Access Journals (Sweden)

    Wangtu Xu

    2012-01-01

    Full Text Available This paper proposes a stochastic user equilibrium (SUE assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: (1 ride time, which is composed of in-vehicle and waiting times, (2 overload delay, (3 fare, (4 transfer constraints, and (5 departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model.

  7. Swarm satellite mission scheduling & planning using Hybrid Dynamic Mutation Genetic Algorithm

    Science.gov (United States)

    Zheng, Zixuan; Guo, Jian; Gill, Eberhard

    2017-08-01

    Space missions have traditionally been controlled by operators from a mission control center. Given the increasing number of satellites for some space missions, generating a command list for multiple satellites can be time-consuming and inefficient. Developing multi-satellite, onboard mission scheduling & planning techniques is, therefore, a key research field for future space mission operations. In this paper, an improved Genetic Algorithm (GA) using a new mutation strategy is proposed as a mission scheduling algorithm. This new mutation strategy, called Hybrid Dynamic Mutation (HDM), combines the advantages of both dynamic mutation strategy and adaptive mutation strategy, overcoming weaknesses such as early convergence and long computing time, which helps standard GA to be more efficient and accurate in dealing with complex missions. HDM-GA shows excellent performance in solving both unconstrained and constrained test functions. The experiments of using HDM-GA to simulate a multi-satellite, mission scheduling problem demonstrates that both the computation time and success rate mission requirements can be met. The results of a comparative test between HDM-GA and three other mutation strategies also show that HDM has outstanding performance in terms of speed and reliability.

  8. Learning to repair plans and schedules using a relational (deictic representation

    Directory of Open Access Journals (Sweden)

    J. Palombarini

    2010-09-01

    Full Text Available Unplanned and abnormal events may have a significant impact on the feasibility of plans and schedules which requires to repair them 'on-the-fly' to guarantee due date compliance of orders-in-progress and negotiating delivery conditions for new orders. In this work, a repair-based rescheduling approach based on the integration of intensive simulations with logical and relational reinforcement learning is proposed. Based on a relational (deictic representation of schedule states, a number of repair operators have been designed to guide the search towards a goal state. The knowledge generated via simulation is encoded in a relational regression tree for the Q-value function defining the utility of applying a given repair operator at a given schedule state. A prototype implementation in Prolog language is discussed using a representative example of three batch extruders processing orders for four different products. The learning curve for the problem of inserting a new order vividly illustrates the advantages of logical and relational learning in rescheduling.

  9. Group scheduling based on control-packet batch processing in optical burst switched networks

    Science.gov (United States)

    Yuan, Chi; Li, Zhengbin; He, Yongqi; Xu, Anshi

    2007-11-01

    Optical burst switching (OBS) is proposed as a high-speed, flexible, and transparent technology. It is thought to be the best way to adapt the bursty IP traffic over optical wavelength division multiplexing (WDM) networks. OBS technology facilitates the efficient integration of both IP and WDM. It provides statistical multiplexing gains and avoids long end to end setup time of traditional virtual circuit configuration. However, there are still a lot of challenges, one of which is burst contention. Owing to the fact that random access memory like buffering is not available in the optical domain at present, there exists a real possibility that bursts may contend with one another at a switching node. Many contention resolutions are proposed. The major contention resolutions in literature are wavelength conversion, fiber delay lines, and deflecting routing. In this paper, a new data burst scheduling scheme, called group scheduling based on control-packet batch processing (GSCBP) was proposed to reduce burst contention. Like transmission control protocol, GSCBP has a batch processing window. Control packets which located in the batch processing window are batch processed. A heuristic scheduling algorithm arranges the relevant bursts' route based on the processing result and the network resource. A new node architecture supporting group scheduling was presented. The GSCBP algorithm is combined with wavelength converter and/or fiber delay lines which is shared by some data channels. Meanwhile, an extended open shortest path first (E-OSPF) routing strategy was proposed for OBS. Both GSCBP and E-OSPF are introduced into 14-node national science foundation network by means of simulations. The ETE delay, burst blocking probability, as well as burst dropping probability were attained. Results show that the GSBCP lead to the higher-priority traffic drop rate decrease one order of magnitude, if drop rate and ETE delay of lower priority traffic is sacrificed.

  10. User’s guide to SNAP for ArcGIS® :ArcGIS interface for scheduling and network analysis program

    Science.gov (United States)

    Woodam Chung; Dennis Dykstra; Fred Bower; Stephen O’Brien; Richard Abt; John. and Sessions

    2012-01-01

    This document introduces a computer software named SNAP for ArcGIS® , which has been developed to streamline scheduling and transportation planning for timber harvest areas. Using modern optimization techniques, it can be used to spatially schedule timber harvest with consideration of harvesting costs, multiple products, alternative...

  11. A Method for Automated Planning of FTTH Access Network Infrastructures

    DEFF Research Database (Denmark)

    Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun

    2005-01-01

    In this paper a method for automated planning of Fiber to the Home (FTTH) access networks is proposed. We introduced a systematic approach for planning access network infrastructure. The GIS data and a set of algorithms were employed to make the planning process more automatic. The method explains...

  12. Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network

    Directory of Open Access Journals (Sweden)

    Xiangming Yao

    2017-01-01

    Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.

  13. Task and Participant Scheduling of Trading Platforms in Vehicular Participatory Sensing Networks.

    Science.gov (United States)

    Shi, Heyuan; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang

    2016-11-28

    The vehicular participatory sensing network (VPSN) is now becoming more and more prevalent, and additionally has shown its great potential in various applications. A general VPSN consists of many tasks from task, publishers, trading platforms and a crowd of participants. Some literature treats publishers and the trading platform as a whole, which is impractical since they are two independent economic entities with respective purposes. For a trading platform in markets, its purpose is to maximize the profit by selecting tasks and recruiting participants who satisfy the requirements of accepted tasks, rather than to improve the quality of each task. This scheduling problem for a trading platform consists of two parts: which tasks should be selected and which participants to be recruited? In this paper, we investigate the scheduling problem in vehicular participatory sensing with the predictable mobility of each vehicle. A genetic-based trading scheduling algorithm (GTSA) is proposed to solve the scheduling problem. Experiments with a realistic dataset of taxi trajectories demonstrate that GTSA algorithm is efficient for trading platforms to gain considerable profit in VPSN.

  14. Variable Scheduling to Mitigate Channel Losses in Energy-Efficient Body Area Networks

    Directory of Open Access Journals (Sweden)

    Lavy Libman

    2012-11-01

    Full Text Available We consider a typical body area network (BAN setting in which sensor nodes send data to a common hub regularly on a TDMA basis, as defined by the emerging IEEE 802.15.6 BAN standard. To reduce transmission losses caused by the highly dynamic nature of the wireless channel around the human body, we explore variable TDMA scheduling techniques that allow the order of transmissions within each TDMA round to be decided on the fly, rather than being fixed in advance. Using a simple Markov model of the wireless links, we devise a number of scheduling algorithms that can be performed by the hub, which aim to maximize the expected number of successful transmissions in a TDMA round, and thereby significantly reduce transmission losses as compared with a static TDMA schedule. Importantly, these algorithms do not require a priori knowledge of the statistical properties of the wireless channels, and the reliability improvement is achieved entirely via shuffling the order of transmissions among devices, and does not involve any additional energy consumption (e.g., retransmissions. We evaluate these algorithms directly on an experimental set of traces obtained from devices strapped to human subjects performing regular daily activities, and confirm that the benefits of the proposed variable scheduling algorithms extend to this practical setup as well.

  15. Variable scheduling to mitigate channel losses in energy-efficient body area networks.

    Science.gov (United States)

    Tselishchev, Yuriy; Boulis, Athanassios; Libman, Lavy

    2012-11-02

    We consider a typical body area network (BAN) setting in which sensor nodes send data to a common hub regularly on a TDMA basis, as defined by the emerging IEEE 802.15.6 BAN standard. To reduce transmission losses caused by the highly dynamic nature of the wireless channel around the human body, we explore variable TDMA scheduling techniques that allow the order of transmissions within each TDMA round to be decided on the fly, rather than being fixed in advance. Using a simple Markov model of the wireless links, we devise a number of scheduling algorithms that can be performed by the hub, which aim to maximize the expected number of successful transmissions in a TDMA round, and thereby significantly reduce transmission losses as compared with a static TDMA schedule. Importantly, these algorithms do not require a priori knowledge of the statistical properties of the wireless channels, and the reliability improvement is achieved entirely via shuffling the order of transmissions among devices, and does not involve any additional energy consumption (e.g., retransmissions). We evaluate these algorithms directly on an experimental set of traces obtained from devices strapped to human subjects performing regular daily activities, and confirm that the benefits of the proposed variable scheduling algorithms extend to this practical setup as well.

  16. Design and analysis of self-adapted task scheduling strategies in wireless sensor networks.

    Science.gov (United States)

    Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong

    2011-01-01

    In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm's ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms.

  17. Two novel batch scheduling algorithms with insufficient wavelength converters in optical burst switching networks

    Science.gov (United States)

    Huang, Sheng; Pang, Hong-Feng; Li, Ling-Xia

    2013-03-01

    In optical burst switching networks, wavelength converters (WCs) of core nodes are used to decrease the burst loss rate. The implementation of the WCs is difficult in the current technology and the cost of WCs is high. So some core nodes may be configured insufficient WCs to reduce the cost in OBS networks. However, many data channel scheduling algorithms do not count the number of WCs and the performance of burst loss rate is not good in the condition of insufficient WCs. To overcome the defect, two novel batch scheduling algorithm with insufficiency of WC are proposed in this paper. The former algorithm improves the WCs' resource utilization probability to reduce the burst loss rate and the later algorithm saves the WCs' resource for the incoming bursts to use to improve the burst loss performance. The later algorithm can reduce more burst loss rate with the same number of WCs, compared with the other scheduling algorithms. The simulation results show that the later algorithm is more effective in reducing the burst loss rate with insufficient WCs.

  18. Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Saoucene Mahfoudh

    2010-08-01

    Full Text Available Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

  19. Energy-Efficient Opportunistic Transmission Scheduling for Sparse Sensor Networks with Mobile Relays

    Directory of Open Access Journals (Sweden)

    Wei Liu

    2016-01-01

    Full Text Available Wireless sensing devices have been widely used in civilian and military applications over the past decade. In some application scenarios, the sensors are sparsely deployed in the field and are costly or infeasible to have stable communication links for delivering the collected data to the destined server. A possible solution is to utilize the motion of entities that are already present in the environment to provide opportunistic relaying services for sensory data. In this paper, we design and propose a new scheduling scheme that opportunistically schedules data transmissions based on the optimal stopping theory, with a view of minimizing the energy consumption on network probes for data delivery. In fact, by exploiting the stochastic characteristics of the relay motion, we can postpone the communication up to an acceptable time deadline until the best relay is found. Simulation results validate the effectiveness of the derived optimal strategy.

  20. Efficient Optimization Methods for Communication Network Planning and Assessment

    OpenAIRE

    Kiese, Moritz

    2010-01-01

    In this work, we develop efficient mathematical planning methods to design communication networks. First, we examine future technologies for optical backbone networks. As new, more intelligent nodes cause higher dynamics in the transport networks, fast planning methods are required. To this end, we develop a heuristic planning algorithm. The evaluation of the cost-efficiency of new, adapative transmission techniques comprises the second topic of this section. In the second part of this work, ...

  1. Prescription Drug Plan Formulary, Pharmacy Network, and P...

    Data.gov (United States)

    U.S. Department of Health & Human Services — These public use files contain formulary, pharmacy network, and pricing data for Medicare Prescription Drug Plans and Medicare Advantage Prescription Drug Plans...

  2. Optimal Fair Scheduling in S-TDMA Sensor Networks for Monitoring River Plumes

    Directory of Open Access Journals (Sweden)

    Miguel-Angel Luque-Nieto

    2016-01-01

    Full Text Available Underwater wireless sensor networks (UWSNs are a promising technology to provide oceanographers with environmental data in real time. Suitable network topologies to monitor estuaries are formed by strings coming together to a sink node. This network may be understood as an oriented graph. A number of MAC techniques can be used in UWSNs, but Spatial-TDMA is preferred for fixed networks. In this paper, a scheduling procedure to obtain the optimal fair frame is presented, under ideal conditions of synchronization and transmission errors. The main objective is to find the theoretical maximum throughput by overlapping the transmissions of the nodes while keeping a balanced received data rate from each sensor, regardless of its location in the network. The procedure searches for all cliques of the compatibility matrix of the network graph and solves a Multiple-Vector Bin Packing (MVBP problem. This work addresses the optimization problem and provides analytical and numerical results for both the minimum frame length and the maximum achievable throughput.

  3. TRADING-OFF CONSTRAINTS IN THE PUMP SCHEDULING OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

    Directory of Open Access Journals (Sweden)

    Gencer Genço\\u011Flu

    2016-01-01

    Full Text Available Pumps are one of the essential components of water supply systems. Depending of the topography, a water supply system may completely rely on pumping. They may consume non-negligible amount of water authorities' budgets during operation. Besides their energy costs, maintaining the healthiness of pumping systems is another concern for authorities. This study represents a multi-objective optimization method for pump scheduling problem. The optimization objective contains hydraulic and operational constraints. Switching of pumps and usage of electricity tariff are assumed to be key factors for operational reliability and energy consumption and costs of pumping systems. The local optimals for systems operational reliability, energy consumptions and energy costs are investigated resulting from trading-off pump switch and electricity tariff constraints within given set of boundary conditions. In the study, a custom made program is employed that combines genetic algorithm based optimization module with hydraulic network simulation software -EPANET. Developed method is applied on the case study network; N8-3 pressure zone of the Northern Supply of Ankara (Turkey Water Distribution Network. This work offers an efficient method for water authorities aiming to optimize pumping schedules considering expenditures and operational reliability mutually.

  4. Multiobjective Joint Optimization of Production Scheduling and Maintenance Planning in the Flexible Job-Shop Problem

    Directory of Open Access Journals (Sweden)

    Jianfei Ye

    2015-01-01

    Full Text Available In order to solve the joint optimization of production scheduling and maintenance planning problem in the flexible job-shop, a multiobjective joint optimization model considering the maximum completion time and maintenance costs per unit time is established based on the concept of flexible job-shop and preventive maintenance. A weighted sum method is adopted to eliminate the index dimension. In addition, a double-coded genetic algorithm is designed according to the problem characteristics. The best result under the circumstances of joint decision-making is obtained through multiple simulation experiments, which proves the validity of the algorithm. We can prove the superiority of joint optimization model by comparing the result of joint decision-making project with the result of independent decision-making project under fixed preventive maintenance period. This study will enrich and expand the theoretical framework and analytical methods of this problem; it provides a scientific decision analysis method for enterprise to make production plan and maintenance plan.

  5. Using Data Mining Techniques on APC Data to Develop Effective Bus Scheduling Plans

    Directory of Open Access Journals (Sweden)

    Jayakrishna PATNAIK

    2006-02-01

    Full Text Available Various trip generators (e.g., buildings, shopping malls, recreational centers continually influence travel demand in urban and suburban areas. As a result, the headway regularity that should be kept among transit vehicles is difficult to maintain, specifically during peak hours. The variation of headways lengthens the average wait times and deteriorates service quality. Providing a tool to monitor and maintain most up-to-date information through Advanced Traveler Information Systems (ATIS can assist effective system planning and scheduling, while reducing the door-to-door travel time. This paper develops a methodology for clustering the state variables (number served passengers and halting stations in each vehicle trip and using that for service planning. The data used to develop the models were collected by Automatic Passenger Counters (APC on buses operated by a transit agency in the northeast region of the United States. The results illustrate that the developed tool can provide suggestions for improving systems performance as well as future planning.

  6. Studying the Orange Peel Schedule as a Candidate Observation Plan for SIM

    Science.gov (United States)

    Schwartz, A.; Boden, A.; Wehrle, A. E.

    2004-12-01

    The Space Interferometry Mission will conduct multiple observations of stars and other astronomical objects to obtain positions, proper motions and parallax information, and ultimately to search for extrasolar planets. The observation sequence for each object will be conducted over the life of the mission (5-10 yr) and the time intervals between observations of an object may vary in a logarithmic or other manner. Where cadence issues are not of concern, objects may be observed at various intervals and all such objects that can be observed within a small (approx. 7.5 degree radial) region of the sky may, for scheduling efficiency, be observed sequentially within that region on a periodic basis. In addition, an astrometric reference grid will be generated by observing, at periodic intervals, a set of known astrometrically stable stars spread uniformly over the celestial sphere. In order to balance competing requirement of observing cadence constraints, grid observation periodicity, and observation efficiency, as well as the desire to maximize the science return over the life of the mission, intensive studies of the "Orange Peel" scheduling plan are being examined. This paper presents an analysis of how well this approach addresses the overall goals of SIM, especially in the areas of parallax measurement and observational cadence efficiency.

  7. Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks

    KAUST Repository

    Douik, Ahmed

    2016-03-28

    In the context of resource allocation in cloud- radio access networks, recent studies assume either signal-level or scheduling-level coordination. This paper, instead, considers a hybrid level of coordination for the scheduling problem in the downlink of a multi-cloud radio- access network, so as to benefit from both scheduling policies. Consider a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and therefore allows joint signal processing between them. Across the multiple clouds, however, only scheduling-level coordination is permitted, as it requires a lower level of backhaul communication. The frame structure of every BS is composed of various time/frequency blocks, called power- zones (PZs), and kept at fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled, at most, to a single cloud, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs\\' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The scheduling problem is, then, shown to be equivalent to a maximum- weight independent set problem in the constructed graph, in which each vertex symbolizes an association of cloud, user, BS and PZ, with a weight representing the utility of that association. Simulation results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

  8. Developing a succession plan: the North Bronx Healthcare Network.

    Science.gov (United States)

    Soares, Denise C

    2002-12-01

    After 3 years of reorganizing a nursing department, surviving 2 very successful Joint Commission on Accreditation of Healthcare Organizations (JCAHO) visits, developing an outcomes-based leadership program for head nurses, and assisting a large health care network navigate change, a nurse executive stops to think about succession planning. The challenge to develop a plan includes her own history, others' definitions, and finally developing her own definition and plan. Included are the complications of planning within a network that includes long-term and loyal employees. Finally, the steps to achieving that plan are outlined with the goal of having the nursing department continue to flourish and survive in a diverse network system.

  9. An UAV scheduling and planning method for post-disaster survey

    Science.gov (United States)

    Li, G. Q.; Zhou, X. G.; Yin, J.; Xiao, Q. Y.

    2014-11-01

    Annually, the extreme climate and special geological environments lead to frequent natural disasters, e.g., earthquakes, floods, etc. The disasters often bring serious casualties and enormous economic losses. Post-disaster surveying is very important for disaster relief and assessment. As the Unmanned Aerial Vehicle (UAV) remote sensing with the advantage of high efficiency, high precision, high flexibility, and low cost, it is widely used in emergency surveying in recent years. As the UAVs used in emergency surveying cannot stop and wait for the happening of the disaster, when the disaster happens the UAVs usually are working at everywhere. In order to improve the emergency surveying efficiency, it is needed to track the UAVs and assign the emergency surveying task for each selected UAV. Therefore, a UAV tracking and scheduling method for post-disaster survey is presented in this paper. In this method, Global Positioning System (GPS), and GSM network are used to track the UAVs; an emergency tracking UAV information database is built in advance by registration, the database at least includes the following information, e.g., the ID of the UAVs, the communication number of the UAVs; when catastrophe happens, the real time location of all UAVs in the database will be gotten using emergency tracking method at first, then the traffic cost time for all UAVs to the disaster region will be calculated based on the UAVs' the real time location and the road network using the nearest services analysis algorithm; the disaster region is subdivided to several emergency surveying regions based on DEM, area, and the population distribution map; the emergency surveying regions are assigned to the appropriated UAV according to shortest cost time rule. The UAVs tracking and scheduling prototype is implemented using SQLServer2008, ArcEnginge 10.1 SDK, Visual Studio 2010 C#, Android, SMS Modem, and Google Maps API.

  10. Composable Flexible Real-time Packet Scheduling for Networks on-Chip

    Science.gov (United States)

    2012-05-16

    the packets at the flow’s source. 2) Preemptive EDF Scheduling: As wormhole flow control allows sending packets sent flit-by-flit, we could employ a...analysis of wormhole based heterogeneous noc. In Proceedings of the 2011 Fifth ACM/IEEE International Symposium on Networks-on-Chip, NOCS ’11, pages 161–168...Computer Architecture, ISCA ’08, pages 89–100, Washington, DC, USA, 2008. IEEE Computer Society. [14] Sunggu Lee. Real-time wormhole channels. Journal of

  11. Access management in Safer Transportation Network Planning : safety principles, planning framework, and library information.

    NARCIS (Netherlands)

    Hummel, T.

    2001-01-01

    This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

  12. Route management in Safer Transportation Network Planning : safety principles, planning framework, and library information.

    NARCIS (Netherlands)

    Hummel, T.

    2001-01-01

    This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

  13. Distortion Optimized Packet Scheduling and Prioritization of Multiple Video Streams over 802.11e Networks

    Directory of Open Access Journals (Sweden)

    Ilias Politis

    2007-01-01

    Full Text Available This paper presents a generic framework solution for minimizing video distortion of all multiple video streams transmitted over 802.11e wireless networks, including intelligent packet scheduling and channel access differentiation mechanisms. A distortion prediction model designed to capture the multireferenced frame coding characteristic of H.264/AVC encoded videos is used to predetermine the distortion importance of each video packet in all streams. Two intelligent scheduling algorithms are proposed: the “even-loss distribution,” where each video sender is experiencing the same loss and the “greedy-loss distribution” packet scheduling, where selected packets are dropped over all streams, ensuring that the most significant video stream in terms of picture context and quality characteristics will experience minimum losses. The proposed model has been verified with actual distortion measurements and has been found more accurate than the “additive distortion” model that omits the correlation among lost frames. The paper includes analytical and simulation results from the comparison of both schemes and from their comparison to the simplified additive model, for different video sequences and channel conditions.

  14. Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

    KAUST Repository

    Celik, Abdulkadir

    2016-09-12

    In this paper, we consider heterogeneous cognitive radio networks (CRNs) comprising primary channels (PCs) with heterogeneous characteristics and secondary users (SUs) with various sensing and reporting qualities for different PCs. We first define the opportunity as the achievable total data rate and its cost as the energy consumption caused from sensing, reporting, and channel switching operations and formulate a joint spectrum discovery and energy efficiency objective to minimize the energy spent per unit of data rate. Then, a mixed integer nonlinear programming problem is formulated to determine: 1) the optimal subset of PCs to be scheduled for sensing; 2) the SU assignment set for each scheduled PC; and 3) sensing durations and detection thresholds of each SU on PCs it is assigned to sense. Thereafter, an equivalent convex framework is developed for specific instances of the above combinatorial problem. For comparison, optimal detection and sensing thresholds are also derived analytically under the homogeneity assumption. Based on these, a prioritized ordering heuristic is developed to order channels under the spectrum, energy, and spectrum-energy limited regimes. After that, a scheduling and assignment heuristic is proposed and is shown to perform very close to the exhaustive optimal solution. Finally, the behavior of the CRN is numerically analyzed under these regimes with respect to different numbers of SUs, PCs, and sensing qualities.

  15. An unit cost adjusting heuristic algorithm for the integrated planning and scheduling of a two-stage supply chain

    Directory of Open Access Journals (Sweden)

    Jianhua Wang

    2014-10-01

    Full Text Available Purpose: The stable relationship of one-supplier-one-customer is replaced by a dynamic relationship of multi-supplier-multi-customer in current market gradually, and efficient scheduling techniques are important tools of the dynamic supply chain relationship establishing process. This paper studies the optimization of the integrated planning and scheduling problem of a two-stage supply chain with multiple manufacturers and multiple retailers to obtain a minimum supply chain operating cost, whose manufacturers have different production capacities, holding and producing cost rates, transportation costs to retailers.Design/methodology/approach: As a complex task allocation and scheduling problem, this paper sets up an INLP model for it and designs a Unit Cost Adjusting (UCA heuristic algorithm that adjust the suppliers’ supplying quantity according to their unit costs step by step to solve the model.Findings: Relying on the contrasting analysis between the UCA and the Lingo solvers for optimizing many numerical experiments, results show that the INLP model and the UCA algorithm can obtain its near optimal solution of the two-stage supply chain’s planning and scheduling problem within very short CPU time.Research limitations/implications: The proposed UCA heuristic can easily help managers to optimizing the two-stage supply chain scheduling problems which doesn’t include the delivery time and batch of orders. For two-stage supply chains are the most common form of actual commercial relationships, so to make some modification and study on the UCA heuristic should be able to optimize the integrated planning and scheduling problems of a supply chain with more reality constraints.Originality/value: This research proposes an innovative UCA heuristic for optimizing the integrated planning and scheduling problem of two-stage supply chains with the constraints of suppliers’ production capacity and the orders’ delivering time, and has a great

  16. Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks.

    Science.gov (United States)

    Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

    2017-09-15

    Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller's direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20-40% while ensuring feasible data delay.

  17. Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yunkai Wei

    2017-09-01

    Full Text Available Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs are an inexorable trend for Wireless Sensor Networks (WSNs, including Wireless Rechargeable Sensor Network (WRSNs. However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay.

  18. Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

    Science.gov (United States)

    Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

    2017-01-01

    Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay. PMID:28914816

  19. Sleep-time sizing and scheduling in green passive optical networks

    KAUST Repository

    Elrasad, Amr

    2012-08-01

    Next-generation passive optical network (PON) has been widely considered as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue for its operations. In this paper, we present a novel sleep time sizing and scheduling framework that satisfies power efficient bandwidth allocation in PONs. We consider the downstream links from an optical line terminal (OLT) to an optical network unit (ONU). The ONU has two classes of traffic, control and data. Control traffic are delay intolerant with higher priority than the data traffic. Closed form model for average ONU sleeping time and end-to-end data traffic delay are presented and evaluated. Our framework decouples the dependency between ONU sleeping time and the QoS of the traffic.

  20. Threshold Based Opportunistic Scheduling of Secondary Users in Underlay Cognitive Radio Networks

    KAUST Repository

    Song, Yao

    2011-12-01

    In underlay cognitive radio networks, secondary users can share the spectrum with primary users as long as the interference caused by the secondary users to primary users is below a certain predetermined threshold. It is reasonable to assume that there is always a large pool of secondary users trying to access the channel, which can be occupied by only one secondary user at a given time. As a result, a multi-user scheduling problem arises among the secondary users. In this thesis, by manipulating basic schemes based on selective multi-user diversity, normalized thresholding, transmission power control, and opportunistic round robin, we propose and analyze eight scheduling schemes of secondary users in an underlay cognitive radio set-up. The system performance of these schemes is quantified by using various performance metrics such as the average system capacity, normalized average feedback load, scheduling outage probability, and system fairness of access. In our proposed schemes, the best user out of all the secondary users in the system is picked to transmit at each given time slot in order to maximize the average system capacity. Two thresholds are used in the two rounds of the selection process to determine the best user. The first threshold is raised by the power constraint from the primary user. The second threshold, which can be adjusted by us, is introduced to reduce the feedback load. The overall system performance is therefore dependent on the choice of these two thresholds and the number of users in the system given the channel conditions for all the users. In this thesis, by deriving analytical formulas and presenting numerical examples, we try to provide insights of the relationship between the performance metrics and the involved parameters including two selection thresholds and the number of active users in the system, in an effort to maximize the average system capacity as well as satisfy the requirements of scheduling outage probability and

  1. Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks

    KAUST Repository

    Douik, Ahmed

    2017-07-17

    In practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling devices to the frames’ radio resources blocks (RRBs) of the single-antenna base-stations (BSs), adjusting the transmit power levels, and for synchronizing the transmit frames across the connected BSs. Previous studies show that the jointly coordinated scheduling and power control problem in the considered CRAN can be solved using an approach that scales exponentially with the number of BSs, devices, and RRBs, which makes the practical implementation infeasible for reasonably sized networks. This paper instead proposes a low-complexity solution to the problem, under the constraints that each device cannot be served by more than one BS but can be served by multiple RRBs within each BS frame, and under the practical assumption that the channel is constant during the duration of each frame. The paper utilizes graph-theoretical based techniques and shows that constructing a single power control graph is sufficient to obtain the optimal solution with a complexity that is independent of the number of RRBs. Simulation results reveal the optimality of the proposed solution for slow-varying channels, and show that the solution performs near-optimal for highly correlated channels.

  2. A Schedule-based Multi-channel MAC Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ilyoung Chong

    2010-10-01

    Full Text Available Due to the half-duplex property of the sensor radio and the broadcast nature of wireless medium, limited bandwidth remains a pressing issue for wireless sensor networks (WSNs. The design of multi-channel MAC protocols has attracted the interest of many researchers as a cost effective solution to meet the higher bandwidth demand for the limited bandwidth in WSN. In this paper, we present a scheduled-based multi-channel MAC protocol to improve network performance. In our protocol, each receiving node selects (schedules some timeslot(s, in which it may receive data from the intending sender(s. The timeslot selection is done in a conflict free manner, where a node avoids the slots that are already selected by others in its interference range. To minimize the conflicts during timeslot selection, we propose a unique solution by splitting the neighboring nodes into different groups, where nodes of a group may select the slots allocated to that group only. We demonstrate the effectiveness of our approach thorough simulations in terms of performance parameters such as aggregate throughput, packet delivery ratio, end-to-end delay, and energy consumption.

  3. A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network

    Directory of Open Access Journals (Sweden)

    Chao Lu

    2016-01-01

    Full Text Available This paper is concerned with the scheduling of Electrical Multiple Units (EMUs under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks.

  4. Risk-aware scheduling for multi-user video streaming over wireless multi-hop networks

    Science.gov (United States)

    Shiang, Hsien-Po; van der Schaar, Mihaela

    2008-01-01

    To cope with the time-varying network conditions, various error-protection and channel adaptation strategies have been proposed at different layers of the protocol stack. However, these cross-layer strategies can be efficiently optimized only if they act on accurate information about the network conditions and hence, are able to timely adapt to network changes. We analyze the impact of such information feedback on the video quality performances of the collaborative multimedia users sharing the same multi-hop wireless infrastructure. Based on the information feedback, we can estimate the risk that packets from different priority and deadline classes will not arrive at their destination before their decoding deadline. Subsequently, cross-layer optimization strategies such as packet scheduling, retransmission (due to transmission error) limit are adapted to jointly consider the estimated risk as well as the impact in terms of distortion of not receiving different priority packets. Our results quantify the risk estimation and its benefit in different network conditions and for various video applications with different delay constraints.

  5. Energy efficient distributed cluster head scheduling scheme for two tiered wireless sensor network

    Directory of Open Access Journals (Sweden)

    G. Kannan

    2015-07-01

    Full Text Available Wireless Sensor Network (WSN provides a significant contribution in the emerging fields such as ambient intelligence and ubiquitous computing. In WSN, optimization and load balancing of network resources are critical concern to provide the intelligence for long duration. Since clustering the sensor nodes can significantly enhance overall system scalability and energy efficiency this paper presents a distributed cluster head scheduling (DCHS algorithm to achieve the network longevity in WSN. The major novelty of this work is that the network is divided into primary and secondary tiers based on received signal strength indication of sensor nodes from the base station. The proposed DCHS supports for two tier WSN architecture and gives suggestion to elect the cluster head nodes and gateway nodes for both primary and secondary tiers. The DCHS mechanism satisfies an ideal distribution of the cluster head among the sensor nodes and avoids frequent selection of cluster head, based on Received Signal Strength Indication (RSSI and residual energy level of the sensor nodes. Since the RSSI is the key parameter for this paper, the practical experiment was conducted to measure RSSI value by using MSP430F149 processor and CC2500 transceiver. The measured RSSI values were given input to the event based simulator to test the DCHS mechanism. The real time experimental study validated the proposed scheme for various scenarios.

  6. Planning and Scheduling of Payloads of AstroSat During Initial and ...

    Indian Academy of Sciences (India)

    R. Pandiyan

    2017-06-20

    Jun 20, 2017 ... The process is found to be labour intensive and several operational software tools, encompassing spacecraft sub-systems, on-orbit, .... ing of scheduling and command generating software packages that were part of 'optimal .... Scheduler design for payloads. The payload scheduler has several modules ...

  7. 40 CFR 58.10 - Annual monitoring network plan and periodic network assessment.

    Science.gov (United States)

    2010-07-01

    ... are being proposed for discontinuance, the effect on data users other than the agency itself, such as... opportunity for public comment and shall approve or disapprove the plan and schedule within 120 days. If the State or local agency has already provided a public comment opportunity on its plan and has made no...

  8. A Wireless Communications Laboratory on Cellular Network Planning

    Science.gov (United States)

    Dawy, Z.; Husseini, A.; Yaacoub, E.; Al-Kanj, L.

    2010-01-01

    The field of radio network planning and optimization (RNPO) is central for wireless cellular network design, deployment, and enhancement. Wireless cellular operators invest huge sums of capital on deploying, launching, and maintaining their networks in order to ensure competitive performance and high user satisfaction. This work presents a lab…

  9. Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

    Science.gov (United States)

    Cui, Laizhong; Lu, Nan; Chen, Fu

    2014-01-01

    Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

  10. QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

    Science.gov (United States)

    Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

    2016-02-01

    As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

  11. Transmission network expansion planning with simulation optimization

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Berscheid, Alan [Los Alamos National Laboratory; Toole, G. Loren [Los Alamos National Laboratory

    2010-01-01

    Within the electric power literatW''e the transmi ssion expansion planning problem (TNEP) refers to the problem of how to upgrade an electric power network to meet future demands. As this problem is a complex, non-linear, and non-convex optimization problem, researchers have traditionally focused on approximate models. Often, their approaches are tightly coupled to the approximation choice. Until recently, these approximations have produced results that are straight-forward to adapt to the more complex (real) problem. However, the power grid is evolving towards a state where the adaptations are no longer easy (i.e. large amounts of limited control, renewable generation) that necessitates new optimization techniques. In this paper, we propose a generalization of the powerful Limited Discrepancy Search (LDS) that encapsulates the complexity in a black box that may be queJied for information about the quality of a proposed expansion. This allows the development of a new optimization algOlitlun that is independent of the underlying power model.

  12. A novel generic optimization method for irrigation scheduling under multiple objectives and multiple hierarchical layers in a canal network

    Science.gov (United States)

    Delgoda, Dilini; Malano, Hector; Saleem, Syed K.; Halgamuge, Malka N.

    2017-07-01

    This research proposes a novel generic method for irrigation scheduling in a canal network to optimize multiple objectives related to canal scheduling (e.g. maximizing water supply and minimizing imbalance of water distribution) within multiple hierarchical layers (e.g. the layers consisting of the main canal, distributaries) while utilizing traditional canal scheduling methods. It is based on modularizing the optimization process. The method is theoretically capable of optimizing an unlimited number of user-defined objectives within an unlimited number of hierarchical layers and only limited by resource availability (e.g. maximum canal capacity and water limitations) in the network. It allows flexible decision-making through quantification of the mutual effects of optimizing conflicting objectives and is adaptable to available multi-objective evolutionary algorithms. The method's application is demonstrated using a hypothetical canal network example with six objectives and three hierarchical layers, and a real scenario with four objectives and two layers.

  13. Intelligent retail logistics scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Rowe, J.; Jewers, K. [Stamford House, London (United Kingdom); Codd, A.; Alcock, A. [Inference Corp., Slough, Berkshire (United Kingdom)

    1996-12-31

    The Supply Chain Integrated Ordering Network (SCION) Depot Bookings system automates the planning and scheduling of perishable and non-perishable commodities and the vehicles that carry them into J. Sainsbury depots. This is a strategic initiative, enabling the business to make the key move from weekly to daily ordering. The system is mission critical, managing the inwards flow of commodities from suppliers into J. Sainsbury`s depots. The system leverages Al techniques to provide a business solution that meets challenging functional and performance needs. The SCION Depot Bookings system is operational providing schedules for 22 depots across the UK.

  14. An Improved Harmony Search Algorithm for Power Distribution Network Planning

    Directory of Open Access Journals (Sweden)

    Wei Sun

    2015-01-01

    Full Text Available Distribution network planning because of involving many variables and constraints is a multiobjective, discrete, nonlinear, and large-scale optimization problem. Harmony search (HS algorithm is a metaheuristic algorithm inspired by the improvisation process of music players. HS algorithm has several impressive advantages, such as easy implementation, less adjustable parameters, and quick convergence. But HS algorithm still has some defects such as premature convergence and slow convergence speed. According to the defects of the standard algorithm and characteristics of distribution network planning, an improved harmony search (IHS algorithm is proposed in this paper. We set up a mathematical model of distribution network structure planning, whose optimal objective function is to get the minimum annual cost and constraint conditions are overload and radial network. IHS algorithm is applied to solve the complex optimization mathematical model. The empirical results strongly indicate that IHS algorithm can effectively provide better results for solving the distribution network planning problem compared to other optimization algorithms.

  15. Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks

    CERN Document Server

    Jiang, Feng; Swindlehurst, A Lee

    2012-01-01

    We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order to optimize the connectivity of the network, which we define to be the probability that all links can achieve the required throughput. In addition to time multiplexing, the MIMO nodes also employ beamforming to manage interference when links are simultaneously active, and the beamformers are designed with the maximum connectivity metric in mind. The effects of outdated channel state information (CSI) are taken into accoun...

  16. Achieving Passive Localization with Traffic Light Schedules in Urban Road Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qiang Niu

    2016-10-01

    Full Text Available Localization is crucial for the monitoring applications of cities, such as road monitoring, environment surveillance, vehicle tracking, etc. In urban road sensor networks, sensors are often sparely deployed due to the hardware cost. Under this sparse deployment, sensors cannot communicate with each other via ranging hardware or one-hop connectivity, rendering the existing localization solutions ineffective. To address this issue, this paper proposes a novel Traffic Lights Schedule-based localization algorithm (TLS, which is built on the fact that vehicles move through the intersection with a known traffic light schedule. We can first obtain the law by binary vehicle detection time stamps and describe the law as a matrix, called a detection matrix. At the same time, we can also use the known traffic light information to construct the matrices, which can be formed as a collection called a known matrix collection. The detection matrix is then matched in the known matrix collection for identifying where sensors are located on urban roads. We evaluate our algorithm by extensive simulation. The results show that the localization accuracy of intersection sensors can reach more than 90%. In addition, we compare it with a state-of-the-art algorithm and prove that it has a wider operational region.

  17. Practice-Oriented Optimization of Distribution Network Planning Using Metaheuristic Algorithms

    NARCIS (Netherlands)

    M.O.W. Grond; N.H. Luong (Ngoc Hoang); J. Morren (Johan); P.A.N. Bosman (Peter); J.G. Slootweg; J.A. La Poutré (Han)

    2014-01-01

    htmlabstractDistribution network operators require more advanced planning tools to deal with the challenges of future network planning. An appropriate planning and optimization tool can identify which option for network extension should be selected from available alternatives. However, many

  18. An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

    Science.gov (United States)

    Dao, Son Duy; Abhary, Kazem; Marian, Romeo

    2017-01-01

    Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial, NP-hard problem, for which no polynomial time algorithm is known to produce an optimal result on a random graph. In this paper, the further development of Genetic Algorithm (GA) for this integrated optimization is presented. Because of the dynamic nature of the problem, the size of its solution is variable. To deal with this variability and find an optimal solution to the problem, GA with new features in chromosome encoding, crossover, mutation, selection as well as algorithm structure is developed herein. With the proposed structure, the proposed GA is able to "learn" from its experience. Robustness of the proposed GA is demonstrated by a complex numerical example in which performance of the proposed GA is compared with those of three commercial optimization solvers.

  19. Technical Report: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    2008-01-01

    In this paper, we present The Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem....... The aim of the planning problem is twofold. A number of compulsory operations are generated, in order to comply with short term planning requirements. These operations are mostly moves of arriving and leaving slabs in the yard. A number of non-compulsory operations with a long term purpose are also...

  20. Reducing Communication Overhead by Scheduling TCP Transfers on Mobile Devices using Wireless Network Performance Maps

    DEFF Research Database (Denmark)

    Højgaard-Hansen, Kim; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

    2012-01-01

    of such performance maps. We demonstrate how the framework can be used to reduce the retransmissions and to better utilise network resources when performing TCP-based file downloads in vehicular M2M communication scenarios. The approach works on top of a standard TCP stack hence has to map identified transmission...... intervals to predicted TCP data volumes. The file download optimisation is evaluated using extensive simulations comparing the TCP scheduling approach to a normal transfer. The performance map is generated by capturing round-trip time measurements and a threshold approach for the mean value for a given area...... potential for improvement in reducing the communication overhead compared with an ordinary TCP transfer....

  1. A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Thi-Nga Dao

    2016-01-01

    Full Text Available Many applications in wireless sensor networks (WSNs require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

  2. Optical Networks Solutions planning - performances - management

    DEFF Research Database (Denmark)

    Fenger, Christian

    2002-01-01

    are kept optical and not converted into the optical domain. The focus is on the scientific results achieved throughout the Ph.D. period. Five subjects – all increasing the understanding of optical networks – are studied. Static wavelength routed optical networks are studied. Management on terms....... An explicit solution for network blocking probability has been derived, and fixed point equations for alternate routing are derived. Secondly is self similar traffic studied and the effect on optical networks considered. The Synchronous Optical Hierarchy is suggested as a new type of network to overcome...

  3. Thematic Research network for emergency and UnScheduled Treatment (TRUST: scoping the potential

    Directory of Open Access Journals (Sweden)

    Edwards Adrian

    2008-01-01

    Full Text Available Abstract Background To identify the benefits of a network in emergency and unscheduled care research, a six week scoping study was undertaken. Objectives were to: draw together stakeholders; identify and prioritise research topics; identify sites for recruitment to studies; and agree a research strategy for a network. Methods A workshop was held to discuss and agree a research strategy based on results from four activities: visits to established research centres in emergency and unscheduled care; a literature overview; interviews with stakeholders in a GP out-of-hours service; and an exploration of the potential for routine data to support research in emergency care. Results Participants attended the workshop from user groups, primary care, the ambulance service, social care, the national telephone based health helpline, the Welsh Assembly Government and the academic sector. Site visits identified opportunities for collaboration. Gaps in knowledge were identified concerning the effectiveness of alternative models of emergency care delivery. Interview data highlighted a lack of evidence related to the quality of out-of-hours provision of primary care. The All Wales Injury Surveillance System (AWISS was found to offer the potential to use routine data to support quantitative studies in emergency care. Three key issues emerged across all activities: working across boundaries; patient involvement; and triage. Conclusion The study included views from patient, provider, policy and academic perspectives and built the case for a research network in emergency care. Now funded, TRUST (Thematic Research network for emergency and UnScheduled Treatment will allow the development of research proposals, building of research teams and recruitment of sites and patients both in Wales and across the UK. It aims to address the imbalance between investment and research in this area and help support provision of 'the right care to the right people at the right time'.

  4. A Mobile Network Planning Tool Based on Data Analytics

    Directory of Open Access Journals (Sweden)

    Jessica Moysen

    2017-01-01

    Full Text Available Planning future mobile networks entails multiple challenges due to the high complexity of the network to be managed. Beyond 4G and 5G networks are expected to be characterized by a high densification of nodes and heterogeneity of layers, applications, and Radio Access Technologies (RAT. In this context, a network planning tool capable of dealing with this complexity is highly convenient. The objective is to exploit the information produced by and already available in the network to properly deploy, configure, and optimise network nodes. This work presents such a smart network planning tool that exploits Machine Learning (ML techniques. The proposed approach is able to predict the Quality of Service (QoS experienced by the users based on the measurement history of the network. We select Physical Resource Block (PRB per Megabit (Mb as our main QoS indicator to optimise, since minimizing this metric allows offering the same service to users by consuming less resources, so, being more cost-effective. Two cases of study are considered in order to evaluate the performance of the proposed scheme, one to smartly plan the small cell deployment in a dense indoor scenario and a second one to timely face a detected fault in a macrocell network.

  5. Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

    Directory of Open Access Journals (Sweden)

    Huiling Fu

    2012-01-01

    Full Text Available Among the most commonly used methods of scheduling train stops are practical experience and various “one-step” optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR network such as the one in China. This paper introduces a two-stage approach for train stop scheduling with a goal of efficiently organizing passenger traffic into a rational train stop pattern combination while retaining features of regularity, connectivity, and rapidity (RCR. Based on a three-level station classification definition, a mixed integer programming model and a train operating tactics descriptive model along with the computing algorithm are developed and presented for the two stages. A real-world numerical example is presented using the Chinese HSR network as the setting. The performance of the train stop schedule and the applicability of the proposed approach are evaluated from the perspective of maintaining RCR.

  6. Performance Analysis of Physical Layer Security of Opportunistic Scheduling in Multiuser Multirelay Cooperative Networks

    Directory of Open Access Journals (Sweden)

    Kyusung Shim

    2017-02-01

    Full Text Available In this paper, we study the physical layer security (PLS of opportunistic scheduling for uplink scenarios of multiuser multirelay cooperative networks. To this end, we propose a low-complexity, yet comparable secrecy performance source relay selection scheme, called the proposed source relay selection (PSRS scheme. Specifically, the PSRS scheme first selects the least vulnerable source and then selects the relay that maximizes the system secrecy capacity for the given selected source. Additionally, the maximal ratio combining (MRC technique and the selection combining (SC technique are considered at the eavesdropper, respectively. Investigating the system performance in terms of secrecy outage probability (SOP, closed-form expressions of the SOP are derived. The developed analysis is corroborated through Monte Carlo simulation. Numerical results show that the PSRS scheme significantly improves the secure ability of the system compared to that of the random source relay selection scheme, but does not outperform the optimal joint source relay selection (OJSRS scheme. However, the PSRS scheme drastically reduces the required amount of channel state information (CSI estimations compared to that required by the OJSRS scheme, specially in dense cooperative networks.

  7. Performance Analysis of Physical Layer Security of Opportunistic Scheduling in Multiuser Multirelay Cooperative Networks.

    Science.gov (United States)

    Shim, Kyusung; Do, Nhu Tri; An, Beongku

    2017-02-15

    In this paper, we study the physical layer security (PLS) of opportunistic scheduling for uplink scenarios of multiuser multirelay cooperative networks. To this end, we propose a low-complexity, yet comparable secrecy performance source relay selection scheme, called the proposed source relay selection (PSRS) scheme. Specifically, the PSRS scheme first selects the least vulnerable source and then selects the relay that maximizes the system secrecy capacity for the given selected source. Additionally, the maximal ratio combining (MRC) technique and the selection combining (SC) technique are considered at the eavesdropper, respectively. Investigating the system performance in terms of secrecy outage probability (SOP), closed-form expressions of the SOP are derived. The developed analysis is corroborated through Monte Carlo simulation. Numerical results show that the PSRS scheme significantly improves the secure ability of the system compared to that of the random source relay selection scheme, but does not outperform the optimal joint source relay selection (OJSRS) scheme. However, the PSRS scheme drastically reduces the required amount of channel state information (CSI) estimations compared to that required by the OJSRS scheme, specially in dense cooperative networks.

  8. A Selection Method for Pipe Network Boosting Plans

    Science.gov (United States)

    Qiu, Weiwei; Li, Mengyao; Weng, Haoyang

    2017-12-01

    Based on the fuzzy mathematics theory, a multi-objective fuzzy comprehensive evaluation method used for selection of pipe network boosting plans was proposed by computing relative membership matrix and weight vector for indexes. The example results show that the multi-objective fuzzy comprehensive evaluation method combining the indexes and the fuzzy relationship between them is suited to realities and can provide reference for decision of pipe network boosting plan.

  9. Impact of a revised appointment scheduling script on IUD service delivery in three Title X family planning clinics.

    Science.gov (United States)

    Gilliam, Melissa L; Mistretta, Stephanie Q; Martins, Summer L; Holl, Jane L

    2014-11-01

    The objective was to study a redesigned call script for intrauterine device (IUD) appointment scheduling. The script for a Title X call center was redesigned. Pre- and postintervention data were collected. For women with a scheduled IUD visit (n=99, pre n=57, post n=42), the preintervention IUD insertion rate was 47%; the postintervention insertion rate was 60% (p=.23). Among women ≤25 years old, the preintervention rate was 41% and the postintervention rate was 68% (p=.05). No-show rates decreased (40.4% vs. 23.8%, p=.08), particularly for younger women (n=51; 46.9% vs. 15.8%, p=.04). A revised IUD appointment scheduling script improved long-acting reversible contraceptive uptake. Revising an appointment scheduling call script is a simple and scalable intervention to decrease administrative and clinical barriers to family planning services. As many clinics in the United States move toward computerized and centralized call centers, improving patient communication during the scheduling process may have a broad impact on clinical efficiency. Copyright © 2014 Elsevier Inc. All rights reserved.

  10. Broadband Access Network Planning Optimization Considering Real Copper Cable Lengths

    Science.gov (United States)

    Peternel, Blaž Kos, Andrej

    Broadband access network planning strategies with techno-economic calculations are important topics, when optimal broadband network deployments are considered. This paper analyzes optimal deployment combination of digital subscriber line technologies (xDSL) and fiber to the home technologies (FTTx), following different user bandwidth demand scenarios. For this reason, optimal placement of remote digital subscriber line multiplexer (RDSLAM) is examined. Furthermore, the article also discusses the economy of investments, depending on certain investment threshold and the reach of different xDSL technologies. Finally, the difference between broadband network deployment in a characteristic urban and rural area in Republic of Slovenia, in terms of required optical cable dig length per household is shown. A tree structure network model of a traditional copper access network is introduced. A dynamic programming logic, with recursion as a basis of a tree structure examination and evaluation of optimal network elements placement is used. The tree structure network model considers several real network parameters (e. g.: copper cable lengths, user coordinates, node coordinates). The main input for the optimization is a local loop distance between each user and a candidate node for RDSLAM placement. Modelling of copper access networks with a tree structure makes new extensions in planning optimization of broadband access networks. Optimization of network elements placement has direct influence on efficiency and profitability of broadband access telecommunication networks.

  11. ICPP tank farm closure study. Volume 3: Cost estimates, planning schedules, yearly cost flowcharts, and life-cycle cost estimates

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

    This volume contains information on cost estimates, planning schedules, yearly cost flowcharts, and life-cycle costs for the six options described in Volume 1, Section 2: Option 1 -- Total removal clean closure; No subsequent use; Option 2 -- Risk-based clean closure; LLW fill; Option 3 -- Risk-based clean closure; CERCLA fill; Option 4 -- Close to RCRA landfill standards; LLW fill; Option 5 -- Close to RCRA landfill standards; CERCLA fill; and Option 6 -- Close to RCRA landfill standards; Clean fill. This volume is divided into two portions. The first portion contains the cost and planning schedule estimates while the second portion contains life-cycle costs and yearly cash flow information for each option.

  12. Neural network computing model for highway construction project scheduling and management : final report, October 1999.

    Science.gov (United States)

    1999-10-01

    A general mathematical formulation has been developed for scheduling of construction projects and applied to the problem of highway construction scheduling. Repetitive and non-repetitive tasks, work continuity considerations, multiple-crew strategies...

  13. Capacity planning for Carrier Ethernet LTE backhaul networks

    DEFF Research Database (Denmark)

    Checko, Aleksandra; Ellegaard, Lars; Berger, Michael Stübert

    2012-01-01

    With the introduction of LTE networks operators need to plan a new, IP-based mobile backhaul. In this paper, we provide recommendation on dimensioning LTE backhaul networks links using three methods: delay-, dimensioning formula- and overbooking factor-based. Results are obtained from OPNET...

  14. The university library in social networks: planning a quality presence

    Directory of Open Access Journals (Sweden)

    Estela Carmen Andrade Andrade

    2011-02-01

    Full Text Available Talks about the feasibility of participation of university libraries in social networking. We present the benefits and opportunities of Web 2.0 and online communities. Poses a set of guidelines aimed at developing a work plan that enables the implementation of site information in a social network. It highlights the capabilities of librarians to optimize this type of service.

  15. Converged Optical Network and Data Center Virtual Infrastructure Planning

    DEFF Research Database (Denmark)

    Georgakilas, Konstantinos; Tzanakaki, Anna; Anastasopoulos, Markos

    2012-01-01

    This paper presents a detailed study of planning virtual infrastructures (VIs) over a physical infrastructure comprising integrated optical network and data center resources with the aim of enabling sharing of physical resources among several virtual operators and services. Through the planning p...

  16. Library Network Analysis and Planning (LIB-NAT

    Directory of Open Access Journals (Sweden)

    Maryann Duggan

    2013-05-01

    Full Text Available A preliminary report on planning for network design undertaken by the Reference Round Table of the Texas Library Association and the State Advisory Council to Library Services and Construction Act Title III Texas Program. Necessary components of a network are discussed, and network transactions of eighteen Dallas area libraries analyzed using a methodology and quantitative measures developed fm· this project.

  17. A real-time traffic scheduling algorithm in CDMA packet networks

    NARCIS (Netherlands)

    Zan, Lei; Heijenk, Geert; El Zarki, Magda; Gong, K.; Niu, Z.

    2003-01-01

    The demands for multimedia and packet data services over wireless devices have increased over the past few years. The direct impact on performance makes scheduling for real-time traffic important. This paper presents a novel scheduling algorithm called fair channel-dependent scheduling which

  18. UMTS network planning, optimization, and inter-operation with GSM

    CERN Document Server

    Rahnema, Moe

    2008-01-01

    UMTS Network Planning, Optimization, and Inter-Operation with GSM is an accessible, one-stop reference to help engineers effectively reduce the time and costs involved in UMTS deployment and optimization. Rahnema includes detailed coverage from both a theoretical and practical perspective on the planning and optimization aspects of UMTS, and a number of other new techniques to help operators get the most out of their networks. Provides an end-to-end perspective, from network design to optimizationIncorporates the hands-on experiences of numerous researchersSingle

  19. An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Thien T. T. Le

    2016-12-01

    Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

  20. Bayesian network models for error detection in radiotherapy plans.

    Science.gov (United States)

    Kalet, Alan M; Gennari, John H; Ford, Eric C; Phillips, Mark H

    2015-04-07

    The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network's conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures.

  1. Center for Network Planning Status Report 2004-2005

    DEFF Research Database (Denmark)

    Madsen, Ole Brun; Pedersen, Jens Myrup; Jensen, Michael

    CNP, Center for Network Planning, was founded January 29th in 2004 based on an agree-ment between the Institutes of Business Studies, Electronic Systems, Mathematics and Planning at Aalborg University and hosted by the department of Control Engineering at the Institute of Electronic Systems. CNP ...... an almost complete state of the art technical framework for its activities as well as an international contact network. The CNP status report 2004 – 2005 summarises the main activities conducted, results achieved and outlines the visions and plans for the period to follow....... was established in order to strengthen the base for research, special studies, educa-tion, training and dissemination of results within the field of Network Planning and with special focus on the development of the next generation ICT Infrastructure. CNP is a member of CTIF, Centre for TeleInFrastruktur, ensuring...

  2. Effect of planning for connectivity on linear reserve networks.

    Science.gov (United States)

    Lentini, Pia E; Gibbons, Philip; Carwardine, Josie; Fischer, Joern; Drielsma, Michael; Martin, Tara G

    2013-08-01

    Although the concept of connectivity is decades old, it remains poorly understood and defined, and some argue that habitat quality and area should take precedence in conservation planning instead. However, fragmented landscapes are often characterized by linear features that are inherently connected, such as streams and hedgerows. For these, both representation and connectivity targets may be met with little effect on the cost, area, or quality of the reserve network. We assessed how connectivity approaches affect planning outcomes for linear habitat networks by using the stock-route network of Australia as a case study. With the objective of representing vegetation communities across the network at a minimal cost, we ran scenarios with a range of representation targets (10%, 30%, 50%, and 70%) and used 3 approaches to account for connectivity (boundary length modifier, Euclidean distance, and landscape-value [LV]). We found that decisions regarding the target and connectivity approach used affected the spatial allocation of reserve systems. At targets ≥50%, networks designed with the Euclidean distance and LV approaches consisted of a greater number of small reserves. Hence, by maximizing both representation and connectivity, these networks compromised on larger contiguous areas. However, targets this high are rarely used in real-world conservation planning. Approaches for incorporating connectivity into the planning of linear reserve networks that account for both the spatial arrangement of reserves and the characteristics of the intervening matrix highlight important sections that link the landscape and that may otherwise be overlooked. © 2013 Society for Conservation Biology.

  3. Integrated coding-aware intra-ONU scheduling for passive optical networks with inter-ONU traffic

    Science.gov (United States)

    Li, Yan; Dai, Shifang; Wu, Weiwei

    2016-12-01

    Recently, with the soaring of traffic among optical network units (ONUs), network coding (NC) is becoming an appealing technique for improving the performance of passive optical networks (PONs) with such inter-ONU traffic. However, in the existed NC-based PONs, NC can only be implemented by buffering inter-ONU traffic at the optical line terminal (OLT) to wait for the establishment of coding condition, such passive uncertain waiting severely limits the effect of NC technique. In this paper, we will study integrated coding-aware intra-ONU scheduling in which the scheduling of inter-ONU traffic within each ONU will be undertaken by the OLT to actively facilitate the forming of coding inter-ONU traffic based on the global inter-ONU traffic distribution, and then the performance of PONs with inter-ONU traffic can be significantly improved. We firstly design two report message patterns and an inter-ONU traffic transmission framework as the basis for the integrated coding-aware intra-ONU scheduling. Three specific scheduling strategies are then proposed for adapting diverse global inter-ONU traffic distributions. The effectiveness of the work is finally evaluated by both theoretical analysis and simulations.

  4. Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

    Directory of Open Access Journals (Sweden)

    Julien Maheut

    2013-07-01

    Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system

  5. An efficient neural network approach to dynamic robot motion planning.

    Science.gov (United States)

    Yang, S X; Meng, M

    2000-03-01

    In this paper, a biologically inspired neural network approach to real-time collision-free motion planning of mobile robots or robot manipulators in a nonstationary environment is proposed. Each neuron in the topologically organized neural network has only local connections, whose neural dynamics is characterized by a shunting equation. Thus the computational complexity linearly depends on the neural network size. The real-time robot motion is planned through the dynamic activity landscape of the neural network without any prior knowledge of the dynamic environment, without explicitly searching over the free workspace or the collision paths, and without any learning procedures. Therefore it is computationally efficient. The global stability of the neural network is guaranteed by qualitative analysis and the Lyapunov stability theory. The effectiveness and efficiency of the proposed approach are demonstrated through simulation studies.

  6. Optimal Planning of Communication System of CPS for Distribution Network

    Directory of Open Access Journals (Sweden)

    Ting Yang

    2017-01-01

    Full Text Available IoT is the technical basis to realize the CPS (Cyber Physical System for distribution networks, with which the complex system becomes more intelligent and controllable. Because of the multihop and self-organization characteristics, the large-scale heterogeneous CPS network becomes more difficult to plan. Using topological potential theory, one of typical big data analysis technologies, this paper proposed a novel optimal CPS planning model. Topological potential equalization is considered as the optimization objective function in heterogeneous CPS network with the constraints of communication requirements, physical infrastructures, and network reliability. An improved binary particle swarm optimization algorithm is proposed to solve this complex optimal problem. Two IEEE classic examples are adopted in the simulation, and the results show that, compared with benchmark algorithms, our proposed method can provide an effective topology optimization scheme to improve the network reliability and transmitting performance.

  7. Settlement Networks in Polish Spatial Development Regional Plans

    Science.gov (United States)

    Sołtys, Jacek

    2017-10-01

    In 1999, ten years after the great political changes in Poland, 16 self-governed regions (in Polish: voivodeship) were created. According to Polish law, voivodeship spatial development plans, or regional plans in short, determine basic elements of the settlement network. No detailed regulations indicate the specific elements of the settlement network or what features of these elements should be determined. For this reason, centres as elements of the settlement network are variously named in different regions and take the form of various models. The purposes of the research described in this article are: (1) recognition and systematization of settlement network models determined in regional plans; and (2) assessment of the readability of determination in planning and its usefulness in the practice of regional policy. Six models of settlement networks in regional plans have been identified and classified into types and sub-types. Names of specific levels of centres indicate that they were classified according to two criteria: (1) level of services, which concerns only 5 voivodships; and (2) importance in development, which concerns the 11 other voivodships. The hierarchical model referring to the importance of development is less understandable than the one related to services. In the text of most plans, centres of services and centres of development are treated independently from their names. In some plans the functional types of towns and cities are indicated. In some voivodships, specifications in the plan text are too general and seem to be rather useless in the practice of regional policy. The author suggests that regional plans should determine two kinds of centres: hierarchical service centres and non-hierarchical centres of development. These centres should be further distinguished according to: (1) their role in the activation of surroundings; (2) their level of development and the necessity of action for their development; and (3) the types of actions

  8. ISP-Friendly Data Scheduling by Advanced Locality-Aware Network Coding for P2P Distribution Cloud

    Directory of Open Access Journals (Sweden)

    Yanjun Li

    2014-01-01

    Full Text Available Peer-to-peer (P2P file distribution imposes increasingly heavy traffic burden on the Internet service providers (ISPs. The vast volume of traffic pushes up ISPs’ costs in routing and investment and degrades their networks performance. Building ISP-friendly P2P is therefore of critical importance for ISPs and P2P services. So far most efforts in this area focused on improving the locality-awareness of P2P applications, for example, to construct overlay networks with better knowledge of the underlying network topology. There is, however, growing recognition that data scheduling algorithms also play an effective role in P2P traffic reduction. In this paper, we introduce the advanced locality-aware network coding (ALANC for P2P file distribution. This data scheduling algorithm completely avoids the transmission of linearly dependent data blocks, which is a notable problem of previous network coding algorithms. Our simulation results show that, in comparison to other algorithms, ALANC not only significantly reduces interdomain P2P traffic, but also remarkably improves both the application-level performance (for P2P services and the network-level performance (for ISP networks. For example, ALANC is 30% faster in distributing data blocks and it reduces the average traffic load on the underlying links by 40%. We show that ALANC holds the above gains when the tit-for-tat incentive mechanism is introduced or the overlay topology changes dynamically.

  9. Delivery-flow routing and scheduling subject to constraints imposed by vehicle flows in fractal-like networks

    Directory of Open Access Journals (Sweden)

    Bocewicz Grzegorz

    2017-06-01

    Full Text Available The problems of designing supply networks and traffic flow routing and scheduling are the subject of intensive research. The problems encompass the management of the supply of a variety of goods using multi-modal transportation. This research also takes into account the various constraints related to route topology, the parameters of the available fleet of vehicles, order values, delivery due dates, etc. Assuming that the structure of a supply network, constrained by a transport network topology that determines its behavior, we develop a declarative model which would enable the analysis of the relationships between the structure of a supply network and its potential behavior resulting in a set of desired delivery-flows. The problem in question can be reduced to determining sufficient conditions that ensure smooth flow in a transport network with a fractal structure. The proposed approach, which assumes a recursive, fractal network structure, enables the assessment of alternative delivery routes and associated schedules in polynomial time. An illustrative example showing the quantitative and qualitative relationships between the morphological characteristics of the investigated supply networks and the functional parameters of the assumed delivery-flows is provided.

  10. Inclusion of a variable RBE into proton and photon plan comparison for various fractionation schedules in prostate radiation therapy.

    Science.gov (United States)

    Ödén, Jakob; Eriksson, Kjell; Toma-Dasu, Iuliana

    2017-03-01

    A constant relative biological effectiveness (RBE) of 1.1 is currently used in proton radiation therapy to account for the increased biological effectiveness compared to photon therapy. However, there is increasing evidence that proton RBE vary with the linear energy transfer (LET), the dose per fraction, and the type of the tissue. Therefore, this study aims to evaluate the impact of disregarding variations in RBE when comparing proton and photon dose plans for prostate treatments for various fractionation schedules using published RBE models and several α/β assumptions. Photon and proton dose plans were created for three generic prostate cancer cases. Three BED3Gy equivalent schedules were studied, 78, 57.2, and 42.8 Gy in 39, 15, and 7 fractions, respectively. The proton plans were optimized assuming a constant RBE of 1.1. By using the Monte Carlo calculated dose-averaged LET (LETd ) distribution and assuming α/β values on voxel level, three variable RBE models were applied to the proton dose plans. The impact of the variable RBE was studied in the plan comparison, which was based on the dose distribution, DVHs, and normal tissue complication probabilities (NTCP) for the rectum. Subsequently, the physical proton dose was reoptimized for each proton plan based on the LETd distribution, to achieve a homogeneous RBE-weighted target dose when applying a specific RBE model and still fulfill the clinical goals for the rectum and bladder. All the photon and proton plans assuming RBE = 1.1 met the clinical goals with similar target coverage. The proton plans fulfilled the robustness criteria in terms of range and setup uncertainty. Applying the variable RBE models generally resulted in higher target doses and rectum NTCP compared to the photon plans. The increase was most pronounced for the fractionation dose of 2 Gy(RBE), whereas it was of less magnitude and more dependent on model and α/β assumption for the hypofractionated schedules. The reoptimized proton

  11. ARQ-Aware Scheduling and Link Adaptation for Video Transmission over Mobile Broadband Networks

    Directory of Open Access Journals (Sweden)

    Victoria Sgardoni

    2012-01-01

    Full Text Available This paper studies the effect of ARQ retransmissions on packet error rate, delay, and jitter at the application layer for a real-time video transmission at 1.03 Mbps over a mobile broadband network. The effect of time-correlated channel errors for various Mobile Station (MS velocities is evaluated. In the context of mobile WiMAX, the role of the ARQ Retry Timeout parameter and the maximum number of ARQ retransmissions is taken into account. ARQ-aware and channel-aware scheduling is assumed in order to allocate adequate resources according to the level of packet error rate and the number of ARQ retransmissions required. A novel metric, namely, goodput per frame, is proposed as a measure of transmission efficiency. Results show that to attain quasi error free transmission and low jitter (for real-time video QoS, only QPSK 1/2 can be used at mean channel SNR values between 12 dB and 16 dB, while 16QAM 1/2 can be used below 20 dB at walking speeds. However, these modes are shown to result in low transmission efficiency, attaining, for example, a total goodput of 3 Mbps at an SNR of 14 dB, for a block lifetime of 90 ms. It is shown that ARQ retransmissions are more effective at higher MS speeds.

  12. Multichannel-Sensing Scheduling and Transmission-Energy Optimizing in Cognitive Radio Networks with Energy Harvesting.

    Science.gov (United States)

    Hoan, Tran-Nhut-Khai; Hiep, Vu-Van; Koo, In-Soo

    2016-03-31

    This paper considers cognitive radio networks (CRNs) utilizing multiple time-slotted primary channels in which cognitive users (CUs) are powered by energy harvesters. The CUs are under the consideration that hardware constraints on radio devices only allow them to sense and transmit on one channel at a time. For a scenario where the arrival of harvested energy packets and the battery capacity are finite, we propose a scheme to optimize (i) the channel-sensing schedule (consisting of finding the optimal action (silent or active) and sensing order of channels) and (ii) the optimal transmission energy set corresponding to the channels in the sensing order for the operation of the CU in order to maximize the expected throughput of the CRN over multiple time slots. Frequency-switching delay, energy-switching cost, correlation in spectrum occupancy across time and frequency and errors in spectrum sensing are also considered in this work. The performance of the proposed scheme is evaluated via simulation. The simulation results show that the throughput of the proposed scheme is greatly improved, in comparison to related schemes in the literature. The collision ratio on the primary channels is also investigated.

  13. Bayesian network models for error detection in radiotherapy plans

    Science.gov (United States)

    Kalet, Alan M.; Gennari, John H.; Ford, Eric C.; Phillips, Mark H.

    2015-04-01

    The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network’s conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures.

  14. The Link Between the Use of Advanced Planning and Scheduling (APS) Modules and Factory Context

    DEFF Research Database (Denmark)

    Kristensen, Jesper; Asmussen, Jesper Normann; Wæhrens, Brian Vejrum

    2017-01-01

    at factories characterized by low planning maturity, but lower for factories with medium planning maturity. For low planning maturity, the APS module is used for improving the configuration of the manufacturing system, whereas high planning maturity is required to capture performance benefits from optimization...

  15. Integration of Hierarchical Goal Network Planning and Autonomous Path Planning

    Science.gov (United States)

    2016-03-01

    is abstract in the literal sense, the system is able to translate this into a waypoint. It can then use the waypoint navigation planner to provide...literal1,literal2) for any number of literals . As an example, a task may be “pick-up(apple,kitchen table,right hand)” representing picking up the apple...tasks. These sequence of actions is called a plan. Because each task and each literal can be named according to the user-defined domain

  16. Correlation Between Channel Profile and Plan View Drainage Network Architecture

    Science.gov (United States)

    Shelef, E.; Hilley, G. E.

    2011-12-01

    This research explores the relationship between the plan-view network and profile geometry of channels using high-resolution digital topography and numerical models. In particular, we study the relations between plan-view morphometrics of the channel network and the mechanics of land-shaping processes as reflected by channel profile concavity. This analysis addresses one of the long-standing questions in geomorphology relating to the mechanistic significance of various plan-view channel network geometry measures. Statistically based studies suggest that Hortonian measures of channel network architecture (e.g. bifurcation ratio, area ratio, and length ratio) describe virtually all possible network geometries, and hence are not diagnostic when evaluating the origins of the geometry of a particular network. Our analyses of high resolution DEMs that capture different channel profile concavities (i.e debris flow vs. fluvial flows), as well as the topography of landscapes produced by process-based numerical models affirms this conclusion and indicates that Hortonian measures, as well as Hack exponent, are insensitive to channel concavity. In contrast, channel frequency (number of channel segments per area) appears to provide a measure that is sensitive to channel concavity. As such, channel frequency appears to discern between landscapes dominated by different land-shaping processes that produce different channel profile concavities. In the context of headword growing networks, the observed relations between concavity and channel frequency can be modeled through the coupled effect of concavity and surface roughness on the competition between headword growing channels. Our results suggest that the plan-view geometry of channel networks does not simply arise from random deflection of channels that once joined, cannot separate, but rather reflects the underlying processes that incise through rock and transport mass through the channel network

  17. A planning tool for tree species selection and planting schedule in forestation projects considering environmental and socio-economic benefits.

    Science.gov (United States)

    Rollan, Catherine Denise; Li, Richard; San Juan, Jayne Lois; Dizon, Liezel; Ong, Karl Benedict

    2017-10-30

    Species selection is a crucial step in the planning phase of forestation programs given its impact on the results and on stakeholder interactions. This study develops a planning tool for forestation programs that incorporates the selection of tree species and the scheduling of planting and harvesting, while balancing the maximization of the carbon sequestered and income realized, into the forestation decision-making and planning process. The validation of the goal programming model formulated demonstrates that the characteristics of natural tree species along with the behavior of growth and timing of yield are significant factors in achieving the environmental and socio-economic aspirations. The proposed model is therefore useful in gauging species behavior and performance over time. Sensitivity analysis was also conducted where the behavior of the income generated and carbon sequestered with respect to the external factors such as carbon market prices, percentage area allocated for protection and discount factor was assessed. Copyright © 2017 Elsevier Ltd. All rights reserved.

  18. Wireless Mesh Networks Path Planning, Power Control and Optimal Solutions

    Directory of Open Access Journals (Sweden)

    G. Guru Charan

    2014-06-01

    Full Text Available Wireless mesh networks are considerd as a potential attractive alternative to provide Broadband acces to users. In this paper we address the following two questions: (i Given a set of nodes with arbitrary locations, and a set of data rows, what is the max-min achievable throughput? And (ii How should the network be configured to achieve the optimum? Given a set of nodes with arbitrary locations, and a set of data rows specified as source-destination pairs, what is the maximum achievable throughput, under certain constraints on the radio parameters in particular, on transmit power. How should the network be configured to achieve this maximum? Specifically, by configuration, we mean the complete choice of the set of links (i.e., topology, the routes, link schedules, and transmit powers and modulation schemes for each link.

  19. Transmission Network Expansion Planning Considering Desired Generation Security

    Directory of Open Access Journals (Sweden)

    Samaneh GOLESTANI

    2014-02-01

    Full Text Available Transmission Network Expansion Planning (TNEP is an important part of power system planning in both conventional and new structured power market. Its goal is to minimize the network construction and operational cost while satisfying the demand increase, considering technical and economic conditions. Planning algorithm in this paper consisted of two stages. The former specifies highly uncertain lines and probability of congestion, considering desired generation security level (e.g. N-2 generation security level. The latter determines the optimal expansion capacity of existing lines. Splitting required capacity for reinforcement of weak lines due to desired generation security level simplifies the TNEP problem. In addition, it monitors the impact of generation uncertainty on transmission lines. Simulation results of the proposed idea are presented for IEEE-RTS-24bus network.

  20. Cross-Layer Resource Scheduling for Video Traffic in the Downlink of OFDMA-Based Wireless 4G Networks

    Directory of Open Access Journals (Sweden)

    2009-03-01

    Full Text Available Designing scheduling algorithms at the medium access control (MAC layer relies on a variety of parameters including quality of service (QoS requirements, resource allocation mechanisms, and link qualities from the corresponding layers. In this paper, we present an efficient cross-layer scheduling scheme, namely, Adaptive Token Bank Fair Queuing (ATBFQ algorithm, which is designed for packet scheduling and resource allocation in the downlink of OFDMA-based wireless 4G networks. This algorithm focuses on the mechanisms of efficiency and fairness in multiuser frequency-selective fading environments. We propose an adaptive method for ATBFQ parameter selection which integrates packet scheduling with resource mapping. The performance of the proposed scheme is compared to that of the round-robin (RR and the score-based (SB schedulers. It is observed from simulation results that the proposed scheme with adaptive parameter selection provides enhanced performance in terms of queuing delay, packet dropping rate, and cell-edge user performance, while the total sector throughput remains comparable. We further analyze and compare achieved fairness of the schemes in terms of different fairness indices available in literature.

  1. An overview of trends in distribution network planning: A movement towards smart planning

    DEFF Research Database (Denmark)

    You, Shi; Bindner, Henrik W.; Hu, Junjie

    2014-01-01

    grid products (e.g., control, communication, and new economic measures) call for urgent improvements in distribution network planning to allow the utilities to proactively modernize their existing distribution grids. This paper reviews the current practices in this area and the emerging trends towards......Distribution network planning, historically known as a ‘predict and provide’ process, seeks to determine a set of optimal network solutions for supplying electric demands spatially distributed over a geographic area. Today, the rapid development and deployment of distributed generation and smart...

  2. Schedule-Based Passenger Assignment for High-Speed Rail Networks considering the Ticket-Booking Process

    Directory of Open Access Journals (Sweden)

    Huanyin Su

    2016-01-01

    Full Text Available This paper proposes a schedule-based passenger assignment method for high-speed rail networks considering the ticket-booking process. Passengers book tickets to reserve seats during the presale period in high-speed rail systems and passengers on trains are determined during the ticket-booking process. The ticket-booking process is modeled as a continuous and deterministic predecision process. A solution algorithm is designed using the discretization of the continuous process by partitioning the ticket-booking time and the optimal paths remain constant in any partition interval. Finally, an application to the Chinese high-speed rail network is presented. A comparison of the numerical results with the reality is conducted to validate the efficiency and precision of the method and algorithm. Based on the results, the operating efficiency of the current train schedule is evaluated and some specific improvement measures are proposed.

  3. System and Method for Network Bandwidth, Buffers and Timing Management Using Hybrid Scheduling of Traffic with Different Priorities and Guarantees

    Science.gov (United States)

    Varadarajan, Srivatsan (Inventor); Hall, Brendan (Inventor); Smithgall, William Todd (Inventor); Bonk, Ted (Inventor); DeLay, Benjamin F. (Inventor)

    2017-01-01

    Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

  4. Multi-year expansion planning of large transmission networks

    Energy Technology Data Exchange (ETDEWEB)

    Binato, S.; Oliveira, G.C. [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil)

    1994-12-31

    This paper describes a model for multi-year transmission network expansion to be used in long-term system planning. The network is represented by a linearized (DC) power flow and, for each year, operation costs are evaluated by a linear programming (LP) based algorithm that provides sensitivity indices for circuit reinforcements. A Backward/Forward approaches is proposed to devise an expansion plan over the study period. A case study with the southeastern Brazilian system is presented and discussed. (author) 18 refs., 5 figs., 1 tab.

  5. Flexible Transmission Network Planning Considering the Impacts of Distributed Generation

    OpenAIRE

    Junhua Zhao; John Foster

    2010-01-01

    The restructuring of global power industries has introduced a number of challenges, such as conflicting planning objectives and increasing uncertainties,to transmission network planners. During the recent past, a number of distributed generation technologies also reached a stage allowing large scale implementation, which will profoundly influence the power industry, as well as the practice of transmission network expansion. In the new market environment, new approaches are needed to meet the ...

  6. Design and implementation of priority and time-window based traffic scheduling and routing-spectrum allocation mechanism in elastic optical networks

    Science.gov (United States)

    Wang, Honghuan; Xing, Fangyuan; Yin, Hongxi; Zhao, Nan; Lian, Bizhan

    2016-02-01

    With the explosive growth of network services, the reasonable traffic scheduling and efficient configuration of network resources have an important significance to increase the efficiency of the network. In this paper, an adaptive traffic scheduling policy based on the priority and time window is proposed and the performance of this algorithm is evaluated in terms of scheduling ratio. The routing and spectrum allocation are achieved by using the Floyd shortest path algorithm and establishing a node spectrum resource allocation model based on greedy algorithm, which is proposed by us. The fairness index is introduced to improve the capability of spectrum configuration. The results show that the designed traffic scheduling strategy can be applied to networks with multicast and broadcast functionalities, and makes them get real-time and efficient response. The scheme of node spectrum configuration improves the frequency resource utilization and gives play to the efficiency of the network.

  7. Optimal Scheduling of a Battery Energy Storage System with Electric Vehicles’ Auxiliary for a Distribution Network with Renewable Energy Integration

    Directory of Open Access Journals (Sweden)

    Yuqing Yang

    2015-09-01

    Full Text Available With global conventional energy depletion, as well as environmental pollution, utilizing renewable energy for power supply is the only way for human beings to survive. Currently, distributed generation incorporated into a distribution network has become the new trend, with the advantages of controllability, flexibility and tremendous potential. However, the fluctuation of distributed energy resources (DERs is still the main concern for accurate deployment. Thus, a battery energy storage system (BESS has to be involved to mitigate the bad effects of DERs’ integration. In this paper, optimal scheduling strategies for BESS operation have been proposed, to assist with consuming the renewable energy, reduce the active power loss, alleviate the voltage fluctuation and minimize the electricity cost. Besides, the electric vehicles (EVs considered as the auxiliary technique are also introduced to attenuate the DERs’ influence. Moreover, both day-ahead and real-time operation scheduling strategies were presented under the consideration with the constraints of BESS and the EVs’ operation, and the optimization was tackled by a fuzzy mathematical method and an improved particle swarm optimization (IPSO algorithm. Furthermore, the test system for the proposed strategies is a real distribution network with renewable energy integration. After simulation, the proposed scheduling strategies have been verified to be extremely effective for the enhancement of the distribution network characteristics.

  8. Collective Travel Planning in Spatial Networks

    KAUST Repository

    Shang, Shuo

    2017-05-18

    We propose and investigate a novel query, the Collective Travel Planning (CTP) query, that finds the lowest-cost route connecting multiple query sources and a destination via at most k meeting points. This type of query is useful in organizing large events, and it can bring significant benefits to society and the environment: it can help optimize the allocation of transportation resources, reduce resource consumption, and enable smarter and greener transportation; and it can help reduce greenhouse-gas emissions and traffic congestion.

  9. On the performance of two-way multiuser mixed RF/FSO relay networks with opportunistic scheduling & asymmetric channel gains

    KAUST Repository

    Al-Eryani, Yasser F.

    2017-07-20

    In this paper, the performance of two-way relaying (TWR) multiuser mixed radio frequency/free space optical (RF/FSO) relay networks with opportunistic user scheduling and asymmetric channel fading is studied. First, closed-form expressions for the exact outage probability, asymptotic (high signal-to-noise ration (SNR)) outage probability, and average ergodic channel capacity are derived assuming heterodyne detection (HD) scheme. Additionally, impacts of several system parameters including number of users, pointing errors, and atmospheric turbulence conditions on the overall network performance are investigated. All the theoretical results are validated by Monte-Carlo simulations. The results show that the TWR scheme almost doubles the network ergodic capacity compared to that of one-way relaying (OWR) scheme with the same outage performance. Additionally, the overall diversity order of the network is shown to be affected not only by the number of users, but it is also a function of the pointing error and atmospheric turbulence conditions.

  10. Collective Travel Planning in Spatial Networks

    KAUST Repository

    Shang, Shuo

    2015-12-17

    Travel planning and recommendation are important aspects of transportation.We propose and investigate a novel Collective Travel Planning (CTP) query that finds the lowest-cost route connecting multiple sources and a destination, via at most k meeting points. When multiple travelers target the same destination (e.g., a stadium or a theater), they may want to assemble at meeting points and then go together to the destination by public transport to reduce their global travel cost (e.g., energy, money, or greenhouse-gas emissions). This type of functionality holds the potential to bring significant benefits to society and the environment, such as reducing energy consumption and greenhouse-gas emissions, enabling smarter and greener transportation, and reducing traffic congestions. The CTP query is Max SNP-hard. To compute the query efficiently, we develop two algorithms, including an exact algorithm and an approximation algorithm. The exact algorithm is capable finding the optimal result for small values of k (e.g., k = 2) in interactive time, while the approximation algorithm, which has a 5-approximation ratio, is suitable for other situations. The performance of the CTP query is studied experimentally with real and synthetic spatial data.

  11. Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

    Directory of Open Access Journals (Sweden)

    Mohammad Taghi Ameli

    2012-01-01

    Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

  12. Routing and Scheduling Algorithms for WirelessHART Networks: A Survey

    Science.gov (United States)

    Nobre, Marcelo; Silva, Ivanovitch; Guedes, Luiz Affonso

    2015-01-01

    Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA). As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques for WirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of the WirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed. PMID:25919371

  13. Modeling and solving the distributed and flexible job shop scheduling problem with WIPs supply planning and bounded processing times

    Directory of Open Access Journals (Sweden)

    M. Ziaee

    2017-02-01

    Full Text Available In this paper, for the first time in the literature, we integrated production scheduling decisions and WIPs planning decisions in a distributed environment. We study the distributed and flexible job shop scheduling problem (DFJSP which involves the scheduling of jobs (products in a distributed manufacturing environment, under the assumption that the shop floor of each factory/cell is configured as a flexible job shop. It is also assumed that the work-in-process (WIP parts can be bought from the market instead of manufacturing them in-house, and they also can be sold in the market instead of processing their remaining operations and selling the end products. Moreover, the processing times of the operations can be decreased by paying a cost. However, there are a lower limit and an upper limit for the processing time of each operation. We formulate this general problem as a mixed integer linear programming (MILP model. A fast heuristic algorithm is also developed to obtain good solutions in very short time. The algorithm is tested on some problem instances in order to evaluate its performance. Computational results show that the proposed heuristic is a computationally efficient and practical approach.

  14. The National Shipbuilding Research Program. Proceedings of the REAPS Technical Symposium. Paper No. 12: Network Scheduling of Shipyard Production, Engineering, and Material Procurement

    Science.gov (United States)

    1979-09-01

    Critical Delivery Schedules 2 2 5 MICRONETS Pre-developed sub-networks: * Can be used for any number of projects * Can be used as often as needed...within a given project * Can be linked to other micronets major Benefits: * Increased Confidence in Network By Production and Management * Reduced Network

  15. Integrated schedule planning with supply-demand interactions for a new generation of aircrafts

    OpenAIRE

    Atasoy, Bilge; Salani, Matteo; Bierlaire, Michel

    2011-01-01

    We present a model where we integrate schedule design, fleet assignment and demand models to maximize the profit of an airline. The objective of the study is to identify the challenges behind the integration of demand modeling into the optimization model and develop methodologies to overcome these challenges. The study is in the context of a collaborative work between EPFL and EPFL Middle East. A new air transportation concept, Clip-Air, is developed at EPFL which is a modular innovative airc...

  16. Improving production planning and scheduling processes at an Industrial/Agricultural Chain Manufacturer

    OpenAIRE

    Tandon, Ramit

    2008-01-01

    A key question which every manufacturing firm, irrespective of its scale faces is about deriving an appropriate production planning and control mechanism that enables it to effectively cater to the market demand along with improving profitability. This project looks at applicability of Material Requirement Planning, Just in Time and Theory of Constraints as production planning and control mechanisms with a specific focus on applying them at Renold Chain Plant in Bredbuy, Stockport, Manchester...

  17. Application of Network Planning to Teaching Wind-Surfing

    Science.gov (United States)

    Zybko, Przemyslaw; Jaczynowski, Lech

    2008-01-01

    Study aim: To determine the effects of network planning on teaching untrained subjects windsurfing. Material and methods: Untrained physical education students (n = 390), aged 19-23 years, took part in the study while staying on a summer camp. They were randomly assigned into two groups: experimental (n = 216) and control (n = 174). Two methods of…

  18. Impacts of fuel oil substitution by natural gas in a pipeline network scheduling; Impactos da substituicao do oleo combustivel por gas natural na programacao de uma rede de dutos

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Coordenacao dos Programas de Pos-Graduacao de Engenharia (COPPE/UFRJ), RJ (Brazil)

    2012-07-01

    In recent decades, due to the advancement and computational methods for solving optimization problems, the number of articles addressing the scheduling of products has grown. The mathematical models developed have proved useful to schedule from a single pipeline with multiple products to complex networks of multiple pipelines. Moreover, the planning of these activities is of even greater importance when considering the existence of new environmental requirements to be applied to production and marketing of petroleum products. An example of this paradigm shift is the reduction in fuel oil consumption due to increased share of natural gas in the Brazilian energy matrix. In this context, this paper proposes a mathematical model to obtain feasible solutions for problems of scheduling a network of pipelines considering replacing all or part of the demand for fuel oil to natural gas. We tested the model on three real instances of a multi commodity network consists of 4 terminals, 4 refineries and 8 unidirectional pipelines, considering a planning horizon of one week. (author)

  19. An architecture for design and planning of mobile television networks

    Directory of Open Access Journals (Sweden)

    R. Tamayo-Fernández

    2011-12-01

    Full Text Available Mobile television (TV, made possible by the convergence of media, telecommunications and consumer electronicsindustries, is one of the most hyped new mobile services in several countries [1]. The advertised key features ofmobile TV are personalization, interactivity, and most importantly, the ability to watch TV programming while on thego. The deployment of a mobile TV network consists of several stages that require careful planning. There are available simulation packages for designing wireless technologies, however, for mobile TV there are still planning and simulations concerns that have to be addressed in order to identify its design challenges. This article reviews the main parameters that should be taken into account to support the design and planning of a mobile TV network andproposes an architecture for its implementation.

  20. On a Novel Simulation Framework and Scheduling Model Integrating Coverage Mechanisms for Sensor Networks and Handling Concurrency

    Science.gov (United States)

    Filippou, A.; Karras, D. A.; Papazoglou, P. M.; Papademetriou, R. C.

    Coverage is one of the fundamental metrics used to quantify the quality of service (QoS) of sensor networks. In general, we use this term to measure the ability of the network to observe and react to the phenomena taking place in the area of interest of the network. In addition, coverage is associated with connectivity and energy consumption, both important aspects in the design process of a Wireless Sensor Network (WSN). On the other hand, simulating a WSN involves taking into account different software and hardware aspects. In this paper we attempt to present a simulation framework suitable for integrating coverage mechanisms in WSN emulation using a layered architecture and a fitting scheduling model. The suggested model is derived after a critical overview and presentation of the coverage strategies as well as the simulation approaches for WSN developed so far. The main advantage of the proposed framework is its capability to handle concurrent events occurring at WSN deployment and operation through the suitable layered scheduler integrated.

  1. Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Madani Sajjad

    2011-01-01

    Full Text Available Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a the distance of the node from the sink node, (b the importance of the node's location from connectivity's perspective, and (c if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.

  2. Urban Green Network Design: Defining green network from an urban planning perspective

    Directory of Open Access Journals (Sweden)

    Andrea Tulisi

    2017-08-01

    Full Text Available From the theoretical context of Smart City various studies have emerged that adopt an analytical approach and description of urban phenomena based on the principles of “network design”; this line of research uses the network systems theory to define the principles that regulate the relationships among the various elements of urban sub-systems in order to optimize their functionality. From the same theoretical basis, urban greenspaces have also been studied as networks, by means of the creation of models capable of measuring the performance of the system in its entirety, posing the basis of a new multy-disciplinary research field called green network. This paper presents the results of research aimed at clarifying the meaning of green network from an urban planning perspective through a lexical analysis applied to a textual corpus of more than 300 abstracts of research papers that have dealt with this topic over the last twenty years. The results show that the concept of green network appears still fuzzy and unclear, due to the different meaning given to the term “green” and to an incorrect use of the term “network”, often referred to as a generic set of natural areas present in a city, without any reference to the network system theory or to the basic rules linking these elements together. For this reason, the paper proposes a unique definition of green network from an urban planning perspective that takes into account the contribution of other research areas to effective green infrastructure planning. This is the concept of “urban green network design” defined as “an urban planning practice, supported by decision support tools able to model green infrastructure as network, composed by natural and semi-natural areas, whose connections are modelled according to specific variables, in order to deliver an equal distribution of public services for enhancing the quality of life as well as a wide range of ecosystem services”.

  3. Importance of simulation tools for the planning of optical network

    Science.gov (United States)

    Martins, Indayara B.; Martins, Yara; Rudge, Felipe; Moschimı, Edson

    2015-10-01

    The main proposal of this work is to show the importance of using simulation tools to project optical networks. The simulation method supports the investigation of several system and network parameters, such as bit error rate, blocking probability as well as physical layer issues, such as attenuation, dispersion, and nonlinearities, as these are all important to evaluate and validate the operability of optical networks. The work was divided into two parts: firstly, physical layer preplanning was proposed for the distribution of amplifiers and compensating for the attenuation and dispersion effects in span transmission; in this part, we also analyzed the quality of the transmitted signal. In the second part, an analysis of the transport layer was completed, proposing wavelength distribution planning, according to the total utilization of each link. The main network parameters used to evaluate the transport and physical layer design were delay (latency), blocking probability, and bit error rate (BER). This work was carried out with commercially available simulation tools.

  4. Understanding planning for effective decision support : a cognitive task analysis of nurse scheduling

    NARCIS (Netherlands)

    Mietus, Dirkje Magrieta

    1994-01-01

    Planning in organizations is for all times. Coordination of organizational activities is needed not only to improve the overall performance of the organization but also to survive a competitive environment. Changes in the organizational environment, and technological developments (among others)

  5. Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

    KAUST Repository

    Hossain, Md Jahangir

    2010-07-01

    In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet\\'s access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.

  6. Efficient method for AC transmission network expansion planning

    Energy Technology Data Exchange (ETDEWEB)

    Rahmani, M. [Electrical Engineering Department, Shahid Bahonar University of Kerman, Kerman (Iran); Faculdade de Engenharia de Ilha Solteira, UNESP - Univ Estadual Paulista, Departamento de Engenharia Eletrica, Ilha Solteira, SP (Brazil); Rashidinejad, M. [Electrical Engineering Department, Shahid Bahonar University of Kerman, Kerman (Iran); Carreno, E.M. [Centro de Engenharia, Universidade Estadual do Oeste de Parana, UNIOESTE, Foz do Iguacu - PR (Brazil); Romero, R. [Faculdade de Engenharia de Ilha Solteira, UNESP - Univ Estadual Paulista, Departamento de Engenharia Eletrica, Ilha Solteira, SP (Brazil)

    2010-09-15

    A combinatorial mathematical model in tandem with a metaheuristic technique for solving transmission network expansion planning (TNEP) using an AC model associated with reactive power planning (RPP) is presented in this paper. AC-TNEP is handled through a prior DC model while additional lines as well as VAr-plants are used as reinforcements to cope with real network requirements. The solution of the reinforcement stage can be obtained by assuming all reactive demands are supplied locally to achieve a solution for AC-TNEP and by neglecting the local reactive sources, a reactive power planning (RPP) will be managed to find the minimum required reactive power sources. Binary GA as well as a real genetic algorithm (RGA) are employed as metaheuristic optimization techniques for solving this combinatorial TNEP as well as the RPP problem. High quality results related with lower investment costs through case studies on test systems show the usefulness of the proposal when working directly with the AC model in transmission network expansion planning, instead of relaxed models. (author)

  7. Effect of AQM-Based RLC Buffer Management on the eNB Scheduling Algorithm in LTE Network

    Directory of Open Access Journals (Sweden)

    Anup Kumar Paul

    2017-09-01

    Full Text Available With the advancement of the Long-Term Evolution (LTE network and smart-phones, most of today’s internet content is delivered via cellular links. Due to the nature of wireless signal propagation, the capacity of the last hop link can vary within a short period of time. Unfortunately, Transmission Control Protocol (TCP does not perform well in such scenarios, potentially leading to poor Quality of Service (QoS (e.g., end-to-end throughput and delay for the end user. In this work, we have studied the effect of Active Queue Management (AQM based congestion control and intra LTE handover on the performance of different Medium Access Control (MAC schedulers with TCP traffic by ns3 simulation. A proper AQM design in the Radio Link Control (RLC buffer of eNB in the LTE network leads to the avoidance of forced drops and link under-utilization along with robustness to a variety of network traffic-loads. We first demonstrate that the original Random Early Detection (RED linear dropping function cannot cope well with different traffic-load scenarios. Then, we establish a heuristic approach in which different non-linear functions are proposed with one parameter free to define. In our simulations, we demonstrate that the performance of different schedulers can be enhanced via proper dropping function.

  8. Consider the OIG Work Plan in your 2012 internal audit schedules.

    Science.gov (United States)

    Schaum, Kathleen D

    2011-12-01

    Wound care professionals should conduct monthly internal audits of their business processes. In addition to auditing, the coding, payment, and coverage issues that are considered issues by the Medicare contractor that processes your claims and the Medicare contractors that audit your claims and payments, be sure to include the OIG Work Plan topics that pertain to your wound care business. Remember, if atopic is important enough to make the OIG Work Plan, it should be important enough to make your 2012 internal audit plan. Because the Medicare Trust Fund is important to all US citizens, everyone has a responsibility to assist in combating fraud, waste, abuse, and mismanagement in HHS programs. Therefore, the OIG Hotline accepts tips from all sources. To provide a tip to the OIG Hotline, see Table 1 for contact information.

  9. Practice-Oriented Optimization of Distribution Network Planning Using Metaheuristic Algorithms

    OpenAIRE

    Grond, M.O.W.; Luong, Ngoc Hoang; Morren, Johan; Bosman, Peter; Slootweg, J.G.; La Poutré, Han

    2014-01-01

    htmlabstractDistribution network operators require more advanced planning tools to deal with the challenges of future network planning. An appropriate planning and optimization tool can identify which option for network extension should be selected from available alternatives. However, many optimization approaches described in the literature are quite theoretical and do not yield results that are practically relevant and feasible. In this paper, a distribution network planning approach is pro...

  10. Transmission Network Expansion Planning Considering Phase-Shifter Transformers

    Directory of Open Access Journals (Sweden)

    Celso T. Miasaki

    2012-01-01

    Full Text Available This paper presents a novel mathematical model for the transmission network expansion planning problem. Main idea is to consider phase-shifter (PS transformers as a new element of the transmission system expansion together with other traditional components such as transmission lines and conventional transformers. In this way, PS are added in order to redistribute active power flows in the system and, consequently, to diminish the total investment costs due to new transmission lines. Proposed mathematical model presents the structure of a mixed-integer nonlinear programming (MINLP problem and is based on the standard DC model. In this paper, there is also applied a specialized genetic algorithm aimed at optimizing the allocation of candidate components in the network. Results obtained from computational simulations carried out with IEEE-24 bus system show an outstanding performance of the proposed methodology and model, indicating the technical viability of using these nonconventional devices during the planning process.

  11. Fair & power-efficient channel-dependent scheduling for CDMA packet networks

    NARCIS (Netherlands)

    Zan, Lei; Heijenk, Geert; El Zarki, Magda

    2003-01-01

    Recently, there has been a significant increase in the amount of packet data services, such as web browsing, being offered over mobile phones. Data services are expected to account for the highest volume of traffic soon. However, current downlink scheduling algorithms for packet data services cannot

  12. An integrated approach for requirement selection and scheduling in software release planning

    NARCIS (Netherlands)

    Li, C.; van den Akker, Marjan; Brinkkemper, Sjaak; Diepen, Guido

    It is essential for product software companies to decide which requirements should be included in the next release and to make an appropriate time plan of the development project. Compared to the extensive research done on requirement selection, very little research has been performed on time

  13. Transmission Network Expansion Planning Considering Phase-Shifter Transformers

    OpenAIRE

    Miasaki, Celso T.; Franco, Edgar M. C.; Romero, Ruben A.

    2012-01-01

    This paper presents a novel mathematical model for the transmission network expansion planning problem. Main idea is to consider phase-shifter (PS) transformers as a new element of the transmission system expansion together with other traditional components such as transmission lines and conventional transformers. In this way, PS are added in order to redistribute active power flows in the system and, consequently, to diminish the total investment costs due to new transmission lines. Proposed...

  14. Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains

    KAUST Repository

    Hossain, Md Jahangir

    2010-03-01

    Our contribution, in this paper, is two-fold. First, we analyze the performance of a hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) scheme, which was proposed by the authors, in a fading environment where different users have different average link gains. Specifically, we present a new expression for the spectral efficiency (SE) of the users and using this expression, we compare the degrees of fairness (DOF) of the TBS scheme with that of classical single user opportunistic scheduling schemes, namely, absolute carrier-to-noise ratio (CNR) based single-best user scheduling (SBS) and normalized CNR based proportional fair scheduling (PFS) schemes. The second contribution is that we propose a new hybrid two-user opportunistic scheduling (HTS) scheme based on our earlier proposed TBS scheme. This HTS scheme selects the first user based on the largest absolute CNR value among all the users while the second user is selected based on the ratios of the absolute CNRs to the corresponding average CNRs of the remaining users. The total transmission rate i.e., the constellation size is selected according to the absolute CNR of the first best user. The total transmission rate is then allocated among these selected users by joint consideration of their absolute CNRs and allocated number of information bit(s) are transmitted to them using hierarchical modulations. Numerical results are presented for a fading environment where different users experience independent but non-identical (i.n.d.) channel fading. These selected numerical results show that the proposed HTS scheme can considerably increase the system\\'s fairness without any degradation of the link spectral efficiency (LSE) i.e., the multiuser diversity gain compared to the classical SBS scheme. These results also show that the proposed HTS scheme has a lower fairness in comparison to the PFS scheme which suffers from a considerable degradation in LSE. © 2010 IEEE.

  15. Developing a Framework for Effective Network Capacity Planning

    Science.gov (United States)

    Yaprak, Ece

    2005-01-01

    As Internet traffic continues to grow exponentially, developing a clearer understanding of, and appropriately measuring, network's performance is becoming ever more critical. An important challenge faced by the Information Resources Directorate (IRD) at the Johnson Space Center in this context remains not only monitoring and maintaining a secure network, but also better understanding the capacity and future growth potential boundaries of its network. This requires capacity planning which involves modeling and simulating different network alternatives, and incorporating changes in design as technologies, components, configurations, and applications change, to determine optimal solutions in light of IRD's goals, objectives and strategies. My primary task this summer was to address this need. I evaluated network-modeling tools from OPNET Technologies Inc. and Compuware Corporation. I generated a baseline model for Building 45 using both tools by importing "real" topology/traffic information using IRD's various network management tools. I compared each tool against the other in terms of the advantages and disadvantages of both tools to accomplish IRD's goals. I also prepared step-by-step "how to design a baseline model" tutorial for both OPNET and Compuware products.

  16. Developing a Mathematical Model for Scheduling and Determining Success Probability of Research Projects Considering Complex-Fuzzy Networks

    Directory of Open Access Journals (Sweden)

    Gholamreza Norouzi

    2015-01-01

    Full Text Available In project management context, time management is one of the most important factors affecting project success. This paper proposes a new method to solve research project scheduling problems (RPSP containing Fuzzy Graphical Evaluation and Review Technique (FGERT networks. Through the deliverables of this method, a proper estimation of project completion time (PCT and success probability can be achieved. So algorithms were developed to cover all features of the problem based on three main parameters “duration, occurrence probability, and success probability.” These developed algorithms were known as PR-FGERT (Parallel and Reversible-Fuzzy GERT networks. The main provided framework includes simplifying the network of project and taking regular steps to determine PCT and success probability. Simplifications include (1 equivalent making of parallel and series branches in fuzzy network considering the concepts of probabilistic nodes, (2 equivalent making of delay or reversible-to-itself branches and impact of changing the parameters of time and probability based on removing related branches, (3 equivalent making of simple and complex loops, and (4 an algorithm that was provided to resolve no-loop fuzzy network, after equivalent making. Finally, the performance of models was compared with existing methods. The results showed proper and real performance of models in comparison with existing methods.

  17. GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

    Energy Technology Data Exchange (ETDEWEB)

    Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

  18. Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics

    NARCIS (Netherlands)

    Meuffels, W.J.M.; Fleuren, H.A.; Cruijssen, F.C.A.M.; van Dam, E.R.

    2009-01-01

    Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns

  19. Enriching the tactical network design of express service carriers with fleet scheduling characteristics

    NARCIS (Netherlands)

    Meuffels, W.J.M.; Fleuren, H.A.; Cruijssen, F.C.A.M.; Dam, E.R.

    2010-01-01

    Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns

  20. Sensors on speaking terms: Schedule-based medium access control protocols for wireless sensor networks

    NARCIS (Netherlands)

    van Hoesel, L.F.W.

    2007-01-01

    Wireless sensor networks make the previously unobservable, observable. The basic idea behind these networks is straightforward: all wires are cut in traditional sensing systems and the sensors are equipped with batteries and radio's to virtually restore the cut wires. The resulting sensors can be

  1. Online Scheduling

    OpenAIRE

    Sgall, Jiri

    2005-01-01

    We survey some recent results on scheduling unit jobs. The emphasis of the talk is both on presenting some basic techniques and providing an overview of the current state of the art. The techniques presented cover charging schemes, potential function arguments, and lower bounds based on Yao's principle. The studied problem is equivalent to the following buffer management problem: packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total...

  2. Two-stage stochastic day-ahead optimal resource scheduling in a distribution network with intensive use of distributed energy resources

    DEFF Research Database (Denmark)

    Sousa, Tiago; Ghazvini, Mohammad Ali Fotouhi; Morais, Hugo

    2015-01-01

    The integration of renewable sources and electric vehicles will introduce new uncertainties to the optimal resource scheduling, namely at the distribution level. These uncertainties are mainly originated by the power generated by renewables sources and by the electric vehicles charge requirements....... This paper proposes a two-state stochastic programming approach to solve the day-ahead optimal resource scheduling problem. The case study considers a 33-bus distribution network with 66 distributed generation units and 1000 electric vehicles....

  3. Heterogeneous Cellular Networks with Spatio-Temporal Traffic: Delay Analysis and Scheduling

    OpenAIRE

    Zhong, Yi; Quek, Tony Q. S.; Ge, Xiaohu

    2016-01-01

    Emergence of new types of services has led to various traffic and diverse delay requirements in fifth generation (5G) wireless networks. Meeting diverse delay requirements is one of the most critical goals for the design of 5G wireless networks. Though the delay of point-to-point communications has been well investigated, the delay of multi-point to multi-point communications has not been thoroughly studied since it is a complicated function of all links in the network. In this work, we propo...

  4. Use of Perceive, Recall, Plan, Perform Stage Two Cognitive Task Analysis for Students with Autism and Intellectual Disability: The Impact of a Sensory Activity Schedule

    Science.gov (United States)

    Mills, Caroline; Chapparo, Christine

    2017-01-01

    The aim of this study was to determine the impact of a classroom sensory activity schedule (SAS) on cognitive strategy use during task performance. This work studies a single-system AB research design with seven students with autism and intellectual disability. Repeated measures using the Perceive, Recall, Plan and Perform (PRPP) Cognitive Task…

  5. IPTV traffic management using topology-based hierarchical scheduling in Carrier Ethernet transport networks

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    Carrier Ethernet is becoming a favorable access technology for Next Generation Network (NGN). The features of cost-efficiency, operation flexibility and high bandwidth have a great attraction to service providers. However, to achieve these characteristics, Carrier Ethernet needs to have Quality o....... This work has been carried out as a part of the research project HIPT (High quality IP network for IPTV and VoIP) founded by Danish Advanced Technology Foundation....

  6. A comprehensive approach for managing feasible solutions in production planning by an interacting network of Zero-Suppressed Binary Decision Diagrams

    Directory of Open Access Journals (Sweden)

    Keita Takahashi

    2015-04-01

    Full Text Available Product Lifecycle Management (PLM ranges from design concepts of products to disposal. In this paper, we focus on the production planning phase in PLM, which is related to process planning and production scheduling and so on. In this study, key decisions for the creation of production plans are defined as production-planning attributes. Production-planning attributes correlate complexly in production-planning problems. Traditionally, the production-planning problem splits sub-problems based on experiences, because of the complexity. In addition, the orders in which to solve each sub-problem are determined by priorities between sub-problems. However, such approaches make solution space over-restricted and make it difficult to find a better solution. We have proposed a representation of combinations of alternatives in production-planning attributes by using Zero-Suppressed Binary Decision Diagrams. The ZDD represents only feasible combinations of alternatives that satisfy constraints in the production planning. Moreover, we have developed a solution search method that solves production-planning problems with ZDDs. In this paper, we propose an approach for managing solution candidates by ZDDs׳ network for addressing larger production-planning problems. The network can be created by linkages of ZDDs that express constraints in individual sub-problems and between sub-problems. The benefit of this approach is that it represents solution space, satisfying whole constraints in the production planning. This case study shows that the validity of the proposed approach.

  7. Scheduling optimization of a real-world multi product pipeline network; Otimizacao das operacoes de transporte de derivados de petroleo em redes de dutos

    Energy Technology Data Exchange (ETDEWEB)

    Boschetto, Suelen N.; Felizari, Luiz C.; Magatao, Leandro; Stebel, Sergio L.; Neves Junior, Flavio; Lueders, Ricardo; Arruda, Lucia V.R. de [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil); Ribas, Paulo Cesar; Bernardo, Luiz F.J. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

    2008-07-01

    This work develops an optimization structure to aid the operational decision-making of scheduling activities in a real world pipeline network. The proposed approach is based on a decomposition method to address complex problems with high computational burden. The Pre-analysis makes a previous evaluation of a batch sequencing, getting information to be entered into optimization block. The continuous time Mixed Integer Linear Program (MILP) model gets such information and calculates the scheduling. The models are applied to a pipeline network that connects different areas including refineries, terminals, and final clients. Many oil derivatives (e.g. gasoline, liquefied petroleum gas, naphtha) can be sent or received in this network. The computational burden to determine a short-term scheduling within the considered scenario is a relevant issue. Many insights have been derived from the obtained solutions, which are given in a reduced computational time for oil industrial-size scenarios. (author)

  8. Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

    Science.gov (United States)

    Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

    2016-09-01

    A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

  9. VNS (Variable Neighbourhood Search) applied to batch sequencing in operational scheduling of pipeline network; VNS (Variable Neighbourhood Search) aplicado ao sequenciamento de bateladas do 'scheduling' de operacoes de uma malha dutoviaria

    Energy Technology Data Exchange (ETDEWEB)

    Yamamoto, Lia; Arruda, Lucia Valeria Ramos de; Libert, Nikolas [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    This work presents the VNS heuristic technique applied on batches ordering in a real network of petroleum derivatives distribution. These ordering have great influence in operational scheduling of a pipeline network. The operational scheduling purposes the efficient utilization of the resources, resulting on a better performance. Due to the great complexity of the real network problem and the necessity of its resolution in little computational time, it was adopted a problem subdivision in assignment of resources, sequencing and timing. In the resources assignment stage, it is considered the production/consumption functions and the products tankages to determine the total batches, including its volume, flow rate and the time-windows to satisfy the demand. These data are used in the sequencing stage, where a VNS based model determines the batches ordering. In a final step, the last block, realize the temporisation considering the network operational constraints. This work shows the results from the optimization of the sequencing stage which aims the improvement of the solution quality of scheduling. (author)

  10. Performance analysis of uplink packet schedulers in cellular networks with relaying

    NARCIS (Netherlands)

    Dimitrova, D.C.; van den Berg, Hans Leo; Heijenk, Geert

    Deployment of intermediate relay nodes in cellular networks, e,g, UMTS/ HSPA, has been proposed for service enhancement, which is of particular importance for uplink users at the cell edge suffering from low power capacity and relatively poor channel conditions. In this paper, we propose and

  11. Electric space heating scheduling for real-time explicit power control in active distribution networks

    DEFF Research Database (Denmark)

    Costanzo, Giuseppe Tommaso; Bernstein, Andrey; Chamorro, Lorenzo Reyes

    2015-01-01

    This paper presents a systematic approach for abstracting the flexibility of a building space heating system and using it within a composable framework for real-time explicit power control of microgrids and, more in general, active distribution networks. In particular, the proposed approach is de...

  12. On a vector space representation in genetic algorithms for sensor scheduling in wireless sensor networks.

    Science.gov (United States)

    Martins, F V C; Carrano, E G; Wanner, E F; Takahashi, R H C; Mateus, G R; Nakamura, F G

    2014-01-01

    Recent works raised the hypothesis that the assignment of a geometry to the decision variable space of a combinatorial problem could be useful both for providing meaningful descriptions of the fitness landscape and for supporting the systematic construction of evolutionary operators (the geometric operators) that make a consistent usage of the space geometric properties in the search for problem optima. This paper introduces some new geometric operators that constitute the realization of searches along the combinatorial space versions of the geometric entities descent directions and subspaces. The new geometric operators are stated in the specific context of the wireless sensor network dynamic coverage and connectivity problem (WSN-DCCP). A genetic algorithm (GA) is developed for the WSN-DCCP using the proposed operators, being compared with a formulation based on integer linear programming (ILP) which is solved with exact methods. That ILP formulation adopts a proxy objective function based on the minimization of energy consumption in the network, in order to approximate the objective of network lifetime maximization, and a greedy approach for dealing with the system's dynamics. To the authors' knowledge, the proposed GA is the first algorithm to outperform the lifetime of networks as synthesized by the ILP formulation, also running in much smaller computational times for large instances.

  13. Echoes from the deep - Communication scheduling, localization and time-synchronization in underwater acoustic sensor networks.

    NARCIS (Netherlands)

    van Kleunen, W.A.P.

    2014-01-01

    Wireless Sensor Networks (WSNs) caused a shift in the way things are monitored. While traditional monitoring was coarse-grained and offline, using WSNs allows fine-grained and real-time monitoring. While radio-based WSNs are growing out of the stage of research to commercialization and widespread

  14. Scheduled MAC in Beacon Overlay Networks for Underwater Localization and Time-Synchronization

    NARCIS (Netherlands)

    van Kleunen, W.A.P.; Meratnia, Nirvana; Havinga, Paul J.M.

    2011-01-01

    In this article we introduce a MAC protocol designed for underwater localization and time-synchronisation. The MAC protocol assumes a network of static reference nodes and allows blind nodes to be localized by listening-only to the beacon messages. Such a system is known to be very scalable. We show

  15. VISUAL UAV TRAJECTORY PLAN SYSTEM BASED ON NETWORK MAP

    Directory of Open Access Journals (Sweden)

    X. L. Li

    2012-07-01

    Full Text Available The base map of the current software UP-30 using in trajectory plan for Unmanned Aircraft Vehicle is vector diagram. UP-30 draws navigation points manually. But in the field of operation process, the efficiency and the quality of work is influenced because of insufficient information, screen reflection, calculate inconveniently and other factors. If we do this work in indoor, the effect of external factors on the results would be eliminated, the network earth users can browse the free world high definition satellite images through downloading a client software, and can export the high resolution image by standard file format. This brings unprecedented convenient of trajectory plan. But the images must be disposed by coordinate transformation, geometric correction. In addition, according to the requirement of mapping scale ,camera parameters and overlap degree we can calculate exposure hole interval and trajectory distance between the adjacent trajectory automatically . This will improve the degree of automation of data collection. Software will judge the position of next point according to the intersection of the trajectory and the survey area and ensure the position of point according to trajectory distance. We can undertake the points artificially. So the trajectory plan is automatic and flexible. Considering safety, the date can be used in flying after simulating flight. Finally we can export all of the date using a key

  16. Multi-Objective Scheduling of Electric Vehicles in Smart Distribution Network

    Directory of Open Access Journals (Sweden)

    Changhong Deng

    2016-11-01

    Full Text Available Due to the energy savings and environmental protection they provide, plug-in electric vehicles (PEVs are increasing in number quickly. Rapid development of PEVs brings new opportunities and challenges to the electricity distribution network’s dispatching. A high number of uncoordinated charging PEVs has significant negative impacts on the secure and economic operation of a distribution network. In this paper, a bi-level programming approach that coordinates PEVs’ charging with the network load and electricity price of the open market is presented. The major objective of the upper level model is to minimize the total network costs and the deviation of electric vehicle aggregators’ charging power and the equivalent power. The subsequent objective of the lower level model after the upper level decision is to minimize the dispatching deviation of the sum of PEVs’ charging power and their optimization charging power under the upper level model. An improved particle swarm optimization algorithm is used to solve the bi-level programming. Numerical studies using a modified IEEE 69-bus distribution test system including six electric vehicle aggregators verify the efficiency of the proposed model.

  17. REPNET: project scheduling and workflow optimization for Construction Projects

    OpenAIRE

    Marco Alvise Bragadin; Kalle Kahkonen

    2013-01-01

    Project planning and control are core processes for construction management. In practice project planning is achieved by network - based techniques like Precedence Diagramming Method (PDM).Indeed many researchers and practitioners claims that networking techniques as such do not provide a suitable model for construction projects. Construction process modeling should incorporate for specific features of resource flows through project activities. So an improved resource scheduling method for co...

  18. Experiences with Implementing a Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Gathering on a Real-Life Sensor Network Platform

    NARCIS (Netherlands)

    Zhang, Y.; Chatterjea, Supriyo; Havinga, Paul J.M.

    2007-01-01

    We report our experiences with implementing a distributed and self-organizing scheduling algorithm designed for energy-efficient data gathering on a 25-node multihop wireless sensor network (WSN). The algorithm takes advantage of spatial correlations that exist in readings of adjacent sensor nodes

  19. Variable Valve Timing Scheduling in a 4-Stroke Internal Combustion Cylinder Utilizing Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    Sepehr Bapiri

    2017-09-01

    Full Text Available The apparently simple structure of a four-stroke internal combustion cylinder belies the complicated problem of optimizing valve operation in response to a change in crankshaft rotation speed. The objective of this study was to determine the cylinder pressure for valve event angles in order to determine the optimal strategy for the timing of valve events when independently-actuated valves are available. In this work, an artificial neural network is applied to create a prediction matrix to anticipate the best variable valve timing approach according to rotation speed.

  20. A Statically Scheduled Time-Division-Multiplexed Network-on-Chip for Real-Time Systems

    DEFF Research Database (Denmark)

    Schoeberl, Martin; Brandner, Florian; Sparsø, Jens

    2012-01-01

    This paper explores the design of a circuit-switched network-on-chip (NoC) based on time-division-multiplexing (TDM) for use in hard real-time systems. Previous work has primarily considered application-specific systems. The work presented here targets general-purpose hardware platforms. We...... consider a system with IP-cores, where the TDM-NoC must provide directed virtual circuits - all with the same bandwidth - between all nodes. This may not be a frequent scenario, but a general platform should provide this capability, and it is an interesting point in the design space to study. The paper...

  1. Flexible Scheduling to Fit the Firefighters.

    Science.gov (United States)

    Cox, Clarice Robinson

    Three flexible scheduling plans were tried in order that firefighters could take regular college courses despite their 24 hours on the 24 off work schedule. Plan one scheduled the firefighters into a regular Monday-Wednesday-Friday class which they attended every other week, making up missed material outside of class. Plan two scheduled special…

  2. A scenario planning approach for disasters on Swiss road network

    Science.gov (United States)

    Mendes, G. A.; Axhausen, K. W.; Andrade, J. S.; Herrmann, H. J.

    2014-05-01

    We study a vehicular traffic scenario on Swiss roads in an emergency situation, calculating how sequentially roads block due to excessive traffic load until global collapse (gridlock) occurs and in this way displays the fragilities of the system. We used a database from Bundesamt für Raumentwicklung which contains length and maximum allowed speed of all roads in Switzerland. The present work could be interesting for government agencies in planning and managing for emergency logistics for a country or a big city. The model used to generate the flux on the Swiss road network was proposed by Mendes et al. [Physica A 391, 362 (2012)]. It is based on the conservation of the number of vehicles and allows for an easy and fast way to follow the formation of traffic jams in large systems. We also analyze the difference between a nonlinear and a linear model and the distribution of fluxes on the Swiss road.

  3. NASA Global GNSS Network (GGN) Status and Plans

    Science.gov (United States)

    Doelger, S.; Sklar, J.; Blume, F.; Meertens, C. M.; Mattioli, G. S.

    2015-12-01

    UNAVCO, in conjunction with JPL, is responsible for monitoring the 62 GNSS permanent stations, which include 88 GPS receivers, which comprise the NASA Global GNSS Network (GGN). These sites represent approximately 16% of the ~400 International GNSS Service (IGS) stations, and they provide a globally distributed GNSS network to support NASA operations and its commitments to GGOS. UNAVCO provides data flow monitoring, trouble-shooting, station installation, maintenance, as well as engineering services to improve the capabilities and performance of station infrastructure. Activities this past year include the installation of a geodetic quality wellhead monument for the new SEY2 station to replace SEY1, which is mounted on a UCSD seismic station in the Seychelles Islands. SEY1 will be removed soon to accommodate planned maintenance and upgrades by UCSD. Data from both SEY1 and SEY2 are being collected concurrently until maintenance begins. MRTG (Multi Router Traffic Grapher), a tool to aid in characterizing bandwidth usage and to identify communications problems, is now being used to monitor data throughput at 7 stations where VSAT or radio telemetry are used, including: ABPO; AREQ; FALK; GUAM; HARV; ISPA; QUIN; and STHL. Aging computers are being replaced with new hardware running Linux CentOS. These are semi-ruggedized low power solid-state systems built to endure challenging environments. With the aid of on-site collaborators, systems are now deployed at: FALK; CUSV; KELY; STHL; SANT; and ZAMB. Last, 4 new GPS stations were deployed for NASA's Space Geodesy Project (SGP); three of which (KOKF, KOKG, and KOKR) are located at Koke'e Park Geophysical Observatory on Kauai, Hawai'i, and HAL1 at the Haleakala observatory complex on Maui, Hawai'i. A campaign system was set up at Koke'e in order to sample data quality to determine if an additional station would be viable. Planning is ongoing for deployment of several new stations next year at McDonald Observatory (TX).

  4. Scheduling the blended solution as industrial CO2 absorber in separation process by back-propagation artificial neural networks.

    Science.gov (United States)

    Abdollahi, Yadollah; Sairi, Nor Asrina; Said, Suhana Binti Mohd; Abouzari-lotf, Ebrahim; Zakaria, Azmi; Sabri, Mohd Faizul Bin Mohd; Islam, Aminul; Alias, Yatimah

    2015-11-05

    It is believe that 80% industrial of carbon dioxide can be controlled by separation and storage technologies which use the blended ionic liquids absorber. Among the blended absorbers, the mixture of water, N-methyldiethanolamine (MDEA) and guanidinium trifluoromethane sulfonate (gua) has presented the superior stripping qualities. However, the blended solution has illustrated high viscosity that affects the cost of separation process. In this work, the blended fabrication was scheduled with is the process arranging, controlling and optimizing. Therefore, the blend's components and operating temperature were modeled and optimized as input effective variables to minimize its viscosity as the final output by using back-propagation artificial neural network (ANN). The modeling was carried out by four mathematical algorithms with individual experimental design to obtain the optimum topology using root mean squared error (RMSE), R-squared (R(2)) and absolute average deviation (AAD). As a result, the final model (QP-4-8-1) with minimum RMSE and AAD as well as the highest R(2) was selected to navigate the fabrication of the blended solution. Therefore, the model was applied to obtain the optimum initial level of the input variables which were included temperature 303-323 K, x[gua], 0-0.033, x[MDAE], 0.3-0.4, and x[H2O], 0.7-1.0. Moreover, the model has obtained the relative importance ordered of the variables which included x[gua]>temperature>x[MDEA]>x[H2O]. Therefore, none of the variables was negligible in the fabrication. Furthermore, the model predicted the optimum points of the variables to minimize the viscosity which was validated by further experiments. The validated results confirmed the model schedulability. Accordingly, ANN succeeds to model the initial components of the blended solutions as absorber of CO2 capture in separation technologies that is able to industries scale up. Copyright © 2015 Elsevier B.V. All rights reserved.

  5. ICPP calcined solids storage facility closure study. Volume II: Cost estimates, planning schedules, yearly cost flowcharts, and life-cycle cost estimates

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

    This document contains Volume II of the Closure Study for the Idaho Chemical Processing Plant Calcined Solids Storage Facility. This volume contains draft information on cost estimates, planning schedules, yearly cost flowcharts, and life-cycle costs for the four options described in Volume I: (1) Risk-Based Clean Closure; NRC Class C fill, (2) Risk-Based Clean Closure; Clean fill, (3) Closure to landfill Standards; NRC Class C fill, and (4) Closure to Landfill Standards; Clean fill.

  6. Cognitive Self-Scheduled Mechanism for Access Control in Noisy Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Mario Manzano

    2015-01-01

    Full Text Available Within the challenging environment of intelligent transportation systems (ITS, networked control systems such as platooning guidance of autonomous vehicles require innovative mechanisms to provide real-time communications. Although several proposals are currently under discussion, the design of a rapid, efficient, flexible, and reliable medium access control mechanism which meets the specific constraints of such real-time communications applications remains unsolved in this highly dynamic environment. However, cognitive radio (CR combines the capacity to sense the radio spectrum with the flexibility to adapt to transmission parameters in order to maximize system performance and has thus become an effective approach for the design of dynamic spectrum access (DSA mechanisms. This paper presents the enhanced noncooperative cognitive division multiple access (ENCCMA proposal combining time division multiple access (TDMA and frequency division multiple access (FDMA schemes with CR techniques to obtain a mechanism fulfilling the requirements of real-time communications. The analysis presented here considers the IEEE WAVE and 802.11p as reference standards; however, the proposed medium access control (MAC mechanism can be adapted to operate on the physical layer of different standards. The mechanism also offers the advantage of avoiding signaling, thus enhancing system autonomy as well as behavior in adverse scenarios.

  7. Range Scheduling Aid (RSA)

    Science.gov (United States)

    Logan, J. R.; Pulvermacher, M. K.

    1991-01-01

    Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

  8. Optimizing radio frequency identification network planning through ring probabilistic logic neurons

    Directory of Open Access Journals (Sweden)

    Aydin Azizi

    2016-08-01

    Full Text Available Radio frequency identification is a developing technology that has recently been adopted in industrial applications for identification and tracking operations. The radio frequency identification network planning problem deals with many criteria like number and positions of the deployed antennas in the networks, transmitted power of antennas, and coverage of network. All these criteria must satisfy a set of objectives, such as load balance, economic efficiency, and interference, in order to obtain accurate and reliable network planning. Achieving the best solution for radio frequency identification network planning has been an area of great interest for many scientists. This article introduces the Ring Probabilistic Logic Neuron as a time-efficient and accurate algorithm to deal with the radio frequency identification network planning problem. To achieve the best results, redundant antenna elimination algorithm is used in addition to the proposed optimization techniques. The aim of proposed algorithm is to solve the radio frequency identification network planning problem and to design a cost-effective radio frequency identification network by minimizing the number of embedded radio frequency identification antennas in the network, minimizing collision of antennas, and maximizing coverage area of the objects. The proposed solution is compared with the evolutionary algorithms, namely genetic algorithm and particle swarm optimization. The simulation results show that the Ring Probabilistic Logic Neuron algorithm obtains a far more superior solution for radio frequency identification network planning problem when compared to genetic algorithm and particle swarm optimization.

  9. Design and Evaluation of the User-Adapted Program Scheduling system based on Bayesian Network and Constraint Satisfaction

    Science.gov (United States)

    Iwasaki, Hirotoshi; Sega, Shinichiro; Hiraishi, Hironori; Mizoguchi, Fumio

    In recent years, lots of music content can be stored in mobile computing devices, such as a portable digital music player and a car navigation system. Moreover, various information content like news or traffic information can be acquired always anywhere by a cellular communication and a wireless LAN. However, usability issues arise from the simple interfaces of mobile computing devices. Moreover, retrieving and selecting such content poses safety issues, especially while driving. Thus, it is important for the mobile system to recommend content automatically adapted to user's preference and situation. In this paper, we present the user-adapted program scheduling that generates sequences of content (Program) suiting user's preference and situation based on the Bayesian network and the Constraint Satisfaction Problem (CSP) technique. We also describe the design and evaluation of its realization system, the Personal Program Producer (P3). First, preference such as a genre ratio of content in a program is learned as a Bayesian network model using simple operations such as a skip behavior. A model including each content tends to become large-scale. In order to make it small, we present the model separation method that carries out losslessly compression of the model. Using the model, probabilistic distributions of preference to generate constraints are inferred. Finally satisfying the constraints, a program is produced. This kind of CSP has an issue of which the number of variables is not fixedness. In order to make it variable, we propose a method using metavariables. To evaluate the above methods, we applied them to P3 on a car navigation system. User evaluations helped us clarify that the P3 can produce the program that a user prefers and adapt it to the user.

  10. Security-Reliability Trade-Off Analysis for Multiuser SIMO Mixed RF/FSO Relay Networks With Opportunistic User Scheduling

    KAUST Repository

    El-Malek, Ahmed H. Abd

    2016-05-24

    In this paper, we study the performance of multiuser single-input multiple-output mixed radio frequency (RF)/free space optical (FSO) relay network with opportunistic user scheduling. The considered system includes multiple users, one amplify-and-forward relay, one destination, and a multiple-antenna eavesdropper. The users are connected with the relay node through RF links and the relay is connected with the destination through an FSO link. Both maximum ratio combining and selection combining schemes are used at the multiple-antenna relay to combine the signal received from the best user on different antennas. The RF/FSO channels models are assumed to follow Nakagami-m/gamma-gamma fading models with pointing errors. Closed-form expressions are derived for the outage probability, average symbol error probability, and ergodic channel capacity. Then, the power of the selected best user is determined to minimize the system asymptotic outage probability under the dominant RF or FSO link. Then, the considered system secrecy performance is investigated, where the closed-form expressions for the intercept probability are derived. Finally, we propose a new cooperative jamming model in which the worst user is selected by the authorized system to jam the existing eavesdropper. Monte-Carlo simulations are provided to validate the achieved exact and asymptotic results.

  11. Temporal Data-Driven Sleep Scheduling and Spatial Data-Driven Anomaly Detection for Clustered Wireless Sensor Networks.

    Science.gov (United States)

    Li, Gang; He, Bin; Huang, Hongwei; Tang, Limin

    2016-09-28

    The spatial-temporal correlation is an important feature of sensor data in wireless sensor networks (WSNs). Most of the existing works based on the spatial-temporal correlation can be divided into two parts: redundancy reduction and anomaly detection. These two parts are pursued separately in existing works. In this work, the combination of temporal data-driven sleep scheduling (TDSS) and spatial data-driven anomaly detection is proposed, where TDSS can reduce data redundancy. The TDSS model is inspired by transmission control protocol (TCP) congestion control. Based on long and linear cluster structure in the tunnel monitoring system, cooperative TDSS and spatial data-driven anomaly detection are then proposed. To realize synchronous acquisition in the same ring for analyzing the situation of every ring, TDSS is implemented in a cooperative way in the cluster. To keep the precision of sensor data, spatial data-driven anomaly detection based on the spatial correlation and Kriging method is realized to generate an anomaly indicator. The experiment results show that cooperative TDSS can realize non-uniform sensing effectively to reduce the energy consumption. In addition, spatial data-driven anomaly detection is quite significant for maintaining and improving the precision of sensor data.

  12. Temporal Data-Driven Sleep Scheduling and Spatial Data-Driven Anomaly Detection for Clustered Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Gang Li

    2016-09-01

    Full Text Available The spatial–temporal correlation is an important feature of sensor data in wireless sensor networks (WSNs. Most of the existing works based on the spatial–temporal correlation can be divided into two parts: redundancy reduction and anomaly detection. These two parts are pursued separately in existing works. In this work, the combination of temporal data-driven sleep scheduling (TDSS and spatial data-driven anomaly detection is proposed, where TDSS can reduce data redundancy. The TDSS model is inspired by transmission control protocol (TCP congestion control. Based on long and linear cluster structure in the tunnel monitoring system, cooperative TDSS and spatial data-driven anomaly detection are then proposed. To realize synchronous acquisition in the same ring for analyzing the situation of every ring, TDSS is implemented in a cooperative way in the cluster. To keep the precision of sensor data, spatial data-driven anomaly detection based on the spatial correlation and Kriging method is realized to generate an anomaly indicator. The experiment results show that cooperative TDSS can realize non-uniform sensing effectively to reduce the energy consumption. In addition, spatial data-driven anomaly detection is quite significant for maintaining and improving the precision of sensor data.

  13. Registration Review Schedules

    Science.gov (United States)

    This schedule indicates plans for completion of risk assessments, proposed interim decisions and interim decisions for pesticides in the Registration Review program, EPA reviews all registered pesticides at least every 15 years as required by FIFRA.

  14. AC Transmission Network Expansion Planning: A Semidefinite Programming Branch-and-Cut Approach

    OpenAIRE

    Ghaddar, Bissan; Jabr, Rabih

    2017-01-01

    Transmission network expansion planning is a mixed-integer optimization problem, whose solution is used to guide future investment in transmission equipment. An approach is presented to find the global solution of the transmission planning problem using an AC network model. The approach builds on the semidefinite relaxation of the AC optimal power flow problem (ACOPF); its computational engine is a new specialized branch-and-cut algorithm for transmission expansion planning to deal with the u...

  15. Integrated production-distribution planning optimization models: A review in collaborative networks context

    OpenAIRE

    Beatriz Andres; Raquel Sanchis; Jaques Lamothe; Leila Saari; Frederic Hauser

    2017-01-01

    Researchers in the area of collaborative networks are more and more aware of proposing collaborative approaches to address planning processes, due to the advantages associated when enterprises perform integrated planning models. Collaborative production-distribution planning, among the supply network actors, is considered a proper mechanism to support enterprises on dealing with uncertainties and dynamicity associated to the current markets. Enterprises, and especially SMEs, should be able to...

  16. Exploiting Linkage Information and Problem-Specific Knowledge in Evolutionary Distribution Network Expansion Planning

    NARCIS (Netherlands)

    N.H. Luong (Ngoc Hoang); J.A. La Poutré (Han); P.A.N. Bosman (Peter)

    2015-01-01

    htmlabstractThis paper tackles the Distribution Network Expansion Planning (DNEP) problem that has to be solved by distribution network operators to decide which, where, and/or when enhancements to electricity networks should be introduced to satisfy the future power demands. We compare two

  17. Exploiting linkage information and problem-specific knowledge in evolutionary distribution network expansion planning

    NARCIS (Netherlands)

    N.H. Luong (Ngoc Hoang); J.A. La Poutré (Han); P.A.N. Bosman (Peter)

    2017-01-01

    textabstractThis article tackles the Distribution Network Expansion Planning (DNEP) problem that has to be solved by distribution network operators to decide which, where, and/or when enhancements to electricity networks should be introd uced to satisfy the future power demands. Because of many

  18. Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

    Directory of Open Access Journals (Sweden)

    Lianbo Ma

    2014-01-01

    Full Text Available This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization, called HABC, to tackle the radio frequency identification network planning (RNP problem. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operators is applied to enhance the global search ability between species. Experiments are conducted on a set of 10 benchmark optimization problems. The results demonstrate that the proposed HABC obtains remarkable performance on most chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. Then HABC is used for solving the real-world RNP problem on two instances with different scales. Simulation results show that the proposed algorithm is superior for solving RNP, in terms of optimization accuracy and computation robustness.

  19. Plan for a groundwater monitoring network in Taiwan

    Science.gov (United States)

    Hsu, Shiang-Kueen

    In Taiwan, rapid economic growth, rising standards of living, and an altered societal structure have in recent years put severe demands on water supplies. Because of its stable quantity and quality, groundwater has long been a reliable source of water for domestic, agricultural, and industrial users, but the establishment of a management program that integrates groundwater and surface-water use has been hampered by the lack of groundwater data. In 1992, the Department of Water Resources (DWR) initiated a program entitled "Groundwater Monitoring Network Plan in Taiwan." Under this program, basic groundwater data, including water-level and water-quality data, are being collected, and a reliable database is being established for the purpose of managing total water resources. This paper introduces the goals, implementation stages, and scope of that plan. The plan calls for constructing 517 hydrogeologic survey stations and 990 groundwater monitoring wells within 17 years. Under this program, water-level fluctuations are continuously monitored, whereas water-quality samples are taken for analysis only at the initial drilling stage and, subsequently, at the time when a monitoring well is being serviced. In 1996, the DWR and the Water Resources Planning Commission were merged to form today's Water Resources Bureau. Résumé A Taïwan, l'expansion économique rapide, l'amélioration des conditions de vie et la transformation de la structure sociale ont provoqué, ces dernières années, une très forte demande en eau. Du fait de sa constance en qualité et en quantité, l'eau souterraine a longtemps été considérée comme une ressource en eau sûre pour les usages domestiques, agricoles et industriels. Mais la mise en place d'un programme de gestion intégrant les utilisations d'eaux souterraines et de surface a été gênée par l'absence de données sur les eaux souterraines. En 1992, le Département des Ressources en Eau a lancé le programme "Plan pour un réseau de

  20. A dynamic simulation model of passenger flow distribution on schedule-based rail transit networks with train delays

    Directory of Open Access Journals (Sweden)

    Wei Li

    2016-08-01

    Full Text Available In a schedule-based rail transit system, passenger route choices are affected by train delays, and, consequently, the relevant passenger flow distribution of the network will differ from the normal state. In this paper, a passenger's alternative choices, such as selecting another route, waiting, and switching to other transportation modes, and the corresponding influence mechanism are analyzed in detail. Given train time–space diagrams and the time-varying travel demands between the origin and destination (O–D, a dynamic simulation model of passenger flow distribution on schedule-based transit networks with train delays is proposed. Animation demonstration and statistical indices, including the passenger flow volume of each train and station, can be generated from simulation results. A numerical example is given to illustrate the application of the proposed model. Numerical results indicate that, compared with conventional methods, the proposed model performs better for a passenger flow distribution with train delays.

  1. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features....... By comparing EPS to classical schedules, EPS simulation provides more accurate results with regards to project goals. These instructions give you guidelines for preparing papers for Journal of Software (JSW). Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use...

  2. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker fuel or simply bunker and bunker costs constitute a signi_cant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during...... operations. Therefore, route and schedule decisions a_ect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning...

  3. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize proFIt by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker and bunker costs constitute a significant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during operations. Therefore......, route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...

  4. Tramp ship routing and scheduling with integrated bunker optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    2014-01-01

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize prot by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker and bunker costs constitute a significant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during operations. Therefore......, route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...

  5. Automated and dynamic scheduling for geodetic VLBI - A simulation study for AuScope and global networks

    Science.gov (United States)

    Iles, E. J.; McCallum, L.; Lovell, J. E. J.; McCallum, J. N.

    2018-02-01

    As we move into the next era of geodetic VLBI, the scheduling process is one focus for improvement in terms of increased flexibility and the ability to react with changing conditions. A range of simulations were conducted to ascertain the impact of scheduling on geodetic results such as Earth Orientation Parameters (EOPs) and station coordinates. The potential capabilities of new automated scheduling modes were also simulated, using the so-called 'dynamic scheduling' technique. The primary aim was to improve efficiency for both cost and time without losing geodetic precision, particularly to maximise the uses of the Australian AuScope VLBI array. We show that short breaks in observation will not significantly degrade the results of a typical 24 h experiment, whereas simply shortening observing time degrades precision exponentially. We also confirm the new automated, dynamic scheduling mode is capable of producing the same standard of result as a traditional schedule, with close to real-time flexibility. Further, it is possible to use the dynamic scheduler to augment the 3 station Australian AuScope array and thereby attain EOPs of the current global precision with only intermittent contribution from 2 additional stations. We thus confirm automated, dynamic scheduling bears great potential for flexibility and automation in line with aims for future continuous VLBI operations.

  6. Solving a New Mathematical Model for Scheduling in Distribution Networks by Multi-Objective Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Rahmat Arab

    2014-01-01

    Full Text Available In this paper a novel, bi-objective mixed-integer mathematical programming has been proposed for a distribution network problem. One objective function minimizes the total purchasing, transportation and holding costs and the another objective minimizes the total amount of delayed or before time deliveries multiplied by respective durations, named "JIT distribution". Supplying the customer demand, holding and delivering products at warehouse are the most important constraints considered in this model. This model has been designed for a three-echelon distribution network consisting multiple suppliers, wholesalers and retailers to distribute multiple products with a deterministic amount of demand through either direct or indirect channels in a planning horizon. Since real-sized problems of the resulting bi-objective mixed-integer linear programming (MILP cannot be solved with exact methods, a multi objective particle swarm algorithm (MOPSO is designed of which, quality in small-sized problems is compared with the solutions obtained by the LINGO software. The computational results show that the proposed MOPSO algorithm finds good solutions in shorter times than LINGO and has acceptable running times in large-scale problems.

  7. Transmission Expansion Planning Considering Network Adequacy and Investment Cost Limitation using Genetic Algorithm

    OpenAIRE

    M. Mahdavi; E. Mahdavi

    2011-01-01

    In this research, STNEP is being studied considering network adequacy and limitation of investment cost by decimal codification genetic algorithm (DCGA). The goal is obtaining the maximum of network adequacy with lowest expansion cost for a specific investment. Finally, the proposed idea is applied to the Garvers 6-bus network. The results show that considering the network adequacy for solution of STNEP problem is caused that among of expansion plans for a determined investment, configuration...

  8. Wind Resource Assessment and Forecast Planning with Neural Networks

    Directory of Open Access Journals (Sweden)

    Nicolus K. Rotich

    2014-06-01

    Full Text Available In this paper we built three types of artificial neural networks, namely: Feed forward networks, Elman networks and Cascade forward networks, for forecasting wind speeds and directions. A similar network topology was used for all the forecast horizons, regardless of the model type. All the models were then trained with real data of collected wind speeds and directions over a period of two years in the municipal of Puumala, Finland. Up to 70th percentile of the data was used for training, validation and testing, while 71–85th percentile was presented to the trained models for validation. The model outputs were then compared to the last 15% of the original data, by measuring the statistical errors between them. The feed forward networks returned the lowest errors for wind speeds. Cascade forward networks gave the lowest errors for wind directions; Elman networks returned the lowest errors when used for short term forecasting.

  9. The Official Control beyond the Official Control. How To Plan And Schedule Controls Starting From Risk Assessment Along The Agro-Food Supply Chain.

    Science.gov (United States)

    Panunzio, M F; Caporizzi, R; Lagravinese, D; Conversano, M

    2015-01-01

    Every year the Italian Ministry of Health, on the basis of regional data, draws up the "Report on Official Controls" to be submitted to the Parliament. The report contains abundant data, diagrams and charts and illustrates the number and type of official controls (OC) performed by the pertinent Bodies (Ministry of Health, Regional and Local Health Authorities) over the previous year on Food Business Operators (FBO), in accordance with the EC Regulation 882/2004. The trend - which has consolidated over the years - relates to the multiplicity of OC and shows a decrease of such controls compared to an increase in "non-conformities". OC frequency is established by the Regional Authorities on the basis of the categorisation of both a "generic risk" for companies calculated taking into account the probability of occurrence of a "non-conformity", and a "specific" risk, assessed on the basis of the results of the OC actually performed on a given "Operatore del Settore Alimentare" (Food Sector Operator, in Italian: OSA). Thus, categorisation (i.e. the probability of occurrence of non-conformities) is the main driver of the OC scheduling and planning process. We have been asking ourselves whether the current OC planning/scheduling method is still suitable for ensuring food safety in the face of internalisation of the food supply chain. As a matter of fact, food safety is now becoming increasingly variable due to the globalization of consumption where "farm to fork", rather than "border to fork", food safety must be ensured. On the basis of these considerations, a different OC planning /scheduling method is being proposed based on the assessment of risks and the estimation of the occurrence of the same along the agro-food chain.

  10. Range Scheduling Automation for the Air Force Satellite Control Network: A Case Study in Computer System Development

    Science.gov (United States)

    1992-09-01

    ECP Engineering Change Proposal FQT Functional Qualification Test GPS Globil Positioning System GTS Guam Tracking Station HTS Hawaii Tracking Station...operational environment for which the two range scheduling automation projects were developed, it is important to understand the AFSCN range scheduling...of the two efforts? The literature review in Chapter II discusses the software acquisition problem in the Department of Defense (DOD) environment and

  11. Integrated production-distribution planning optimization models: A review in collaborative networks context

    Directory of Open Access Journals (Sweden)

    Beatriz Andres

    2017-01-01

    Full Text Available Researchers in the area of collaborative networks are more and more aware of proposing collaborative approaches to address planning processes, due to the advantages associated when enterprises perform integrated planning models. Collaborative production-distribution planning, among the supply network actors, is considered a proper mechanism to support enterprises on dealing with uncertainties and dynamicity associated to the current markets. Enterprises, and especially SMEs, should be able to overcome the continuous changes of the market by increasing their agility. Carrying out collaborative planning allows enterprises to enhance their readiness and agility for facing the market turbulences. However, SMEs have limited access when incorporating optimization tools to deal with collaborative planning, reducing their ability to respond to the competition. The problem to solve is to provide SMEs affordable solutions to support collaborative planning. In this regard, new optimisation algorithms are required in order to improve the collaboration within the supply network partners. As part of the H2020 Cloud Collaborative Manufacturing Networks (C2NET research project, this paper presents a study on integrated production and distribution plans. The main objective of the research is to identify gaps in current optimization models, proposed to address integrated planning, taking into account the requirements and needs of the industry. Thus, the needs of the companies belonging to the industrial pilots, defined in the C2NET project, are identified; analysing how these needs are covered by the optimization models proposed in the literature, to deal with the integrated production-distribution planning.

  12. Automated Scheduling of Science Activities for Titan Encounters by Cassini

    Science.gov (United States)

    Ray, Trina L.; Knight, Russel L.; Mohr, Dave

    2014-01-01

    In an effort to demonstrate the efficacy of automated planning and scheduling techniques for large missions, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] and CLASP (Compressed Large-scale Activity Scheduling and Planning) [2] to the domain of scheduling high-level science goals into conflict-free operations plans for Titan encounters by the Cassini spacecraft.

  13. On-line task scheduling and trajectory planning techniques for reconnaissance missions with multiple unmanned aerial vehicles supervised by a single human operator

    Science.gov (United States)

    Ortiz Rubiano, Andres Eduardo

    The problem of a single human operator monitoring multiple UAVs in reconnaissance missions is addressed in this work. In such missions, the operator inspects and classifies targets as they appear on video feeds from the various UAVs. In parallel, the aircraft autonomously execute a flight plan and transmit real-time video of an unknown terrain. The main contribution of this work is the development of a system that autonomously schedules the display of video feeds such that the human operator is able to inspect each target in real time (i.e., no video data is recorded and queued for later inspection). The construction of this non-overlapping schedule is made possible by commanding changes to the flight plan of the UAVs. These changes are constructed such that the impact on the mission time is minimized. The development of this system is addressed in the context of both fixed and arbitrary target inspection times. Under the assumption that the inspection time is constant, a Linear Program (LP) formulation is used to optimally solve the display scheduling problem in the time domain. The LP solution is implemented in the space domain via velocity and trajectory modifications to the flight plan of the UAVs. An online algorithm is proposed to resolve scheduling conflicts between multiple video feeds as targets are discovered by the UAVs. Properties of this algorithm are studied to develop conflict resolution strategies that ensure correctness regardless of the target placement. The effect of such strategies on the mission time is evaluated via numerical simulations. In the context of arbitrary inspection time, the human operator indicates the end of target inspection in real time. A set of maneuvers is devised that enable the operator to inspect each target uninterruptedly and indefinitely. In addition, a cuing mechanism is proposed to increase the situational awareness of the operator and potentially reduce the inspection times. The benefits of operator cuing on mission

  14. Federal Plan for Advanced Networking Research and Development

    Data.gov (United States)

    Networking and Information Technology Research and Development, Executive Office of the President — In the four decades since Federal research first enabled computers to send and receive data over networks, U.S. government research and development R and D in...

  15. Support system for process flow scheduling

    OpenAIRE

    Salomone, Enrique; Chiotti, Omar Juan Alfredo; Lerch, Juan

    2001-01-01

    Process flow scheduling is a concept that refers to the scheduling of flow shop process plants, whose scheduling calculations are guided by the process structure. In a wide variety of high-volume process industries, the process flow scheduling concept implies an integrated structure for planning and scheduling. This integrated vision of the planning function and the very particular characteristics of the process industry production environment challenge the application of the most traditio...

  16. Pricing and Capacity Planning Problems in Energy Transmission Networks

    DEFF Research Database (Denmark)

    Villumsen, Jonas Christoffer

    and transmission pricing problems in energy transmission networks. Although the modelling framework applies to energy networks in general, most of the applications discussed concern the transmission of electricity. A number of the problems presented involves transmission switching, which allows the operator...... of an electricity transmission network to switch lines in and out in an operational context in order to optimise the network flow. We show that transmission switching in systems with large-scale wind power may alleviate network congestions and reduce curtailment of wind power leading to higher utilisation...... of installed wind power capacity. We present formulations of — and efficient solution methods for— the transmission line capacity expansion problem and the unit commitment problem with transmission switching. We also show that transmission switching may radically change the optimal line capacity expansion...

  17. Communication, knowledge, social network and family planning utilization among couples in Mwanza, Tanzania

    NARCIS (Netherlands)

    Mosha, I.H.; Ruben, R.

    2013-01-01

    Family planning utilization in Tanzania is low. This study was cross sectional. It examined family planning use and socio demographic variables, social networks, knowledge and communication among the couples, whereby a stratified sample of 440 women of reproductive age (18-49), married or cohabiting

  18. The development of stochastic process modeling through risk analysis derived from scheduling of NPP project

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Kwang Ho; Roh, Myung Sub [KEPCO International Nuclear Graduate School, Ulsan (Korea, Republic of)

    2013-10-15

    There are so many different factors to consider when constructing a nuclear power plant successfully from planning to decommissioning. According to PMBOK, all projects have nine domains from a holistic project management perspective. They are equally important to all projects, however, this study focuses mostly on the processes required to manage timely completion of the project and conduct risk management. The overall objective of this study is to let you know what the risk analysis derived from scheduling of NPP project is, and understand how to implement the stochastic process modeling through risk management. Building the Nuclear Power Plant is required a great deal of time and fundamental knowledge related to all engineering. That means that integrated project scheduling management with so many activities is necessary and very important. Simulation techniques for scheduling of NPP project using Open Plan program, Crystal Ball program, and Minitab program can be useful tools for designing optimal schedule planning. Thus far, Open Plan and Monte Carlo programs have been used to calculate the critical path for scheduling network analysis. And also, Minitab program has been applied to monitor the scheduling risk. This approach to stochastic modeling through risk analysis of project activities is very useful for optimizing the schedules of activities using Critical Path Method and managing the scheduling control of NPP project. This study has shown new approach to optimal scheduling of NPP project, however, this does not consider the characteristic of activities according to the NPP site conditions. Hence, this study needs more research considering those factors.

  19. Planning Tripoli Metro Network by the Use of Remote Sensing Imagery

    Science.gov (United States)

    Alhusain, O.; Engedy, Gy.; Milady, A.; Paulini, L.; Soos, G.

    2012-08-01

    Tripoli, the capital city of Libya is going through significant and integrated development process, this development is expected to continue in the next few decades. The Libyan authorities have put it as their goal to develop Tripoli to an important metropolis in North Africa. To achieve this goal, they identified goals for the city's future development in all human, economic, cultural, touristic, and nonetheless infrastructure levels. On the infrastructure development level, among other things, they have identified the development of public transportation as one of the important development priorities. At present, public transportation in Tripoli is carried out by a limited capacity bus network alongside of individual transportation. However, movement in the city is characterized mainly by individual transportation with all its disadvantages such as traffic jams, significant air pollution with both carbon monoxide and dust, and lack of parking space. The Libyan authorities wisely opted for an efficient, modern, and environment friendly solution for public transportation, this was to plan a complex Metro Network as the backbone of public transportation in the city, and to develop and integrate the bus network and other means of transportation to be in harmony with the planned Metro network. The Metro network is planned to provide convenient connections to Tripoli International Airport and to the planned Railway station. They plan to build a system of Park and Ride (P+R) facilities at suitable locations along the Metro lines. This paper will present in details the planned Metro Network, some of the applied technological solutions, the importance of applying remote sensing and GIS technologies in different planning phases, and problems and benefits associated with the use of multi-temporal-, multi-format spatial data in the whole network planning phase.

  20. Architecture of a corporate system to aid the scheduling of a oil derivatives transport in a pipeline network; Arquitetura de um sistema corporativo para auxilio a programacao do transporte de derivados de petroleo em redes dutoviarias

    Energy Technology Data Exchange (ETDEWEB)

    Lara, Guilherme R.; Polli, Helton L.; Esser, Eduardo M.; Lueders, Ricardo; Neves Junior, Flavio; Magatao, Leandro; Stebel, Sergio L. [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil); Ribas, Paulo C. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

    2008-07-01

    This paper addresses the development and the architecture of a corporative package to aid the operational decision-making of the scheduling activities in a real-world pipeline network for oil derivatives. The system was developed based on a service-oriented architecture, allowing the development of Web applications to define the network scheduling, as well as graphic display of the movements. The solution of the scheduling is generated by an optimization block as a service of this application. However, this paper emphasizes the description of the architecture and its functionalities, which was defined with the help of experienced programmers. (author)

  1. Determining optimal maintenance schedules for adjuvant intravesical bacillus Calmette-Guerin immunotherapy in non-muscle-invasive bladder cancer: a systematic review and network meta-analysis.

    Science.gov (United States)

    Huang, Zixiong; Liu, Huixin; Wang, Yizeng; Zhang, Chunfang; Xu, Tao

    2017-08-01

    To figure out optimal bacillus Calmette-Guerin (BCG) maintenance schedules for non-muscle-invasive bladder cancer (NMIBC) patients by comparing different schedules in a systematic review using conventional and network meta-analysis. Literature was searched in the databases of Medline, Embase, Cochrane library, Clinicaltrials.gov, Wanfang, CNKI and SinoMed in April 2016 and 9 randomized clinical trials comparing intravesical BCG maintenance therapy with BCG induction-only therapy or comparing different BCG maintenance schedules (induction-only, 1 year, 1.5 year, 2 year, 3 year maintenance) in NMIBC patients were included. Conventional and network meta-analyses within a Bayesian framework were performed to calculate odds ratios of tumor recurrence, progression and side effects (cystitis, hematuria, general malaise and fever). The surface under the cumulative ranking curve (SUCRA) mean ranking was used to obtain schedule hierarchy. Data from 1951 patients showed that longer-term maintenance BCG therapy does not significantly decrease tumor recurrence and progression rate of NMIBC compared to shorter-term maintenance BCG therapy. However, longer-maintenance therapy does not increase side effect incidence compared to induction-only therapy. According to SUCRA results, induction-only therapy has the highest probability of recurrence and progression but least probability of side effects. Longer BCG maintenance therapy (such as 3 years) is not superior to shorter maintenance therapy (such as 1 year). But maintenance therapy overall is better than induction-only BCG therapy while not increasing side effects. Though further evidence and clinical practice with balanced confounding factors (risk stratification and BCG strain) are wished for, the current study suggests the common use of 1 year intravesical BCG instillation for NMIBC patients.

  2. Multi-day activity scheduling reactions to planned activities and future events in a dynamic model of activity-travel behavior

    Science.gov (United States)

    Nijland, Linda; Arentze, Theo; Timmermans, Harry

    2014-01-01

    Modeling multi-day planning has received scarce attention in activity-based transport demand modeling so far. However, new dynamic activity-based approaches are being developed at the current moment. The frequency and inflexibility of planned activities and events in activity schedules of individuals indicate the importance of incorporating those pre-planned activities in the new generation of dynamic travel demand models. Elaborating and combining previous work on event-driven activity generation, the aim of this paper is to develop and illustrate an extension of a need-based model of activity generation that takes into account possible influences of pre-planned activities and events. This paper describes the theory and shows the results of simulations of the extension. The simulation was conducted for six different activities, and the parameter values used were consistent with an earlier estimation study. The results show that the model works well and that the influences of the parameters are consistent, logical, and have clear interpretations. These findings offer further evidence of face and construct validity to the suggested modeling approach.

  3. Scheduling for production teams

    Directory of Open Access Journals (Sweden)

    Yuri Mauergauz

    2015-09-01

    Full Text Available This paper presents a method of calendar (weekly scheduling for production teams, when the average orders utility function is used as the quality criterion. The method is based on the concept of “production intensity”, which is a dynamic parameter of production process. Applied software package allows scheduling for medium quantity of jobs. The result of software application is the team load on the planning horizon. The computed schedule may be corrected and recalculated in interactive mode. Current load of every team is taken into account at each recalculation. The method may be used for any combination of complex and specialized teams.

  4. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  5. Resource management framework for QoS scheduling in IEEE 802.16 WiMAX networks

    DEFF Research Database (Denmark)

    Wang, Hua; Dittmann, Lars

    2009-01-01

    . A two-level hierarchical scheduler is developed for the DRA module, which can provide more organized service differentiation among different service classes, and a measurement-based connection admission control strategy is introduced for the CAC module. Through system-level simulation, it is shown...... an important role in QoS provisioning for different types of services. In this chapter, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module...

  6. Downlink resource management for QoS scheduling in IEEE 802.16 WiMAX networks

    DEFF Research Database (Denmark)

    Wang, Hua; Dittmann, Lars

    2010-01-01

    -level hierarchical scheduler is developed for the DRA module, which can provide more organized service differentiation among different service classes, and a measurement-based connection admission control strategy is introduced for the CAC module. Through system-level simulation, it is shown that the proposed...... an important role in QoS provisioning for different types of services. In this paper, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module. A two...

  7. Multi-Objective Transmission Network Planning with Consideration of Power Grid Vulnerability and Wind Power Accommodation

    Directory of Open Access Journals (Sweden)

    Chun-guang Tian

    2013-12-01

    Full Text Available This paper proposes an efficient approach for transmission network expansion planning. Three indicators are proposed to evaluate the planning, which is the power grid vulnerability, wind power accommodation and operation cost. Vulnerability is evaluated based on the complex network theory, and wind power accommodation analysis is performed by the rate of abandoned wind power. The optimization of transmission network expansion planning is translated into constraints multi-objective optimization problem. A novel QS-MOWE algorithm based on the improvement quick sort and NSGA-II algorithm has been proposed. The method can be used effectively to study the effect of increasing wind power integration and vulnerability with high wind generation uncertainties. The model and algorithms are applied to calculate a case of 6 units. The results show that the proposed modeling method can provide a useful guidance for planning problems.

  8. An ontological knowledge base for cyber network attack planning

    CSIR Research Space (South Africa)

    Chan, P

    2015-03-01

    Full Text Available . An ontology enables the representation of semantic information and automated reasoning that can support the complexity of planning cyber operations. It also contributes towards the sharing of information and the creation and maintenance of a common vocabulary...

  9. Virtualized Network Control (VNC)

    Energy Technology Data Exchange (ETDEWEB)

    Lehman, Thomas [Univ. of Southern California, Los Angeles, CA (United States); Guok, Chin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Ghani, Nasir [Univ. of New Mexico, Albuquerque, NM (United States)

    2013-01-31

    The focus of this project was on the development of a "Network Service Plane" as an abstraction model for the control and provisioning of multi-layer networks. The primary motivation for this work were the requirements of next generation networked applications which will need to access advanced networking as a first class resource at the same level as compute and storage resources. A new class of "Intelligent Network Services" were defined in order to facilitate the integration of advanced network services into application specific workflows. This new class of network services are intended to enable real-time interaction between the application co-scheduling algorithms and the network for the purposes of workflow planning, real-time resource availability identification, scheduling, and provisioning actions.

  10. Evolution of networks for body plan patterning; interplay of modularity, robustness and evolvability.

    Science.gov (United States)

    Ten Tusscher, Kirsten H; Hogeweg, Paulien

    2011-10-01

    A major goal of evolutionary developmental biology (evo-devo) is to understand how multicellular body plans of increasing complexity have evolved, and how the corresponding developmental programs are genetically encoded. It has been repeatedly argued that key to the evolution of increased body plan complexity is the modularity of the underlying developmental gene regulatory networks (GRNs). This modularity is considered essential for network robustness and evolvability. In our opinion, these ideas, appealing as they may sound, have not been sufficiently tested. Here we use computer simulations to study the evolution of GRNs' underlying body plan patterning. We select for body plan segmentation and differentiation, as these are considered to be major innovations in metazoan evolution. To allow modular networks to evolve, we independently select for segmentation and differentiation. We study both the occurrence and relation of robustness, evolvability and modularity of evolved networks. Interestingly, we observed two distinct evolutionary strategies to evolve a segmented, differentiated body plan. In the first strategy, first segments and then differentiation domains evolve (SF strategy). In the second scenario segments and domains evolve simultaneously (SS strategy). We demonstrate that under indirect selection for robustness the SF strategy becomes dominant. In addition, as a byproduct of this larger robustness, the SF strategy is also more evolvable. Finally, using a combined functional and architectural approach, we determine network modularity. We find that while SS networks generate segments and domains in an integrated manner, SF networks use largely independent modules to produce segments and domains. Surprisingly, we find that widely used, purely architectural methods for determining network modularity completely fail to establish this higher modularity of SF networks. Finally, we observe that, as a free side effect of evolving segmentation and

  11. Adaptable bandwidth planning using reinforcement learning

    Directory of Open Access Journals (Sweden)

    Dirk Hetzer

    2006-08-01

    Full Text Available In order to improve the bandwidth allocation considering feedback of operational environment, adaptable bandwidth planning based on reinforcement learning is proposed. The approach is based on new constrained scheduling algorithms controlled by reinforcement learning techniques. Different constrained scheduling algorithms,, such as "conflict free scheduling with minimum duration", "partial displacement" and "pattern oriented scheduling" are defined and implemented. The scheduling algorithms are integrated into reinforcement learning strategies. These strategies include: - Q-learning for selection of optimal planning schedule using Q-values; - Informed Q-learning for exploitation and handling of prior-knowledge (patterns of network behaviour; - Relational Q-learning for improving of bandwidth allocation policies dynamically in operational networks considering actual network performance data. Scenarios based on integration of the scheduling algorithms and reinforcement learning techniques in the experimental monitoring and bandwidth planning system called QORE (QoS and resource optimisation are given. The proposed adaptable bandwidth planning is required for more efficient usage of network resources.

  12. A Power Planning Algorithm Based on RPL for AMI Wireless Sensor Networks.

    Science.gov (United States)

    Miguel, Marcio L F; Jamhour, Edgard; Pellenz, Marcelo E; Penna, Manoel C

    2017-03-25

    The advanced metering infrastructure (AMI) is an architecture for two-way communication between electric, gas and water meters and city utilities. The AMI network is a wireless sensor network that provides communication for metering devices in the neighborhood area of the smart grid. Recently, the applicability of a routing protocol for low-power and lossy networks (RPL) has been considered in AMI networks. Some studies in the literature have pointed out problems with RPL, including sub-optimal path selection and instability. In this paper, we defend the viewpoint that careful planning of the transmission power in wireless RPL networks can significantly reduce the pointed problems. This paper presents a method for planning the transmission power in order to assure that, after convergence, the size of the parent set of the RPL nodes is as close as possible to a predefined size. Another important feature is that all nodes in the parent set offer connectivity through links of similar quality.

  13. Satellites vs. fiber optics based networks and services - Road map to strategic planning

    Science.gov (United States)

    Marandi, James H. R.

    An overview of a generic telecommunications network and its components is presented, and the current developments in satellite and fiber optics technologies are discussed with an eye on the trends in industry. A baseline model is proposed, and a cost comparison of fiber- vs satellite-based networks is made. A step-by-step 'road map' to the successful strategic planning of telecommunications services and facilities is presented. This road map provides for optimization of the current and future networks and services through effective utilization of both satellites and fiber optics. The road map is then applied to different segments of the telecommunications industry and market place, to show its effectiveness for the strategic planning of executives of three types: (1) those heading telecommunications manufacturing concerns, (2) those leading communication service companies, and (3) managers of telecommunication/MIS departments of major corporations. Future networking issues, such as developments in integrated-services digital network standards and technologies, are addressed.

  14. Solving the AI Planning Plus Scheduling Problem Using Model Checking via Automatic Translation from the Abstract Plan Preparation Language (APPL) to the Symbolic Analysis Laboratory (SAL)

    Science.gov (United States)

    Butler, Ricky W.; Munoz, Cesar A.; Siminiceanu, Radu I.

    2007-01-01

    This paper describes a translator from a new planning language named the Abstract Plan Preparation Language (APPL) to the Symbolic Analysis Laboratory (SAL) model checker. This translator has been developed in support of the Spacecraft Autonomy for Vehicles and Habitats (SAVH) project sponsored by the Exploration Technology Development Program, which is seeking to mature autonomy technology for the vehicles and operations centers of Project Constellation.

  15. Analytic network process (ANP approach for product mix planning in railway industry

    Directory of Open Access Journals (Sweden)

    Hadi Pazoki Toroudi

    2016-08-01

    Full Text Available Given the competitive environment in the global market in recent years, organizations need to plan for increased profitability and optimize their performance. Planning for an appropriate product mix plays essential role for the success of most production units. This paper applies analytical network process (ANP approach for product mix planning for a part supplier in Iran. The proposed method uses four criteria including cost of production, sales figures, supply of raw materials and quality of products. In addition, the study proposes different set of products as alternatives for production planning. The preliminary results have indicated that that the proposed study of this paper could increase productivity, significantly.

  16. A DSM-based “2.0” System for Human Intervention Planning and Scheduling in Facilities Emitting Ionizing Radiations

    CERN Document Server

    Baudin, M; De Jonghe, J

    2012-01-01

    To efficiently and safely plan, schedule and control its interventions in underground facilities, which are subject to ionizing radiations, CERN is currently developing a collaborative Web-based system. A similar project for maintenance management is also under way. On top of presenting their key requirements, this paper shows how the implementation of DSM can enhance a so-called Web 2.0 or collaborative dimension by bringing an intuitive and fair way of taking the dependencies between several activities into account. It is also discussed that the incoherencies brought in DSM by collaborative use (for instance regarding the time intervals) can be addressed by enlarging the binary DSM span of dependencies to ones of the Allen’s interval algebra or at least a subset of its dependencies.

  17. City networks collaboration and planning for health and sustainability

    CERN Document Server

    Migdalas, Athanasios; Rassia, Stamatina; Pardalos, Panos

    2017-01-01

    Sustainable development within urban and rural areas, transportation systems, logistics, supply chain management, urban health, social services, and architectural design are taken into consideration in the cohesive network models provided in this book. The ideas, methods, and models presented consider city landscapes and quality of life conditions based on mathematical network models and optimization. Interdisciplinary Works from prominent researchers in mathematical modeling, optimization, architecture, engineering, and physics are featured in this volume to promote health and well-being through design.   Specific topics include: -          Current technology that form the basis of future living in smart cities -          Interdisciplinary design and networking of large-scale urban systems  -          Network communication and route traffic optimization -          Carbon dioxide emission reduction -          Closed-loop logistics chain management and operation ...

  18. Multi-Objective Planning Techniques in Distribution Networks: A Composite Review

    Directory of Open Access Journals (Sweden)

    Syed Ali Abbas Kazmi

    2017-02-01

    Full Text Available Distribution networks (DNWs are facing numerous challenges, notably growing load demands, environmental concerns, operational constraints and expansion limitations with the current infrastructure. These challenges serve as a motivation factor for various distribution network planning (DP strategies, such as timely addressing load growth aiming at prominent objectives such as reliability, power quality, economic viability, system stability and deferring costly reinforcements. The continuous transformation of passive to active distribution networks (ADN needs to consider choices, primarily distributed generation (DG, network topology change, installation of new protection devices and key enablers as planning options in addition to traditional grid reinforcements. Since modern DP (MDP in deregulated market environments includes multiple stakeholders, primarily owners, regulators, operators and consumers, one solution fit for all planning scenarios may not satisfy all these stakeholders. Hence, this paper presents a review of several planning techniques (PTs based on mult-objective optimizations (MOOs in DNWs, aiming at better trade-off solutions among conflicting objectives and satisfying multiple stakeholders. The PTs in the paper spread across four distinct planning classifications including DG units as an alternative to costly reinforcements, capacitors and power electronic devices for ensuring power quality aspects, grid reinforcements, expansions, and upgrades as a separate category and network topology alteration and reconfiguration as a viable planning option. Several research works associated with multi-objective planning techniques (MOPT have been reviewed with relevant models, methods and achieved objectives, abiding with system constraints. The paper also provides a composite review of current research accounts and interdependence of associated components in the respective classifications. The potential future planning areas, aiming at

  19. Network-Based Material Requirements Planning (NBMRP) in ...

    African Journals Online (AJOL)

    Projects are characterized by inefficient time utilization, downtimes and operational delays during the execution stage due to poor material supply programmes. To address the problems, this study evaluated the existing material planning practice, and formulated a NBMRP model out of the variables of the existing MRP and ...

  20. Planning of Green Space Ecological Network in Urban Areas: An Example of Nanchang, China.

    Science.gov (United States)

    Li, Haifeng; Chen, Wenbo; He, Wei

    2015-10-15

    Green space plays an important role in sustainable urban development and ecology by virtue of multiple environmental, recreational, and economic benefits. Constructing an effective and harmonious urban ecological network and maintaining a sustainable living environment in response to rapid urbanization are the key issues required to be resolved by landscape planners. In this paper, Nanchang City, China was selected as a study area. Based on a series of landscape metrics, the landscape pattern analysis of the current (in 2005) and planned (in 2020) green space system were, respectively, conducted by using FRAGSTATS 3.3 software. Considering the actual situation of the Nanchang urban area, a "one river and two banks, north and south twin cities" ecological network was constructed by using network analysis. Moreover, the ecological network was assessed by using corridor structure analysis, and the improvement of an ecological network on the urban landscape was quantitatively assessed through a comparison between the ecological network and green space system planning. The results indicated that: (1) compared to the green space system in 2005, the planned green space system in 2020 of the Nanchang urban area will decline in both districts (Changnan and Changbei districts). Meanwhile, an increase in patch density and a decrease in mean patch size of green space patches at the landscape level implies the fragmentation of the urban green space landscape. In other words, the planned green space system does not necessarily improve the present green space system; (2) the ecological network of two districts has high corridor density, while Changnan's ecological network has higher connectivity, but Changbei's ecological network is more viable from an economic point of view, since it has relatively higher cost efficiency; (3) decrease in patch density, Euclidean nearest neighbor distance, and an increase in mean patch size and connectivity implied that the ecological network

  1. Planning of Green Space Ecological Network in Urban Areas: An Example of Nanchang, China

    Directory of Open Access Journals (Sweden)

    Haifeng Li

    2015-10-01

    Full Text Available Green space plays an important role in sustainable urban development and ecology by virtue of multiple environmental, recreational, and economic benefits. Constructing an effective and harmonious urban ecological network and maintaining a sustainable living environment in response to rapid urbanization are the key issues required to be resolved by landscape planners. In this paper, Nanchang City, China was selected as a study area. Based on a series of landscape metrics, the landscape pattern analysis of the current (in 2005 and planned (in 2020 green space system were, respectively, conducted by using FRAGSTATS 3.3 software. Considering the actual situation of the Nanchang urban area, a “one river and two banks, north and south twin cities” ecological network was constructed by using network analysis. Moreover, the ecological network was assessed by using corridor structure analysis, and the improvement of an ecological network on the urban landscape was quantitatively assessed through a comparison between the ecological network and green space system planning. The results indicated that: (1 compared to the green space system in 2005, the planned green space system in 2020 of the Nanchang urban area will decline in both districts (Changnan and Changbei districts. Meanwhile, an increase in patch density and a decrease in mean patch size of green space patches at the landscape level implies the fragmentation of the urban green space landscape. In other words, the planned green space system does not necessarily improve the present green space system; (2 the ecological network of two districts has high corridor density, while Changnan’s ecological network has higher connectivity, but Changbei’s ecological network is more viable from an economic point of view, since it has relatively higher cost efficiency; (3 decrease in patch density, Euclidean nearest neighbor distance, and an increase in mean patch size and connectivity implied that the

  2. Sustainable Value Generation through Collaborative Symbiotic Networks Planning

    OpenAIRE

    Araujo, Juliano; Pintão, Raphael; Rosa, Cyntia,

    2011-01-01

    Part 19: Sustainability Issues; International audience; Industrial Symbiosis is an important component of Industrial Ecology which studies the collaboration and coexistence of companies to achieve mutual benefits. Its concepts have traditionally focused on eco-efficiency and its direct benefits such as costs reduction, resources optimization and environmental impacts reduction. The paper introduces the use of externalities and collaborative networks as tools to amplify the spectrum of opportu...

  3. Optimization of RFID network planning using Zigbee and WSN

    Science.gov (United States)

    Hasnan, Khalid; Ahmed, Aftab; Badrul-aisham, Bakhsh, Qadir

    2015-05-01

    Everyone wants to be ease in their life. Radio frequency identification (RFID) wireless technology is used to make our life easier. RFID technology increases productivity, accuracy and convenience in delivery of service in supply chain. It is used for various applications such as preventing theft of automobiles, tolls collection without stopping, no checkout lines at grocery stores, managing traffic, hospital management, corporate campuses and airports, mobile asset tracking, warehousing, tracking library books, and to track a wealth of assets in supply chain management. Efficiency of RFID can be enhanced by integrating with wireless sensor network (WSN), zigbee mesh network and internet of things (IOT). The proposed system is used for identifying, sensing and real-time locating system (RTLS) of items in an indoor heterogeneous region. The system gives real-time richer information of object's characteristics, location and their environmental parameters like temperature, noise and humidity etc. RTLS reduce human error, optimize inventory management, increase productivity and information accuracy at indoor heterogeneous network. The power consumption and the data transmission rate of the system can be minimized by using low power hardware design.

  4. On Planning of FTTH Access Networks with and without Redundancy

    DEFF Research Database (Denmark)

    Riaz, M. Tahir; Haraldsson, Gustav; Gutierrez Lopez, Jose Manuel

    2010-01-01

    offered on a single fiber connection. As a single point of failure in fiber connection can cause multiple service deprivation therefore redundancy is very crucial. In this work, an automated planning model was used to test different scenarios of implementation. A cost estimation is presented in terms...... of digging and amount of fiber used. Three topologies, including the traditional one “tree topology”, were test with combination of various passive optical technologies....

  5. An industrial robot singular trajectories planning based on graphs and neural networks

    Science.gov (United States)

    Łęgowski, Adrian; Niezabitowski, Michał

    2016-06-01

    Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

  6. Artificial intelligence-based 5G network capacity planning and operation

    OpenAIRE

    Pérez Romero, Jordi; Sallent Roig, José Oriol; Ferrús Ferré, Ramón Antonio; Agustí Comes, Ramon

    2015-01-01

    The highly demanding requirements envisaged for future 5G networks together with the required support of new customers from vertical industries (e.g. e-health, automotive, energy) pose a big challenge for operators in 5G on how to balance investments, user experience and profitability. There will be the need to revisit the actual methodologies of network planning and operation, fully exploiting cognitive capabilities that embrace knowledge and intelligence to achie...

  7. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  8. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...

  9. Medicare Program; Revisions to Payment Policies Under the Physician Fee Schedule and Other Revisions to Part B for CY 2017; Medicare Advantage Bid Pricing Data Release; Medicare Advantage and Part D Medical Loss Ratio Data Release; Medicare Advantage Provider Network Requirements; Expansion of Medicare Diabetes Prevention Program Model; Medicare Shared Savings Program Requirements. Final rule.

    Science.gov (United States)

    2016-11-15

    This major final rule addresses changes to the physician fee schedule and other Medicare Part B payment policies, such as changes to the Value Modifier, to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services, as well as changes in the statute. This final rule also includes changes related to the Medicare Shared Savings Program, requirements for Medicare Advantage Provider Networks, and provides for the release of certain pricing data from Medicare Advantage bids and of data from medical loss ratio reports submitted by Medicare health and drug plans. In addition, this final rule expands the Medicare Diabetes Prevention Program model.

  10. Artificial intelligence for the CTA Observatory scheduler

    Science.gov (United States)

    Colomé, Josep; Colomer, Pau; Campreciós, Jordi; Coiffard, Thierry; de Oña, Emma; Pedaletti, Giovanna; Torres, Diego F.; Garcia-Piquer, Alvaro

    2014-08-01

    The Cherenkov Telescope Array (CTA) project will be the next generation ground-based very high energy gamma-ray instrument. The success of the precursor projects (i.e., HESS, MAGIC, VERITAS) motivated the construction of this large infrastructure that is included in the roadmap of the ESFRI projects since 2008. CTA is planned to start the construction phase in 2015 and will consist of two arrays of Cherenkov telescopes operated as a proposal-driven open observatory. Two sites are foreseen at the southern and northern hemispheres. The CTA observatory will handle several observation modes and will have to operate tens of telescopes with a highly efficient and reliable control. Thus, the CTA planning tool is a key element in the control layer for the optimization of the observatory time. The main purpose of the scheduler for CTA is the allocation of multiple tasks to one single array or to multiple sub-arrays of telescopes, while maximizing the scientific return of the facility and minimizing the operational costs. The scheduler considers long- and short-term varying conditions to optimize the prioritization of tasks. A short-term scheduler provides the system with the capability to adapt, in almost real-time, the selected task to the varying execution constraints (i.e., Targets of Opportunity, health or status of the system components, environment conditions). The scheduling procedure ensures that long-term planning decisions are correctly transferred to the short-term prioritization process for a suitable selection of the next task to execute on the array. In this contribution we present the constraints to CTA task scheduling that helped classifying it as a Flexible Job-Shop Problem case and finding its optimal solution based on Artificial Intelligence techniques. We describe the scheduler prototype that uses a Guarded Discrete Stochastic Neural Network (GDSN), for an easy representation of the possible long- and short-term planning solutions, and Constraint

  11. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    OpenAIRE

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and ...

  12. Application of neural network and Levenberg–Marquardt algorithm for electrical grid planning

    Science.gov (United States)

    Boopathi, M.; Senthil Kumar, S.; Kalaiarassan, G.

    2017-11-01

    In the present scenario of industrial growth, technological advancement and population growth, the single most inseparable commodity is electrical energy. This paper presents a novel way to use Neural Networks to forecast long-term electricity load and use the result for proper grid planning in terms of expansion and maintenance. Uninterrupted, reliable and cheap electricity can only be available if there is a proper planned and stable grid, which can be achieved only through proper futuristic grid planning models. In this paper, focus is centered to form the cluster of areas based on the forecasted energy needs in India. Priority ranking also allocated to decide the level of expansion for forthcoming decades.

  13. OPEN: Optimized Path Planning Algorithm with Energy Efficiency and Extending Network - Lifetime in WSN

    Directory of Open Access Journals (Sweden)

    Syed Bilal Hussain Shah

    2017-01-01

    Full Text Available In Wireless Sensors Networks (WSNs, researcher’s main focus is on energy preservation and prolonging network lifetime. More energy resources are required in case of remote applications of WSNs, where some of the nodes die early that shorten the lifetime and decrease the stability of the network. It is mainly caused due to the non-optimal Cluster Heads (CHs selection based on single criterion and uneven distribution of energy. We propose a new clustering protocol for both homogeneous and heterogeneous environments, named as Optimized Path planning algorithm with Energy efficiency and Extending Network lifetime in WSN (OPEN. In the proposed protocol, timer value concept is used for CH selection based on multiple criteria. Simulation results prove that OPEN performs better than the existing protocols in terms of the network lifetime, throughput and stability. The results explicitly explain the cluster head selection of OPEN protocol and efficient solution of uneven energy distribution problem.

  14. Shuttle Planning for Link Closures in Urban Public Transport Networks

    DEFF Research Database (Denmark)

    van der Hurk, Evelien; Koutsopoulos, Haris N.; Wilson, Nigel

    2016-01-01

    cost, which includes transfers and frequency-dependent waiting time costs. This model is applied to a shuttle design problem based on a real-world case study of the Massachusetts Bay Transportation Authority network of Boston, Massachusetts. The results show that additional shuttle routes can reduce......Urban public transport systems must periodically close certain links for maintenance, which can have significant effects on the service provided to passengers. In practice, the effects of closures are mitigated by replacing the closed links with a simple shuttle service. However, alternative...... passenger delay compared to the standard industry practice, while also distributing delay more equally over passengers, at the same operating budget. The results are robust under different assumptions about passenger route choice behavior. Computational experiments show that the proposed formulation...

  15. Smart Distribution Networks: A Review of Modern Distribution Concepts from a Planning Perspective

    Directory of Open Access Journals (Sweden)

    Syed Ali Abbas Kazmi

    2017-04-01

    Full Text Available Smart grids (SGs, as an emerging grid modernization concept, is spreading across diverse research areas for revolutionizing power systems. SGs realize new key concepts with intelligent technologies, maximizing achieved objectives and addressing critical issues that are limited in conventional grids. The SG modernization is more noticeable at the distribution grid level. Thus, the transformation of the traditional distribution network (DN into an intelligent one, is a vital dimension of SG research. Since future DNs are expected to be interconnected in nature and operation, hence traditional planning methods and tools may no longer be applicable. In this paper, the smart distribution network (SDN concept under the SG paradigm, has presented and reviewed from the planning perspective. Also, developments in the SDN planning process have been surveyed on the basis of SG package (SGP. The package presents a SDN planning foundation via major SG-enabling technologies (SGTF, anticipated functionalities (SGAF, new consumption models (MDC as potential SDN candidates, associated policies and pilot projects and multi-objective planning (MOP as a real-world optimization problem. In addition, the need for an aggregated SDN planning model has also been highlighted. The paper discusses recent notable related works, implementation activities, various issues/challenges and potential future research directions; all aiming at SDN planning.

  16. A hybrid Planning Method for Transmission Network in a Deregulated Enviroment

    DEFF Research Database (Denmark)

    Xu, Zhao; Dong, Zhaoyang; Poulsen, Kit

    2006-01-01

    The reconstruction of power industries has brought fundamental changes to both power system operation and planning. This paper presents a new planning method using a multi-objective optimization (MOOP) technique, as well as human knowledge, to expand the transmission network in open-access schemes....... The method starts with a candidate pool of feasible expansion plans. Consequent selection of the best candidates is carried out through a MOOP approach, of which multiple objectives are tackled simultaneously, aiming at integrating the market operation and planning as one unified process in context...... of a deregulated system. Human knowledge has been applied in both stages to ensure the selection with practical engineering and management concerns. The expansion plan from MOOP is assessed by reliability criteria before it is finalized. The proposed method has been tested with the IEEE 14-bus system, and relevant...

  17. Evaluation of scheduling problems for the project planning of large-scale projects using the example of nuclear facility dismantling; Evaluation von Schedulingproblemen fuer die Projektplanung von Grossprojekten am Beispiel des kerntechnischen Rueckbaus

    Energy Technology Data Exchange (ETDEWEB)

    Huebner, Felix; Schellenbaum, Uli; Stuerck, Christian; Gerhards, Patrick; Schultmann, Frank

    2017-05-15

    The magnitude of widespread nuclear decommissioning and dismantling, regarding deconstruction costs and project duration, exceeds even most of the prominent large-scale projects. The deconstruction costs of one reactor are estimated at several hundred million Euros and the dismantling period for more than a decade. The nuclear power plants built in the 1970s are coming closer to the end of their planned operating lifespan. Therefore, the decommissioning and dismantling of nuclear facilities, which is posing a multitude of challenges to planning and implementation, is becoming more and more relevant. This study describes planning methods for large-scale projects. The goal of this paper is to formulate a project planning problem that appropriately copes with the specific challenges of nuclear deconstruction projects. For this purpose, the requirements for appropriate scheduling methods are presented. Furthermore, a variety of possible scheduling problems are introduced and compared by their specifications and their behaviour. A set of particular scheduling problems including possible extensions and generalisations is assessed in detail. Based on the introduced problems and extensions, a Multi-mode Resource Investment Problem with Tardiness Penalty is chosen to fit the requirements of nuclear facility dismantling. This scheduling problem is then customised and adjusted according to the specific challenges of nuclear deconstruction projects. It can be called a Multi-mode Resource Investment Problem under the consideration of generalized precedence constraints and post-operational costs.

  18. Plan View and Profile Relations: Measuring Correlation Between Channel Profile and Network Morphology

    Science.gov (United States)

    Shelef, E.; Hilley, G. E.

    2010-12-01

    In this research, we explore the relationships between channel network attributes and the corresponding channel profile geometries using high-resolution digital topography and model-generated synthetic topographies. This combined analysis addresses one of the long-standing questions in geomorphology relating to the mechanistic significance of various plan-view channel network geometry measures. Statistically based numerical studies suggest that Hortonian measures of channel network architecture (e.g. bifurcation ratio, area ratio, and length ratio) describe virtually all possible network geometries, and so are not diagnostic when evaluating the origins of the geometry of a particular network. We further explore this hypothesis by examining the correlation between Hack exponent, the channel profile characteristics, and process changes (i.e debris flow vs. fluvial flows) within the landscape. Analysis of high resolution DEMs as well as modeled landscapes, suggests that the Hack exponent is likewise insensitive to changes in the channel profile concavity. In contrast, we find that changes in the concavity of channel profiles apparently impacts the spatial distribution of plan-view junction angles of joining stream segments throughout a catchment. In the context of previous work, this angle might be expected to be a function of the ratio between the slopes of the adjoined channels. Channel concavity determines downstream change in this ratio for channel segments throughout the basin, and so such a metric might be used to explicitly link profile channel geometries to plan-view network geometries. Because profile geometries may change with different advective mass transport processes, such a metric may provide a link between the processes that transport material across a landscape, the profile geometry of channels through which these flows traverse, and the overall drainage network geometry. Additional numerical and field data based analysis are required to further

  19. Analysis of wideband radio channel properties for planning of next-generation wireless networks

    NARCIS (Netherlands)

    Zhang, H.; Mantel, O.C.; Kwakkernaat, M.R.J.A.E.; Herben, M.

    2009-01-01

    This paper analyzes the application of wideband channel properties in the radio planning of wideband wireless networks. The definition and prediction of delay spread (DS) and angular spread (AS) are first discussed. A wideband high-resolution measurement campaign is then described which was

  20. Energy aware planning of multiple virtual infrastructures over converged optical network and IT physical resources.

    Science.gov (United States)

    Anastasopoulos, Markos P; Tzanakaki, Anna; Georgakilas, Konstantinos; Simeonidou, Dimitra

    2011-12-12

    This paper studies energy efficient planning of multiple concurrent virtual infrastructures over a converged physical infrastructure incorporating integrated optical network and IT resources. An MILP model for virtualization of the underlying physical resources is proposed and validated achieving significant energy savings. © 2011 Optical Society of America

  1. Linking Climate Risk, Policy Networks and Adaptation Planning in Public Lands

    Science.gov (United States)

    Lubell, M.; Schwartz, M.; Peters, C.

    2014-12-01

    Federal public land management agencies in the United States have engaged a variety of planning efforts to address climate adaptation. A major goal of these efforts is to build policy networks that enable land managers to access information and expertise needed for responding to local climate risks. This paper investigates whether the perceived and modeled climate risk faced by different land managers is leading to larger networks or more participating in climate adaptation. In theory, the benefits of climate planning networks are larger when land managers are facing more potential changes. The basic hypothesis is tested with a survey of public land managers from hundreds of local and regional public lands management units in the Southwestern United States, as well as other stakeholders involved with climate adaptation planning. All survey respondents report their perceptions of climate risk along a variety of dimensions, as well as their participation in climate adaptation planning and information sharing networks. For a subset of respondents, we have spatially explicity GIS data about their location, which will be linked with downscaled climate model data. With the focus on climate change, the analysis is a subset of the overall idea of linking social and ecological systems.

  2. Advanced Planning Concepts in the Closed-Loop Container Network of ARN

    NARCIS (Netherlands)

    Le Blanc, H.M.; van Krieken, M.G.C.; Krikke, H.R.; Fleuren, H.A.

    2004-01-01

    In this paper we discuss a real-life case study in the optimization of the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands.Advanced planning concepts like dynamic assignment of dismantlers to logistic service providers are analyzed by a

  3. Strategic plan : providing high precision search to NASA employees using the NASA engineering network

    Science.gov (United States)

    Dutra, Jayne E.; Smith, Lisa

    2006-01-01

    The goal of this plan is to briefly describe new technologies available to us in the arenas of information discovery and discuss the strategic value they have for the NASA enterprise with some considerations and suggestions for near term implementations using the NASA Engineering Network (NEN) as a delivery venue.

  4. Airline network development in Europe and its implications for airport planning

    NARCIS (Netherlands)

    Burghouwt, G.

    2007-01-01

    Order by Fax Printer Friendly PDF Brochure Send to Friend Enquire before Buying Hard Copy Airline Network Development in Europe and its Implications for Airport Planning Ashgate Publishing, March 2007, Pages: 300 Description Table of Contents Enquire before Buying Send to a Friend The ongoing

  5. Kootenai River White Sturgeon Recovery Implementation Plan and Schedule; 2005-2010, Technical Report 2004-2005.

    Energy Technology Data Exchange (ETDEWEB)

    Anders, Paul

    2007-03-01

    Kootenai River white sturgeon have been declining for at least 50 years and extinction of the wild population is now imminent (Paragamian et al. 2005). Only 630 adults were estimated to remain in 2002 from a population ten times that size just 20 years ago. Significant recruitment of young sturgeon has not been observed since the early 1970s and consistent annual recruitment has not been seen since the 1950s. The remaining wild population consists of a cohort of large, old fish that is declining by about 9% per year as fish die naturally and are not replaced. At this rate, the wild population will disappear around the year 2040. Numbers have already reached critical low levels where genetic and demographic risks are acute. The Kootenai River White Sturgeon Recovery Team was convened in 1994, provided a draft Recovery Plan in 1996 and the first complete Recovery Plan for Kootenai River white sturgeon in 1999 (USFWS 1996, 1999). The Plan outlined a four part strategy for recovery, including: (1) measures to restore natural recruitment, (2) use of conservation aquaculture to prevent extinction, (3) monitoring survival and recovery, and (4) updating and revising recovery plan criteria and objectives as new information becomes available. Sturgeon recovery efforts are occurring against a backdrop of a broader ecosystem protection and restoration program for the Kootenai River ecosystem. With abundance halving time of approximately 8 years, the Kootenai River white sturgeon population is rapidly dwindling, leaving managers little time to act. Decades of study consistently indicate that recruitment failure occurs between embryo and larval stages. This assertion is based on four key observations. First, almost no recruitment has occurred during the last 30 years. Second, thousands of naturally produced white sturgeon embryos, most viable, have been collected over the past decade, resulting from an estimated 9 to 20 spawning events each year. Third, Kootenai River white

  6. Total-order multi-agent task-network planning for contract bridge

    Energy Technology Data Exchange (ETDEWEB)

    Smith, S.J.J.; Nau, D.S. [Univ. of Maryland, College Park, MD (United States); Throop, T.A. [Great Game Products, Bethesda, MD (United States)

    1996-12-31

    This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent information about bridge in a task network that is extended to represent multi-agency and uncertainty. Our game-playing procedure uses this task network to generate game trees in which the set of alternative choices is determined not by the set of possible actions, but by the set of available tactical and strategic schemes. This approach avoids the difficulties that traditional game-tree search techniques have with imperfect-information games such as bridge--but it also differs in several significant ways from the planning techniques used in typical HTN planners. We describe why these modifications were needed in order to build a successful planner for bridge. This same modified HTN planning strategy appears to be useful in a variety of application domains, for example, we have used the same planning techniques in a process-planning system for the manufacture of complex electromechanical devices. We discuss why the same technique has been successful in two such diverse domains.

  7. Motion planning for autonomous vehicle based on radial basis function neural network in unstructured environment.

    Science.gov (United States)

    Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao

    2014-09-18

    The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality.

  8. Adaptive Scheduling Applied to Non-Deterministic Networks of Heterogeneous Tasks for Peak Throughput in Concurrent Gaudi

    CERN Document Server

    AUTHOR|(CDS)2070032; Clemencic, Marco

    As much the e-Science revolutionizes the scientific method in its empirical research and scientific theory, as it does pose the ever growing challenge of accelerating data deluge. The high energy physics (HEP) is a prominent representative of the data intensive science and requires scalable high-throughput software to be able to cope with associated computational endeavors. One such striking example is $\\text G\\rm \\small{AUDI}$ -- an experiment independent software framework, used in several frontier HEP experiments. Among them stand ATLAS and LHCb -- two of four mainstream experiments at the Large Hadron Collider (LHC) at CERN, the European Laboratory for Particle Physics. The framework is currently undergoing an architectural revolution aiming at massively concurrent and adaptive data processing. In this work I explore new dimensions of performance improvement for the next generation $\\text G\\rm \\small{AUDI}$. I then propose a complex of generic task scheduling solutions for adaptive and non-intrusive throu...

  9. A Multi-Verse Optimizer with Levy Flights for Numerical Optimization and Its Application in Test Scheduling for Network-on-Chip.

    Science.gov (United States)

    Hu, Cong; Li, Zhi; Zhou, Tian; Zhu, Aijun; Xu, Chuanpei

    2016-01-01

    We propose a new meta-heuristic algorithm named Levy flights multi-verse optimizer (LFMVO), which incorporates Levy flights into multi-verse optimizer (MVO) algorithm to solve numerical and engineering optimization problems. The Original MVO easily falls into stagnation when wormholes stochastically re-span a number of universes (solutions) around the best universe achieved over the course of iterations. Since Levy flights are superior in exploring unknown, large-scale search space, they are integrated into the previous best universe to force MVO out of stagnation. We test this method on three sets of 23 well-known benchmark test functions and an NP complete problem of test scheduling for Network-on-Chip (NoC). Experimental results prove that the proposed LFMVO is more competitive than its peers in both the quality of the resulting solutions and convergence speed.

  10. Network effects in railways

    DEFF Research Database (Denmark)

    Landex, Alex

    2012-01-01

    Railway operation is often affected by network effects as a change in one part of the network can influence other parts of the network. Network effects occur because the train runs may be quite long and since the railway system has a high degree of interdependencies as trains cannot cross....../overtake each other everywhere in the network. First this paper describes network effects in general (section 1). In section 2 the network effects for trains and how they can be measured by scheduled waiting time is described. When the trains are affected by network effects the passengers are also affected....... Therefore, sections 3 and 4 describe the network effects for passengers and how they can be measured using passenger delay models. Before the concluding remarks in section 6, section 5 discusses how the operation can be improved by examining network effects in the planning process. © 2012 WIT Press....

  11. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

    The scheduling limits for a typical long year taking into account technical stops, machine development, spe- cial physics runs are presented. An attempt is then made to outline a ten year post LS1 schedule taking into account the disparate requirements outlined in the previous talks in this session. The demands on the planned long shutdowns and the impact of these demands on their proposed length will be discussed. The option of using ion running as a pre-shutdown cool-down period will be addressed.

  12. Dynamic and stochastic multi-project planning

    CERN Document Server

    Melchiors, Philipp

    2015-01-01

    This book deals with dynamic and stochastic methods for multi-project planning. Based on the idea of using queueing networks for the analysis of dynamic-stochastic multi-project environments this book addresses two problems: detailed scheduling of project activities, and integrated order acceptance and capacity planning. In an extensive simulation study, the book thoroughly investigates existing scheduling policies. To obtain optimal and near optimal scheduling policies new models and algorithms are proposed based on the theory of Markov decision processes and Approximate Dynamic programming.

  13. A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks

    NARCIS (Netherlands)

    Chatterjea, Supriyo; Nieberg, T.; Meratnia, Nirvana; Havinga, Paul J.M.

    Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a

  14. MDS-Mac: a scheduled MAC for localization, time-synchronisation and communication in underwater acoustic networks

    NARCIS (Netherlands)

    van Kleunen, W.A.P.; Meratnia, Nirvana; Havinga, Paul J.M.

    2012-01-01

    In this paper we describe a design for an underwater MAC protocol which combines localization, time-synchronisation and communication. This protocol is designed for small-scale clustered networks in which all nodes are able to ommunicate with each other. We consider an integrated design of

  15. A project plan for construction and cabling of picture archiving and communication system network.

    Science.gov (United States)

    Luo, Min; Wang, Xiaolin; Luo, Song; Lei, Wenyong; Wang, Xuejian; Wen, Hongyu; Wu, Hongxing

    2003-05-01

    To determine a network solution to meet the network requirements of the heavy data flow, load balance, and potential network storms from expansion of picture archiving and communication system (PACS) application. Intel Netstructure 480T Giga Switch was used as the main switch and connected to each building by fiber channel at 1 Giga speed to archive 100 MB/s to each port. At the same time, the in-dependence of the original network construction was physically kept. The layer 3 and 4 switchers were used as load balance to reduce the heavy load of the network, and all the cabling for PACS used the super CAT5 along with the Intel NetStructure 1520 to prepare for potential network storms. An advanced intranet was set up to fully meet the high standard requirement of the PACS. The foundation for upgrading the whole network system to 1 Giga application was built to achieve sharing and transmission of images, information, and patient data within the hospital. The base was established for the standardized management of the hospital. Good planning is the first step in setting up PACS, and the equipment forms the necessary platform to run PACS and all kinds of hospital information system (HIS). The networking construction is the foundation of e-hospital.

  16. Interfaz entre el plan de producción y el programa de producción en ambientes de ensamble Interface between the production plan and the master production schedule in assembly environments

    Directory of Open Access Journals (Sweden)

    Marcos Moya Navarro

    2012-11-01

    Full Text Available En un entorno de producción existe una relación directa entre el mercado y los procesos de manufactura de los bienes. Sin embargo, cuando la producción está inmersa en un ambiente de ensamble, el procedimiento de la planificación y la programación se vuelve complejo, con el riesgo de que la empresa pierda ventaja competitiva en términos de incumplimiento de las fechas de entrega y elevados costos de planificación y control. La programación lineal constituye una herramienta apropiada para construir modelos de programación y control de la producción en entornos de manufactura complejos. El objetivo de este trabajo es mostrar la interfaz entre el plan de producción y el programa de producción en ambientes de ensamble mediante el modelado por programación lineal. Para ello, se seleccionó un entorno que produce tres productos finales cuya estructura de producto está dispuesta en tres niveles con un máximo de ocho componentes. Los datos proporcionados por el plan de producción se desglosaron en diez órdenes, cada una indicando el tipo de producto, la cantidad por producir y su respectiva fecha de entrega. Los resultados obtenidos en el programa de producción establecieron la recepción de pedidos planificados y el programa de componentes totales requeridos en cada periodo de producción, para minimizar los costos totales de emisión de órdenes de producción e inventario.In a production environment there is a direct relationship between the market and the manufacturing process of goods.When production is immersed in an assembly environment, the process of production planning and scheduling becomes complex, and the enterprises have the risk of losing competitive advantages in terms of not meeting delivery dates and production high costs. Linear programming has become an appropriate tool for production planning and scheduling in complex manufacturing environments. The aim of this paper is to show the interface between both the

  17. Partnership capacity for community health improvement plan implementation: findings from a social network analysis.

    Science.gov (United States)

    McCullough, J Mac; Eisen-Cohen, Eileen; Salas, S Bianca

    2016-07-13

    Many health departments collaborate with community organizations on community health improvement processes. While a number of resources exist to plan and implement a community health improvement plan (CHIP), little empirical evidence exists on how to leverage and expand partnerships when implementing a CHIP. The purpose of this study was to identify characteristics of the network involved in implementing the CHIP in one large community. The aims of this analysis are to: 1) identify essential network partners (and thereby highlight potential network gaps), 2) gauge current levels of partner involvement, 3) understand and effectively leverage network resources, and 4) enable a data-driven approach for future collaborative network improvements. We collected primary data via survey from n = 41 organizations involved in the Health Improvement Partnership of Maricopa County (HIPMC), in Arizona. Using the previously validated Program to Analyze, Record, and Track Networks to Enhance Relationships (PARTNER) tool, organizations provided information on existing ties with other coalition members, including frequency and depth of partnership and eight categories of perceived value/trust of each current partner organization. The coalition's overall network had a density score of 30 %, degree centralization score of 73 %, and trust score of 81 %. Network maps are presented to identify existing relationships between HIPMC members according to partnership frequency and intensity, duration of involvement in the coalition, and self-reported contributions to the coalition. Overall, number of ties and other partnership measures were positively correlated with an organization's perceived value and trustworthiness as rated by other coalition members. Our study presents a novel use of social network analysis methods to evaluate the coalition of organizations involved in implementing a CHIP in an urban community. The large coalition had relatively low network density but high

  18. Federal Facility Agreement plans and schedules for liquid low-level radioactive waste tank systems at Oak Ridge National Laboratory, Oak Ridge, Tennessee

    Energy Technology Data Exchange (ETDEWEB)

    1992-03-01

    Although the Federal Facility Agreement (FFA) addresses the entire Oak Ridge Reservation, specific requirements are set forth for the liquid low-level radioactive waste (LLLW) storage tanks and their associated piping and equipment, tank systems, at ORNL. The stated objected of the FFA as it relates to these tank systems is to ensure that structural integrity, containment and detection of releases, and source control are maintained pending final remedial action at the site. The FFA requires that leaking LLLW tank systems be immediately removed from service. It also requires the LLLW tank systems that do not meet the design and performance requirements established for secondary containment and leak detection be either upgraded or replaced. The FFA establishes a procedural framework for implementing the environmental laws. For the LLLW tank systems, this framework requires the specified plans and schedules be submitted to EPA and TDEC for approval within 60 days, or in some cases, within 90 days, of the effective date of the agreement.

  19. Federal Facility Agreement plans and schedules for liquid low-level radioactive waste tank systems at Oak Ridge National Laboratory, Oak Ridge, Tennessee. Environmental Restoration Program

    Energy Technology Data Exchange (ETDEWEB)

    1992-03-01

    Although the Federal Facility Agreement (FFA) addresses the entire Oak Ridge Reservation, specific requirements are set forth for the liquid low-level radioactive waste (LLLW) storage tanks and their associated piping and equipment, tank systems, at ORNL. The stated objected of the FFA as it relates to these tank systems is to ensure that structural integrity, containment and detection of releases, and source control are maintained pending final remedial action at the site. The FFA requires that leaking LLLW tank systems be immediately removed from service. It also requires the LLLW tank systems that do not meet the design and performance requirements established for secondary containment and leak detection be either upgraded or replaced. The FFA establishes a procedural framework for implementing the environmental laws. For the LLLW tank systems, this framework requires the specified plans and schedules be submitted to EPA and TDEC for approval within 60 days, or in some cases, within 90 days, of the effective date of the agreement.

  20. Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

    Directory of Open Access Journals (Sweden)

    Yueyue Deng

    2013-01-01

    Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.

  1. Multiobjective Transmission Network Planning considering the Uncertainty and Correlation of Wind Power

    Directory of Open Access Journals (Sweden)

    Yuan Hu

    2014-01-01

    Full Text Available In order to consider the uncertainty and correlation of wind power in multiobjective transmission network expansion planning (TNEP, this paper presents an extended point-estimation method to calculate the probabilistic power flow, based on which the correlative power outputs of wind farm are sampled and the uncertain multiobjective transmission network planning model is transformed into a solvable deterministic model. A modified epsilon multiobjective evolutionary algorithm is used to solve the above model and a well-distributed Pareto front is achieved, and then the final planning scheme can be obtained from the set of nondominated solutions by a fuzzy satisfied method. The proposed method only needs the first four statistical moments and correlation coefficients of the output power of wind farms as input information; the modeling of wind power is more precise by considering the correlation between wind farms, and it can be easily combined with the multiobjective transmission network planning model. Besides, as the self-adaptive probabilities of crossover and mutation are adopted, the global search capabilities of the proposed algorithm can be significantly improved while the probability of being stuck in the local optimum is effectively reduced. The accuracy and efficiency of the proposed method are validated by IEEE 24 as well as a real system.

  2. Integration opportunities for HIV and family planning services in Addis Ababa, Ethiopia: an organizational network analysis.

    Science.gov (United States)

    Thomas, James C; Reynolds, Heidi; Bevc, Christine; Tsegaye, Ademe

    2014-01-18

    Public health resources are often deployed in developing countries by foreign governments, national governments, civil society and the private health clinics, but seldom in ways that are coordinated within a particular community or population. The lack of coordination results in inefficiencies and suboptimal results. Organizational network analysis can reveal how organizations interact with each other and provide insights into means of realizing better public health results from the resources already deployed. Our objective in this study was to identify the missed opportunities for the integration of HIV care and family planning services and to inform future network strengthening. In two sub-cities of Addis Ababa, we identified each organization providing either HIV care or family planning services. We interviewed representatives of each of them about exchanges of clients with each of the others. With network analysis, we identified network characteristics in each sub-city network, such as referral density and centrality; and gaps in the referral patterns. The results were shared with representatives from the organizations. The two networks were of similar size (25 and 26 organizations) and had referral densities of 0.115 and 0.155 out of a possible range from 0 (none) to 1.0 (all possible connections). Two organizations in one sub-city did not refer HIV clients to a family planning organization. One organization in one sub-city and seven in the other offered few HIV services and did not refer clients to any other HIV service provider. Representatives from the networks confirmed the results reflected their experience and expressed an interest in establishing more links between organizations. Because of organizations not working together, women in the two sub-cities were at risk of not receiving needed family planning or HIV care services. Facilitating referrals among a few organizations that are most often working in isolation could remediate the problem, but the

  3. Dynamic Fuzzy-Logic Based Path Planning for Mobility-Assisted Localization in Wireless Sensor Networks.

    Science.gov (United States)

    Alomari, Abdullah; Phillips, William; Aslam, Nauman; Comeau, Frank

    2017-08-18

    Mobile anchor path planning techniques have provided as an alternative option for node localization in wireless sensor networks (WSNs). In such context, path planning is a movement pattern where a mobile anchor node's movement is designed in order to achieve a maximum localization ratio possible with a minimum error rate. Typically, the mobility path planning is designed in advance, which is applicable when the mobile anchor has sufficient sources of energy and time. However, when the mobility movement is restricted or limited, a dynamic path planning design is needed. This paper proposes a novel distributed range-free movement mechanism for mobility-assisted localization in WSNs when the mobile anchor's movement is limited. The designed movement is formed in real-time pattern using a fuzzy-logic approach based on the information received from the network and the nodes' deployment. Our proposed model, Fuzzy-Logic based Path Planning for mobile anchor-assisted Localization in WSNs (FLPPL), offers superior results in several metrics including both localization accuracy and localization ratio in comparison to other similar works.

  4. A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

    Science.gov (United States)

    Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

    To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

  5. SQoS based Planning using 4-regular Grid for Optical Fiber Networks

    DEFF Research Database (Denmark)

    Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun

    2005-01-01

    The recent research on Structural Quality of Service (SQoS) devised many useful properties that can enhance the network performance. Three different structures have been introduced, i.e. 4-regular Grid, N2R, and Honeycomb. These structures are now well described and proposed for the next generati...... a case study of Hals (a small town in the north of Denmark) to apply the implementation procedure. The results are quite promising for the structural based network planning. Conclusion and discussion are presented, and further research is proposed....

  6. Trans-Pacific HDR Satellite Communications Experiment Phase-2 Project Plan and Experimental Network

    Science.gov (United States)

    Hsu, Eddie; Kadowaki, Naoto; Yoshimura, Naoko; Takahashi, Takashi; Yoshikawa, Makoto; Bergman, Larry; Bhasin, Kul

    2000-01-01

    The trans-Pacific high data rate (TP-HDR) satellite communications experiment was proposed at the Japan-U.S. Cooperation in Space (JUCS) Program Workshop held in Hawaii in 1993 and remote high definition video post-production was demonstrated as the first phase trial. ATM-based 45 Mbps trans-Pacific link was established in the first phase, and the following experiments with 155 Mbps was planned as the phase 2. This paper describes the experimental network configuration and project plan of TP-HDR experiment phase 2. Additional information is provided in the original.

  7. Distribution Network Expansion Planning Based on Multi-objective PSO Algorithm

    DEFF Research Database (Denmark)

    Zhang, Chunyu; Ding, Yi; Wu, Qiuwei

    2013-01-01

    This paper presents a novel approach for electrical distribution network expansion planning using multi-objective particle swarm optimization (PSO). The optimization objectives are: investment and operation cost, energy losses cost, and power congestion cost. A two-phase multi-objective PSO...... algorithm was proposed to solve this optimization problem, which can accelerate the convergence and guarantee the diversity of Pareto-optimal front set as well. The feasibility and effectiveness of both the proposed multi-objective planning approach and the improved multi-objective PSO have been verified...

  8. Dynamic supply chain network design with capacity planning and multi-period pricing

    DEFF Research Database (Denmark)

    Fattahi, Mohammad; Mahootchi, Masoud; Govindan, Kannan

    2015-01-01

    This paper addresses a new problem in designing and planning a multi-echelon and multi-product supply chain network over a multi-period horizon in which customer zones have price-sensitive demands. Based on price-demand relationships, a generic method is presented to obtain price levels...... for products and then, a mixed-integer linear programming model is developed. Due to the problem intractability, a simulated annealing algorithm that uses some developed linear relaxation-based heuristics for capacity planning and pricing is presented. Numerical results demonstrate the significance...

  9. Dengue research networks: building evidence for policy and planning in Brazil.

    Science.gov (United States)

    de Paula Fonseca E Fonseca, Bruna; Zicker, Fabio

    2016-11-08

    The analysis of scientific networks has been applied in health research to map and measure relationships between researchers and institutions, describing collaboration structures, individual roles, and research outputs, and helping the identification of knowledge gaps and cooperation opportunities. Driven by dengue continued expansion in Brazil, we explore the contribution, dynamics and consolidation of dengue scientific networks that could ultimately inform the prioritisation of research, financial investments and health policy. Social network analysis (SNA) was used to produce a 20-year (1995-2014) retrospective longitudinal evaluation of dengue research networks within Brazil and with its partners abroad, with special interest in describing institutional collaboration and their research outputs. The analysis of institutional co-authorship showed a significant expansion of collaboration over the years, increased international involvement, and ensured a shift from public health research toward vector control and basic biomedical research, probably as a reflection of the expansion of transmission, high burden and increasing research funds from the Brazilian government. The analysis identified leading national organisations that maintained the research network connectivity, facilitated knowledge exchange and reduced network vulnerability. SNA proved to be a valuable tool that, along with other indicators, can strengthen a knowledge platform to inform future policy, planning and funding decisions. The paper provides relevant information to policy and planning for dengue research as it reveals: (1) the effectiveness of the research network in knowledge generation, sharing and diffusion; (2) the near-absence of collaboration with the private sector; and (3) the key central organisations that can support strategic decisions on investments, development and implementation of innovations. In addition, the increase in research activities and collaboration has not yet

  10. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear...

  11. Topological clustering as a tool for planning water quality monitoring in water distribution networks

    DEFF Research Database (Denmark)

    Kirstein, Jonas Kjeld; Albrechtsen, Hans-Jørgen; Rygaard, Martin

    2015-01-01

    ) identify steady clusters for a part of the network where an actual contamination has occurred; (2) analyze this event by the use of mesh diagrams; and (3) analyze the use of mesh diagrams as a decision support tool for planning water quality monitoring. Initially, the network model was divided...... into strongly and weakly connected clusters for selected time periods and mesh diagrams were used for analysing cluster connections in the Nørrebro district. Here, areas of particular interest for water quality monitoring were identified by including user-information about consumption rates and consumers...... particular sensitive towards water quality deterioration. The analysis revealed sampling locations within steady clusters, which increased samples' comparability over time. Furthermore, the method provided a simplified overview of water movement in complex distribution networks, and could assist...

  12. Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

    Science.gov (United States)

    Jha, Devesh K.; Chattopadhyay, Pritthi; Sarkar, Soumik; Ray, Asok

    2016-05-01

    This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin's car-like robot.

  13. Building oceanographic and atmospheric observation networks by composition: unmanned vehicles, communication networks, and planning and execution control frameworks

    Science.gov (United States)

    Sousa, J. T.; Pinto, J.; Martins, R.; Costa, M.; Ferreira, F.; Gomes, R.

    2014-12-01

    The problem of developing mobile oceanographic and atmospheric observation networks (MOAO) with coordinated air and ocean vehicles is discussed in the framework of the communications and control software tool chain developed at Underwater Systems and Technologies Laboratory (LSTS) from Porto University. This is done with reference to field experiments to illustrate key capabilities and to assess future MOAO operations. First, the motivation for building MOAO by "composition" of air and ocean vehicles, communication networks, and planning and execution control frameworks is discussed - in networked vehicle systems information and commands are exchanged among multiple vehicles and operators, and the roles, relative positions, and dependencies of these vehicles and operators change during operations. Second, the planning and execution control framework developed at LSTS for multi-vehicle systems is discussed with reference to key concepts such as autonomy, mixed-initiative interactions, and layered organization. Third, the LSTS tool software tool chain is presented to show how to develop MOAO by composition. The tool chain comprises the Neptus command and control framework for mixed initiative interactions, the underlying IMC messaging protocol, and the DUNE on-board software. Fourth, selected LSTS operational deployments illustrate MOAO capability building. In 2012 we demonstrated the use of UAS to "ferry" data from UUVs located beyond line of sight (BLOS). In 2013 we demonstrated coordinated observations of coastal fronts with small UAS and UUVs, "bent" BLOS through the use of UAS as communication relays, and UAS tracking of juvenile hammer-head sharks. In 2014 we demonstrated UUV adaptive sampling with the closed loop controller of the UUV residing on a UAS; this was done with the help of a Wave Glider ASV with a communications gateway. The results from these experiments provide a background for assessing potential future UAS operations in a compositional MOAO.

  14. Landscape Planning and Ecological Networks. Part A. A Rural System in Nuoro, Sardinia

    Directory of Open Access Journals (Sweden)

    Andrea De Montis

    2014-05-01

    Full Text Available Urban-rural landscape planning research is nowadays focusing on strategies and tools that support practitioners in designing integrated spaces starting from the analysis of local areas, where human and natural pressures interfere. A prominent framework is provided by the ecological networks, whose design regards the combination of a set of green areas or patches (the nodes interconnected through environmental corridors (the edges. Ecological networks are useful for biodiversity protection and enhancement, as they are able to counteract fragmentation, and to create or strengthen relations and exchanges among otherwise isolated elements. Biodiversity evolution, indeed, depends on the quantity and quality of spatial cohesion of natural areas.  In this paper, we aim at designing an ecological network for the periurban area on the town of Nuoro in central Sardinia. The narrative unfolds in two parts. Part A is presented in this paper and includes its methodological premises, i.e. biodiversity conservation and ecological network analysis and design, and the introductory elements of a spatial analysis on a pilot ecological network of one hundred patches. We locate patches by focusing on the ecosystems supported by the target vegetal species holm oak (Quercus ilex and cultivated or wild olive (Olea europaea var. sativa, O. europaea var. sylverstis. These are very common plants species in the municipality and some animal species are active as seed dispersal. The reminder, i.e. Part B, of the essay is presented in an homonymous paper that focuses on the illustration of the network analysis conceived as a monitoring system and, in future perspective, as a planning support system.

  15. Cross-layer design for radio resource allocation based on priority scheduling in OFDMA wireless access network

    Directory of Open Access Journals (Sweden)

    Chen Yen-Wen

    2011-01-01

    Full Text Available Abstract The orthogonal frequency-division multiple access (OFDMA system has the advantages of flexible subcarrier allocation and adaptive modulation with respect to channel conditions. However, transmission overhead is required in each frame to broadcast the arrangement of radio resources to all mobile stations within the coverage of the same base station. This overhead greatly affects the utilization of valuable radio resources. In this paper, a cross layer scheme is proposed to reduce the number of traffic bursts at the downlink of an OFDMA wireless access network so that the overhead of the media access protocol (MAP field can be minimized. The proposed scheme considers the priorities and the channel conditions of quality of service (QoS traffic streams to arrange for them to be sent with minimum bursts in a heuristic manner. In addition, the trade-off between the degradation of the modulation level and the reduction of traffic bursts is investigated. Simulation results show that the proposed scheme can effectively reduce the traffic bursts and, therefore, increase resource utilization.

  16. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    led several cost research initiatives in cloud computing, service-oriented architecture , and agile development and various independent schedule...systems and platforms. Manring is trained and experienced on a number of commercial parametric software cost models and risk analysis tools. She has...and he supports DoD and federal acquisition efforts with a focus on rapid and agile practices to speed solutions with the lowest practical program

  17. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1991-01-01

    Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

  18. (Box-filling-model)-based ONU schedule algorithm and bandwidth-requirement-based ONU transfer mechanism for multi-subsystem-based VPONs' management in metro-access optical network

    Science.gov (United States)

    Zhang, Yuchao; Gan, Chaoqin; Gou, Kaiyu; Hua, Jian

    2017-07-01

    ONU schedule algorithm and ONU transfer mechanism for multi-subsystem-based VPONs' management is proposed in this paper. To avoid frequent wavelength switch and realize high system stability, ONU schedule algorithm is presented for wavelength allocation by introducing box-filling model. At the same time, judgement mechanism is designed to filter wavelength-increased request caused by slight bandwidth fluctuation of VPON. To share remained bandwidth among VPONs, ONU transfer mechanism is put forward according to flexible wavelength routing. To manage wavelength resource of entire network and wavelength requirement from VPONs, information-managed matrix model is constructed. Finally, the effectiveness of the proposed scheme is demonstrated by simulation and analysis.

  19. Significance of the Maritimes Region ecosystem research initiative to marine protected area network planning within Fisheries and Oceans Canada

    National Research Council Canada - National Science Library

    Lawton, P; Westhead, M; Greenlaw, M.E; Smith, S.J; Brown, C.J; Quigley, S; Brickman, D

    2013-01-01

    This research document outlines the relevance to Marine Protected Area (MPA) network planning of scientific work recently completed under Fisheries and Oceans Canada's Maritimes Region Ecosystem Research Initiative (ERI...

  20. Multiuser Switched Diversity Scheduling Schemes

    CERN Document Server

    Shaqfeh, Mohammad; Alouini, Mohamed-Slim

    2012-01-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback sys...

  1. Optimization of beamforming and path planning for UAV-assisted wireless relay networks

    Directory of Open Access Journals (Sweden)

    Ouyang Jian

    2014-04-01

    Full Text Available Recently, unmanned aerial vehicles (UAVs acting as relay platforms have attracted considerable attention due to the advantages of extending coverage and improving connectivity for long-range communications. Specifically, in the scenario where the access point (AP is mobile, a UAV needs to find an efficient path to guarantee the connectivity of the relay link. Motivated by this fact, this paper proposes an optimal design for beamforming (BF and UAV path planning. First of all, we study a dual-hop amplify-and-forward (AF wireless relay network, in which a UAV is used as relay between a mobile AP and a fixed base station (BS. In the network, both of the AP and the BS are equipped with multiple antennas, whereas the UAV has a single antenna. Then, we obtain the output signal-to-noise ratio (SNR of the dual-hop relay network. Based on the criterion of maximizing the output SNR, we develop an optimal design to obtain the solution of the optimal BF weight vector and the UAV heading angle. Next, we derive the closed-form outage probability (OP expression to investigate the performance of the dual-hop relay network conveniently. Finally, computer simulations show that the proposed approach can obtain nearly optimal flying path and OP performance, indicating the effectiveness of the proposed algorithm. Furthermore, we find that increasing the antenna number at the BS or the maximal heading angle can significantly improve the performance of the considered relay network.

  2. Automated transportation management system (ATMS) software project management plan (SPMP)

    Energy Technology Data Exchange (ETDEWEB)

    Weidert, R.S., Westinghouse Hanford

    1996-05-20

    The Automated Transportation Management System (ATMS) Software Project Management plan (SPMP) is the lead planning document governing the life cycle of the ATMS and its integration into the Transportation Information Network (TIN). This SPMP defines the project tasks, deliverables, and high level schedules involved in developing the client/server ATMS software.

  3. REPNET: project scheduling and workflow optimization for Construction Projects

    Directory of Open Access Journals (Sweden)

    Marco Alvise Bragadin

    2013-10-01

    Full Text Available Project planning and control are core processes for construction management. In practice project planning is achieved by network - based techniques like Precedence Diagramming Method (PDM.Indeed many researchers and practitioners claims that networking techniques as such do not provide a suitable model for construction projects. Construction process modeling should incorporate for specific features of resource flows through project activities. So an improved resource scheduling method for construction is developed, called REPNET, based on a precedence network plotted on a resource–space chart and presented with a flow-line chart. The heuristics of REPNET are used to carry out resource timing while optimizing processes flows and resource usage. The method has been tested on a sample project.

  4. Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy

    Directory of Open Access Journals (Sweden)

    Seung Jun Baek

    2017-01-01

    Full Text Available We consider a scheduling problem for a two-hop queueing network where the queues have randomly varying connectivity. Customers arrive at the source queue and are later routed to multiple relay queues. A relay queue can be served only if it is in connected state, and the state changes randomly over time. The source queue and relay queues are served in a time-sharing manner; that is, only one customer can be served at any instant. We propose Join the Shortest Queue-Longest Connected Queue (JSQ-LCQ policy as follows: (1 if there exist nonempty relay queues in connected state, serve the longest queue among them; (2 if there are no relay queues to serve, route a customer from the source queue to the shortest relay queue. For symmetric systems in which the connectivity has symmetric statistics across the relay queues, we show that JSQ-LCQ is strongly optimal, that is, minimizes the delay in the stochastic ordering sense. We use stochastic coupling and show that the systems under coupling exist in two distinct phases, due to dynamic interactions among source and relay queues. By careful construction of coupling in both phases, we establish the stochastic dominance in delay between JSQ-LCQ and any arbitrary policy.

  5. Integrating priority areas and ecological corridors into national network for conservation planning in China.

    Science.gov (United States)

    Liang, Jie; He, Xinyue; Zeng, Guangming; Zhong, Minzhou; Gao, Xiang; Li, Xin; Li, Xiaodong; Wu, Haipeng; Feng, Chunting; Xing, Wenle; Fang, Yilong; Mo, Dan

    2018-01-11

    Considering that urban expansion and increase of human activities represent important threats to biodiversity and ecological processes in short and long term, developing protected area (PA) network with high connectivity is considered as a valuable conservation strategy. However, conservation planning associated with the large-scale network in China involves important information loopholes about the land cover and landscape connectivity. In this paper, we made an integrative analysis for the identification of conservation priority areas and least-cost ecological corridors (ECs) in order to promote a more representative, connected and efficient ecological PA network for this country. First, we used Zonation, a spatial prioritization software, to achieve a hierarchical mask and selected the top priority conservation areas. Second, we identified optimal linkages between two patches as corridors based on least-cost path algorithm. Finally, we proposed a new framework of China's PA network composed of conservation priority and ECs in consideration of high connectivity between areas. We observed that priority areas identified here cover 12.9% of the region, distributed mainly in mountainous and plateau areas, and only reflect a spatial mismatch of 19% with the current China's nature reserves locations. From the perspective of conservation, our result provide the need to consider new PA categories, specially located in the south (e.g., the middle-lower Yangtze River area, Nanling and Min-Zhe-Gan Mountains) and north regions (e.g., Changbai Mountains), in order to construct an optimal and connected national network in China. This information allows us better opportunities to identify the relative high-quality patches and draft the best conservation plan for the China's biodiversity in the long-term run. Copyright © 2018 Elsevier B.V. All rights reserved.

  6. Empowering health personnel for decentralized health planning in India: The Public Health Resource Network

    Directory of Open Access Journals (Sweden)

    Prasad Vandana

    2009-07-01

    Full Text Available Abstract The Public Health Resource Network is an innovative distance-learning course in training, motivating, empowering and building a network of health personnel from government and civil society groups. Its aim is to build human resource capacity for strengthening decentralized health planning, especially at the district level, to improve accountability of health systems, elicit community participation for health, ensure equitable and accessible health facilities and to bring about convergence in programmes and services. The question confronting health systems in India is how best to reform, revitalize and resource primary health systems to deliver different levels of service aligned to local realities, ensuring universal coverage, equitable access, efficiency and effectiveness, through an empowered cadre of health personnel. To achieve these outcomes it is essential that health planning be decentralized. Districts vary widely according to the specific needs of their population, and even more so in terms of existing interventions and available resources. Strategies, therefore, have to be district-specific, not only because health needs vary, but also because people's perceptions and capacities to intervene and implement programmes vary. In centrally designed plans there is little scope for such adaptation and contextualization, and hence decentralized planning becomes crucial. To undertake these initiatives, there is a strong need for trained, motivated, empowered and networked health personnel. It is precisely at this level that a lack of technical knowledge and skills and the absence of a supportive network or adequate educational opportunities impede personnel from making improvements. The absence of in-service training and of training curricula that reflect field realities also adds to this, discouraging health workers from pursuing effective strategies. The Public Health Resource Network is thus an attempt to reach out to motivated

  7. Deficit Round Robin with Fragmentation Scheduling to Achieve Generalized Weighted Fairness for Resource Allocation in IEEE 802.16e Mobile WiMAX Networks

    Directory of Open Access Journals (Sweden)

    Chakchai So-In

    2010-10-01

    Full Text Available Deficit Round Robin (DRR is a fair packet-based scheduling discipline commonly used in wired networks where link capacities do not change with time. However, in wireless networks, especially wireless broadband networks, i.e., IEEE 802.16e Mobile WiMAX, there are two main considerations violate the packet-based service concept for DRR. First, the resources are allocated per Mobile WiMAX frame. To achieve full frame utilization, Mobile WiMAX allows packets to be fragmented. Second, due to a high variation in wireless channel conditions, the link/channel capacity can change over time and location. Therefore, we introduce a Deficit Round Robin with Fragmentation (DRRF to allocate resources per Mobile WiMAX frame in a fair manner by allowing for varying link capacity and for transmitting fragmented packets. Similar to DRR and Generalized Processor Sharing (GPS, DRRF achieves perfect fairness. DRRF results in a higher throughput than DRR (80% improvement while causing less overhead than GPS (8 times less than GPS. In addition, in Mobile WiMAX, the quality of service (QoS offered by service providers is associated with the price paid. This is similar to a cellular phone system; the users may be required to pay air-time charges. Hence, we have also formalized a Generalized Weighted Fairness (GWF criterion which equalizes a weighted sum of service time units or slots, called temporal fairness, and transmitted bytes, called throughput fairness, for customers who are located in a poor channel condition or at a further distance versus for those who are near the base stations, or have a good channel condition. We use DRRF to demonstrate the application of GWF. These fairness criteria are used to satisfy basic requirements for resource allocation, especially for non real-time traffic. Therefore, we also extend DRRF to support other QoS requirements, such as minimum reserved traffic rate, maximum sustained traffic rate, and traffic priority. For real

  8. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje Elisabeth; Braaksma, Aleida; Vliegen, Ingrid; Boucherie, Richardus J.; Litvak, Nelli; Hans, Elias W.

    2014-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  9. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje Elisabeth; Boucherie, Richardus J.; Litvak, Nelli; Hans, Elias W.

    2011-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  10. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  11. Optimization of observation plan based on the stochastic characteristics of the geodetic network

    Directory of Open Access Journals (Sweden)

    Pachelski Wojciech

    2016-06-01

    Full Text Available Optimal design of geodetic network is a basic subject of many engineering projects. An observation plan is a concluding part of the process. Any particular observation within the network has through adjustment a different contribution and impact on values and accuracy characteristics of unknowns. The problem of optimal design can be solved by means of computer simulation. This paper presents a new method of simulation based on sequential estimation of individual observations in a step-by-step manner, by means of the so-called filtering equations. The algorithm aims at satisfying different criteria of accuracy according to various interpretations of the covariance matrix. Apart of them, the optimization criterion is also amount of effort, defined as the minimum number of observations required.

  12. Self-Organizing Networks (SON) Self-Planning, Self-Optimization and Self-Healing for GSM, UMTS and LTE

    CERN Document Server

    Ramiro, Juan

    2011-01-01

    With the current explosion in network traffic, and mounting pressure on operators' business case, Self-Organizing Networks (SON) play a crucial role. They are conceived to minimize human intervention in engineering processes and at the same time improve system performance to maximize Return-on-Investment (ROI) and secure customer loyalty. Written by leading experts in the planning and optimization of Multi-Technology and Multi-Vendor wireless networks, this book describes the architecture of Multi-Technology SON for GSM, UMTS and LTE, along with the enabling technologies for SON planning, opti

  13. From planning to practice: building the national network for the surveillance of severe maternal morbidity

    Science.gov (United States)

    2011-01-01

    Background Improving maternal health is one of the Millennium Development Goals for 2015. Recently some progress has been achieved in reducing mortality. On the other hand, in developed regions, maternal death is a relatively rare event compared to the number of cases of morbidity; hence studying maternal morbidity has become more relevant. Electronic surveillance systems may improve research by facilitating complete data reporting and reducing the time required for data collection and analysis. Therefore the purpose of this study was to describe the methods used in elaborating and implementing the National Network for the Surveillance of Severe Maternal Morbidity in Brazil. Methods The project consisted of a multicenter, cross-sectional study for the surveillance of severe maternal morbidity including near-miss, in Brazil. Results Following the development of a conceptual framework, centers were selected for inclusion in the network, consensus meetings were held among the centers, an electronic data collection system was identified, specific software and hardware tools were developed, research material was prepared, and the implementation process was initiated and analyzed. Conclusion The conceptual framework developed for this network was based on the experience acquired in various studies carried out in the area over recent years and encompasses maternal and perinatal health. It is innovative especially in the context of a developing country. The implementation of the project represents the first step towards this planned management. The system online elaborated for this surveillance network may be used in further studies in reproductive and perinatal health. PMID:21549009

  14. A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles.

    Science.gov (United States)

    Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X

    2017-01-01

    Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.

  15. SU-E-T-619: A Network-Flow Solution Approach to VMAT Treatment Plan Optimization.

    Science.gov (United States)

    Salari, E; Craft, D

    2012-06-01

    To add mathematical rigor to the merging phase of the recently published two-stage VMAT optimization method called VMERGE. Using an exact merging method, we are able to better characterize the tradeoff between delivery efficiency and dose quality. VMERGE begins with an IMRT plan that uses 180 equi-spaced beams and yields the "ideal" dose. Neighboring fluence maps are successively merged, meaning they are added together and delivered as one map. The merging process improves the delivery time at the expense of deviating from the initial high-quality dose distribution. We replace the original heuristic merging method by considering the merging problem as a bi-criteria optimization problem: maximize treatment efficiency and minimize the deviation from the ideal dose. We formulate this using a network-flow model where nodes represent the beam angles along with the starting MLC leaf position and arcs represent the possible merges. Since the problem is non-convex, we employ a customized box algorithm to obtain the Pareto approximation. We also evaluate the performance of several simple heuristics. We test our exact and heuristic solution approaches on a pancreas and a prostate case. For both cases, the shape of the Pareto frontier suggests that starting from a high quality plan, we can obtain efficient VMAT plans through merging neighboring arcs without substantially deviating from the initial dose distribution. The trade-off curves obtained by the various heuristics are contrasted and shown to all be equally capable of initial plan simplifications, but to deviate in quality for more drastic efficiency improvements. This work presents a bi-criteria network-flow solution approach to the merging problem. The obtained Pareto-frontier approximation is used as a benchmark to evaluate the performance of the proposed merging heuristics. The results validate that one of the heuristics in particular can achieve high-quality solutions. © 2012 American Association of Physicists in

  16. A pre-analysis for the optimal operational scheduling of a pipeline network; Uma pre-analise do problema de otimizacao da programacao das operacoes de uma malha dutoviaria

    Energy Technology Data Exchange (ETDEWEB)

    Czaikowski, Daniel I.; Brondani, William M.; Arantes, Lucas G.; Boschetto, Suelen N.; Lueders, Ricardo; Magatao, Leandro; Stebel, Sergio L. [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil); Ribas, Paulo C. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

    2008-07-01

    This work suggests a Pre-analysis in the input parameters of an optimization system (Bonacin et al., 2007; Boschetto et al., 2008). The proposed method is based on programming techniques that use lists of objects threaded, where objects are elements belonging to the same class, according to the concept of the object-oriented programming. The Preanalysis makes a previous evaluation of a batch sequencing, getting information to be entered into an optimization block. The continuous time Mixed Integer Linear Programming (MILP) model gets such information and determines the scheduling. The models are applied on a pipeline network that connects different areas including refineries, terminals, and final clients. Many oil derivatives (e.g. gasoline, liquefied petroleum gas, naphtha) can be sent or received in this network. The Pre-analysis objective is to reduce the computational time of an MILP model, and the proposed approach can aid the decision-making process to obtain a more detailed scheduling. (author)

  17. Neural network dose models for knowledge-based planning in pancreatic SBRT.

    Science.gov (United States)

    Campbell, Warren G; Miften, Moyed; Olsen, Lindsey; Stumpf, Priscilla; Schefter, Tracey; Goodman, Karyn A; Jones, Bernard L

    2017-10-10

    Stereotactic body radiation therapy (SBRT) for pancreatic cancer requires a skillful approach to deliver ablative doses to the tumor while limiting dose to the highly sensitive duodenum, stomach, and small bowel. Here, we develop knowledge-based artificial neural network dose models (ANN-DMs) to predict dose distributions that would be approved by experienced physicians. Arc-based SBRT treatment plans for 43 pancreatic cancer patients were planned, delivering 30-33 Gy in five fractions. Treatments were overseen by one of two physicians with individual treatment approaches, with variations in prescribed dose, target volume delineation, and primary organs-at-risk. Using dose distributions calculated by a commercial treatment planning system (TPS), physician-approved treatment plans were used to train ANN-DMs that could predict physician-approved dose distributions based on a set of geometric parameters (vary from voxel to voxel) and plan parameters (constant across all voxels for a given patient). Patient datasets were randomly allocated, with 2/3(rds) used for training, and 1/3(rd) used for validation. Differences between TPS and ANN-DM dose distributions were used to evaluate model performance. ANN-DM design, including neural network structure and parameter choices, were evaluated to optimize dose model performance. Remarkable improvements in ANN-DM accuracy (i.e., from >30% to models for the treatment style of each physician. Increased neural network complexity (i.e., more layers, more neurons per layer) did not improve dose model accuracy. Mean dose errors were less than 5% at all distances from the PTV, and mean absolute dose errors were on the order of 5%, but no more than 10%. Dose-volume histogram errors (in cm(3) ) demonstrated good model performance above 25 Gy, but much larger errors were seen at lower doses. ANN-DM dose distributions showed excellent overall agreement with TPS dose distributions, and accuracy was substantially improved when each physician

  18. Optimizing Transmission Network Expansion Planning With The Mean Of Chaotic Differential Evolution Algorithm

    Directory of Open Access Journals (Sweden)

    Ahmed R. Abdelaziz

    2015-08-01

    Full Text Available This paper presents an application of Chaotic differential evolution optimization approach meta-heuristics in solving transmission network expansion planning TNEP using an AC model associated with reactive power planning RPP. The reliabilityredundancy of network analysis optimization problems implicate selection of components with multiple choices and redundancy levels that produce maximum benefits can be subject to the cost weight and volume constraints is presented in this paper. Classical mathematical methods have failed in handling non-convexities and non-smoothness in optimization problems. As an alternative to the classical optimization approaches the meta-heuristics have attracted lot of attention due to their ability to find an almost global optimal solution in reliabilityredundancy optimization problems. Evolutionary algorithms EAs paradigms of evolutionary computation field are stochastic and robust meta-heuristics useful to solve reliabilityredundancy optimization problems. EAs such as genetic algorithm evolutionary programming evolution strategies and differential evolution are being used to find global or near global optimal solution. The Differential Evolution Algorithm DEA population-based algorithm is an optimal algorithm with powerful global searching capability but it is usually in low convergence speed and presents bad searching capability in the later evolution stage. A new Chaotic Differential Evolution algorithm CDE based on the cat map is recommended which combines DE and chaotic searching algorithm. Simulation results and comparisons show that the chaotic differential evolution algorithm using Cat map is competitive and stable in performance with other optimization approaches and other maps.

  19. Service and transfer selection for freights in a synchromodal network

    NARCIS (Netherlands)

    Perez Rivera, Arturo Eduardo; Mes, Martijn R.K.

    2016-01-01

    We study the planning problem of selecting services and transfers in a synchromodal network to transport freights with diff erent characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new

  20. Using neural networks and Dyna algorithm for integrated planning, reacting and learning in systems

    Science.gov (United States)

    Lima, Pedro; Beard, Randal

    1992-01-01

    The traditional AI answer to the decision making problem for a robot is planning. However, planning is usually CPU-time consuming, depending on the availability and accuracy of a world model. The Dyna system generally described in earlier work, uses trial and error to learn a world model which is simultaneously used to plan reactions resulting in optimal action sequences. It is an attempt to integrate planning, reactive, and learning systems. The architecture of Dyna is presented. The different blocks are described. There are three main components of the system. The first is the world model used by the robot for internal world representation. The input of the world model is the current state and the action taken in the current state. The output is the corresponding reward and resulting state. The second module in the system is the policy. The policy observes the current state and outputs the action to be executed by the robot. At the beginning of program execution, the policy is stochastic and through learning progressively becomes deterministic. The policy decides upon an action according to the output of an evaluation function, which is the third module of the system. The evaluation function takes the following as input: the current state of the system, the action taken in that state, the resulting state, and a reward generated by the world which is proportional to the current distance from the goal state. Originally, the work proposed was as follows: (1) to implement a simple 2-D world where a 'robot' is navigating around obstacles, to learn the path to a goal, by using lookup tables; (2) to substitute the world model and Q estimate function Q by neural networks; and (3) to apply the algorithm to a more complex world where the use of a neural network would be fully justified. In this paper, the system design and achieved results will be described. First we implement the world model with a neural network and leave Q implemented as a look up table. Next, we use a