Metaheuristic Algorithms Based on Compromise Programming for Multi-Objective Urban Shipment Problem

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

Stability Control Method of Hybrid Impulsive System Based on M-Matrix

Aiming at the problems of poor control effect and poor stability of the mixed pulse system with the traditional method, this paper introduces the M-matrix to establish the pulse delay differential indefinite formula and realize stability control of the mixed pulse system. The synchronization problem of mixed-pulse systems in complex networks is analyzed using M matrix. The local coupling strength of the impulsive system is controlled according to the adaptive method. A class of Multi-Lyapunov functions is constructed for stability control of hybrid impulsive systems. The proposed method is proved to have better control effect through experiments.

A Q-Learning-Based Parameters Adaptive Algorithm for Formation Tracking Control of Multi-Mobile Robot Systems

This paper proposes an adaptive formation tracking control algorithm optimized by Q-learning scheme for multiple mobile robots. In order to handle the model uncertainties and external disturbances, a desired linear extended state observer is designed to develop an adaptive formation tracking control strategy. Then an adaptive method of sliding mode control parameters optimized by Q-learning scheme is employed, which can avoid the complex parameter tuning process. Furthermore, the stability of the closed-loop control system is rigorously proved by means of matrix properties of graph theory and Lyapunov theory, and the formation tracking errors can be guaranteed to be uniformly ultimately bounded. Finally, simulations are presented to show the proposed algorithm has the advantages of faster convergence rate, higher tracking accuracy, and better steady-state performance.

Auxiliary function-based algorithm for blind extraction of a moving speaker

In this paper, we propose a novel algorithm for blind source extraction (BSE) of a moving acoustic source recorded by multiple microphones. The algorithm is based on independent vector extraction (IVE) where the contrast function is optimized using the auxiliary function-based technique and where the recently proposed constant separating vector (CSV) mixing model is assumed. CSV allows for movements of the extracted source within the analyzed batch of recordings. We provide a practical explanation of how the CSV model works when extracting a moving acoustic source. Then, the proposed algorithm is experimentally verified on the task of blind extraction of a moving speaker. The algorithm is compared with state-of-the-art blind methods and with an adaptive BSE algorithm which processes data in a sequential manner. The results confirm that the proposed algorithm can extract the moving speaker better than the BSE methods based on the conventional mixing model and that it achieves improved extraction accuracy than the adaptive method.

Towards Adaptive Gamification: A Method Using Dynamic Player Profile and a Case Study

The design of gamified experiences following the one-fits-all approach uses the same game elements for all users participating in the experience. The alternative is adaptive gamification, which considers that users have different playing motivations. Some adaptive approaches use a (static) player profile gathered at the beginning of the experience; thus, the user experience fits this player profile uncovered through the use of a player type questionnaire. This paper presents a dynamic adaptive method which takes players’ profiles as initial information and also considers how these profiles change over time based on users’ interactions and opinions. Then, the users are provided with a personalized experience through the use of game elements that correspond to their dynamic playing profile. We describe a case study in the educational context, a course integrated on Nanomoocs, a massive open online course (MOOC) platform. We also present a preliminary evaluation of the approach by means of a simulator with bots that yields promising results when compared to baseline methods. The bots simulate different types of users, not so much to evaluate the effects of gamification (i.e., the completion rate), but to validate the convergence and validity of our method. The results show that our method achieves a low error considering both situations: when the user accurately (Err = 0.0070) and inaccurately (Err = 0.0243) answers the player type questionnaire.

Design o f Wireless Ad Hoc System u sing Adaptive Multi Hop Link State Optimal Routing Protocol

Now a days for the radio network communication multi-hop routing is used. This multi-hop routing technique covers larger coverage area. Therefore to reach at specific location data is transferred in form of packets from one node to other node. But for the transmission of radio signals over the large distance, large number of transreceivers are required and these transreceivers requires large power to operate. As a result, multi-hop routing can saves energy over separate routing. Therefore it is necessity to design a cost effective multi-hop routing technique for successful transmission of ratio packet data. In this paper a hop by hop adaptive link state optional routing (HALO) is explained. It is the first packet transmitting solution with hop by hop and link state routing, which reduces the cost of transporting data across a packet switch network[3]. The triple model is designed for multi hop packet routing. In this work each node of network iteratively and separately improves the small part of traffic bound. This algorithm finds the shortest path of specific location for every iteration and it is calculated by the marginal cost of the various links of network. The marginal link cost is used to calculate the shortest path between the node and the destination location. This marginal link cost is gathered from link state updates. The various networks changes are automatically identified by the adaptive method which is used in this paper. Due to this the exchange between the packets on wrong node is reduced over the overhead traffic. To validate these theoretical results the experimental evaluations and mathematical calculations are also reported in this work. Net beans java is the programmed use in this proposed project.

Tree-informed Bayesian multi-source domain adaptation: cross-population probabilistic cause-of-death assignment using verbal autopsy

Determining causes of deaths (COD) occurred outside of civil registration and vital statistics systems is challenging. A technique called verbal autopsy (VA) is widely adopted to gather information on deaths in practice. A VA consists of interviewing relatives of a deceased person about symptoms of the deceased in the period leading to the death, often resulting in multivariate binary responses. While statistical methods have been devised for estimating the cause-specific mortality fractions (CSMFs) for a study population, continued expansion of VA to new populations (or "domains") necessitates approaches that recognize between-domain differences while capitalizing on potential similarities. In this paper, we propose such a domain-adaptive method that integrates external between-domain similarity information encoded by a pre-specified rooted weighted tree. Given a cause, we use latent class models to characterize the conditional distributions of the responses that may vary by domain. We specify a logistic stick-breaking Gaussian diffusion process prior along the tree for class mixing weights with node-specific spike-and-slab priors to pool information between the domains in a data-driven way. Posterior inference is conducted via a scalable variational Bayes algorithm. Simulation studies show that the domain adaptation enabled by the proposed method improves CSMF estimation and individual COD assignment. We also illustrate and evaluate the method using a validation data set. The paper concludes with a discussion on limitations and future directions.

Incremental Decision Rules Algorithm: A Probabilistic and Dynamic Approach to Decisional Data Stream Problems

Data science is currently one of the most promising fields used to support the decision-making process. Particularly, data streams can give these supportive systems an updated base of knowledge that allows experts to make decisions with updated models. Incremental Decision Rules Algorithm (IDRA) proposes a new incremental decision-rule method based on the classical ID3 approach to generating and updating a rule set. This algorithm is a novel approach designed to fit a Decision Support System (DSS) whose motivation is to give accurate responses in an affordable time for a decision situation. This work includes several experiments that compare IDRA with the classical static but optimized ID3 (CREA) and the adaptive method VFDR. A battery of scenarios with different error types and rates are proposed to compare these three algorithms. IDRA improves the accuracies of VFDR and CREA in most common cases for the simulated data streams used in this work. In particular, the proposed technique has proven to perform better in those scenarios with no error, low noise, or high-impact concept drifts.