Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

Optimal load of mobile robots, while carrying a load with predefined motion precision is an important consideration regarding their applications. In this paper a general formulation for finding maximum load carrying capacity of flexible joint mobile manipulators is presented. Meanwhile, overturning stability of the system and precision of the motion on the given end-effector trajectory are take...

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

Within the competition in today’s business environment, the design of supply chains becomes more complex than before. This paper deals with the retailer’s location problem when customers choose their vendors, and inventory costs have been considered for retailers. In a competitive location problem, price and location of facilities affect demands of customers; consequently, simultaneous optimiza...

In this article I present a novel approach to integrated ground and air public transport journey planning, operating at continent scale. Flexible date search, prerequisite for long distance trips given their typical low and irregular service frequencies, is core functionality. The algorithm, best described as timed branch-and-bound (BBtime), is especially suited for irregular and poorly structu...

We present characterization results on non-weighted minihypers. For minihypers in PG(k − 1, q), q not a square, we improve greatly the results of Hamada, Helleseth, and Maekawa, and of Ferret and Storme. The largest improvements are obtained for q prime.

We propose an approximate wavefunction of the bound state of N D0-branes. Its spread grows as N Definition of M-theory [1][2] using its ten dimensional compactification requires the knowledge of the behaviour of the Kaluza-Klein modes of the graviton. These are realized as the bound states [3] of D0-branes of Type IIA string theory, originally discovered as the black holes in the supergravity [...

We propose an approximate wavefunction of the bound state of N D0-branes. Its spread grows as N Definition of M-theory [1][2] using its ten dimensional compactification requires the knowledge of the behaviour of the Kaluza-Klein modes of the graviton. These are realized as the bound states [3] of D0-branes of Type IIA string theory, originally discovered as the black holes in the supergravity [...

This paper is concerned with delay-dependent exponential stability analysis and stabilization for continuous-time T-S fuzzy Markovian jump systems with mode-dependent time-varying delay. By constructing a novel Lyapunov-Krasovskii functional and utilizing some advanced techniques, less conservative conditions are presented to guarantee the closed-loop system is mean-square exponentially stable....