Transcritical CO2 heat pump water heaters have been widely studied by researchers for its environmentally friendly nature and energy efficiency. To analyze the impact of various operating parameters on the heating per...
详细信息
Transcritical CO2 heat pump water heaters have been widely studied by researchers for its environmentally friendly nature and energy efficiency. To analyze the impact of various operating parameters on the heating performance of transcritical CO2 heat pump water heater systems, simulation models were developed and their accuracy was verified through experiments. Results indicated that the discharge pressure and CO2 temperature at the gas cooler outlet (Tgc,out) had a significant effect on the system performance, the coefficient of performance (COP) increased notably with higher evaporation temperatures, and the optimal discharge pressure varied depending on the evaporation temperature. The system equipped with intermediate heat exchanger demonstrated a lower optimal discharge pressure and a higher COP compared to the basic system. The inclusion of an intermediate heat exchanger in a system, the maximum COP is 2.99 % to 3.83 % higher than the basic system under the same conditions. It has been observed that the introduction of intermediate heat exchanger significantly improved the system performance when Tgc,out were 35 degrees C, 40 degrees C and 45 degrees C, corresponding to discharge pressures lower than 10.75 MPa, 11.167 MPa and 11.625 MPa. According to the research results, the optimal discharge pressure equation was fitted and an improved algorithm was proposed. Compared to the experimental values, the improved algorithm exhibits a maximum error of 8.81 % and 7.55 % for determining the optimal discharge pressure and temperature, and the improved algorithm is effective in engineering applications. Consequently, the simulation data holds great importance in guiding the design of transcritical CO2 heat pump water heater systems.
One of the major research topics in the supply chain management field is the multi-depot vehicle routing problem with time windows (m-VRPTW). It aims to designing a set of minimum-cost routes for a vehicle fleet servi...
详细信息
One of the major research topics in the supply chain management field is the multi-depot vehicle routing problem with time windows (m-VRPTW). It aims to designing a set of minimum-cost routes for a vehicle fleet servicing many customers with known demands and predefined time windows. This paper presents an m-VRPTW local search improvement algorithm that explores a large neighborhood of the current solution to discover a cheaper set of feasible routes. The neighborhood structure comprises all solutions that can be generated by iteratively performing node exchanges among nearby trips followed by a node reordering on every route. Manageable mixed-integer linear programming (MILP) formulations for both algorithmic steps were developed. To further reduce the problem size, a spatial decomposition scheme has also been applied. A significant number of large-scale benchmark problems, some of them including up to 200 customers, multiple depots and different vehicle-types, were solved in quite reasonable CPU times. (C) 2008 Elsevier Ltd. All rights reserved.
This paper deals with the problem of scheduling a flow shop operating in a sequence dependent setup time environment. The objective is to determine the sequence that minimises the makes pan. Two efficient neighbourhoo...
详细信息
This paper deals with the problem of scheduling a flow shop operating in a sequence dependent setup time environment. The objective is to determine the sequence that minimises the makes pan. Two efficient neighbourhood search-based heuristics have been developed and tested using 960 problems, and the results obtained reveal their usefulness. The algorithms make use of two existing constructive heuristics. A neighbourhood search known as variable neighbourhood descent is used to improve the two constructive heuristics. Experimentation is carried out on the 96 groups of problems with 10 problem instances in each group. Performance analysis is carried out using the relative performance improvement of each heuristic. The analysis shows a consistently better performance of the neighbourhood-based improvement heuristics. A paired comparison test is used for validating the superiority of the proposed heuristics. The statistical analysis reveals that the performance of the neighbourhood-based heuristics is very much dependent on the initial constructive heuristics used. (C) 2013 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Choosing the right algorithm for Intelligent Agent is very important in determining the next step. Actions taken by an Intelligent Agent with less optimum algorithm can be figured out easily by the player competing wi...
详细信息
ISBN:
(纸本)9781728147147
Choosing the right algorithm for Intelligent Agent is very important in determining the next step. Actions taken by an Intelligent Agent with less optimum algorithm can be figured out easily by the player competing with it. This certainly makes it easier for the player to win the game. Card Battle is a game that compares the strength of both card decks. They competed to determine who has the best cards on deck to reduce the enemy health point. Intelligent Agent need to act as the competing enemy called Non-Player Character (NPC). Presently, Intelligent Agent on Card Battle Games still use the Minimax algorithm. This algorithm thinks only to counter enemy summoned card without considering other things such as enemy health point left, the cost for summoning a card, etc. Improvisation of Minimax algorithm with Multi Criteria Decision Maker (MCDM) provides a new way of thinking for the decision making during the game. The results of this study increase the difficulty of the NPC by making it possible for the Intelligent Agent to consider more game properties and counter the player cards.
暂无评论