Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem
Helmut-Schmidt-University, University of the Federal Armed Forces Hamburg(赫尔穆特·施密特大学(汉堡联邦国防军大学))
Martin Josef Geiger
发表信息:
In: Graham Kendall, Greet Vanden Berghe, and Barry McCollum (editors): Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications, August 27-29, 2013, Gent, Belgium, pages 807-811
The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e.g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decision variable values, a set of side constraints, such as resource availabilities, precedence constraints, etc., has to be respected.
In 2013, the MISTA 2013 Challenge stipulated research in the RCMMMPSP. It's goal was the solution of a given set of instances under running time restrictions. We have contributed to this challenge with the here presented approach.
Refined Iterated Pareto Greedy for Energy-aware Hybrid Flowshop Scheduling with Blocking Constraints
Department of Computer Science(计算机科学系);University College Cork(科尔克大学);Process, Energy and Transport Engineering(过程、能源与运输工程);Munster Technological University(穆斯林技术大学)
Tree-based iterated local search for Markov random fields with applications in image analysis
Deakin University(迪肯大学)
一般结构马尔可夫随机场(MRF)的\emph{maximum a posteriori}(MAP)分配在计算上是困难的.在本文中,我们利用基于树的方法来有效地解决这个问题。我们的新方法,命名为基于树的迭代局部搜索(T-ILS)利用了MRF中嵌入的树结构的易处理性,从而在ILS框架中获得强大的局部搜索。该方法有效地探索指数大的邻域,这样做与有限的内存没有任何要求的成本函数。我们评估的T-ILS在伊辛模型和两个现实世界中的问题,计算机视觉:立体匹配,图像去噪的模拟。实验结果表明,我们的方法是有竞争力的国家的最先进的竞争对手具有显着的计算增益。
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads
Instituto de Computação – Universidade Federal Fluminense(联邦弗卢米嫩塞大学计算机学院);Departamento de Engenharia Industrial – Pontifícia Universidade Católica do Rio de Janeiro(天主教里约热内卢大学工业工程系);Departamento de Informática – Pontifícia Universidade Católica do Rio de Janeiro(天主教里约热内卢大学计算机系);Departamento de Computação – Universidade Federal de Ouro Preto(联邦乌贝兰迪亚大学计算机系);Department of Business Administration – Universität Wien(维也纳大学工商管理系)
Discrete Differential Evolution Particle Swarm Optimization Algorithm for Energy Saving Flexible Job Shop Scheduling Problem Considering Machine Multi States
Business School, Shandong Normal University(山东师范大学商学院);School of Mathematics, Yunnan Normal University(云南师范大学数学学院);School of Physics and Electronics, Shandong Normal University(山东师范大学物理与电子科学学院)
Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling
Nanyang Technological University(南洋理工大学);Eindhoven University of Technology(埃因霍温理工大学);Singapore Management University(新加坡管理大学);Shandong University(山东大学);Agency for Science Technology and Research (A*STAR)(新加坡科技研究局)
Learning Memory-Enhanced Improvement Heuristics for Flexible Job Shop Scheduling
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education(教育部符号计算与知识工程重点实验室);College of Software(软件学院);College of Computer Science and Technology(计算机科学与技术学院);Singapore Management University(新加坡管理大学);Nanyang Technological University(南洋理工大学)
Integrated packing, placement, scheduling, and routing of personalized production: a pharmaceutical Industry 4.0 use-case with a planar transport system
Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague(捷克信息学、机器人学与自动化技术研究所,布拉格技术大学);Faculty of Electrical Engineering, Czech Technical University in Prague(布拉格技术大学电子工程系);Department of Chemical Engineering, University of Chemistry and Technology(化学与技术大学化工系)
Zuse Institute Berlin(柏林祖斯研究所);Hochschule für Technik und Wirtschaft Berlin(柏林工程与经济应用技术大学);Google Research(谷歌研究院);Technische Universität Berlin(柏林工业大学)
A Random-Key Optimizer for Combinatorial Optimization
Federal U. of São Paulo(巴西圣保罗联邦大学);Amazon Advanced Solutions Lab(亚马逊高级解决方案实验室);DIMACS;University of Southampton(南安普顿大学);Federal U. of Pernambuco(巴西佩雷布鲁克联邦大学)