نتایج جستجو برای: sequence dependent setup time traveling salesman problem
تعداد نتایج: 3413329 فیلتر نتایج به سال:
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...
nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...
In this paper we introduce novel optimization methods for sequencing problems in which the setup times between a pair of tasks depend on the relative position of the tasks in the ordering. Our proposed methods rely on a hybrid approach where a constraint programming model is enhanced with two distinct relaxations: One discrete relaxation based on multivalued decision diagrams, and one continuou...
We consider a variation of the well-known traveling salesman problem in which there are multiple agents who all have to tour whole set nodes same graph, while obeying node- and edge-capacity constraints require that must not crash. simplest model input is an undirected graph with capacities equal one. A solution synchronized called agency. Our puts similar relation as so-called evacuation probl...
The Time Dependent Traveling Salesman Problem (TDTSP) is a generalization of the classical Traveling Salesman Problem (TSP), where arc costs depend on their position in the tour with respect to the source node. While TSP instances with thousands of vertices can be solved routinely, there are very challenging TDTSP instances with less than 100 vertices. In this work, we study the polytope associ...
this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید