共查询到20条相似文献,搜索用时 683 毫秒
1.
2.
3.
4.
Windows环境下的禁忌搜索法解Job—shop问题 总被引:3,自引:0,他引:3
本文应用禁忌搜索算法来解决复杂的车间调度问题,介绍了禁忌搜索算法的基本概念和各项参数,讨论了基于禁忌搜索的调度方案,并给出了调度方案的编程实现。 相似文献
5.
酸轧生产调度的主要任务是在满足酸轧机组生产工艺和能力约束下, 考虑下游机组的流向需求,为保证生产连续性和平滑过渡的要求,从给定候选池中选择适合的板卷构成一个酸轧调度单元. 针对此问题, 本文建立了以最小化过渡费用和调度单元剩余容量惩罚费用为目标的整数规划模型, 提出了一种嵌入强化Dynasearch算法的禁忌搜索混合算法. 该混合算法采用基于最小插入法的两阶段启发式产生初始解, 根据采用邻域结构的不同设计双禁忌表, 为了避免算法陷入局部最优, 在禁忌搜索的每次迭代过程中嵌入Swap邻域和Inner-insert邻域相结合的多交换Dynasearch邻域, 并设计了多项式动态规划算法搜索该邻域. 针对问题的特征, 提出了Block分区结构, 基于此分析了多个可行解性质, 有效降低了搜索空间. 与一般禁忌搜索算法比较, 结果表明所提出的强化Dynsearch TS (Tabu search)算法求解效果明显优于一般TS算法, 平均改进量为3.62%, 算法运行时间大大缩短. 验证了该算法在解决此类问题的有效性. 相似文献
6.
Although the concept of just-in-time (JIT) production systems has been proposed for over two decades, it is still important in real-world production systems. In this paper, we consider minimizing the total weighted earliness and tardiness with a restrictive common due date in a single machine environment, which has been proved as an NP-hard problem. Due to the complexity of the problem, metaheuristics, including simulated annealing, genetic algorithm, tabu search, among others, have been proposed for searching good solutions in reasonable computation times. In this paper, we propose a hybrid metaheuristic that uses tabu search within variable neighborhood search (VNS/TS). There are several distinctive features in the VNS/TS algorithm, including different ratio of the two neighborhoods, generating five points simultaneously in a neighborhood, implementation of the B/F local search, and combination of TS with VNS. By examining the 280 benchmark problem instances, the algorithm shows an excellent performance in not only the solution quality but also the computation time. The results obtained are better than those reported previously in the literature. 相似文献
7.
Cell formation is the first step in the design of cellular manufacturing systems. In this study, an efficient tabu search algorithm based on a similarity coefficient is proposed to solve the cell formation problem with alternative process routings and machine reliability considerations. In the proposed algorithm, good initial solutions are first generated and later on improved by a tabu search algorithm combining the mutation operator and an effective neighborhood solution searching mechanism. Computational experiences from test problems show that the proposed approach is extremely effective and efficient. When compared with the mathematical programming approach which took three hours to solve problems, the proposed algorithm is able to produce optimal solutions in less than 2 s. 相似文献
8.
Minimizing Total Weighted Tardiness in a Generalized Job Shop 总被引:1,自引:0,他引:1
We consider a generalization of the classical job shop scheduling problem with release times, positive end–start time lags,
and a general precedence graph. As objective we consider the total weighted tardiness. We use a tabu search algorithm to search
for the order in which the operations are processed on each machine. Given a sequence of operations on each machine, we determine
optimal starting times by solving a maximum cost flow problem. This solution is used to determine the neighborhood for our
tabu search algorithm. All sequences in our neighborhood are obtained by swapping certain pairs of adjacent operations. We show that
only swaps that possess a certain property can improve the current solution; if no such swap is available in the neighborhood,
then the current solution is globally optimal. In the computational results we compare our method with other procedures proposed
in literature. Our tabu search algorithm seems to be effective both with respect to time and solution quality.
The research was carried out at the Technische Universiteit Eindhoven and the Universiteit Utrecht with support of Baan and
the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT). 相似文献
9.
本文提出了解决最小完工时间的无等待流水调度问题的基于禁忌搜索的混合算法。算法结合了调度规则和禁忌搜索算法的优点,首先利用调度规则构造较好的初始解,既可以加快禁忌搜索算法的收敛速度,也可以降低整个算法的运算量,使算法有更好的工程实用性;然后使用变邻域结构的禁忌搜索算法改进当前解。在保持可达性的基础上,该算法缩小了邻域规模和减少了计算时间。数值仿真实验表明,该算法是有效的。 相似文献
10.
Tabu search (TS) algorithms are among the most effective approaches for solving the job shop scheduling problem (JSP) which is one of the most difficult NP-complete problems. However, neighborhood structures and move evaluation strategies play the central role in the effectiveness and efficiency of the tabu search for the JSP. In this paper, a new enhanced neighborhood structure is proposed and applied to solving the job shop scheduling problem by TS approach. Using this new neighborhood structure combined with the appropriate move evaluation strategy and parameters, we tested the TS approach on a set of standard benchmark instances and found a large number of better upper bounds among the unsolved instances. The computational results show that for the rectangular problem our approach dominates all others in terms of both solution quality and performance. 相似文献
11.
The job shop scheduling problem is a difficult combinatorial optimization problem. This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem. The proposed algorithm used biased random sampling to have a better covering of the solution space. In addition, a new version of N6 neighborhood is applied in a tabu search framework. In order to evaluate the algorithm, comprehensive tests are applied to it using various standard benchmark sets. Computational results confirm the effectiveness of the algorithm and its high speed. Besides, 19 new upper bounds among the unsolved problems are found. 相似文献
12.
This work proposes a hybrid metaheuristic (HMH) approach which integrates several features from tabu search (TS), simulated annealing (SA) and variable neighbourhood search (VNS) in a new configurable scheduling algorithm. In particular, either a deterministic or a random candidate list strategy can be used to generate the neighbourhood of a solution, both a tabu list mechanism and the SA probabilistic rule can be adopted to accept solutions, and the dimension of the explored neighbourhood can be dynamically modified. The considered class of scheduling problems is characterized by a set of independent jobs to be executed on a set of parallel machines with non-zero ready times and sequence dependent setups. In particular, the NP-hard generalized parallel machine total tardiness problem (GPMTP) recently defined by Bilge et al. [A tabu search algorithm for parallel machine total tardiness problem. Computers & Operations Research 2004;31:397–414], is faced. Several alternative configurations of the HMH have been tested on the same benchmark set used by Bilge et al. The results obtained highlight the appropriateness of the proposed approach. 相似文献
13.
The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-complete optimization problems. Over the last 10–15 years, tabu search (TS) has emerged as an effective algorithmic approach for the JSP. However, the quality of solutions found by tabu search approach depends on the initial solution. To overcome this problem and provide a robust and efficient methodology for the JSP, the heuristics search approach combining simulated annealing (SA) and TS strategy is developed. The main principle of this approach is that SA is used to find the elite solutions inside big valley (BV) so that TS can re-intensify search from the promising solutions. This hybrid algorithm is tested on the standard benchmark sets and compared with the other approaches. The computational results show that the proposed algorithm could obtain the high-quality solutions within reasonable computing times. For example, 17 new upper bounds among the unsolved problems are found in a short time. 相似文献
14.
15.
We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to generate solutions to the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure to effectively construct a path linking the initiating solution and the guiding solution, and a reference solution determination mechanism based on two kinds of improvement methods. We evaluate the performance of TS/PR on almost all of the benchmark JSP instances available in the literature. The test results show that TS/PR obtains competitive results compared with state-of-the-art algorithms for JSP in the literature, demonstrating its efficacy in terms of both solution quality and computational efficiency. In particular, TS/PR is able to improve the upper bounds for 49 out of the 205 tested instances and it solves a challenging instance that has remained unsolved for over 20 years. 相似文献
16.
针对提前/拖期Job Shop调度问题,建立其约束满足优化问题模型,提出了一种约束满足与禁忌搜索结合的混合算法。该算法基于约束满足思想,通过约束传播技术和启发式修复算法,得到可行调度作为禁忌搜索算法的初始解;再进行关键路径上的邻域变换,优化当前解;并采用一种全局邻域交换策略,扩大搜索空间,改善优化结果。数据实验表明了该混合算法的可行性和有效性。 相似文献
17.
This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent
setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between
two jobs comprises an unrestricted setup that can be performed at any time, and a restricted setup that must be performed
outside of a given time interval which repeats daily in the same position. The setup time between two jobs is thus a function
of the completion time of the first job. The tabu search heuristic relies on shift and swap moves, and a surrogate objective
function is used to speed-up the neighborhood evaluation. Computational experiments show that the proposed heuristic consistently
finds better solutions in less computation time than a recent branch-and-cut algorithm. Furthermore, on instances where the
branch-and-cut algorithm cannot find the optimal solution, the heuristic always identifies a better solution. 相似文献
18.
Cellular manufacturing systems (CMS) are used to improve production flexibility and efficiency. They involve the identification of part families and machine cells so that intercellular movement is minimized and the utilization of the machines within a cell is maximized. Previous research has focused mainly on cell formation problems and their variants; however, only few articles have focused on more practical and complicated problems that simultaneously consider the three critical issues in the CMS-design process, i.e., cell formation, cell layout, and intracellular machine sequence. In this study, a two-stage mathematical programming model is formulated to integrate the three critical issues with the consideration of alternative process routings, operation sequences, and production volume. Next, because of the combinatorial nature of the above model, an efficient tabu search algorithm based on a generalized similarity coefficient is proposed. Computational results from test problems show that our proposed model and solution approach are both effective and efficient. When compared to the mathematical programming approach, which takes more than 112 h (LINGO) and 1139 s (CPLEX) to solve a set of ten test instances, the proposed algorithm can produce optimal solutions for the same set of test instances in less than 12 s. 相似文献
19.
20.
Tabu search for attribute reduction in rough set theory 总被引:2,自引:0,他引:2
Abdel-Rahman Hedar Jue Wang Masao Fukushima 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(9):909-918
In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction problem in rough set theory.
The proposed method, called tabu search attribute reduction (TSAR), is a high-level TS with long-term memory. Therefore, TSAR
invokes diversification and intensification search schemes besides the TS neighborhood search methodology. TSAR shows promising
and competitive performance compared with some other CI tools in terms of solution qualities. Moreover, TSAR shows a superior
performance in saving the computational costs. 相似文献