scholarly journals Enhanced Partial Expansion A*

2014 ◽  
Vol 50 ◽  
pp. 141-187 ◽  
Author(s):  
M. Goldenberg ◽  
A. Felner ◽  
R. Stern ◽  
G. Sharon ◽  
N. Sturtevant ◽  
...  

When solving instances of problem domains that feature a large branching factor, A* may generate a large number of nodes whose cost is greater than the cost of the optimal solution. We designate such nodes as surplus. Generating surplus nodes and adding them to the OPEN list may dominate both time and memory of the search. A recently introduced variant of A* called Partial Expansion A* (PEA*) deals with the memory aspect of this problem. When expanding a node n, PEA* generates all of its children and puts into OPEN only the children with f = f (n). n is re-inserted in the OPEN list with the f -cost of the best discarded child. This guarantees that surplus nodes are not inserted into OPEN. In this paper, we present a novel variant of A* called Enhanced Partial Expansion A* (EPEA*) that advances the idea of PEA* to address the time aspect. Given a priori domain- and heuristic- specific knowledge, EPEA* generates only the nodes with f = f(n). Although EPEA* is not always applicable or practical, we study several variants of EPEA*, which make it applicable to a large number of domains and heuristics. In particular, the ideas of EPEA* are applicable to IDA* and to the domains where pattern databases are traditionally used. Experimental studies show significant improvements in run-time and memory performance for several standard benchmark applications. We provide several theoretical studies to facilitate an understanding of the new algorithm.

2020 ◽  
Vol 50 (3) ◽  
pp. 153-165
Author(s):  
Christian Haket ◽  
Bo van der Rhee ◽  
Jacques de Swart

In many industries, multifacility service providers can save time and money and reduce carbon dioxide (CO2) emissions by more efficiently allocating customers to their facilities. However, firms incur a reallocation cost when reassigning a customer to a different facility, something that has not received much attention in the literature. Software packages such as CPLEX can find the optimal solution for this type of problem, but managers rarely use them because they lack the specific knowledge, overestimate the cost, and/or underestimate the benefits. Including the reallocation costs, we modeled several common heuristics in Excel’s Visual Basic and compared the results with the optimal solution found by CPLEX. We collaborated with Van Dorp, a large service provider in the Netherlands, and found that (1) substantial savings can be achieved, (2) reallocation costs play a major role, and (3) the best heuristic achieves near-optimal results. Specifically, reallocating Van Dorp’s 20 “worst allocated” customers realizes a savings of more than 4,000 driving hours and €360,000 in cost and a reduction of 41 tons of CO2 emissions.


2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.


Author(s):  
Alexey V. Kavokin ◽  
Jeremy J. Baumberg ◽  
Guillaume Malpuech ◽  
Fabrice P. Laussy

This chapter presents experimental studies performed on planar semiconductor microcavities in the strong-coupling regime. The first section reviews linear experiments performed in the 1990s that evidence the linear optical properties of cavity exciton-polaritons. The chapter is then focused on experimental and theoretical studies of resonantly excited microcavity emission. We mainly describe experimental configuations in which stimulated scattering was observed due to formation of a dynamical condensate of polaritons. Pump-probe and cw experiments are described in addition. Dressing of the polariton dispersion and bistability of the polariton system due to inter-condensate interactions are discussed. The semiclassical and the quantum theories of these effects are presented and their results analysed. The potential for realization of devices is also discussed.


Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.


2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.


Author(s):  
S.V. Matsenko ◽  
◽  
V.M. Minko ◽  
A.A. Koshelev ◽  
V.Yu. Piven ◽  
...  

Violation of industrial safety rules during the operation of offshore facilities for the production, storage and transportation of the hydrocarbon raw materials leads in the most cases to pollution of the marine environment with oil and its components. The works on localization and elimination of such pollution are carried out with the help of vessels of the technical support fleet and booms. When developing oil spill response plans at such facilities, a calculated determination of the technical characteristics of vessels and booms is required that are sufficient to carry out the planned activities. The basic design principles for determining the towing capacity of the technical fleet vessels involved in the localization and elimination of oil and oil product spills by trawling methods are given in the article. The calculation is based on theoretical studies performed by the authors of the physical processes occurring during the movement of objects of a mobile trawling order in the sea area. The results obtained during the course of theoretical studies were confirmed by the experimental studies carried out by the authors personally using the real pieces of equipment in the actual development of tasks for training spill containment by trawling. As a result, the empirical dependencies were obtained and experimentally confirmed, which can be used to calculate technical characteristics of the ships as part of the mobile orders and anchor systems as part of stationary orders intended for the localization and elimination of oil pollution. These results can be used, among other things, for the calculated substantiation of the technical characteristics of the technical fleet vessels designed to ensure safety of the offshore facilities for production, storage, and transportation of the hydrocarbon raw materials.


2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Fouzia Amir ◽  
Ali Farajzadeh ◽  
Jehad Alzabut

Abstract Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.


2021 ◽  
Vol 1038 ◽  
pp. 336-344
Author(s):  
Olena Pinchevska ◽  
Andriy Spirochkin ◽  
Denys Zavialov ◽  
Rostislav Oliynyk

The reasons of white spots appearance in the middle of oak timber are determined. These white spots reduce the cost of the lamina made of oak timbers - the front covering of floorboards. It is proposed to intensify the drying process by using oscillating drying schedules to avoid this defect. A method for calculating the duration of such drying is proposed. This method includes the peculiarities of heating and cooling periods kinetics of oak timbers with 25 mm and 30 mm thickness. The inexpediency of using the oscillation of the drying agent parameters in the range of wood moisture content below 20% has been established. An adequate model for calculating wood temperature and air humidity during wood heating and cooling periods has been developed using heat and mass transfer criteria and experimentally determined oak wood moisture conductivity coefficient. Based on the results of theoretical and experimental studies oscillating drying schedules of different thickness oak timbers are offered. Tests of the proposed schedules in industrial conditions showed no discoloration of the central layers of European oak (Quercus robur) timbers. The drying process duration was reduced by 1.5–2.4 times and energy consumption were reduced by 1.53 times.


1998 ◽  
Vol 2 (1) ◽  
pp. 65-104 ◽  
Author(s):  
V. Adlakha ◽  
H. Arsham

In a fast changing global market, a manager is concerned with cost uncertainties of the cost matrix in transportation problems (TP) and assignment problems (AP).A time lag between the development and application of the model could cause cost parameters to assume different values when an optimal assignment is implemented. The manager might wish to determine the responsiveness of the current optimal solution to such uncertainties. A desirable tool is to construct a perturbation set (PS) of cost coeffcients which ensures the stability of an optimal solution under such uncertainties.The widely-used methods of solving the TP and AP are the stepping-stone (SS) method and the Hungarian method, respectively. Both methods fail to provide direct information to construct the needed PS. An added difficulty is that these problems might be highly pivotal degenerate. Therefore, the sensitivity results obtained via the available linear programming (LP) software might be misleading.We propose a unified pivotal solution algorithm for both TP and AP. The algorithm is free of pivotal degeneracy, which may cause cycling, and does not require any extra variables such as slack, surplus, or artificial variables used in dual and primal simplex. The algorithm permits higher-order assignment problems and side-constraints. Computational results comparing the proposed algorithm to the closely-related pivotal solution algorithm, the simplex, via the widely-used pack-age Lindo, are provided. The proposed algorithm has the advantage of being computationally practical, being easy to understand, and providing useful information for managers. The results empower the manager to assess and monitor various types of cost uncertainties encountered in real-life situations. Some illustrative numerical examples are also presented.


Sign in / Sign up

Export Citation Format

Share Document