2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)最新文献_第2页

GPU accelerated NEH algorithm GPU加速NEH算法

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007169

Magdalena Metlicka, D. Davendra, F. Hermann, M. Meier, Matthias Amann

引用次数: 6

A bi-objective model for local and global green supply chain 本地和全球绿色供应链的双目标模型

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007165

N. Smith, Mario G. Manzano, K. Castillo-Villar, Luis A. Rivera-Morales

引用次数: 2

A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop 排列流车间加权总延迟最小的混合和谐搜索算法

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007154

M. Komaki, S. Sheikh, E. Teymourian

{"title":"A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop","authors":"M. Komaki, S. Sheikh, E. Teymourian","doi":"10.1109/CIPLS.2014.7007154","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007154","url":null,"abstract":"We address the permutation flow shop scheduling problem with sequence dependent setup times between jobs. Each job has its weight of importance as well as due date. The goal is to find sequence of jobs such that total weighted tardiness of jobs is minimized. Due to NP-Hard complexity of this problem, a hybrid meta-heuristic algorithm based on Harmony Search Algorithm is developed. In the proposed algorithm, a new acceptance criterion of new improvised harmony is suggested which allows the algorithm to explore the solution space in earlier iterations (diversification), and as algorithm progresses the acceptance criterion leads the algorithm to accept the solutions in neighborhood of the current solution, (intensification). In order to improve the search ability of the algorithm, Variable Neighborhood Search Algorithm is applied to improve the quality of generated harmony. The computational experiments based on well-known benchmark instances are conducted. Results show that the proposed algorithm outperforms other state of the art algorithm used for solving studied problem.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"58 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132900958","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}

引用次数: 15

Iterated local search with neighborhood space reduction for two-echelon distribution network for perishable products 易逝品两梯次配送网络的邻域空间约简迭代局部搜索

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007163

Sona Kande, C. Prins, Lucile Belgacem, Benjamin Redon

{"title":"Iterated local search with neighborhood space reduction for two-echelon distribution network for perishable products","authors":"Sona Kande, C. Prins, Lucile Belgacem, Benjamin Redon","doi":"10.1109/CIPLS.2014.7007163","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007163","url":null,"abstract":"This article presents a planning problem in a distribution network incorporating two levels of inventory management. Perishable products are routed with lot-sizing, multi-sourcing and limited transport capacity using a homogeneous fleet of vehicles. A mixed integer linear programming (MILP) and a greedy heuristic have been developed to solve this real planning problem. There are some instances for which the solver cannot give a good lower bound within the limited time and for other instances it takes a lot of time to solve MILP. The greedy heuristic is an alternative to the mixed integer linear program, used to quickly solve some large instances taking into account original and difficult constraints. For some instances the gap between the solution provided by the solver (MILP) and the heuristic becomes quite significant. An iterated local search (ILS) using the variable neighborhood descent (VND) method has been implemented to improve the quality of heuristic solutions. We have included the ILS method in an APS (Advanced Planning System) and have compared it with an exact resolution of the MILP. Two types of instances are tested: models derived from actual data and models built using a random generator of instances that have wider diversity for computational evaluation. The ILS procedure significantly improves the quality of solutions and average computational time is much shorter than MILP resolution.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126180825","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

Managing inventories in multi-echelon on-line retail fulfillment system with different response lead time demands 多级在线零售物流系统中不同响应时间要求的库存管理

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007164

Juan Li, J. Muckstadt

引用次数: 2

A genetic algorithm with an embedded Ikeda map applied to an order picking problem in a multi-aisle warehouse 将嵌入池田地图的遗传算法应用于多通道仓库的拣货问题

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007161

Michael Stauffer, Remo Ryter, D. Davendra, Rolf Dornberger, T. Hanne

引用次数: 4

An agent-based approach to simulate production, degradation, repair, replacement and preventive maintenance of manufacturing systems 一个基于代理的方法来模拟生产，退化，维修，更换和预防性维护制造系统

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007157

E. Alsina, Giacomo Cabri, A. Regattieri

{"title":"An agent-based approach to simulate production, degradation, repair, replacement and preventive maintenance of manufacturing systems","authors":"E. Alsina, Giacomo Cabri, A. Regattieri","doi":"10.1109/CIPLS.2014.7007157","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007157","url":null,"abstract":"The capacity to reconfigure production systems is considered fundamental for today's factories because of increasing demand for a high-level customer service (in terms of lead time and price). For this reason, the ability to simulate the productivity of a specific production line configuration can be a great assistance to the decision making process. This paper presents a multi-agent model used to simulate the failure behavior of a complex line production. This approach offers a decentralized alternative to designing decision-making system based on the simulation of distributed entities. The model is able to independently manage the variations in production rates and the tendency to fail, caused by the degradation of machines, repair actions, and replacements. In addition, random failures and preventive maintenance on the manufacturing system of a single product were considered. The blackboard system and the contract net protocol have inspired the coordination of the productivity of the different machines in the production line, to simulate the most feasible and balanced productivity for different states of the line.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134622191","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}

引用次数: 4

A coordination mechanism for capacitated lot-sizing in non-hierarchical n-tier supply chains 非分层n层供应链中有容量批量的协调机制

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007155

F. Reiss, Tobias Buer

{"title":"A coordination mechanism for capacitated lot-sizing in non-hierarchical n-tier supply chains","authors":"F. Reiss, Tobias Buer","doi":"10.1109/CIPLS.2014.7007155","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007155","url":null,"abstract":"In the context of an n-tier supply chain, a coalition of agents is considered that has to jointly solve a distributed multi-level capacitated lot-sizing problem in order to minimize the agents joint total costs. Due to asymmetric information between the agents, e.g., with respect to setup costs, inventory holding costs or available machine capacities, this problem cannot be solved by a single, central decision maker. Therefore, this paper introduces a coordination mechanism to enable collaborative planning by taking asymmetric information into account. Furthermore, the coordination mechanism is able to deal with non-hierarchical assignment of items to agents within a mutual bill of material. To evaluate the coordination mechanism, test instances for the classical multi-level capacitated lot sizing problem are extended. A computational study shows that the coordination mechanism works well for instances without setup times. That is, for these instances solution quality for the distributed case deviates on average by less than five percent from best-known solutions in the non-distributed case.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115059044","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

Common due-window problem: Polynomial algorithms for a given processing sequence 常见的随窗问题:给定处理序列的多项式算法

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007158

A. Awasthi, Jörg Lässig, Oliver Kramer, T. Weise

{"title":"Common due-window problem: Polynomial algorithms for a given processing sequence","authors":"A. Awasthi, Jörg Lässig, Oliver Kramer, T. Weise","doi":"10.1109/CIPLS.2014.7007158","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007158","url":null,"abstract":"The paper considers the Common Due-Window (CDW) problem where a single machine processes a certain number of jobs against a common due-window. Each job possesses different processing times but different and asymmetric earliness and tardiness penalties. The objective of the problem is to find the processing sequence of jobs, their completion times and the position of the given due-window to minimize the total penalty incurred due to tardiness and earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for a single machine with the run-time complexity of O(n2), where n is the number of jobs. We also provide an O(n) algorithm for optimizing the CDW with unit processing times. The algorithms take a sequence consisting of all the jobs (Ji, i = 1, 2, ..., n) as input and return the optimal completion times, which offers the minimum possible total penalty for the sequence. Furthermore, we implement our polynomial algorithms in conjunction with Simulated Annealing (SA) to obtain the best processing sequence. We compare our results with that of Biskup and Feldmann for different due-window lengths.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132784149","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

Solving capacitated vehicle routing problem by artificial bee colony algorithm 用人工蜂群算法求解有能力车辆路径问题

2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) Pub Date : 2014-12-01 DOI: 10.1109/CIPLS.2014.7007160

Alberto Gómez, S. Salhi

引用次数: 16