Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Dynamic problem”

Dynamic boundary problem

RCIN (Digital Repository of the Scientifics Institutes) (Institute of Archaeology and Ethnology of the Polish Academy of Sciences) · 1973

Cited by 0Open access

Dynamic Transportation Problem

Rajesh Kumar Singh, Kartikesh Thakur, Saurabh Kasaudhan et al. · Soft Computing Research Society eBooks · 2024

Rising urbanisation and population expansion present difficulties for urban transportation networks. All of these constraints worsen traffic-related problems: unforeseen congestion, poor route planning, and underuse of resources. Dynamic Transportation Optimisation (DTO) technologies have consequently become intriguing means to increase the sustainability and efficiency of metropolitan transportation networks. Dynamic programming (DP), Simulated Annealing (SA), Ant Colony Optimisation (ACO), Swarm Intelligence (SI), Genetic Algorithms (GA), Reinforcement Learning (RL), Machine Learning Models (ML), Geographic Information Systems (GIS), and Integer Linear Programming (ILP) are just a few of the wide range of approaches DTO methods apply. These technologies generate complete traffic analysis and dynamic routing solutions by using real-time data from security cameras, traffic sensors, and GPS devices. This paper gives a complete evaluation of DTO approaches coupled with assessments of their usefulness, performance, and constraints in the framework of urban transportation. By way of a detailed comparison analysis, the study intends to highlight the advantages and disadvantages of every method, so supporting stakeholders in choosing and deploying DTO solutions customised to unique urban transport concerns. Furthermore highlighted in light of developments in artificial intelligence, big data analytics, and predictive modelling is the future prospects of DTO techniques. The integration of these technologies within present urban contexts aims to develop resilient transportation networks, thereby contributing to the continuing discourse on the evolution of urban mobility solutions. The subsequent sections of this article delve into the intricacy of each DTO technique, offering insights into their capabilities, actual implementations, and projected repercussions on urban transportation networks. By combining empirical evidence with theoretical frameworks, the research presents a holistic understanding of the role and significance of DTO techniques in defining the future of urban mobility.

Cited by 0Open access

Dynamic incompatibility problem

Hccobmccthocth 7j, H Bbipll>kchhh ~ E Bbict}, B~cjieho Hbhoe Bbipa>kehhe et al. · RCIN (Digital Repository of the Scientifics Institutes) (Institute of Archaeology and Ethnology of the Polish Academy of Sciences) · 1974

Dynamic incompatibility problemE. KOSSECKA (W ARSZAWA)THB MBDWM with incompatibilities depending on time is considered.With the help of the idea of plastic deformations, the constraint equations for the elastic strain and velocity fields are derived.Constraints equations lead to definitions of the incompatibility tensor 7J and the new quantity-the incompatibility current tensor F. Next, the dynamic problem for the anisotropic.infinite, linearly elastic medium is examined.The strain field e and velocity v ate obtained in terms of 7J and F. In the expression for e the dynamic Green potential K = -L1-1 G appears.The explicit expression for K for the isotropic medium is found.Rozwai:a si~ osrodek z niezgodno8ciami zalemymi od czasu.Posluguj11c si~ po~em deformacji plastycznej wyprowadza si~ r6wnania wi~z6w dla sp~stego pola odksztalcenia i pr~oSci.R6wnania te prowadzll do definicji tensora niezgodno8ci 7J i nowej wielkoSci, tensora pflldu niezgodno8ci F. Nast~pnie rozwi11zuje si~ problem dynamiczny dla anizotropowego, nieskon czonego o5rodka liniowo spr~stego

Cited by 0Open access

Dynamic Problem Solving

Samuel Greiff, Sascha Wüstenberg, Joachim Funke · Applied Psychological Measurement · 2012

This article addresses two unsolved measurement issues in dynamic problem solving (DPS) research: (a) unsystematic construction of DPS tests making a comparison of results obtained in different studies difficult and (b) use of time-intensive single tasks leading to severe reliability problems. To solve these issues, the MicroDYN approach is presented, which combines (a) the formal framework of linear structural equation models as a systematic way to construct tasks with (b) multiple and independent tasks to increase reliability. Results indicated that the assumed measurement model that comprised three dimensions, information retrieval, model building, and forecasting, fitted the data well ( n = 114 students) and could be replicated in another sample ( n = 140), showing excellent reliability estimates for all dimensions. Predictive validity of school grades was excellent for model building but nonexistent for the other two MicroDYN dimensions and for an additional measure of DPS. Implications are discussed.

Cited by 5

Dynamic scheduling problem solving

Yuan-geng Huang, Laveen N. Kanal, Satish K. Tripathi · 1990

Dynamic scheduling problems involve modifying the existing schedule during the production time so that the impact on the production goal by unexpected events, such as machine breakdown, is minimized. Dynamic scheduling problem solving in a reactive scheduling system requires that the problems be solved in real time and under the constraints of the existing production environment. This dissertation studies how the unexpected events would affect the production goal of a schedule and how to maintain the goal under the constantly changing environment. Two models are presented. In the first model, the optimization goal of a schedule is to minimize the maximal lateness of jobs, and the issue here is how to maintain the optimality of a schedule by changing the job sequence when the schedule is continually postponed. Problem analysis showed that it is computationally too expensive to come up with an optimal approach for dynamic optimization problems. A heuristic approach is proposed to adjust job order locally and incrementally as the delay time increases. The simulation result shows that optimal results are achieved 95% of the time at a very low cost. In the second model, the primary goal is to satisfy a set of constraints on meeting the due dates of jobs, and the issue is how to maintain the feasibility of a schedule by deleting the minimal number of jobs with or without job sequence adjustment. When job reordering is not allowed, a heuristic algorithm is proposed which achieves optimal results 80% of the time with a polynomial time complexity. When job reordering is allowed, the heuristics developed for dynamic scheduling problems of the first model are used to adjust job order. The experiments showed that heuristic job order adjustment improves both the quality of the solution in terms of requiring fewer jobs to be deleted and the efficiency of the algorithm in terms of the number of schedules which need to be explored before a solution is returned. Another problem studied is the scheduling problem with both the optimization goal of minimizing the maximal lateness and a hard constraint that no jobs are processed later than a given deadline. Heuristic algorithms are given and experimental results are also presented.

Cited by 1

A Dynamic Domination Problem

William F. Klostermeyer · Journal of Discrete Mathematical Sciences and Cryptography · 2015

A dynamic domination problem in graphs is studied in which an innite sequence of attacks occurs at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex. Other guards are allowed to move at the same time, and before and after each attack, the vertices containing guards must form a dominating set. We are concerned with the minimum number of guards required to achieve this goal against any arbitrary sequence of attacks; this number is called the swap number. The swap number lies between the domination and independence numbers of the graph; bounds for some classes of graphs are examined in this paper.

Cited by 0

Problem in Dynamic Thermoelasticity

Yeng‐Yung Tsui · The Journal of the Acoustical Society of America · 1965

This paper deals with the dynamic treatment of a transient thermoelastic problem for an elastic half-space that is exposed to step temperature and velocity on its entire plane boundary and is constrained against transverse displacements. The stress distribution pertaining to this problem, whose plane boundary is subjected to step- and/or ramp-type temperature only, was previously treated by Danilovskaya [Prikl. Mat. i Mekhan. 14, 316 (1950)], Mura [Proc. Japan Natl. Congr. Appl. Mech., 2nd, 9 (1952)], and Sternberg et al. [J. Appl. Mech. 26, 503 (1959)]. In physical reality, when the boundary experiences temperature variations, it often also experiences velocity variations. A comparison of present results with previous results reveals that the stress distributions are changed considerably once the velocity variation on the boundary is considered.

Cited by 1Open access

Coupled dynamic thermoviscoelasticity problem

С. А. Лычев · Mechanics of Solids · 2008

We construct a closed analytic solution of a coupled dynamic thermoviscoelasticity problem for bodies of canonical shape. The solution is represented in the form of spectral expansions in a biorthogonal eigenfunction system of the nonself-adjoint pencil of differential operators generated by the problem under study. The spectral expansions are obtained with the help of a special class of nonsymmetric integral transforms.

Cited by 20

Dynamic Access Control Problem

Cungang Yang, Celia Li, One-way Hash · 2004

Access control plays an important role in the area of information security, which ensures that any access to data is authorized. Consider a situation where the users are divided into a number of

Cited by 0

Dynamic Facility Location Problem

Reza Zanjirani Farahani, Maryam Abedian, Sara Sharahi · Contributions to management science · 2009

Facility location is a strategic management decision. This decision is usually made, however, with respect to the current parameters (like weights) which represent population, infrastructure, service requirements and others (Drezner 1995; Francis and Lowe 1992; Mirchandani and Francis 1990). Much of the research published on location theory is drawn from the models such as single/multi facility location, covering, P-median, P-center problems, and their applications and extensions. Solving many of these problems can be extremely difficult. Thus, it is not surprising that so much work has focused on statistic and deterministic problem formulations. While such formulations are reasonable research topics, they do not capture many of the characteristics of real-world location problems.

Cited by 35

A Dynamic Messenger Problem

Jan Fabry · Communications - Scientific letters of the University of Zilina · 2007

Messenger services provide customers to deliver their package from a specific origin to a specific destination. Real situations require the fast messenger's reaction to the on-line customer's request. While it is not possible to change the planned route in static distribution problems, a dynamic version enables a dispatcher the integration of a new request to existing route for optimization. The mathematical models proposed in the paper are based on the Miller-Tucker-Zemlin's formulation of Traveling Salesman Problem. Because of NP hardness of the problem it is impossible for most real problems to find the optimal solution in acceptable time. Heuristic algorithms represent the important alternative to solving real dynamic problems. Basic formulation of the messenger problem can be extended to problems with time windows. Limited capacity of the vehicle and multiple vehicles can be also considered.

Cited by 2Open access

Dynamic decision problem structuring

James L. Corner, John Buchanan, Mordecai Henig · Journal of Multi-Criteria Decision Analysis · 2001

Abstract This paper develops a conceptualization of decision problem structuring which synthesizes a number of models and approaches cited in the decision‐making literature in general and the multi‐criteria literature in particular. The approach advocates a dynamic interaction between criteria and alternatives as a decision‐maker understands his preferences and expands the set of alternatives. This approach endeavours to bridge the gap between prescriptive and descriptive decision problem structuring. It is prescriptive in its orientation, recommending an approach based on earlier prescriptive work. However, the approach is also validated empirically, based on the descriptive decision‐making literature and reported case studies of actual decision‐making. Copyright © 2001 John Wiley & Sons, Ltd.

Cited by 81

Rotatory Pump Dynamic Problem

Frantisek Zboril · 1996

The paper deals with the solving a practical problem - vibrations of the rotatory pump. The problem was solved twenty five years ago and the AP3M analog computer was used at that time for computation. In this paper it will be shown that the computation time for solutions of dynamic problems using the PENTIUM PC computers is even shorter than that of the old analog computers. It is clear the user comfort is uncomparably better. Keywords: Rotatory Pump, Vibrations, Dynamic System 1 Introduction A simplified rotatory pump dynamic model consisting of two mass coupled dynamic oscillate systems is shown in Fig.1. The pump rotor rotates around z-axis. The stator and rotor variations in the x-axis and y-axis can be described by similar equations. These equations have the following form (for y-axis) m 2 d 2 y 2 dt 2 + 2m 2 ff 2 dy 2 dt + (k 12 + kk 23 k + k 23 )y 2 = kk 23 k + k 23 (y 3 \\Gamma e sin ') (1) m 3 d 2 y 3 dt 2 + 2m 3 ff 3 dy 3 dt + kk 23 k + k 23 y 3 = ...

Cited by 0

Dynamic decision problem structuring

James L. Corner, John Buchanan, Mordecai Henig · Journal of Multi-Criteria Decision Analysis · 2001

This paper develops a conceptualization of decision problem structuring which synthesizes a number of models and approaches cited in the decision-making literature in general and the multi-criteria literature in particular. The approach advocates a dynamic interaction between criteria and alternatives as a decision-maker understands his preferences and expands the set of alternatives. This approach endeavours to bridge the gap between prescriptive and descriptive decision problem structuring. It is prescriptive in its orientation, recommending an approach based on earlier prescriptive work. However, the approach is also validated empirically, based on the descriptive decision-making literature and reported case studies of actual decision-making. Copyright © 2001 John Wiley & Sons, Ltd.

Cited by 4

Intelligence Dynamic problem solving

Sascha Wüstenberg, Samuel Greiff, Joachim Funke et al. · 2011

This study investigates the internal structure and construct validity of Complex Problem Solving (CPS), which ismeasured by aMultiple-Item-Approach. It is tested, if (a) three facets of CPS – rule identification (adequateness of strategies), rule knowledge (generated knowledge) and rule ap-plication (ability to control a system) – can be empirically distinguished, how (b) reasoning is related to these CPS-facets and if (c) CPS shows incremental validity in predicting school grade point average (GPA) beyond reasoning. N=222 university students completed Micro-DYN, a computer-based CPS test and Ravens Advanced Progressive Matrices. Analysis including structural equation models showed that a 2-dimensionsal model of CPS including rule knowl-edge and rule application fitted the data best. Furthermore, reasoning predicted performance in rule application only indirectly through its influence on rule knowledge indicating that learn-ing during system exploration is a prerequisite for controlling a system successfully. Finally, CPS explained variance in GPA even beyond reasoning, showing incremental validity of CPS. Thus, CPS measures important aspects of academic performance not assessed by reasoning and should be considered when predicting real life criteria such as GPA.

Cited by 0