نتایج جستجو برای: sequence dependent setup time traveling salesman problem
تعداد نتایج: 3413329 فیلتر نتایج به سال:
This work compares six sequencing operators that have been developed for use with genetic algorithms. An improved version of the edge recombination operator is presented, the concepts of adjacency, order, and position are reviewed in the context of these operators , and results are compared for a 30 city \Blind" Traveling Salesman Problem and a real world warehouse/shipping scheduling applicati...
Let G = (V, E) be a graph and w: E -» R+ be a length function. Given S C V, a Steiner tour is a cycle passing at least once through each vertex of S . In this paper we investigate naturally submodular graphs: graphs for which the length function of the Steiner tours is submodular. We provide two characterizations of naturally submodular graphs, an 0(n) time algorithm for identifying such graphs...
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer. Disclaimer: This article was authored by Craig Alan Feinstein in his private capacity. No official support or endorsement by the U.S. Government is intended or should be inferred. Consider the following well-known NP-hard problem: Traveling Salesman Problem A traveling salesman...
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
Parallel Machine Scheduling Problem with Unavailable Time Periods and Sequence Dependent Setup Times
Makine çizelgeleme problemlerinde tüm makineler daima kullanılabilir durumda değildirler. Planlı bakım, öğle yemeği ve dinlenme molaları gibi nedenlerle periyodik olarak kesintilere uğrayabilmektedirler. Ancak literatürde genellikle bu durum göz ardı edilmektedir. Bu çalışmada kullanılamayan zaman dilimlerinin sıra bağımlı hazırlık sürelerinin olduğu ilişkisiz paralel makine problemi ele alınmı...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید