Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.7.003
Guangyan Xu, Zailin Guan, Kai Peng, Lei Yue
In multi-stage machining-assembly production, collaborative scheduling for multiple production lines can effectively improve the execution efficiency of production planning and increase the effective output of the production system. In this paper, a production scheduling mathematical model was constructed for the collaborative scheduling problem of machining-assembly multi-production lines with kitting constraints, with the optimization objectives of minimizing assembly completion time and tardiness time. For the scheduling model, the product assembly process is constrained by the machining sequence of the jobs on the machining lines. Only by collaborating on the production scheduling schemes of the machine line and the assembly line as a whole can the output efficiency of the product on the assembly line be improved. An improved hybrid multi-objective optimization algorithm named SMOEA/D is designed to solve this scheduling model. The algorithm uses adaptive parents’ selection and mutation rate strategies and integrates the Tabu search strategy for the search process in the solution space when the solution of the sub-problem has not been improved after specified search generations, to improve the local search ability and search accuracy of MOEA/D algorithm. To verify the performance of the SMOEA/D algorithm in solving machining-assembly collaborative scheduling problems in production systems with different resource configurations and scales, two sets of numerical experiments were designed, corresponding to situations where the number of operations on each production line is equal or unequal. The running results of the proposed algorithm were compared with three other well-known multi-objective algorithms. The comparison results indicate that the SMOEA/D algorithm is effective and superior for solving such problems.
{"title":"Collaborative scheduling of machining-assembly in complex multiple parallel production lines environment considering kitting constraints","authors":"Guangyan Xu, Zailin Guan, Kai Peng, Lei Yue","doi":"10.5267/j.ijiec.2023.7.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.7.003","url":null,"abstract":"In multi-stage machining-assembly production, collaborative scheduling for multiple production lines can effectively improve the execution efficiency of production planning and increase the effective output of the production system. In this paper, a production scheduling mathematical model was constructed for the collaborative scheduling problem of machining-assembly multi-production lines with kitting constraints, with the optimization objectives of minimizing assembly completion time and tardiness time. For the scheduling model, the product assembly process is constrained by the machining sequence of the jobs on the machining lines. Only by collaborating on the production scheduling schemes of the machine line and the assembly line as a whole can the output efficiency of the product on the assembly line be improved. An improved hybrid multi-objective optimization algorithm named SMOEA/D is designed to solve this scheduling model. The algorithm uses adaptive parents’ selection and mutation rate strategies and integrates the Tabu search strategy for the search process in the solution space when the solution of the sub-problem has not been improved after specified search generations, to improve the local search ability and search accuracy of MOEA/D algorithm. To verify the performance of the SMOEA/D algorithm in solving machining-assembly collaborative scheduling problems in production systems with different resource configurations and scales, two sets of numerical experiments were designed, corresponding to situations where the number of operations on each production line is equal or unequal. The running results of the proposed algorithm were compared with three other well-known multi-objective algorithms. The comparison results indicate that the SMOEA/D algorithm is effective and superior for solving such problems.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"41 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":"135784229","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}
A multi-objective dynamic demand split delivery emergency material distribution model is developed to enhance the efficiency of emergency material distribution and facilitate the smooth progress of safety rescue operations during unconventional emergencies. This model incorporates the psychological view of those affected by disasters. The issue of dynamic demand may be transformed into a static demand problem by dividing the distribution time window into time domains of equal length. The optimization process is thereafter executed in real-time with the timed batch methodology. A refined ant colony method has been developed to address the model by integrating the attributes of the mathematical model, followed by doing an arithmetic case analysis. The findings indicate that the algorithm and mathematical model suggested in this study are efficacious in addressing the emergency material distribution issue, offering valuable decision-making advice and reference.
{"title":"Optimization of emergency supplies paths based on dynamic real-time split deliver","authors":"Xixi Zhang, Shuai Chen, Qingkui Cao, Xiangyang Ren","doi":"10.5267/j.ijiec.2023.9.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.9.003","url":null,"abstract":"A multi-objective dynamic demand split delivery emergency material distribution model is developed to enhance the efficiency of emergency material distribution and facilitate the smooth progress of safety rescue operations during unconventional emergencies. This model incorporates the psychological view of those affected by disasters. The issue of dynamic demand may be transformed into a static demand problem by dividing the distribution time window into time domains of equal length. The optimization process is thereafter executed in real-time with the timed batch methodology. A refined ant colony method has been developed to address the model by integrating the attributes of the mathematical model, followed by doing an arithmetic case analysis. The findings indicate that the algorithm and mathematical model suggested in this study are efficacious in addressing the emergency material distribution issue, offering valuable decision-making advice and reference.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"2020 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":"135784055","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.6.002
Yuan-Shyi P. Chiu, Hung-Yi Chen, Victoria Chiu, Singa Wang Chiu, Hsiao-Chun Wu
The present research explores the collective influence of quality assurance and postponement on a hybrid multiproduct replenishing-delivery decision-making. Assume the required multiproduct has a standard (common) component, and our replenishing-delivery model has incorporated a two-phase postponement strategy. The first phase makes all standard components and hires an external supplier to partially provide the required parts to cut short the needed uptime. In contrast, the second phase fabricates the finished multiproduct in sequence. To ensure the desired merchandise quality, we apply a quality-assurance action to the in-house processes to screen and remove scrap items and rework the repairable defects in both stages. Upon completing each merchandise, these products are transported to the customer in n fixed-quantity shipment in fixed-time intervals. We employ math modeling and formulating approaches to gain the overall supply-chain operating expenses comprising subcontracting, fabricating, stock holding, transportation, and customer holding costs. By minimizing system operating expenses, this research determines the optimal replenishing-delivery policy. Lastly, we give a numerical example to demonstrate our study’s applicability and usefulness/capability for facilitating managerial decision-making.
{"title":"The joint influence of quality assurance and postponement on a hybrid multi-item manufacturing-delivery decision-making","authors":"Yuan-Shyi P. Chiu, Hung-Yi Chen, Victoria Chiu, Singa Wang Chiu, Hsiao-Chun Wu","doi":"10.5267/j.ijiec.2023.6.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.6.002","url":null,"abstract":"The present research explores the collective influence of quality assurance and postponement on a hybrid multiproduct replenishing-delivery decision-making. Assume the required multiproduct has a standard (common) component, and our replenishing-delivery model has incorporated a two-phase postponement strategy. The first phase makes all standard components and hires an external supplier to partially provide the required parts to cut short the needed uptime. In contrast, the second phase fabricates the finished multiproduct in sequence. To ensure the desired merchandise quality, we apply a quality-assurance action to the in-house processes to screen and remove scrap items and rework the repairable defects in both stages. Upon completing each merchandise, these products are transported to the customer in n fixed-quantity shipment in fixed-time intervals. We employ math modeling and formulating approaches to gain the overall supply-chain operating expenses comprising subcontracting, fabricating, stock holding, transportation, and customer holding costs. By minimizing system operating expenses, this research determines the optimal replenishing-delivery policy. Lastly, we give a numerical example to demonstrate our study’s applicability and usefulness/capability for facilitating managerial decision-making.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"206 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":"135784223","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.8.001
Shuo Shi, Sixiao Gao
The challenge presented by simultaneous buffer and service rate allocation in manufacturing systems represents a difficult non-deterministic polynomial problem. Previous studies solved this problem by iteratively utilizing a generative method and an evaluative method. However, it typically takes a long computation time for the evaluative method to achieve high evaluation accuracy, while the satisfactory solution quality realized by the generative method requires a certain number of iterations. In this study, a data-driven hybrid approach is developed by integrating a tabu search–non-dominated sorting genetic algorithm II with a whale optimization algorithm–gradient boosting regression tree to maximize the throughput and minimize the average buffer level of a manufacturing system subject to a total buffer capacity and total service rate. The former algorithm effectively searches for candidate simultaneous allocation solutions by integrating global and local search strategies. The prediction models built by the latter algorithm efficiently evaluate the candidate solutions. Numerical examples demonstrate the efficacy of the proposed approach. The proposed approach improves the solution efficiency of simultaneous allocation, contributing to dynamic production resource reconfiguration of manufacturing systems.
{"title":"Multi-objective optimization of simultaneous buffer and service rate allocation in manufacturing systems based on a data-driven hybrid approach","authors":"Shuo Shi, Sixiao Gao","doi":"10.5267/j.ijiec.2023.8.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.8.001","url":null,"abstract":"The challenge presented by simultaneous buffer and service rate allocation in manufacturing systems represents a difficult non-deterministic polynomial problem. Previous studies solved this problem by iteratively utilizing a generative method and an evaluative method. However, it typically takes a long computation time for the evaluative method to achieve high evaluation accuracy, while the satisfactory solution quality realized by the generative method requires a certain number of iterations. In this study, a data-driven hybrid approach is developed by integrating a tabu search–non-dominated sorting genetic algorithm II with a whale optimization algorithm–gradient boosting regression tree to maximize the throughput and minimize the average buffer level of a manufacturing system subject to a total buffer capacity and total service rate. The former algorithm effectively searches for candidate simultaneous allocation solutions by integrating global and local search strategies. The prediction models built by the latter algorithm efficiently evaluate the candidate solutions. Numerical examples demonstrate the efficacy of the proposed approach. The proposed approach improves the solution efficiency of simultaneous allocation, contributing to dynamic production resource reconfiguration of manufacturing systems.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"92 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":"135784224","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.3.002
Andrés Arias Londoño, W. González, Oscar Danilo Montoya Giraldo, J. Escobar
Operations with Electric Vehicles (EVs) on logistic companies and power utilities are increasingly related due to the charging stations representing the point of standard coupling between transportation and power networks. From this perspective, the Multi-depot Electric Vehicle Routing Problem (MDEVRP) is addressed in this research, considering a novel hybrid matheheuristic approach combining exact approaches and a Chu-Beasley Genetic Algorithm. An existing conflict is shown in three objectives handled through the experimentations: routing cost, cost of charging stations, and increased cost due to energy losses. EVs driving range is chosen as the parameter to perform the sensitivity analysis of the proposed MDEVRP. A 25-customer transportation network conforms to a newly designed test instance for methodology validation, spatially combined with a 33 nodes power distribution system.
{"title":"A new matheheuristic approach based on Chu-Beasley genetic approach for the multi-depot electric vehicle routing problem","authors":"Andrés Arias Londoño, W. González, Oscar Danilo Montoya Giraldo, J. Escobar","doi":"10.5267/j.ijiec.2023.3.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.3.002","url":null,"abstract":"Operations with Electric Vehicles (EVs) on logistic companies and power utilities are increasingly related due to the charging stations representing the point of standard coupling between transportation and power networks. From this perspective, the Multi-depot Electric Vehicle Routing Problem (MDEVRP) is addressed in this research, considering a novel hybrid matheheuristic approach combining exact approaches and a Chu-Beasley Genetic Algorithm. An existing conflict is shown in three objectives handled through the experimentations: routing cost, cost of charging stations, and increased cost due to energy losses. EVs driving range is chosen as the parameter to perform the sensitivity analysis of the proposed MDEVRP. A 25-customer transportation network conforms to a newly designed test instance for methodology validation, spatially combined with a 33 nodes power distribution system.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"1 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87021281","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.5.002
Cuicui Wang, Yanle Xie, Hua Wang
This paper explores the impact of retailers' corporate social responsibility (CSR) and manufacturers' overconfidence on manufacturers' carbon reduction in sustainable supply chains. We analyze the profits of manufacturers and retailers under different scenarios and explore the social welfare and environmental impacts under CSR. Our results suggest that retailers' CSR and manufacturers' overconfidence contribute positively to promoting carbon mitigation and reducing environmental impacts under certain conditions. However, with increasing CSR and manufacturer overconfidence levels, manufacturers are more likely to lead to worse environmental impacts and carbon emission reduction. In addition, we show that when the manufacturer's overconfidence level is high, manufacturers and retailers are more profitable and contribute to carbon emission reductions in the manufacturer without overconfidence (retailer without CSR) scenario. Moreover, we find that firms have the higher potential to capture optimal overall social welfare in the presence of retailers with CSR and manufacturer overconfidence.
{"title":"Low carbon decision-making model under the combined effect of corporate social responsibility and overconfidence","authors":"Cuicui Wang, Yanle Xie, Hua Wang","doi":"10.5267/j.ijiec.2023.5.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.5.002","url":null,"abstract":"This paper explores the impact of retailers' corporate social responsibility (CSR) and manufacturers' overconfidence on manufacturers' carbon reduction in sustainable supply chains. We analyze the profits of manufacturers and retailers under different scenarios and explore the social welfare and environmental impacts under CSR. Our results suggest that retailers' CSR and manufacturers' overconfidence contribute positively to promoting carbon mitigation and reducing environmental impacts under certain conditions. However, with increasing CSR and manufacturer overconfidence levels, manufacturers are more likely to lead to worse environmental impacts and carbon emission reduction. In addition, we show that when the manufacturer's overconfidence level is high, manufacturers and retailers are more profitable and contribute to carbon emission reductions in the manufacturer without overconfidence (retailer without CSR) scenario. Moreover, we find that firms have the higher potential to capture optimal overall social welfare in the presence of retailers with CSR and manufacturer overconfidence.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"39 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79724326","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2022.10.003
Xingkai Wang, Weimin Wu, Zichao Xing
Automated guided vehicle (AGV) is widely used in automated manufacturing systems as a material handling tool. Although the task scheduling problem with isomorphic AGV has remained a very active research field through the years, too little work has been devoted to the task scheduling problems with heterogeneous AGVs. A coupled task with heterogeneous AGVs is a complex task that needs the cooperation of more than one type of AGVs. In this paper, a manufacturing system with two types of AGVs and three types of tasks is studied. To solve the coupled task scheduling problem with heterogeneous AGVs in this manufacturing system, we introduce two new methods based on the established mathematical model, namely, the decoupled scheduling strategy and coupled scheduling strategy with multi-decision model. The decoupled scheduling strategy is widely used in coupled task scheduling problems. However, there are some situations that the decoupled scheduling strategy cannot solve the problem well. To overcome the problem, the multi-decision point model solves the coupled task scheduling problem without decomposition. In order to ensure the searching speed and searching accuracy, a novel hybrid heuristic algorithm based on simulated annealing algorithm and tabu search algorithm is developed. The simulation experiment results show the proposed coupled scheduling algorithm has priority in coupled task scheduling problems.
{"title":"Multi-decision points model to solve coupled-task scheduling problem with heterogeneous multi-AGV in manufacturing systems","authors":"Xingkai Wang, Weimin Wu, Zichao Xing","doi":"10.5267/j.ijiec.2022.10.003","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.10.003","url":null,"abstract":"Automated guided vehicle (AGV) is widely used in automated manufacturing systems as a material handling tool. Although the task scheduling problem with isomorphic AGV has remained a very active research field through the years, too little work has been devoted to the task scheduling problems with heterogeneous AGVs. A coupled task with heterogeneous AGVs is a complex task that needs the cooperation of more than one type of AGVs. In this paper, a manufacturing system with two types of AGVs and three types of tasks is studied. To solve the coupled task scheduling problem with heterogeneous AGVs in this manufacturing system, we introduce two new methods based on the established mathematical model, namely, the decoupled scheduling strategy and coupled scheduling strategy with multi-decision model. The decoupled scheduling strategy is widely used in coupled task scheduling problems. However, there are some situations that the decoupled scheduling strategy cannot solve the problem well. To overcome the problem, the multi-decision point model solves the coupled task scheduling problem without decomposition. In order to ensure the searching speed and searching accuracy, a novel hybrid heuristic algorithm based on simulated annealing algorithm and tabu search algorithm is developed. The simulation experiment results show the proposed coupled scheduling algorithm has priority in coupled task scheduling problems.","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":"82888562","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2022.8.004
Juan Sebastián Herrera-Cobo, J. Escobar, D. Álvarez-Martínez
The increasing accumulation of solid waste worldwide has made it necessary to look for alternatives that improve the operation of recyclable waste collection systems to make waste treatment more profitable and eco-friendlier. This paper introduces a new variant of the multi-compartment vehicle routing problem (MCVRP) that considers the rearrangement or relocation of collection points and packing the demand. This problem is called the location packing multi-compartment vehicle routing problem (LPMCVRP) and is developed for a waste collection system using vehicles with flexible compartments. A mathematical formulation of the problem is proposed. A two-phase metaheuristic algorithm based on a tabu search without packing considerations and a variant that integrates a tabu search and a greedy randomized adaptive search procedure (GRASP) scheme with packing constraints have been proposed. A set of instances adapted from the literature is generated to validate the proposed solution strategy. The results obtained show the efficiency of the proposed solution scheme for optimizing collection systems.
{"title":"Metaheuristic algorithm for the location, routing and packing problem in the collection of recyclable waste","authors":"Juan Sebastián Herrera-Cobo, J. Escobar, D. Álvarez-Martínez","doi":"10.5267/j.ijiec.2022.8.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.8.004","url":null,"abstract":"The increasing accumulation of solid waste worldwide has made it necessary to look for alternatives that improve the operation of recyclable waste collection systems to make waste treatment more profitable and eco-friendlier. This paper introduces a new variant of the multi-compartment vehicle routing problem (MCVRP) that considers the rearrangement or relocation of collection points and packing the demand. This problem is called the location packing multi-compartment vehicle routing problem (LPMCVRP) and is developed for a waste collection system using vehicles with flexible compartments. A mathematical formulation of the problem is proposed. A two-phase metaheuristic algorithm based on a tabu search without packing considerations and a variant that integrates a tabu search and a greedy randomized adaptive search procedure (GRASP) scheme with packing constraints have been proposed. A set of instances adapted from the literature is generated to validate the proposed solution strategy. The results obtained show the efficiency of the proposed solution scheme for optimizing collection systems.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"25 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77346368","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2023.3.001
Na Yuan, Xiaohu Qian, Min Huang, Haiming Liang, Andrew W. H. Ip, K. Yung
Reverse auction is an effective tool for a 4PL to purchase transportation services. This paper investigated a new transportation services procurement problem for 4PL, which involves three features: the 4PL’s loss-averse behavior, price and non-price attributes, and multiple transportation requests. An efficient multi-attribute multi-item reverse auction mechanism considering the 4PL ex-ante and ex-post satisfaction (EES-MMRA) is proposed to purchase transportation services for the 4PL. In the EES-MMRA, integrating the allocation rule with the 4PL ex-ante satisfaction, a 0-1 programming model is constructed to determine winning 3PLs and obtain efficient allocations. Then, a payment rule considering the 4PL ex-post satisfaction is established to ensure truthful bidding of 3PLs. And we discuss some desirable properties (e.g., incentive compatibility, individual rationality, efficiency, and budget balance properties) to justify the EES-MMRA mechanism, subsequently. Next, several numerical experiments are conducted to demonstrate the effectiveness and applicability of the EES-MMRA mechanism. Furthermore, sensitivity analysis presents the influences of the weights of the non-price attributes, risk attitude coefficients, and loss aversion coefficients. Finally, we conduct comparison analysis to show the advantages of the EES-MMRA mechanism over the known Vickrey–Clark–Groves (P-VCG) mechanism.
{"title":"An efficient multi-attribute multi-item auction mechanism with ex-ante and ex-post satisfaction for 4PL transportation service procurement","authors":"Na Yuan, Xiaohu Qian, Min Huang, Haiming Liang, Andrew W. H. Ip, K. Yung","doi":"10.5267/j.ijiec.2023.3.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.3.001","url":null,"abstract":"Reverse auction is an effective tool for a 4PL to purchase transportation services. This paper investigated a new transportation services procurement problem for 4PL, which involves three features: the 4PL’s loss-averse behavior, price and non-price attributes, and multiple transportation requests. An efficient multi-attribute multi-item reverse auction mechanism considering the 4PL ex-ante and ex-post satisfaction (EES-MMRA) is proposed to purchase transportation services for the 4PL. In the EES-MMRA, integrating the allocation rule with the 4PL ex-ante satisfaction, a 0-1 programming model is constructed to determine winning 3PLs and obtain efficient allocations. Then, a payment rule considering the 4PL ex-post satisfaction is established to ensure truthful bidding of 3PLs. And we discuss some desirable properties (e.g., incentive compatibility, individual rationality, efficiency, and budget balance properties) to justify the EES-MMRA mechanism, subsequently. Next, several numerical experiments are conducted to demonstrate the effectiveness and applicability of the EES-MMRA mechanism. Furthermore, sensitivity analysis presents the influences of the weights of the non-price attributes, risk attitude coefficients, and loss aversion coefficients. Finally, we conduct comparison analysis to show the advantages of the EES-MMRA mechanism over the known Vickrey–Clark–Groves (P-VCG) mechanism.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"38 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85379834","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}
Pub Date : 2023-01-01DOI: 10.5267/j.ijiec.2022.12.005
Xu Wang, Jian Zhong
During the spread of the epidemic, the home delivery service (HDS) has been quickly introduced by retailers which helps customers avoid the risk of viral infection while shopping at offline stores. However, the operation cost of HDS is a huge investment for O2O retailers. How to minimize the operating costs of HDS is an urgent issue for the industry. To solve this problem, we outline those management decisions of HDS that have an impact on operating costs, including dynamic vehicle routing, driver sizing and scheduling, and propose an integrated optimization model by comprehensively considering these management decisions. Moreover, the dynamic feature of online orders and the heterogeneous workforces are also considered in this model. To solve this model, an efficient adaptive large neighborhood search (ALNS) and branch-and-cut algorithms are developed. In the case study, we collected real data from a leading O2O retailer in China to assess the effectiveness of our proposed model and algorithms. Experimental results show that our approach can effectively reduce the operating costs of HDS. Furthermore, a comprehensive analysis is conducted to reveal the changing patterns in operating costs, and some valuable management insights are provided for O2O retailers. The theoretical and numerical results would shed light on the management of HDS for O2O retailers.
{"title":"An integrated optimization for minimizing the operation cost of home delivery services in O2O retail","authors":"Xu Wang, Jian Zhong","doi":"10.5267/j.ijiec.2022.12.005","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.12.005","url":null,"abstract":"During the spread of the epidemic, the home delivery service (HDS) has been quickly introduced by retailers which helps customers avoid the risk of viral infection while shopping at offline stores. However, the operation cost of HDS is a huge investment for O2O retailers. How to minimize the operating costs of HDS is an urgent issue for the industry. To solve this problem, we outline those management decisions of HDS that have an impact on operating costs, including dynamic vehicle routing, driver sizing and scheduling, and propose an integrated optimization model by comprehensively considering these management decisions. Moreover, the dynamic feature of online orders and the heterogeneous workforces are also considered in this model. To solve this model, an efficient adaptive large neighborhood search (ALNS) and branch-and-cut algorithms are developed. In the case study, we collected real data from a leading O2O retailer in China to assess the effectiveness of our proposed model and algorithms. Experimental results show that our approach can effectively reduce the operating costs of HDS. Furthermore, a comprehensive analysis is conducted to reveal the changing patterns in operating costs, and some valuable management insights are provided for O2O retailers. The theoretical and numerical results would shed light on the management of HDS for O2O retailers.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"62 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79025875","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：