نتایج جستجو برای: covering tour problem

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

Journal: :Mathematical and Computer Modelling 1990

Journal: :INFORMS Journal on Computing 2012

Journal: :Decision Making 2023

In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the (RSP). Here objective problem to find subset nodes in network minimize sum routing costs interconnecting cycle assignment are out cycle, their nearest concentrators such that no assigned node exceeds predetermined distance (say, covering distance) from concentrators. The dista...

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

Journal: :Theoretical Computer Science 2014

Journal: :Papers in Regional Science 1996

Journal: :مهندسی صنایع 0
مهدی علینقیان استادیار دانشکدة صنایع و سیستم های دانشگاه صنعتی اصفهان علیرضا گلی کارشناس ارشد مهندسی صنایع دانشگاه صنعتی اصفهان فریماه مخاطب رفیعی دانشیار دانشکدة فنی بخش مهندسی صنایع دانشگاه تربیت مدرس

one of the most important measures needed to be done in times of crisis is to optimize the allocation and distribution of resources among individuals. time is a critical factor effective to increase the number of people rescued by the relief activities.in this paper, we present a relief vehicle routing model in the affected area which uses covering tour approach to reduce total response time. a...

Journal: :journal of algorithms and computation 0
s. jabari university of tehran, department of algorithms and computation. dara moazzami university of tehran, college of engineering, faculty of engineering science a. ghodousian university of tehran, college of engineering, faculty of engineering science

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

1997
Kan Chen

We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation: i) A tour is selected by choosing cities probabilistically according to the “synaptic” strengths between cities. ii) The “synaptic” strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of th...

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

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