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

A bi-objective inventory routing problem by considering customer satisfaction level in context of perishable product 考虑易腐产品顾客满意度的双目标库存路径问题

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

M. Rahimi, A. Baboli, Y. Rekik

引用次数: 7

Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP 比较了分支定界混合算法与进化算法在TSP上的局部搜索及其混合算法

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

Yan Jiang, T. Weise, Jörg Lässig, R. Chiong, R. Athauda

{"title":"Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP","authors":"Yan Jiang, T. Weise, Jörg Lässig, R. Chiong, R. Athauda","doi":"10.1109/CIPLS.2014.7007174","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007174","url":null,"abstract":"Benchmarking is one of the most important ways to investigate the performance of metaheuristic optimization algorithms. Yet, most experimental algorithm evaluations in the literature limit themselves to simple statistics for comparing end results. Furthermore, comparisons between algorithms from different “families” are rare. In this study, we use the TSP Suite - an open source software framework - to investigate the performance of the Branch and Bound (BB) algorithm for the Traveling Salesman Problem (TSP). We compare this BB algorithm to an Evolutionary Algorithm (EA), an Ant Colony Optimization (ACO) approach, as well as three different Local Search (LS) algorithms. Our comparisons are based on a variety of different performance measures and statistics computed over the entire optimization process. The experimental results show that the BB algorithm performs well on very small TSP instances, but is not a good choice for any medium to large-scale problem instances. Subsequently, we investigate whether hybridizing BB with LS would give rise to similar positive results like the hybrid versions of EA and ACO have. This turns out to be true - the “Memetic” BB algorithms are able to improve the performance of pure BB algorithms significantly. It is worth pointing out that, while the results presented in this paper are consistent with previous findings in the literature, our results have been obtained through a much more comprehensive and solid experimental procedure.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"70 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":"128652142","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}

引用次数: 14

An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion 具有最大完工时间准则的混合流水车间问题的迭代贪心算法

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

Damla Kizilay, M. Tasgetiren, Q. Pan, Ling Wang

引用次数: 15

An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problem 一种改进的基于智能水滴算法的车辆路径优化方法

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

Zahra Booyavi, E. Teymourian, G. Komaki, S. Sheikh

引用次数: 16

Determining the cost impact of SCM system errors 确定SCM系统错误对成本的影响

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

John M. Medellin

{"title":"Determining the cost impact of SCM system errors","authors":"John M. Medellin","doi":"10.1109/CIPLS.2014.7007173","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007173","url":null,"abstract":"Software Configuration Management (SCM) auditing is the fourth of four sub processes recommended by the IEEE and the ACM in this area. This research is the continuation of ongoing experiments in the use of heuristics for predicting fault rates in systems that support SCM. This paper allocates financial indicators to the business model for a hypothetical Telecommunications company and predicts the potential financial error impact due to Configuration Management errors in the SCM system. This paper focuses on sampling first Use Cases in order to determine the error rates by Operating Profile and then using that knowledge in drawing samples of Test Cases. The 5,388 Test Cases were generated from sources available in open forums and they were injected with 4% of faults; 2.1% carried from Use Cases and 2% added. A total sampling of 492 items was conducted and was able to approximate the financial error rate in 6,006 items at an acceptable level with a 92% reduction in effort. The two stage sampling technique performed better than straight random sampling. When applied to the contribution from each Test Case, random sampling produced above a 6.87% error in the value chain estimate while two stage sampling produced under a 2.72% error in the same estimate.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"40 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":"132903137","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

Design of multi-product / multi-period closed-loop reverse logistics network using a genetic algorithm 基于遗传算法的多产品多周期闭环逆向物流网络设计

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

Helga J. Hernandez-Hernandez, J. Montoya-Torres, Fabricio Niebles Atencio

引用次数: 6

A two-layer optimization framework for UAV path planning with interval uncertainties 具有区间不确定性的无人机路径规划两层优化框架

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

Bai Li, R. Chiong, Mu Lin

引用次数: 8

A distance based variable neighborhood search for parallel machine scheduling 基于距离的可变邻域搜索并行机器调度

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

André Costa Batista, L. Batista

引用次数: 0

Realtime dynamic clustering for interference and traffic adaptation in wireless TDD system 无线TDD系统中实时动态聚类的干扰和业务适应

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

Mingliang Tao, Qimei Cui, Xiaofeng Tao, Haihong Xiao

{"title":"Realtime dynamic clustering for interference and traffic adaptation in wireless TDD system","authors":"Mingliang Tao, Qimei Cui, Xiaofeng Tao, Haihong Xiao","doi":"10.1109/CIPLS.2014.7007171","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007171","url":null,"abstract":"The dynamic time-division duplex (TDD) system is a recently proposed technology that can accommodate downlink (DL)/uplink (UL) traffic asymmetry and sufficiently utilize the spectrum resource. Its feature of sufficiency and flexibility will also induce a more sophisticated interference environment, which is known as interference mitigation and traffic adaptation (IMTA) problem. Clustering is a new idea which has been widely accepted to solve IMTA problem. However, most previous works just took large-scale path loss or coupling loss as criteria of the clustering schemes, thus the throughput performance would be limited by the varying traffic requirements among different small cells within one cluster. In this paper, a realtime dynamic cluster-based IMTA scheme is proposed and evaluated with dense deployment of small cells (SCs). Firstly, a new clustering criterion named Differentiating Metric (DM) is defined. Based on the defined DM value, a DM matrix is formed and further presented by a clustering graph. In the clustering graph, the dynamic clustering strategy is mapped to a MAX N-CUT problem, which is addressed in polynomial time by a proposed heuristic clustering algorithm. Furthermore, the system level simulation results demonstrate a promising improvement on uplink traffic throughput (UTP) in our proposed scheme compared with traditional clustering schemes.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"12 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":"125542239","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

A preliminary simulated annealing for resilience supply chains 弹性供应链的初步模拟退火

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

Hernan Chavez, K. Castillo-Villar

{"title":"A preliminary simulated annealing for resilience supply chains","authors":"Hernan Chavez, K. Castillo-Villar","doi":"10.1109/CIPLS.2014.7007167","DOIUrl":"https://doi.org/10.1109/CIPLS.2014.7007167","url":null,"abstract":"Most of the products imported from Mexico to U.S. can be classified as perishable. The United States Trade Representative has reported that the overall importations from Mexico to U.S. were equivalent to $16.4 billion during 2012. Due to the geographical location of both countries most of the transportation of products across the U.S. - Mexico border is road modal transportation. The inspection of trucks at the border entry points can take a long and unpredictable time. For perishable products, these inspections have a very important effect on their shelf life once they arrive to their destination. This paper presents a novel model that combines a metaheuristic with a simulation. The proposed method was coded in Matlab®. This model helps in the selection of the amount of product that will be sent through each of the available routes. Random length of disruptive inspection time and availability of servers at the entry points are very important for the Supply Chain (SC) that includes the transportation system of perishables from Mexico to U.S. The proposed Simulation-based Optimization Model (SimOpt) minimizes transportation time and transportation cost of agricultural products traded across the U.S. - Mexico border to build a resilient supply chain. This SimOpt model considers realistic continuous probability distributions for the inspection time. This variability also accounts for the availability of inspection servers and lanes in the points of entry. The solution procedure finds solutions for a weighted (time and freight cost) objective function. The results of a case study are presented.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"83 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":"124231197","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