C. Bernard Department of Physi s, Washington University, St. Louis, MO 63130, USA T. Bur h, E.B. Gregory, and D. Toussaint Department of Physi s, University of Arizona,Tu son, AZ 85721, USA C. DeTar and J. Osborn Physi s Department, University of Utah, Salt Lake City, UT 84112, USA Steven Gottlieb Department of Physi s, Indiana University,Bloomington, IN 47405, USA U.M. Heller Ameri an Physi al...

in this paper, a new approach was presented for bus network design which took the effects of three out of four stages of the bus planning process into account. the presented model consisted of three majors steps 1- network design procedure (ndp), 2- frequency determination and assignment procedure (fdap), and 3- network evaluation procedure (nep). genetic algorithm (ga) was utilized to solve th...

This thesis is concerned with investigating an approach for adding problem notation to a computer language. A method is proposed for modifying a programming language to fit problem notation by including the capability of defining a problem specific set of symbols or operators in the language. The proposed method for extending a language uses operator overloading to map language operations to th...

In this paper, we propose a lightweight yet powerful dynamic epistemic logic that captures not only the distinction between de dicto and re knowledge but also updates. The is based on dynamified version of an language extended with assignment operator borrowed from logic, following work Wang Seligman (Proc. AiML 2018). We obtain complete axiomatizations for counterparts public announcement even...

Finding a line plan with corresponding frequencies is an important stage of planning a public transport system. A line plan should permit all passengers to travel with an appropriate quality at appropriate costs for the public transport operator. Traditional line planning procedures proceed sequentially: In a first step a traffic assignment allocates passengers to routes in the network, often b...

The performance of evolutionary algorithms is highly affected by the selection of the variation operators to solve the problem at hand. This paper presents a brief review of the results that have been recently obtained using the “Extreme Dynamic Multi-Armed Bandit” (Ex-DMAB), a technique used to automatically select the operator to be applied between the available ones, while searching for the ...

‎In this short note‎, ‎we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy‎, ‎{em Math‎. ‎Inequal‎. ‎Appl.}‎ ‎{18} (2015)‎, ‎no‎. ‎2‎, ‎401--406]‎. ‎Meanwhile‎, ‎we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...

Evolutionary algorithms solve problems by simulating the evolution of a population candidate solutions. We focus on evolving permutations for ordering such as traveling salesperson problem (TSP), well assignment quadratic (QAP) and largest common subgraph (LCS). propose cycle mutation, new mutation operator whose inspiration is well-known crossover operator, concept permutation cycle. use fitne...