A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff

In this paper, an algorithm for solving interval time-cost tradeoff transportation problemsis presented. In this problem, all the demands are defined as intervalto determine more realistic duration and cost. Mathematical methods can be used to convert the time-cost tradeoff problems to linear programming, integer programming, dynamic programming, goal programming or multi-objective linear programming problems for determining the optimum duration and cost. Using this approach, the algorithm is developed converting interval time-cost tradeoff transportation problem to the linear programming problem by taking into consideration of decision maker (DM)

A New Successive Linearization Approach for Solving Nonlinear Programming Problems

In this paper, we focused on general nonlinear programming (NLP) problems having m nonlinear (or linear) algebraic inequality (or equality or mixed) constraints with a nonlinear (or linear) algebraic objective function in n variables. We proposed a new two-phase-successive linearization approach for solving NLP problems. Aim of this proposed approach is to find a solution of the NLP problem, based on optimal solution of linear programming (LP) problems, satisfying the nonlinear constraints oversensitively. This approach leads to novel methods. Numerical examples are given to illustrate the approach

System Optimum Fuzzy Traffic Assignment Problem

This paper focuses on converting the system optimum traffic assignment problem (SO-TAP) to system optimum fuzzy traffic assignment problem (SO-FTAP). The SO-TAP aims to minimize the total system travel time on road network between the specified origin and destination points. Link travel time is taken as a linear function of fuzzy link flow; thus each link travel time is constructed as a triangular fuzzy number. The objective function is expressed in terms of link flows and link travel times in a non-linear form while satisfying the flow conservation constraints. The parameters of the problem are path lengths, number of lanes, average speed of a vehicle, vehicle length, clearance, spacing, link capacity and free flow travel time. Considering a road network, the path lengths and number of lanes are taken as crisp numbers. The average speed of a vehicle and vehicle length are imprecise in nature, so these are taken as triangular fuzzy numbers. Since the remaining parameters, that are clearance, spacing, link capacity and free flow travel time are determined by the average speed of a vehicle and vehicle length, they will be triangular fuzzy numbers. Finally, the original SO-TAP is converted to a fuzzy quadratic programming (FQP) problem, and it is solved using an existing approach from literature. A numerical experiment is illustrated.</p

The karyotype of the wild boar Sus scrofa Linnaeus, 1758 in Turkey (Mammalia: Artiodactyla)

This study is based on the karyological analyses of 4 Sus scrofa specimens obtained from Kirikkale province in 2003 and 2005. It is the first time that karyotypes of Turkish wild boar specimens were determined. The diploid chromosome number (2n) is 38 and number of autosomal arms (NFa) 60. Karyological data were compared to the relevant literature. The results showed that the Turkish wild boar is different from central and western continental European specimens having 36 chromosomes and is identical to the domestic pig, and ones from east and south-east Europe and the Mediterranean islands. © TÜBİTAK

A Novel Approach for Solving Quadratic Fractional Programming Problems

In this paper, quadratic fractional programming (QFP) problems involving a factorized or non-factorized objective function and subject to homogenous or non-homogenous constraints are considered. Our proposed approach depends on a computational method that converts the QFP problem into a linear programming (LP) problem by using a Taylor series to solve the problem algebraically. This approach, based on the solution of LP problems, can be applied to various types of nonlinear fractional programming problems containing nonlinear constraint(s), and minimizes the total execution time on iterative operations. To illustrate the solution process, two examples are presented and the proposed approach is compared with other two existing methods for solving QFP problems

A regularized trace formula for second order differential operator equations

In this paper, we deal with abstract Sturm-Liouville problems when the potential of the differential equation is an operator function in a Hilbert space $H$. We generalize trace formula obtained by [7], [9] for the classic regular Sturm-Liouville problems. We investigate the spectrum and obtained a regularized trace formula for the Sturm-Liouville operator with an operator coefficient

G-banding karyotypes of Myotis myotis (Borkhausen, 1797) and Myotis blythii (Tomes, 1857) (Mammalia: Chiroptera) in Turkey

WOS: 000292629800015This study is based on the G-banding karyotype of 2 sibling bat species Myotis myotis (Borkhausen, 1797) (Greater Mouse-eared Myotis) and M. blythii (Tomes, 1857) (Lesser Mouse-eared Myotis) distributed in Turkey. G-banding karyotypes showed that the 2 taxa possessed identical G-banded chromosome arms. It was concluded that G-banded chromosomes are not sufficient as a diagnostic character for separating M. myotis from M. blythii.Research Fund of Kirikkale UniversityKirikkale University [BAP-03.03.04.04]This study was supported by the Research Fund of Kirikkale University (BAP-03.03.04.04)