نتایج جستجو برای: traveling time

تعداد نتایج: 1902676  

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :computational methods for differential equations 0
ahmet bekir eskisehir osmangazi university, art-science faculty, department of mathematics-computer ozkan guner dumlupınar university

in this paper, exp-function and (g′/g)expansion methods are presented to derive traveling wave solutions for a class of nonlinear space-time fractional differential equations. as a results, some new exact traveling wave solutions are obtained.

Journal: :advances in railway engineering 0
masoud yaghini rail transportation department, school of railway engineering, iran university of science and technology, tehran, iran hasti jafari rail transportation department, school of railway engineering, iran university of science and technology, tehran, iran.

regarding the importance of competitive advantages among the transportation systems, improving the costumer’s satisfaction is an important factor in attracting them to these systems. in this research, we focus on the effects of constructing new stations on users and a new mathematical model is proposed for this problem. in the proposed model, two simultaneous effects on customers by constructin...

In this paper, Exp-function and (G′/G)expansion methods are presented to derive traveling wave solutions for a class of nonlinear space-time fractional differential equations. As a results, some new exact traveling wave solutions are obtained.

Journal: :journal of advances in computer research 0
touraj mohammadpour department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran mehdi yadollahi department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran amir massoud bidgoli assistant professor, b.sc., m.sc., ph.d. (manchester university), mieee, tehran north branch, islamic azad university, tehran, iran habib esmaeelzadeh rostam department of computer engineering, ghaemshahr branch, islamic azad university, ghaemshahr, iran

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

Journal: :international journal of industrial engineering and productional research- 0
k. shahanaghi v.r. ghezavati

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...

Journal: :Journal of Experimental Psychology: Animal Behavior Processes 2002

  In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...

Journal: :journal of optimization in industrial engineering 2014
parham azimi ramtin rooeinfar hani pourvaziri

in today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. in this paper, we present a new model for the traveling salesman problem with multiple transporters (tspmt). in the proposed model, which is more applicable than the traditional versions, each city has diffe...

Journal: :Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics 1999
Y Lee J S Andrade S V Buldyrev N V Dokholyan S Havlin P R King G Paul H E Stanley

We study traveling time and traveling length for tracer dispersion in two-dimensional bond percolation, modeling flow by tracer particles driven by a pressure difference between two points separated by Euclidean distance r. We find that the minimal traveling time t(min) scales as t(min) approximately r(1.33), which is different from the scaling of the most probable traveling time, t* approximat...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید