We apply Belishev’s Boundary Control method to the dynamical inverse problem for the Goupillaud model—a one-dimensional discrete layered medium with equal two-way wave travel times—providing a rigorous operator setting for this prob...
Let
The article formulates the classical three-body problem in conformal-Euclidean space (Riemannian manifold), and its equivalence to the Newton three-body problem is mathematically rigorously proved. It is shown that a curved space with a local coordin...
In this paper, we consider a class of economic dynamics models in the form of linear functional differential systems with continuous and discrete times (hybrid models) that covers many kinds of dynamic models with aftereffect. The focus of attention...
The Dynamic Vehicle Routing Problem (DVRP) is one of the most important problems in the area of enterprise logistics. DVRP problems involve these dynamics: the appearance of customers, travel times, service times, or vehicle availability. One of the...
The ready-mixed concrete delivery (RMC) problem is a scheduling problem, where multiple trucks deliver concrete to order sites abiding by hard constraints in a dynamic environment. It is an NP-hard problem, impractical to solve using exhaustive metho...
Among the few exactly solvable problems in theoretical physics, the 2D (two-dimensional) Newtonian free fall problem in Euclidean space is perhaps the least known as compared to the harmonic oscillator or the Kepler–Coulomb problems. The aim of...
The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previou...
In recent years, the vigorous rise in computational intelligence has opened up new research ideas for solving chemical dynamic optimization problems, making the application of swarm-intelligence optimization techniques more and more widespread. Howev...
We propose a doubly inertial coupled dynamical system (DICDS) for linear inverse problems, extending an existing first-order coupled dynamical system by introducing second-order dynamics for both the unknown variable x and an auxiliary variable y rep...
This paper presents an unconditionally stable integration method, which introduces a linearly implicit algorithm featuring an explicit displacement expression. The technique that is being considered integrates one Newton iteration into the mean accel...
One of the most important tasks in handling real-world global optimization problems is to achieve a balance between exploration and exploitation in any nature-inspired optimization method. As a result, the search agents of an algorithm constantly str...
This study aims to document the extent to which the use of digital technology enhances and extends high school teachers’ problem-solving strategies when framing their teaching scenarios. The participants systematically relied on online developments s...
The vehicle-routing problem (VRP) is a popular area of research. This popularity springs from its wide application in many real-world problems, such as logistics, network routing, E-commerce, and various other fields. The VRP is simple to formulate,...
The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem, which requires the identification of such route plans on a given graph to a number of vehicles that generates the least total cost. The Dynamic CARP (DCARP) is a vari...
We propose a class of coupled dynamical systems for solving linear inverse problems, treating both the unknown variable and an auxiliary variable representing measurement dynamics as state variables. This framework does not rely on probabilistic mode...
In this paper, the generalized quadratic assignment problem (GQAP) is extended to consider multiple time periods and is called the dynamic GQAP (DGQAP). This problem considers assigning a set of facilities to a set of locations for multiple periods i...
The dynamic vehicle routing problem (DVRP) is a variant of the Vehicle Routing Problem (VRP) in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a mo...
This paper presents a reinforcement learning (RL) approach for solving the team orienteering problem under both deterministic and dynamic travel time conditions. The proposed method builds on the transformer architecture and is trained to construct r...
This paper proposes a dynamic vehicle routing problem (DVRP) model with fuzzy customer responses and suggests optimal routing strategies. Most DVRP studies have focused on how to create a new route upon the occurrence of dynamic situations such as un...
Ant colony optimization (ACO) has proven its adaptation capabilities on optimization problems with dynamic environments. In this work, the dynamic traveling salesman problem (DTSP) is used as the base problem to generate dynamic test cases. Two types...
The path planning problem is an important issue in maritime search and rescue. This paper models the path planning problem as a dynamic vehicle routing problem. It first designs a dynamic generator that transforms the existing benchmark sets for the...
Nonlinear complex systems exhibit emergent behavior, sensitivity to initial conditions, and rich dynamics arising from interactions among their components. A classical example of such a system is the Troesch problem—a nonlinear boundary value p...
We present a dynamical-system approach to linear inverse problems based on a newly introduced discrepancy measure called the mutual power divergence (MPD). The MPD evaluates the mutual consistency between the measurement and the prediction and serves...
The rapid increase in urbanization results in an increase in the volume of municipal solid waste produced every day, causing overflow of the garbage cans and thus distorting the city’s appearance; for this and environmental reasons, smart citie...
The graph theory is one of the fundamental structures in computer science used to model various scientific and engineering problems. Many problems within the graph theory are categorized as NP-hard and NP-complete. One such problem is the minimum dom...
Freight transportation is becoming an increasingly critical activity for enterprises in a global world. Moreover, the distribution activities have a non-negligible impact on the environment, as well as on the citizens’ welfare. The classical ve...
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal w...
This paper focuses on the dynamic workforce scheduling and routing problem for the maintenance work of harvesters in a sugarcane harvesting operation. Technician teams categorized as mechanical, hydraulic, and electrical teams are assumed to have dif...
The numerical solution of the dynamic optimization problem is often sought for chemical processes, but the discretization of control variables is a difficult problem. Firstly, based on the analysis of the seagull optimization algorithm, this paper in...
In the container loading problem (CLP), the construction of packing patterns is driven by the maximization of the volume occupied, and comprises several constraints such as loading feasibility, weight balance, cargo stability, operational safety, mat...
Theories of consciousness grounded in neuroscience must explain the phenomenal binding problem, e.g., how micro-units of information are combined to create the macro-scale conscious experience common to human phenomenology. An example is how single &...
We study a one-dimensional heat equation with dynamic integral boundary conditions together with an inverse problem for recovering an unknown boundary source from interior temperature measurements. For the direct problem, the existence and uniqueness...
Transport activities and citizen mobility have a deep impact on enlarged smart cities. By analyzing Big Data streams generated through Internet of Things (IoT) devices, this paper aims to show the efficiency of using IoT analytics, as an agile optimi...
In this work, we propose a nonlinear dynamic inverse solution to the diffusion problem based on Krylov Subspace Methods with spatiotemporal constraints. The proposed approach is applied by considering, as a forward problem, a 1D diffusion problem wit...
As a new delivery mode, the collaborative delivery of packages using trucks and drones has been proven to reduce delivery costs and delivery time. To cope with the huge cost challenges brought by strict time constraints and ever-changing customer ord...
Dynamic Multi-Objective Optimization Problems (DMOPs) and Many-Objective Optimization Problems (MaOPs) are two classes of the optimization field that have potential applications in engineering. Modified Multi-Objective Evolutionary Algorithms hybrid...
We study the motion of a test particle in a conservative force field. In the framework of the 2D inverse problem of Newtonian dynamics, we find 2D potentials that produce a preassigned monoparametric family of regular orbits
To solve the problem of inserting new job into flexible job-shops, this paper proposes a dynamic self-learning artificial bee colony (DSLABC) optimization algorithm to solve dynamic flexible job-shop scheduling problem (DFJSP). Through the reasonable...
Job shop scheduling problem (JSSP) is essential in the production, which can significantly improve production efficiency. Dynamic events such as machine breakdown and job rework frequently occur in smart manufacturing, making the dynamic job shop sch...
The dynamic lot-sizing problem under a time-varying environment considers new features of the production system where factors such as production setup cost, unit inventory-holding cost, and unit price of manufacturing resources may vary in different...
This paper proposes the Open Competency Optimization (OCO) approach, based on adaptive combinatorial operators, to solve the Dynamic Green Traveling Salesman Problem (DG-TSP), which extends the classical TSP by incorporating dynamic travel conditions...
The dynamic flexible job-shop problem (DFJSP) is a realistic and challenging problem that many production plants face. As the product line becomes more complex, the machines may suddenly break down or resume service, so we need a dynamic scheduling f...
This paper studies the cyclic dynamic gaming case of the r-interdiction median problem with fortification (CDGC-RIMF), which is important for strengthening a facility’s reliability and invulnerability under various possible attacks. We formulat...
In the event of a disaster, the road network is often compromised in terms of its capacity and usability conditions. This is a challenge for humanitarian operations in the context of delivering critical medical supplies. To optimise vehicle routing f...
Dynamic optimization is an important research topic in chemical process control. A dynamic optimization method with good performance can reduce energy consumption and prompt production efficiency. However, the method of solving the problem is complic...
Dynamic customer demands impose new challenges for vehicle routing optimization with time windows, in which customer demands appear dynamically within the working periods of depots. The delivery routes should be adjusted for the new customer demands...
Developing numerical methods to solve dynamic electromagnetic problems has broad application prospects. In computational electromagnetics, traditional numerical methods are commonly used to deal with static electromagnetic problems. However, they can...
Background: The Dynamic Modified Stochastic p-Median Problem (DMS-p-MP) is an important problem in supply chain network design, as it deals with the optimal location of facilities and the allocation of demand in a dynamic and uncertain environment. M...
In this paper, we introduce a new formulation of the multivehicle point-to-point network problem to be utilised in urban air mobility (UAM) vertiport-to-vertiport network operations. Vehicle routing problems (VRPs) and their variants have previously...
of 360