A neural network approach to the vessel dispatching problem

The paper discusses the process of loading, transport and unloading of gravel by inland water transportation. At the loading port, the problem that needs to be solved is the assignment of load barges to pusher tugs for the planned period of one day. However, disturbances of planned schedules are very common. Whenever a disturbance in a daily schedule appears, the dispatcher urgently attempts to mitigate negative effects resulting from the disturbance. Real-time operations limit the amount of time that dispatchers in charge of traffic control have to make decisions and increase the level of stress associated with quick and adequate response. This paper aims to demonstrate the feasibility of a dispatch decision support system that could decrease the work load for the dispatcher and improve the quality of decisions. The proposed neural network with the ability to adapt or learn from examples of decisions can simulate the dispatcher's decision process.     

大型水电工程物资调运建模及算法

根据小湾水电工程物资供应管理的实际情况,提出了物资调运的三级节点概念模型,论述了物资采购与调运的数学模型,并给出了具体算法。模型已应用于该工程物资调运决策支持系统中,运行实践表明,该模型能够辅助调度人员制定合理的物资采购与调运方案。     

Method for calculation of flow distribution in a gas transport system

A method is proposed for iterative refinement of hydraulic resistances of portions of a high-pressure gas transport system with consideration of its current state. The algorithm is realized as a set of computer programs. Numerical experiments performed with data from a functioning interindustry system show good agreement between calculated values and dispatcher data.Translated from Teoreticheskaya i Prikladnaya Mekhanika, No. 20, pp. 98–102, 1989.     

A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands

In this paper, the vehicle routing problem with fuzzy demands (VRPFD) is considered, and a fuzzy chance constrained program model is designed, based on fuzzy credibility theory. Then stochastic simulation and differential evolution algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy chance constrained program model. Moreover, the influence of the dispatcher preference index on the final objective of the problem is discussed using stochastic simulation, and the best value of the dispatcher preference index is obtained.     

Round robin scheduling of heterogeneous parallel servers in heavy traffic

We consider scheduling for heterogeneous server systems, where tasks arrive according to a Poisson process, with their processing requirements following a discrete distribution with finite support. For a system with a dispatcher and several heterogeneous servers, we propose an optimized multi-layered round robin routing policy followed by shortest remaining processing time scheduling at each server. Using a heavy traffic approximation, we show that the proposed policy performs as well as the optimal scheduling policy for a heterogeneous servers system with a single queue (no routing) in heavy traffic. Additional simulation results suggest that such policies will be effective in more general settings.     

Interactive multicriteria procedure exploiting a knowledge-based module to select electricity production alternatives: The CASTART system

For some decisional problems, it is difficult to have a set of potential alternatives a priori. This is true, for instance, when the object of the decision is dependent on an external environment, as in the case of disturbance situations in industrial processes. Computer assistance must support, first, the elaboration of a potential alternatives set and, second, the decision-making activity which will determine the decision elements leading to recovery from the disturbance. This paper deals with such a situation encountered in an electricity production context. An interactive multicriteria procedure exploiting a knowledge-based module to select electricity production alternatives is presented. Section 1 introduces the electricity production-consumption framework and identifies the Spinning Reserve Mobilization (SRM) function. Next, our contribution to the systematization and the experimentation of a decision-making process which supports the dispatcher confronted with an SRM situation is described. The decision-making process includes an intelligent module and a decisional procedure. The module and the procedure, and their interconnections, are developed in Section 2. Section 3 describes the DSS called CASTART which implements this process. An overview of DSS functionalities is given, as well as the results obtained by a dispatcher working in cooperation with the system, in the case of a simulated production incident.     

Generation Supply Bidding in Perfectly Competitive Electricity Markets

This paper reports on the development of a comprehensive framework for the analysis and formulation of bids in competitive electricity markets. Competing entities submit offers of power and energy to meet the next day's load. We use the England and Wales Power Pool as the basis for the development of a very general competitive power pool (CPP) framework. The framework provides the basis for solving the CPP dispatcher problem and for specifying the optimal bidding strategies. The CPP dispatcher selects the winning bids for the right to serve load each period of the scheduling horizon. The dispatcher must commit sufficient generation to meet the forecasted load and reserve requirements throughout the scheduling horizon. All the unique constraints under which electrical generators operate including start-up and shut-down time restrictions, reserve requirements and unit output limits must be taken into account. We develop an analytical formulation of the problem faced by a bidder in the CPP by specifying a strategy that maximizes his profits. The optimal bidding strategy is solved analytically for the case of perfect competition. The study in this work takes into account the principal sources of uncertainty—the load forecast and the actions of the other competitors. The formulation and solution methodology effectively exploit a Lagrangian relaxation based approach. We have conducted a wide range of numerical studies; a sample of numerical results are presented to illustrate the robustness and superiority of the analytically developed bidding strategies.     

Zero-wait load balancing with sparse messaging

A key challenge in designing load balancing strategies is to achieve low delay in large-scale systems while only using minimal communication overhead. Motivated by these issues, we introduce a novel scheme in which the dispatcher becomes aware of idle servers without any explicit communication from either side, using absence of messages at predefined time instants. The proposed scheme achieves provably vanishing queueing delays while using strictly less than one message per job on average.     

Size- and state-aware dispatching problem with queue-specific job sizes

We consider the dispatching problem in a size- and state-aware multi-queue system with Poisson arrivals and queue-specific job sizes. By size- and state-awareness, we mean that the dispatcher knows the size of an arriving job and the remaining service times of the jobs in each queue. By queue-specific job sizes, we mean that the time to process a job may depend on the chosen server. We focus on minimizing the mean sojourn time (i.e., response time) by an MDP approach. First we derive the so-called size-aware relative values of states with respect to the sojourn time in an M/G/1 queue operating under FIFO, LIFO, SPT or SRPT disciplines. For FIFO and LIFO, the size-aware relative values turn out to be insensitive to the form of the job size distribution. The relative values are then exploited in developing efficient dispatching rules in the spirit of the first policy iteration.     

An application of discrete-event theory to truck dispatching

This article focuses on the dispatching problem of an oilsand excavation process subject to production objectives and specifications. Herein, we cast the truck dispatching task in a decision-making framework for determining solutions and helping a dispatcher to make decisions. In this paper, we apply the discrete-event formalism to investigate the dispatching of a large truck fleet. For this purpose, we examine the capabilities and limitations of two distinct theories: discrete-event system (DES) and vector discrete-event system (VDES). Despite their differences, both theories can be used to model the logical structure of the dispatching process. These theories also provide techniques for implementing specifications and representing solutions in a compact manner. The results of this paper demonstrate that current procedures and tools available for DES allow a broader range of techniques to be applied, thus increasing the likelihood of finding a suitable solution. This work was supported, in part, by the Natural Sciences and Engineering Research Council of Canada (NSERC), the Canadian Foundation for Innovation and PRECARN and associates. In addition, the first author was supported by NSERC, Fonds pour la formation de Chercheurs et l’Aide a la Recherche (FCAR), and Ontario Graduate Scholarships (OGS).     

Discrete optimization in public rail transport

Many problems arising in traffic planning can be modelled and solved using discrete optimization. We will focus on recent developments which were applied to large scale real world instances. Most railroad companies apply a hierarchically structured planning process. Starting with the definition of the underlying network used for transport one has to decide which infrastructural improvements are necessary. Usually, the rail system is periodically scheduled. A fundamental base of the schedule are the lines connecting several stations with a fixed frequency. Possible objectives for the construction of the line plan may be the minimization of the total cost or the maximization of the passengers’s comfort satisfying certain regulations. After the lines of the system are fixed, the train schedule can be determined. A criterion for the quality of a schedule is the total transit time of the passengers including the waiting time which should be minimized satisfying some operational constraints. For each trip of the schedule a train consisting of a locomotive and some carriages is needed for service. The assignment of rolling stock to schedule trips has to satisfy operational requirements. A comprehensible objective is to minimize the total cost. After all strategic and tactical planning the schedule has to be realized. Several external influences, for example delayed trains, force the dispatcher to recompute parts of the schedule on-line. A Web page with examples quoted in this survey can be found at http://www.math.tu-bs.de/mo/ismp.html.     

Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. In CLRP-FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed, the vehicles and the depots have a predefined capacity to serve the customers that have fuzzy demands. To model this problem, a fuzzy chance constrained programming model of that is designed based upon the fuzzy credibility theory. To solve this problem, a greedy clustering method (GCM) including the stochastic simulation is proposed. To obtain the best value of the dispatcher preference index of the model and to analyze its influence on the final solution, numerical experiments are carried out. Finally, to show the performance of the greedy clustering method, associated results are compared with the lower bound of the solutions.     

Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics

In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small. By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness of the approach.     

Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm

In this paper, the dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD) is considered. In the DCLRP-FD, facility location problem and vehicle routing problem are solved on a time horizon. Decisions concerning facility locations are permitted to be made only in the first time period of the planning horizon but, the routing decisions may be changed in each time period. Furthermore, the vehicles and depots have a predefined capacity to serve the customers with altering demands during the time horizon. It is assumed that the demands of customers are fuzzy variables. To model the DCLRP-FD, a fuzzy chance-constrained programming is designed based upon the fuzzy credibility theory. To solve this problem, a hybrid heuristic algorithm (HHA) with four phases including the stochastic simulation and a local search method are proposed. To achieve the best value of two parameters of the model, the dispatcher preference index (DPI) and the assignment preference index (API), and to analyze their influences on the final solution, numerical experiments are carried out. Moreover, the efficiency of the HHA is demonstrated via comparing with the lower bound of solutions and by using a standard benchmark set of test problems. The numerical examples show that the proposed algorithm is robust and could be used in real world problems.     

Recovery management for a dial-a-ride system with real-time disruptions

The problem considered in this work stems from a non-profit organization in charge of door-to-door passenger transportation for medical appointments. Patients are picked up at home by a driver and are then dropped at their appointment location. They may also be driven back home at the end of their appointment. Some patients have specific requirements, e.g., they may require an accompanying person or a wheelchair. Planning such activities gives rise to a so-called dial-a-ride problem. In the present work, it is assumed that the requests assigned to the drivers have been selected, and the transportation plan has been established for the next day. However, in practice, appointment durations may vary due to unforeseen circumstances, and some transportation requests may be modified, delayed or canceled during the day. The aim of this work is to propose a reactive algorithm which can adapt the initial plan in order to manage the disruptions and to take care of as many patients as possible in real-time. The plan should be modified quickly when a perturbation is observed, without resorting to major changes which may confuse the drivers and the patients. Several recourse procedures are defined for this purpose. They allow the dispatcher to temporarily delete a request, to insert a previously deleted request, or to permanently cancel a request. Simulation techniques are used to test the approach on randomly generated scenarios. Several key performance indicators are introduced in order to measure the impact of the disruptions and the quality of the solutions.     

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additional goods are brought back to the depot from the backhaul customers. Numerous ways of modeling the backhaul constraints have been proposed in the literature, each imposing different restrictions on the handling of backhaul customers. A survey of these models is presented, and a unified model is developed that is capable of handling most variants of the problem from the literature. The unified model can be seen as a Rich Pickup and Delivery Problem with Time Windows, which can be solved through an improved version of the large neighborhood search heuristic proposed by Ropke and Pisinger [An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Technical Report, DIKU, University of Copenhagen, 2004]. The results obtained in this way are comparable to or improve on similar results found by state of the art heuristics for the various variants of the problem. The heuristic has been tested on 338 problems from the literature and it has improved the best known solution for 227 of these. An additional benefit of the unified modeling and solution method is that it allows the dispatcher to mix various variants of the Vehicle Routing Problem with Backhauls for the individual customers or vehicles.     

Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances

In this article, we propose a robust tube-based MPC formulation for a class of hybrid systems, namely autonomously switched PWA systems, with bounded additive disturbances. The term tube-based refers to those control techniques whose objective is to maintain all possible trajectories of the uncertain system inside a tube which is a set around the nominal (or reference) system trajectory, that is free from disturbances. Common methods in tube-based control systems consider an error dynamical system as the difference between the state of the nominal system and the state of the perturbed system. However, this definition of the error dynamical system leads to a complicated switched affine system for PWA systems. Therefore, we use a new notion of the reference system similar to the nominal system except that the switching between the various modes of the PWA system is driven by the state of the real system. Using this reference system instead of the nominal system leads us to an error dynamical system that can be modeled as a switched linear system. We employ a switched linear controller to stabilize this error system under arbitrary switching. This auxiliary controller forces the states of the uncertain system to remain in a tube confined to the invariant set around the state of the reference system. We add new constraints and tighten some other constraints of the nominal hybrid MPC for the reference system, in order to ensure convergence of the uncertain system and to guarantee robust exponential stability of the closed-loop system.     

Optimal burn-in for maximizing reliability of repairable non-series systems

Burn-in is a manufacturing process applied to products to eliminate early failures in the factory before the products reach the customers. Various methods have been proposed for determining an optimal burn-in time of a non-repairable system or a repairable series system, assuming that system burn-in improves all components in the system. In this paper, we establish the trade-off between the component reliabilities during system burn-in and develop an optimal burn-in time for repairable non-series systems to maximize reliability. One impediment to expressing the reliability of a non-series system is in that successive failures during system burn-in cannot be described precisely because a failed component is not detected until the whole system fails. For approximating the successive failures of a non-series system during system burn-in, we considered two types of repair: minimal repair at the time of system failure, and repair at the time of component or connection failure. The two types of repair provide bounds on the optimal system burn-in time of non-series systems.     

Singularity Structure of Third-Order Dynamical Systems. II

The singularity structure of the solutions of a general third-order system, with polynomial right-hand sides of degree less than or equal to two, is studied about a movable singular point. An algorithm for transforming the given third-order system to a third-order Briot–Bouquet system is presented. The dominant behavior of a solution of the given system near a movable singularity is used to construct a transformation that changes the given system directly to a third-order Briot–Bouquet system. The results of Horn for the third-order Briot–Bouquet system are exploited to give the complete form of the series solutions of the given third-order system; convergence of these series in a deleted neighborhood of the singularity is ensured. This algorithm is used to study the singularity structure of the solutions of the Lorenz system, the Rikitake system, the three-wave interaction problem, the Rabinovich system, the Lotka–Volterra system, and the May–Leonard system for different sets of parameter values. The proposed approach goes far beyond the ARS algorithm.     

模块化可靠性系统的Signature计算方法研究

系统Signature是体现结构设计优良性的一组向量,描述系统设计对系统故障率的影响,在诸如系统可靠性指标分析、系统设计、系统寿命比较、寿命极限行为以及系统设计优化等方面展现出了强大的功能,成为可靠性研究领域越来越强有力的研究工具。而如何求解一个系统的Signature往往成为分析的关键一步,当系统庞大而复杂时,Signature计算难度将随着元件数目的增加呈指数增加,出现维数爆炸问题,这无疑对后续的分析造成巨大的障碍. 本文为了解决此问题,建立了基于模块化思想的系统Signature求解方法,并给出了基于模块化思想的模块化串、并联系统与模块化备份系统的求解方法,对比于传统算法,运用模块化思想大大减少了计算Signature的复杂度,能够有效减小计算量,缩减计算时间,并拓展了可求解Signature的系统范围。