Line-pack management for producing electric power on peak periods

The distribution of natural gas is carried out by means of long ducts and intermediate compression stations to compensate the pressure drops due to friction. The natural gas compressors are usually driven by an electric motor or a gas turbine system, offering possibilities for energy management, one of these consisting in generating energy for use in-plant or to commercialize as independent power producer. It can be done by matching the natural gas demand, at the minimum pressure allowed in the reception point, and the storage capacity of the feed duct with the maximum compressor capacity, for storing the natural gas at the maximum permitted pressure. This allows the gas turbine to drive an electric generator during the time in which the decreasing pressure in duct is above the minimum acceptable by the sink unit. In this paper, a line-pack management analysis is done for an existing compression station considering its actual demand curve for determining the economic feasibility of maintaining the gas turbine system driver generating electricity in a peak and off-peak tariff structure. The potential of cost reduction from the point of view of energy resources (natural gas and electric costs) is also analyzed. (C) 2010 Elsevier Ltd. All rights reserved.

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.