International Journal of Industrial Engineering Computations最新文献

{"title":"Composite heuristics and water wave optimality algorithms for tri-criteria multiple job classes and customer order scheduling on a single machine","authors":"Lung-Yu Li, Win-Chin Lin, D. Bai, Xingong Zhang, Ameni Azzouz, Shuenn-Ren Cheng, Ya-Li Wu, Chin-Chia Wu","doi":"10.5267/j.ijiec.2023.2.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.2.002","url":null,"abstract":"Among the well-known scheduling problems, the customer order scheduling problem (COSP) has always been of great importance in manufacturing. To reflect the reality of COSPs as much as possible, this study considers that jobs from different orders are classified in various classes. This paper addresses a tri-criteria single-machine scheduling model with multiple job classes and customer orders on which the measurement minimizes a linear combination of the sum of the ranges of all orders, the tardiness of all orders, and the total completion times of all jobs. Due to the NP-hard complexity of the problem, a lower bound and a property are developed and utilized in a branch-and-bound for solving an exact solution. Afterward, four heuristics with three local improved searching methods each and a water wave optimality algorithm with four variants of wavelengths are proposed. The tested outputs report the performances of the proposed methods.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"41 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73330373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A joint replenishment problem with the (T,ki) policy under obsolescence","authors":"Ricardo Afonso, P. Godinho, J. Costa","doi":"10.5267/j.ijiec.2023.4.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.4.002","url":null,"abstract":"Companies are frequently confronted with the need to order different types of items from a single supplier or to manufacture the items in a production line. Indeed, coordinated ordering of multiple items may lead to important savings whenever a family of items can be ordered from a common supplier, produced in a common facility, or use a common mode of transportation. The Joint Replenishment Problem (JRP) tackles the coordinated replenishment of multiple items by minimizing the total cost, composed of ordering (or setup) costs and holding costs, while satisfying the demand. On the other hand, when items are subject to obsolescence, they may face an abrupt decline in demand as they are no longer needed. This decline can be caused by reasons such as rapid advancements in technology, going out of fashion, or ceasing to be economically viable. The present article develops an extension of the JRP where the items may suddenly become obsolete during an infinite planning horizon. The point at which an item becomes obsolete is uncertain. The lifetimes of the items are assumed to follow independent negative exponential distributions. A model is proposed by using the total expected discounted cost as the minimization criterion. The time value of money is considered through an appropriate discount rate. Extensive tests were performed to assess the impact of obsolescence rates and discount rates on the ordering policies. The progressive increase of the obsolescence rates determines smaller periods between successive replenishments, while the progressive increase of the discount rate determines smaller lot sizes.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"9 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75216412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sales mode selection strategic analysis for risk-averse manufacturers under revenue sharing contracts","authors":"Gui‐Hua Lin, Xiaoli Xiong, Yuwei Li, Xide Zhu","doi":"10.5267/j.ijiec.2022.11.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.11.001","url":null,"abstract":"This paper considers a sales mode selection problem under revenue sharing contracts between resale and agency modes for risk-averse manufacturers with traditional retail channel, direct selling channel, and e-commerce platform channel. By considering the factors including price competition intensity, market share, revenue sharing ratio, commission rate, and degree of risk aversion, we construct leader-follower game models with manufacturers as leaders and traditional retailers and e-commerce platforms as followers. To obtain optimal solutions, we discuss conditions to ensure the upper and lower models to be convex and then give the optimal strategies for all members in the network. Through numerical experiments, we analyze the involved parameters’ impact on sales mode selection strategy and the changing trends of each member's optimal pricing and profit under different sales modes. The numerical results reveal the following revelations: The manufacturer should choose the agency mode when the commission rate is low and the direct selling channel has a large market share. If both the commission rate and degree of risk aversion are high, direct selling channels have a low market share, and price competition intensity is weak, the manufacturer should choose the resale mode. The degree of risk aversion has an effect on each member’s optimal decision. Regardless of which sales mode the manufacturer chooses, the optimal price of each member decreases as the degree of risk aversion increases. Under certain conditions, the manufacturer’s choice of agency mode can create win-win situations with supply chain members.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"29 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82624392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows","authors":"Luka Matijević","doi":"10.5267/j.ijiec.2023.2.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.2.001","url":null,"abstract":"With the growing environmental concerns and the rising number of electric vehicles, researchers and companies are paying more and more attention to green logistics. This paper studies the Electric Vehicle Routing Problem with time-dependent speeds and soft time windows. The purpose is to minimize the total distance travelled, while penalizing early or late arrivals at the customers’ locations. For this purpose, we formulated the Mixed Integer Linear Program (MILP) and developed a General Variable Neighborhood Search (GVNS) metaheuristic, an efficient way to tackle this problem. To prove the efficiency of our approach, we tested the GVNS against the Adaptive Large Neighborhood Search (ALNS) algorithm and our MILP model, using a set of available benchmark instances. After an extensive experimental evaluation, we concluded that GVNS can find better quality solutions than other methods considered in this research or the same quality solution in less time.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135535137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bi-Objective simplified swarm optimization for fog computing task scheduling","authors":"Wei-Chang Yeh, Zhenyao Liu, Kuan-Cheng Tseng","doi":"10.5267/j.ijiec.2023.7.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.7.004","url":null,"abstract":"In the face of burgeoning data volumes, latency issues present a formidable challenge to cloud computing. This problem has been strategically tackled through the advent of fog computing, shifting computations from central cloud data centers to local fog devices. This process minimizes data transmission to distant servers, resulting in significant cost savings and instantaneous responses for users. Despite the urgency of many fog computing applications, existing research falls short in providing time-effective and tailored algorithms for fog computing task scheduling. To bridge this gap, we introduce a unique local search mechanism, Card Sorting Local Search (CSLS), that augments the non-dominated solutions found by the Bi-objective Simplified Swarm Optimization (BSSO). We further propose Fast Elite Selecting (FES), a ground-breaking one-front non-dominated sorting method that curtails the time complexity of non-dominated sorting processes. By integrating BSSO, CSLS, and FES, we are unveiling a novel algorithm, Elite Swarm Simplified Optimization (EliteSSO), specifically developed to conquer time-efficiency and non-dominated solution issues, predominantly in large-scale fog computing task scheduling conundrums. Computational evidence reveals that our proposed algorithm is both highly efficient in terms of time and exceedingly effective, outstripping other algorithms on a significant scale.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135784230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Extending the hypergradient descent technique to reduce the time of optimal solution achieved in hyperparameter optimization algorithms","authors":"F. Seifi, S. T. A. Niaki","doi":"10.5267/j.ijiec.2023.4.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.4.004","url":null,"abstract":"There have been many applications for machine learning algorithms in different fields. The importance of hyperparameters for machine learning algorithms is their control over the behaviors of training algorithms and their crucial impact on the performance of machine learning models. Tuning hyperparameters crucially affects the performance of machine learning algorithms, and future advances in this area mainly depend on well-tuned hyperparameters. Nevertheless, the high computational cost involved in evaluating the algorithms in large datasets or complicated models is a significant limitation that causes inefficiency of the tuning process. Besides, increased online applications of machine learning approaches have led to the requirement of producing good answers in less time. The present study first presents a novel classification of hyperparameter types based on their types to create high-quality solutions quickly. Then, based on this classification and using the hypergradient technique, some hyperparameters of deep learning algorithms are adjusted during the training process to decrease the search space and discover the optimal values of the hyperparameters. This method just needs only the parameters of the previous two steps and the gradient of the previous step. Finally, the proposed method is combined with other techniques in hyperparameter optimization, and the results are reviewed in two case studies. As confirmed by experimental results, the performance of the algorithms with the proposed method have been increased 36.62% and 23.16% (based on the best average accuracy) for Cifar10 and Cifar100 dataset respectively in early stages while the final produced answers with this method are equal to or better than the algorithms without it. Therefore, this method can be combined with hyperparameter optimization algorithms in order to improve their performance and make them more appropriate for online use by just using the parameters of the previous two steps and the gradient of the previous step.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"os-40 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87228503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The bid generation problem in combinatorial auctions for transportation service procurement","authors":"Fang Yang, Shengyin Li, Yao-Huei Huang","doi":"10.5267/j.ijiec.2023.4.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.4.003","url":null,"abstract":"In this work, a probabilistic bid generation problem with the pricing of a bundle of lanes and carrier’s vehicle routing is considered as it is an importation in transportation service procurement. Depending on the network of the vehicle, there exist multiple lanes for traveling between two locations. To solve the bid generation problem efficiently, a two-phase method approach is presented. At the core of the procedure a feasible vehicle routing problem on a multidigraph is solved by an exhaustive search algorithm to enumerate all routes concerning routing constraints and treat each route as a decision variable in the set partitioning formulation. We examine our model both analytically and empirically using a simulation-based analysis.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"9 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85951589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Unrelated parallel machine scheduling with machine processing cost","authors":"H. Safarzadeh, S. T. A. Niaki","doi":"10.5267/j.ijiec.2022.10.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.10.004","url":null,"abstract":"In practical scheduling problems, some factors such as depreciation cost, green costs like the amount of energy consumption or carbon emission, other resources consumption, raw material cost, etc., are not explicitly related to the machine processing times. Most of these factors can be generally considered as machine costs. Considering the machine cost as another objective alongside the other classical time-driven decision objectives can be an attractive work in scheduling problems. However, this subject has not been discussed thoroughly in the literature for the case the machines have fixed processing costs. This paper investigates a general unrelated parallel machine scheduling problem with the machine processing cost. In this problem, it is assumed that processing a job on a machine incurs a particular cost in addition to processing time. The considered objectives are the makespan and the total cost, which are minimized simultaneously to obtain Pareto optimal solutions. The efficacy of the mathematical programming approach to solve the considered problem is evaluated rigorously in this paper. In this respect, a multiobjective solution procedure is proposed to generate a set of appropriate Pareto solutions for the decision-maker based on the mathematical programming approach. In this procedure, the ϵ-constraint method is first used to convert the bi-objective optimization problem into single-objective problems by transferring the makespan to the set of constraints. Then, the single-objective problems are solved using the CPLEX software. Moreover, some strategies are also used to reduce the solution time of the problem. At the end of the paper, comprehensive numerical experiments are conducted to evaluate the performance of the proposed multiobjective solution procedure. A vast range of problem sizes is selected for the test problems, up to 50 machines and 500 jobs. Furthermore, some rigorous analyses are performed to significantly restrict the patterns of generating processing time and cost parameters for the problem instances. The experimental results demonstrate the mathematical programming solution approach's efficacy in solving the problem. It is observed that even for large-scale problems, a diverse set of uniformly distributed Pareto solutions can be generated in a reasonable time with the gaps from the optimality less than 0.03 most of the time.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"21 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89709087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimization for bi-objective express transportation network design under multiple topological structures","authors":"Jian Zhong, Xu Wang, Longxiao Li, Sergio García","doi":"10.5267/j.ijiec.2023.2.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.2.003","url":null,"abstract":"With the rapid development of the courier industry, customers are placing higher demands on the cost and delivery time of courier services. Therefore, this paper focuses on the bi-objective express transportation network design problem (BO-ETNDP) to minimize the operation cost and maximum arrival time. A multi-structure parallel design methodology (MS-PDM) is proposed to solve the BO-ETNDP. In this methodology, all topological structures commonly used in designing transportation networks are sorted out. For each topological structure, a novel bi-objective nonlinear mixed-integer optimization model for BO-ETNDP is developed considering the impact of the hub’s sorting efficiency on the operation cost and arrival time. To solve these models, a preference-based multi-objective algorithm (PB-MOA) is devised, which embeds the branch-and-cut algorithm and Pareto dominance theory in the framework of this ranking algorithm. In the case study, the applicability of the proposed methodology is verified in a real-world leading express company. The results show that our methodology can effectively avoid the limitation of solving the BO-ETNDP with a specific structure. Besides, the suitable topology for designing express transportation networks in different scenarios are explored through the sensitivity analysis.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135535136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A two-sided logistics matching method considering trading psychology and matching effort under a 4PL","authors":"Na Yuan, Haiming Liang, Min Huang, Qing Wang","doi":"10.5267/j.ijiec.2023.9.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.9.001","url":null,"abstract":"As a supply chain integrator, a fourth party logistics (4PL) typically does not have its own logistics facilities, so the 4PL needs to match third party logistics (3PLs) and customers to meet customers' logistics service demands. An effective matching method can not only improve the efficiency of 4PL supply chain management, but also establish more long-term and stable cooperative relationships with customers and 3PLs. Therefore, we propose a novel two-sided logistics matching method considering the trading psychology and matching effort of matching subjects under the 4PL. First, based on considering the trading psychology, the concepts of blocking pair and stable matching are redefined. Then, based on the public values and matching effort of customers and 3PLs, the evaluation values of customers and 3PLs are calculated. And the trading possibilities of customers and 3PLs are calculated by considering the fairness threshold. Next, we consider different stable matching demands of customers and 3PLs and develop a bi-objective matching model to maximize the trading possibilities of both customers and 3PLs. Furthermore, the properties of the proposed method are discussed. Finally, a numerical example and comparison analysis are provided to prove the feasibility and effectiveness of the proposed method.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135784058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}