The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

The likelihood of a crash or crash potential is significantly affected by short-term turbulence of traffic flow. For this reason, crash potential must be estimated on a real-time basis by monitoring the current traffic condition. In this regard, a probabilistic real-time crash prediction model relating crash potential to various traffic flow characteristics which lead to crash occurrence, or “c...

We study consequences of regulatory interventions in limit order markets that aim at stabilizing the market after an occurrence of a "flash crash". We use a simulation platform that creates random arrivals of trade orders, that allows us to analyze subtle features of liquidity and price variability under various market structures. The simulations are performed under continuous double-auction mi...

The rare species Lymnastis novikovi Michailov, 1998, described from the single female specimen collected in Ukraine, is redescribed on the basis of new material. We provide the illustrations of the general habitus, the median lobe and its internal sac and describe the habitat of L. novikovi, to increase information about this species. A key to European Lyinastis species is given. The current di...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

background : there are few published studies that use real data testing to examine the performance of outbreak detection methods. the aim of this study was to determine the performance of the exponentially weighted moving average (ewma) in real time detection of a local outbreak in mashhad city, eastern iran . methods : the ewma algorithms (both ewma 1 with λ=0.3 and ewma 2 with λ=0.6) were app...

Nowadays using of new energies in the form of dispersed resources in the worlds is wide spreading. In this article we will design a dispersed production source in the form of a solar/wind hybrid power plant in order to supply the energy of a residential unit according to a sample load pattern. The aim of aforementioned design is to reduce its costs in a period of 20 years. In order to optimi...

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample small number of KPGM graphs and quilt them together. Under a restricted set of ...