Heterogeneous Problem Research Articles

Applying quantum approximate optimization to the heterogeneous vehicle routing problem

Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on small-size problems. A candidate for such combinatorial problems is the heterogeneous vehicle routing problem (HVRP): the problem of finding the optimal set of routes, given a heterogeneous fleet of vehicles with varying loading capacities, to deliver goods to a given set of customers. In this work, we investigate the potential use of a quantum computer to find approximate solutions to the HVRP using the quantum approximate optimization algorithm (QAOA). For this purpose we formulate a mapping of the HVRP to an Ising Hamiltonian and simulate the algorithm on problem instances of up to 21 qubits. We show that the number of qubits needed for this mapping scales quadratically with the number of customers. We compare the performance of different classical optimizers in the QAOA for varying problem size of the HVRP, finding a trade-off between optimizer performance and runtime.

Deep reinforcement learning driven trajectory-based meta-heuristic for distributed heterogeneous flexible job shop scheduling problem

As the production environment evolves, distributed manufacturing exhibits heterogeneous characteristics, including diverse machines, workers, and production processes. This paper examines a distributed heterogeneous flexible job shop scheduling problem (DHFJSP) with varying processing times. A mixed integer linear programming (MILP) model of the DHFJSP is formulated with the objective of minimizing the makespan. To solve the DHFJSP, we propose a deep Q network-aided automatic design of a variable neighborhood search algorithm (DQN-VNS). By analyzing schedules, sixty-one types of scheduling features are extracted. These features, along with six shaking strategies, are used as states and actions. A DHFJSP environment simulator is developed to train the deep Q network. The well-trained DQN then generates the shaking procedure for VNS. Additionally, a greedy initialization method is proposed to enhance the quality of the initial solution. Seven efficient critical path-based neighborhood structures with three-vector encoding scheme are introduced to improve local search. Numerical experiments on various scales of instances validate the effectiveness of the MILP model and the DQN-VNS algorithm. The results show that the DQN-VNS algorithm achieves an average relative percentage deviation (ARPD) of 3.2%, which represents an approximately 88.45% reduction compared to the best-performing algorithm among the six compared, with an ARPD of 27.7%. This significant reduction in ARPD highlights the superior stability and performance of the proposed DQN-VNS algorithm.

Device-Performance-Driven Heterogeneous Multiparty Learning for Arbitrary Images.

Multiparty learning (MPL) is an emerging framework for privacy-preserving collaborative learning. It enables individual devices to build a knowledge-shared model and remaining sensitive data locally. However, with the continuous increase of users, the heterogeneity gap between data and equipment becomes wider, which leads to the problem of model heterogeneous. In this article, we concentrate on two practical issues: data heterogeneous problem and model heterogeneous problem, and propose a novel personal MPL method named device-performance-driven heterogeneous MPL (HMPL). First, facing the data heterogeneous problem, we focus on the problem of various devices holding arbitrary data sizes. We introduce a heterogeneous feature-map integration method to adaptively unify the various feature maps. Meanwhile, to handle the model heterogeneous problem, as it is essential to customize models for adapting to the various computing performances, we propose a layer-wise model generation and aggregation strategy. The method can generate customized models based on the device's performance. In the aggregation process, the shared model parameters are updated through the rules that the network layers with the same semantics are aggregated with each other. Extensive experiments are conducted on four popular datasets, and the result demonstrates that our proposed framework outperforms the state of the art (SOTA).

A quadratically constrained mixed-integer non-linear programming model for multiple sink distributions

Rising traffic congestion and fuel costs pose significant challenges for supply chains with numerous retailers. This paper addresses these challenges by optimizing transportation routes for processed tomatoes within a long-haul and intercity distribution network. We use the heterogeneous capacitated vehicle routing problem framework to create a new quadratically constrained mixed-integer non-linear programming model that aims to meet demand at multiple destinations while minimizing transportation costs. Our model incorporates real-time data and route optimization strategies that consider traffic conditions based on freight time and route diversions for expedited deliveries. It aims to devise an optimal transportation schedule that minimizes fuel, operational, and maintenance costs while ensuring efficient delivery of tomato paste. By applying this model to a real-world case study, we estimate a significant 27.59% reduction in transportation costs, dropping them from GH¢20,270 ($1,638.91) to GH¢14,676 ($1,186.61) on average. This highlights the effectiveness of our strategy in lowering costs while maintaining smooth and efficient deliveries.

A time-driven simulation–optimization framework for the dynamic heterogeneous order-courier assignment problem for instant deliveries

In recent years, instant delivery services have become very popular for transporting meals to urban areas, with an extensive range of products now available to order. The platforms that offer these services rely on crowdsourced couriers who utilize their personal vehicles, resulting in heterogeneous fleets. Furthermore, the competition among companies to retain both customers and couriers is very intense, which underscores the importance of developing superior decision support systems. These systems must generate real-time assignments that meet the expectations of service providers, customers, and couriers. In this study, we designed a time-driven simulation–optimization framework that addresses the dynamic heterogeneous order-courier assignment problem and incorporates order-vehicle restrictions. The framework efficiently manages real-time order arrivals, courier movements, and positional updates while considering dynamic factors such as traffic congestion and regional speed limits for various vehicle types. Extensive testing using literature instances demonstrated the framework’s ability to satisfactorily address the defined problem. Additionally, the time-driven simulation–optimization framework was applied to a realistic case study, resulting in an approximately 4.5% reduction in the total delivery times (from the submission of the order until the delivery to the client) for all orders when compared to the original assignment.

ASAP: Automatic Synthesis of Attack Prototypes, an online-learning, end-to-end approach

Zero-day attack detection and categorization is an open-research field where four main context factors need to be taken into account: novel or zero-day attacks (i) are unlabeled by definition, (ii) may correspond to out-of-distribution data, (iii) can arise concurrently, and (iv) distribution shifts in the feature space need online-learning. Given such constraints, the online detection and categorization of new cyber threats can be modeled as a heterogeneous collective anomaly detection problem, for which no online-learning solutions exist purely based on back-propagation. To this respect, this paper presents an online-learning, end-to-end back-propagation strategy for Automatically Synthesizing the potential signatures or Attack Prototypes of novel cyber threats (asap). The presented framework incorporates automatic feature engineering, operating over raw data from the OpenFlow monitoring API and raw bytes of traffic captures. In asap, specialized inductive biases enhance the training data efficiency and accommodate the inference machinery to resource-constrained scenarios such as the Internet of Things. Finally, the validity of this framework is demonstrated in a live training experiment comprising IoT traffic emulation 33To foster research in the field, the source-code of asap alongside instructions to reproduce the experiments are made publicly available among the set of SmartVille NID models in [1]..

A symmetric interior-penalty discontinuous Galerkin isogeometric analysis spatial discretization of the self-adjoint angular flux form of the neutron transport equation

This paper presents the first application of a symmetric interior-penalty discontinuous Galerkin isogeometric analysis (SIP-DG-IGA) spatial discretization to the self-adjoint angular flux (SAAF) form of the multi-group neutron transport equation. The penalty parameters are determined, for general element types, from a mathematically rigorous coercivity analysis of the bilinear form. The proposed scheme produces a compact spatial discretization stencil. It also yields symmetric positive-definite (SPD) matrices, which can be efficiently solved using pre-conditioned conjugate gradient (PCG) solution algorithms. The proposed discretization scheme is verified using the method of manufactured solutions (MMS) and several nuclear reactor physics benchmark verification test cases. For sufficiently smooth elliptic problems, the proposed spatial discretization can exploit higher-order continuity, or k-refinement, of the NURBS basis to consistently yield greater numerical accuracy per degree of freedom (DoF) than standard h-refinement. Since this is a discontinuous scheme, it can also accurately model significant changes in the neutron scalar flux that may occur near the material interfaces of heterogeneous problems.

Scheduling as a Constraint Satisfaction Problem (Using the Example of Open-Pit Minе Production Scheduling Problem)

The research described in the work is aimed at developing methods for Scheduling. The fundamental disadvantage of the existing methods of Mixed-Integer Linear Programming in application to the problems under consideration is the fact that they are too demanding on the amount of RAM. The difficulty of applying local search procedures to such high-dimensional problems is to develop an effective way to find an acceptable initial approximation and determine the neighboring state transition function, which would allow achieving the optimum fast enough. In the Operations Research Theory, adding additional conditions to a problem can lead to a fundamental change in the problem-solving scheme. The methods proposed in the study are implemented within the framework of the Constraint Programming Paradigm which makes it possible to represent the subject domain dependencies saving RAM, as well as to provide the ability to step-by-step take into account heterogeneous problem conditions without essentially changing the scheme of finding solutions. A significant part of the research deals with methods of logical inference on constraints to reduce the search space and speed up the computational process. The approach to scheduling is illustrated by the Open-Pit Mine Production Scheduling Problem, which was first proposed to be solved as a Constraint Satisfaction Problem. In order to find the first feasible solution, a «greedy» search method is proposed, the result of which can be improved using the developed hybrid method. Both methods rely on original procedures of inference on constraints. The proposed approach has proven its efficiency for block models with sizes of tens and hundreds of thousands of blocks.

Compactness results for a Dirichlet energy of nonlocal gradient with applications

AbstractWe prove two compactness results for function spaces with finite Dirichlet energy of half‐space nonlocal gradients. In each of these results, we provide sufficient conditions on a sequence of kernel functions that guarantee the asymptotic compact embedding of the associated nonlocal function spaces into the class of square‐integrable functions. Moreover, we will demonstrate that the sequence of nonlocal function spaces converges in an appropriate sense to a limiting function space. As an application, we prove uniform Poincaré‐type inequalities for sequence of half‐space gradient operators. We also apply the compactness result to demonstrate the convergence of appropriately parameterized nonlocal heterogeneous anisotropic diffusion problems. We will construct asymptotically compatible schemes for these type of problems. Another application concerns the convergence and robust discretization of a nonlocal optimal control problem.

Vehicle routing in precooling logistics with dynamic temperature-dependent product quality decay

This study focuses on precooling operations for post-harvest fruits and vegetables in smallholder countries, aiming to provide an effective way to reduce product losses in the early stage of food supply chains. In this study, we consider the traditional centralized precooling and emerging mobile precooling to fulfill a series of small-scale and scattered precooling requests, with the goal of minimizing the total operating cost while guaranteeing the product quality of farmers. The resulting problem is a variant of the classic heterogeneous fleet vehicle routing problems with time windows, with the additional consideration of heterogeneous service and temperature-dependent product quality decay. The vehicle routing model is formulated by integrating product quality as a constraint in which a dedicated function is developed to capture the quality dynamics under changing temperatures. We design an improved adaptive large neighborhood search method to solve this problem by identifying a strategy that is able to deal with the interactions among decisions. Experiment results quantify the advantages of managing product quality in the early stage of supply chains for perishable products and provide management insights on conducting quality-based precooling services. Numerical experiments based on small-scale instances of the studied problem as well as large-scale benchmark instances verify the effectiveness and efficiency of the proposed algorithm by comparing it with CPLEX and three state-of-the-art algorithms.

Circular phase shift migration based photoacoustic computational tomography

Abstract In the recent several decades, photoacoustic technique has proved to be capable of noninvasive biomedical imaging with scalable spatial resolution and high penetration depth. To achieve faithful image reconstruction, various method has been proposed, such as back projection, phase shift migration, model-based method, etc. These methods have simple implementations in homogeneous media, whereas in the cases of heterogeneous media (e.g., layered media), complicated modifications with respect to wave propagation at layer interface are always necessary. Here, we propose a frequency domain algorithm extension of phase shift migration in polar coordinates, which is obtained by making second order approximation to the optoacoustic point spread function in cylindrical coordinates and thereafter step by step wavenumber-frequency domain wave field extrapolation along the axial direction. Theoretical simulation and phantom experimental results demonstrate that the proposed circular phase shift migration method can well solve the layered heterogeneous reconstructive problem without modifying the wave propagation model. The acoustic diffraction limited acoustic resolution (up to 225 μm) and high imaging SNR (at least 16 dB) are obtained.

Co-design of an unmanned cable shovel for structural and control integrated optimization: A highly heterogeneous constrained multi-objective optimization algorithm

Unmanned cable shovel is an intelligence-based large machine used for excavating in open-pit coal mines, with significant implications for the security and development of energy resources. The co-design of unmanned cable shovels, considering elements from both structural and control systems, has demonstrated superior performance in obtaining optimal solutions compared to the traditional approaches that focus on individual systems. However, the inherent complexities of diverse systems often lead to heterogeneous function evaluations, posing challenges for the existing optimization algorithms. To address highly heterogeneous multi-objective optimization problems characterized by surrogate-approximated expensive functions and explicit inexpensive functions, this study proposes a highly heterogeneous constrained multi-objective optimization (HHCMO) algorithm. Leveraging NSGA-III as an evolutionary optimizer and the Kriging model for approximating expensive functions, HHCMO strategically addresses the challenges posed by highly heterogeneous objective evaluations. A Monte Carlo sampling-based expected hypervolume improvement (EHVI) criterion, employing a new nearest point approximation method in a unified sampling space, effectively handles the impact of heterogeneous objective evaluations on the sequential infill of the Kriging model. Thorough evaluations on both unconstrained and constrained multi-objective benchmark problems validate the correctness of HHCMO and its superiority relative to state-of-the-art algorithms. Finally, the effectiveness of the proposed method is successfully demonstrated in an engineering scenario of an unmanned cable shovel, where it adeptly handles expensive functions from the structural system and inexpensive functions from the control system.

Assessment and diagnosis of post-traumatic stress disorders (PTSDs) for medico-legal and other clinical purposes: DSM-5-TR PTSD, ICD-11 PTSD and ICD-11 complex PTSD

SUMMARY Post-traumatic stress disorder (PTSD) is a complex, heterogeneous mental health problem that can be challenging to identify, assess, understand, diagnose and treat. This article provides an overview and critique of key topics, literature and principles to inform comprehensive and meticulous assessment of PTSDs. Although expert witnesses are the target audience, this article will have relevance for identifying, assessing, understanding and diagnosing PTSDs in all clinical contexts. A range of topics relevant to assessment are discussed, including: the complex relationship between trauma and PTSDs; DSM-5-TR PTSD and ICD-11 PTSD and complex PTSD diagnoses and the similarities and differences between them; the clinical presentation of PTSDs; psychological models of PTSDs; how to approach assessment and differential diagnosis; the impact of PTSD on neuropsychological abilities and functioning (disability); causation, reliability and assessing PTSDs when this is being considered as a legal defence; evidence-based interventions (medication, psychological therapy, when is the ‘right time’ for therapy, contraindications); and prognosis (if untreated, how long therapy/change takes). Given ongoing debate, the article proposes that trauma exposure is best defined in future iterations of the DSM and ICD as exposure to one or more psychologically threatening or horrific experiences that are overwhelming.

Quantitative Homogenization for the Obstacle Problem and Its Free Boundary

In this manuscript we prove quantitative homogenization results for the obstacle problem with bounded measurable coefficients. As a consequence, large-scale regularity results both for the solution and the free boundary for the heterogeneous obstacle problem are derived.

Towards efficient solutions for vehicle routing problems for oxygen supply chains

This work investigates the integrated production–inventory-routing problem (PIRP) for liquid oxygen supply chains consisting of multiple plants, customers, and heterogeneous vehicles. Solving such a problem is challenging, especially when dealing with large-scale industrial scales. A two-level procedure is adopted that determines decisions regarding production, inventory, and product allocation by simplifying the routing component in the first level. Then, the routing decisions are considered in the lower level for which 3-index mathematical programming formulations are presented. To address the combinatorial complexity of the lower-level decisions, we propose alternative multi-trip heterogeneous vehicle routing problem (MTHVRP) formulations together with a column generation-based solution strategy. A set of test instances and a real-world case study demonstrate the applicability and performance of the formulations and solution methods.

Joint computation offloading and resource allocation for end-edge collaboration in internet of vehicles via multi-agent reinforcement learning

Vehicular edge computing (VEC), a promising paradigm for the development of emerging intelligent transportation systems, can provide lower service latency for vehicular applications. However, it is still a challenge to fulfill the requirements of such applications with stringent latency requirements in the VEC system with limited resources. In addition, existing methods focus on handling the offloading task in a certain time slot with statically allocated resources, but ignore the heterogeneous tasks’ different resource requirements, resulting in resource wastage. To solve the real-time task offloading and heterogeneous resource allocation problem in VEC system, we propose a decentralized solution based on the attention mechanism and recurrent neural networks (RNN) with a multi-agent distributed deep deterministic policy gradient (AR-MAD4PG). First, to address the partial observability of agents, we construct a shared agent graph and propose a periodic communication mechanism that enables edge nodes to aggregate information from other edge nodes. Second, to help agents better understand the current system state, we design an RNN-based feature extraction network to capture the historical state and resource allocation information of the VEC system. Thirdly, to tackle the challenges of excessive joint observation-action space and ineffective information interference, we adopt the multi-head attention mechanism to compress the dimension of the observation-action space of agents. Finally, we build a simulation model based on the actual vehicle trajectories, and the experimental results show that our proposed method outperforms the existing approaches.

Heterogeneous Electric Vehicle Routing Problem with Multiple Compartments and Multiple Trips for the Collection of Classified Waste

Heterogeneous Electric Vehicle Routing Problem with Multiple Compartments and Multiple Trips for the Collection of Classified Waste

A cooperative learning-aware dynamic hierarchical hyper-heuristic for distributed heterogeneous mixed no-wait flow-shop scheduling

The distributed heterogeneous mixed scheduling mode in the manufacturing systems emphasizes the cooperation between factories for the entire production cycle, which poses enormous challenges to the processing and assignment of jobs. Discrepancies in the processing environment and types of machines of each factory during various production stages cause diverse processing paths and scheduling. The distributed heterogeneous mixed no-wait flow-shop scheduling problem with sequence-dependent setup time (DHMNWFSP-SDST), abstracted from the industrial scenarios, is addressed in this paper. The mathematical model of DHMNWFSP-SDST is established. A cooperative learning-aware dynamic hierarchical hyper-heuristic (CLDHH) is proposed to solve the DHMNWFSP-SDST. In CLDHH, a cooperative initialization method is developed to promote diversity and quality of solutions. A hierarchical hyper-heuristic framework with reinforcement learning (RL) is designed to select the algorithm component automatically. Estimation of Distribution Algorithm (EDA) guides the upper-layer RL to select four neighborhood structures. A dynamic adaptive neighborhood switching constructs the lower-layer RL to accelerate exploitation with the dominant sub-neighborhoods. An elite-guided hybrid path relinking achieves local enhancement. The experimental results of CLDHH and six state-of-the-art algorithms on instances indicate that the proposed CLDHH is superior to the state-of-the-art algorithms in solution quality, robustness, and efficiency.

An Adaptive Multi-Objective Genetic Algorithm for Solving Heterogeneous Green City Vehicle Routing Problem

Intelligent scheduling plays a crucial role in minimizing transportation expenses and enhancing overall efficiency. However, most of the existing scheduling models fail to comprehensively account for the requirements of urban development, as exemplified by the vehicle routing problem with time windows (VRPTW), which merely specifies the minimization of path length. This paper introduces a new model of the heterogeneous green city vehicle routing problem with time windows (HGCVRPTW), addressing challenges in urban logistics. The HGCVRPTW model considers carriers with diverse attributes, recipients with varying tolerance for delays, and fluctuating road congestion levels impacting carbon emissions. To better deal with the HGCVRPTW, an adaptive multi-objective genetic algorithm based on the greedy initialization strategy (AMoGA-GIS) is proposed, which includes the following three advantages. Firstly, considering the impact of initial information on the search process, a greedy initialization strategy (GIS) is proposed to guide the overall evolution during the initialization phase. Secondly, the adaptive multiple mutation operators (AMMO) are introduced to improve the diversity of the population at different evolutionary stages according to their success rate of mutation. Moreover, we built a more tailored testing dataset that better aligns with the challenges faced by the HGCVRPTW. Our extensive experiments affirm the competitive performance of the AMoGA-GIS by comparing it with other state-of-the-art algorithms and prove that the GIS and AMMO play a pivotal role in advancing algorithmic capabilities tailored to the HGCVRPTW.

A sequential multiple attribute three-way group decision-making method to heterogeneous MAGDM problems with unknown weight information

As a decision model to depict the human cognitive process, three-way decision (3WD) provides a reasonable semantic interpretation for solving practical multi-attribute group decision-making (MAGDM) problems. At the same time, there often exist different types of information due to the subjective and objective criteria in practical decision-making problems, thus it is necessary to develop some efficient frameworks to deal with the MAGDM problems with heterogeneous information. In this paper, based on 3WD theory and sequential strategy, we propose a sequential multiple attribute three-way group decision-making (SMA3WGD) method for the heterogeneous MAGDM problem with unknown weight information to achieve this goal. At first, we compute the weights of decision-makers by using the consensus degree between each of the decision-makers in a group. Then, we calculate the collective evaluation result of multiple decision-makers by utilizing the mathematical planning method with two objectives of minimum difference and high similarity between group evaluation values and individual evaluation values. Meanwhile, a nested sequence of the set of attributes is constructed according to the attribute values offered by decision-makers that have different degrees of consensus on different attributes. On this basis, a multilevel granular structure for the heterogeneous MAGDM problems is constructed, and then the compute of the cost functions and conditional probability is explored in a single level of granular structure, and the thresholds and three-way decision rules of alternatives are further determined depending on the principle of cost minimization. Furthermore, by using a sequential strategy, we obtain a sequential three-way decision result of the heterogeneous MAGDM problems under the multilevel granular structure. At last, the practicality and advantages of the suggested method are demonstrated via a blockchain service provider selection case study, a parameter sensitivity analysis along with a comparison analysis.