发布求助
文献互助 智能选刊 最新文献

2007 IEEE Symposium on Computational Intelligence in Scheduling最新文献

筛选
英文 中文
Modelling Alternatives in Temporal Networks 时间网络中的建模选择
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367680
R. Barták, O. Cepek, Pavel Surynek
{"title":"Modelling Alternatives in Temporal Networks","authors":"R. Barták, O. Cepek, Pavel Surynek","doi":"10.1109/SCIS.2007.367680","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367680","url":null,"abstract":"Temporal networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117008555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Noisy Chaotic Neural Networks For Delay Constrained Multicast Routing 时延约束组播路由的噪声混沌神经网络
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367700
Wen Liu, Lipo Wang, Haixiang Shi
{"title":"Noisy Chaotic Neural Networks For Delay Constrained Multicast Routing","authors":"Wen Liu, Lipo Wang, Haixiang Shi","doi":"10.1109/SCIS.2007.367700","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367700","url":null,"abstract":"The QoS constrained multicast routing is studied widely these years due to the development of multimedia applications such as video-conferencing and video-on-demand. We apply noisy chaotic neural networks (NCNN) on the delay constrained multicast routing problem. The NCNN has richer and more flexible dynamics, and therefore is more efficient compared with the conventional Hopfield neural network as the latter is often trapped at local minima","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123519761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A New Lower Bound to the Traveling Tournament Problem 旅行比武问题的一个新下界
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367664
S. Urrutia, C. Ribeiro, Rafael A. Melo
{"title":"A New Lower Bound to the Traveling Tournament Problem","authors":"S. Urrutia, C. Ribeiro, Rafael A. Melo","doi":"10.1109/SCIS.2007.367664","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367664","url":null,"abstract":"Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower and upper bounds.","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125982141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Structured Neighborhood Tabu Search for Assigning Judges to Competitions 基于结构化邻域禁忌搜索的比赛裁判分配
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367696
A. Lamghari, J. Ferland
{"title":"Structured Neighborhood Tabu Search for Assigning Judges to Competitions","authors":"A. Lamghari, J. Ferland","doi":"10.1109/SCIS.2007.367696","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367696","url":null,"abstract":"A metaheuristic approach including three different stages is introduced to assign the judges for the John Molson International Case Competition. The complexity of the mathematical formulation accounting for the rules to be followed in assigning the judges, leads us to use such an approach. The two different tabu search methods in the first two stages are combined with a diversification strategy. Numerical results are provided to indicate the efficiency of the approach to generate very good solutions.","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133504380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Parameter setting and exploration of TAGS using a genetic algorithm 基于遗传算法的tag参数设置与探索
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367702
Hagit Sarfati, E. Bachmat, Sagit Kedem-Yemini
{"title":"Parameter setting and exploration of TAGS using a genetic algorithm","authors":"Hagit Sarfati, E. Bachmat, Sagit Kedem-Yemini","doi":"10.1109/SCIS.2007.367702","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367702","url":null,"abstract":"We consider the performance of TAGS, a multi-host job assignment policy. We use a genetic algorithm to compute the optimal parameter settings for the policy. We then explore the performance of the policy using the optimal parameters, when the job size distribution is a heavy-tailed bounded Pareto distribution with parameter alpha. We show that TAGS only operates at low inter-arrival rates. At low rates it is very efficient in comparison with other standard policies. At high rates TAGS has to be combined with other policies to achieve good performance. We also show that the performance is nearly symmetrical around the value alpha = 1, with the best performance when alpha = 1","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A GA based Intelligent Traffic Signal Scheduling Model 基于遗传算法的智能交通信号调度模型
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367675
Shaw-Ching Chang, Ming-Wen Tsai, Gillian Huang
{"title":"A GA based Intelligent Traffic Signal Scheduling Model","authors":"Shaw-Ching Chang, Ming-Wen Tsai, Gillian Huang","doi":"10.1109/SCIS.2007.367675","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367675","url":null,"abstract":"A GA based intelligent traffic signal scheduling model is proposed in this paper. There are two layers in this model. The upper layer decides which direction of intersection should have the priority to go. The intersection signal controller in the lower layer will execute its instruction. The upper layer has to make a decision in a very short time limit, or the signal in the lower layer will response to a wrong traffic pattern. It is as if what the fixed time signal scheduling strategy did before. This paper shows this idea through a simulation model. Our simulation results show that it saves 71 seconds from the fixed time signal scheduling strategy. The lost time might be even higher in our real world. If one intersection is jam-packed, our simulation result also shows that all cars will be redirected within a short time. This model can bring the travelers a better experience of traffic facility for keeping their transportation efficient","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131050767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
An Ant Based Hyper-heuristic for the Travelling Tournament Problem 一种基于蚁群的超启发式旅行比赛问题
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367665
Pai-Chun Chen, G. Kendall, G. V. Berghe
{"title":"An Ant Based Hyper-heuristic for the Travelling Tournament Problem","authors":"Pai-Chun Chen, G. Kendall, G. V. Berghe","doi":"10.1109/SCIS.2007.367665","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367665","url":null,"abstract":"The travelling tournament problem is a challenging sports timetabling problem which is widely believed to be NP-hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper-heuristic algorithm for this problem. Ant algorithms, a well known meta-heuristic, have been successfully applied to various problems. Whilst hyper-heuristics are an emerging technology, which operate at a higher level of abstraction than meta-heuristics. This paper presents a framework which employs ant algorithms as a hyper-heuristic. We show that this approach produces good quality solutions for the traveling tournament problem when compared with results from the literature","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130289334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 61
Solving a Bi-Criteria Permutation Flow Shop Problem Using Immune Algorithm 用免疫算法求解双准则置换流水车间问题
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367669
R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, A. Mirzaei
{"title":"Solving a Bi-Criteria Permutation Flow Shop Problem Using Immune Algorithm","authors":"R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, A. Mirzaei","doi":"10.1109/SCIS.2007.367669","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367669","url":null,"abstract":"A flow shop problem as a typical manufacturing challenge has gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, in which the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objective immune algorithm (MOIA) is proposed for searching locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, a number of test problems are solved and the efficiency of the proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm, i.e. SPEA-II. The computational results show that the proposed MOIA performs better than the above genetic algorithm, especially for large-sized problems","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Optimal Paths Design for a GMPLS Network using the Lagrangian Relaxation Method 用拉格朗日松弛法设计GMPLS网络的最优路径
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367697
T. Fukumoto, N. Komoda
{"title":"Optimal Paths Design for a GMPLS Network using the Lagrangian Relaxation Method","authors":"T. Fukumoto, N. Komoda","doi":"10.1109/SCIS.2007.367697","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367697","url":null,"abstract":"We describe an optimal path design for a GMPLS network that uses the Lagrangian relaxation method, which can estimate the lower bounds of the solution to a problem. This feature helps the designer of the problem to take the accuracy of the solution obtained by the calculation into consideration when he makes a decision to assign the solution to a real network in critical situations. A formulation of the problem and how to solve it using the Lagrangian relaxation method is described, and the results obtained by a prototype and considerations are shown in this paper.","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A starting-time-based approach to production scheduling with Particle Swarm Optimization 基于起始时间的粒子群优化生产调度方法
2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI: 10.1109/SCIS.2007.367679
J. Grobler, A. Engelbrecht, J. Joubert, S. Kok
{"title":"A starting-time-based approach to production scheduling with Particle Swarm Optimization","authors":"J. Grobler, A. Engelbrecht, J. Joubert, S. Kok","doi":"10.1109/SCIS.2007.367679","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367679","url":null,"abstract":"This paper provides a generic formulation for the complex scheduling problems of Optimatix, a South African company specializing in supply chain optimization. To address the complex requirements of the proposed problem, various additional constraints were added to the classical job shop scheduling problem. These include production downtime, scheduled maintenance, machine breakdowns, sequence-dependent set-up times, release dates and multiple predecessors per job. Differentiation between primary resources (machines) and auxiliary resources (labour, tools and jigs) were also achieved. Furthermore, this paper applies particle swarm optimization (PSO), a stochastic population based optimization technique originating from the study of social behavior of birds and fish, to the proposed problem. Apart from the significance of the paper in that the proposed problem has not been addressed before, the benefit of an improved production schedule can be generalized to include cost reduction, customer satisfaction, improved profitability and overall competitive advantage","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125697747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信