scholarly journals Goal Identification Control Using an Information Entropy-Based Goal Uncertainty Metric

Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 299 ◽  
Author(s):  
Kai Xu ◽  
Quanjun Yin
Keyword(s):  
Information Entropy ◽  
Empirical Evaluation ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Identification Process ◽  
Related Information ◽  
Relative Value ◽  
Goal Recognition ◽  
Mixed Integer Programming Problem ◽  
Real Goal

Recent research has found situations where the identification of agent goals could be purposefully controlled, either by changing the underlying environment to make it easier, or exploiting it during agent planning to delay the opponent’s goal recognition. The paper tries to answer the following questions: what kinds of actions contain less information and more uncertainty about the agent’s real goal, and how to describe this uncertainty; what is the best way to control the process of goal identification. Our contribution is the introduction of a new measure we call relative goal uncertainty (rgu) with which we assess the goal-related information that each action contains. The rgu is a relative value associated with each action and represents the goal uncertainty quantified by information entropy after the action is taken compared to other executable ones in each state. After that, we show how goal vagueness could be controlled either for one side or for both confronting sides, and formulate this goal identification control problem as a mixed-integer programming problem. Empirical evaluation shows the effectiveness of the proposed solution in controlling goal identification process.

scholarly journals A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Godfrey Chagwiza ◽  
Chipo Chivuraise ◽  
Christopher T. Gadzirayi
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Moringa Oleifera ◽  
Bat Algorithm ◽  
Mixed Integer ◽  
Poultry Feed ◽  
Integer Programming Problem ◽  
Optimum Solution ◽  
Mixed Integer Programming Problem ◽  
Number Of Iterations

In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

Scheduling of Yard Truck Considering Loading and Unloading Simultaneously in an Underground Container Logistics System

2021 ◽  
pp. 036119812110478
Author(s):  
Yinping Gao ◽  
Daofang Chang ◽  
Jun Yuan ◽  
Chengji Liang
Keyword(s):  
Genetic Algorithm ◽  
Container Terminals ◽  
Mixed Integer ◽  
Operating Efficiency ◽  
Adaptive Genetic Algorithm ◽  
Integer Programming Problem ◽  
Logistics System ◽  
Container Logistics ◽  
Loading And Unloading ◽  
Mixed Integer Programming Problem

With the rapid growth of containers and scarce of land, the underground container logistics system (UCLS) presents a logical alternative for container terminals to better protect the environment and relieve traffic pressure. The operating efficiency of container terminals is one of the competitive edges over other terminals, which requires UCLS to be well integrated with the handling process of the storage yard. In UCLS, yard trucks (YTs) serve different handling points dynamically instead of one fixed handling point, and yard cranes (YCs) perform loading and unloading simultaneously. To minimize the total time of handling all containers in UCLS, the mixed integer programming problem is described and solved using an adaptive genetic algorithm (AGA). The convergence speed and accuracy of AGA are demonstrated by comparison with conventional genetic algorithm (GA). Additionally, AGA and CPLEX are compared with different scale cases. Experimental results show that the proposed algorithm is superior to CPLEX in resulted solutions and calculation time. A sensitivity analysis is provided to obtain reasonable numbers of YTs for scheduling between handling points and the storage yard in UCLS.

The Optimal Controlled Partitioning Strategy for Power System Based on Master-Slave Problem

2013 ◽  
Vol 385-386 ◽  
pp. 999-1006
Author(s):  
Wei Wang ◽  
Ting Yu ◽  
Tian Jiao Pu ◽  
Ai Zhong Tian ◽  
Ji Keng Lin
Keyword(s):  
Large Scale ◽  
Optimization Method ◽  
Mixed Integer ◽  
Master Problem ◽  
Decomposition Algorithms ◽  
Integer Programming Problem ◽  
Complete Model ◽  
New Approach ◽  
Mixed Integer Programming Problem ◽  
Partitioning Strategy

Controlled partitioning strategy is one of the effective measures taken for the situation when system out-of-step occurs. The complete splitting model, mostly solved by approximate decomposition algorithms, is a large-scale nonlinear mixed integer programming problem. A new alternate optimization method based on master-slave problem to search for optimal splitting strategy is proposed hereby. The complete model was converted into master-slave problems based on CGKP (Connected Graph Constrained Knapsack Problem). The coupling between master problem and slave problem is achieved through load adjustment. A better splitting strategy can be obtained through the alternating iteration between the master problem and the salve problem. The results of the examples show that the method can obtain better splitting strategy with less shed load than other approximate algorithms, which verifies the feasibility and effectiveness of the new approach presented.

scholarly journals Distributionally robust chance constrained svm model with $\ell_2$-Wasserstein distance

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Qing Ma ◽  
Yanjun Wang
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Numerical Experiments ◽  
Wasserstein Distance ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Discrete Form ◽  
Svm Model ◽  
Distributionally Robust ◽  
Mixed Integer Programming Problem

<p style='text-indent:20px;'>In this paper, we propose a distributionally robust chance-constrained SVM model with <inline-formula><tex-math id="M1">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein ambiguity. We present equivalent formulations of distributionally robust chance constraints based on <inline-formula><tex-math id="M2">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein ambiguity. In terms of this method, the distributionally robust chance-constrained SVM model can be transformed into a solvable linear 0-1 mixed integer programming problem when the <inline-formula><tex-math id="M3">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein distance is discrete form. The DRCC-SVM model could be transformed into a tractable 0-1 mixed-integer SOCP programming problem for the continuous case. Finally, numerical experiments are given to illustrate the effectiveness and feasibility of our model.</p>

HYBRID CODING PSO-ACO CO-EVOLUTIONARY ALGORITHM FOR SOLVING MIXED-INTEGER PROGRAMMING PROBLEMS

2013 ◽  
Vol 30 (03) ◽  
pp. 1340001 ◽  
Author(s):  
YUELIN GAO ◽  
MIAOMIAO WANG
Keyword(s):  
Integer Programming ◽  
Evolutionary Algorithm ◽  
Mixed Integer Programming ◽  
Mixed Integer ◽  
Penalty Function Method ◽  
Integer Programming Problem ◽  
The Real ◽  
Hybrid Coding ◽  
Integer Programming Problems ◽  
Mixed Integer Programming Problem

A co-evolutionary algorithm based on particle swarm optimization (PSO) and ant colony optimization (ACO) is given to solve the bound constrained mixed-integer programming problem (BCMIP). For the specificity of the problem, the hybrid coding includes the real coding and the integer coding. The real coding part is evolved by PSO while the integer coding part is evolved by ACO. The entire population is co-evolved by PSO and ACO. Numerical experiments show that the proposed algorithm is feasible and effective to solve BCMIP. We also obtain satisfactory result to solve MIP when the proposed algorithm is combined with penalty function method.

Sign in / Sign up

Export Citation Format

Share Document