The optimization of bi-objective vehicle routing problem has become a research hotspot in recent years. In this paper, a time-dependent and bi-objective vehicle routing problem with time windows (TD-BO-VRPTW) is proposed, which is a new extension of classical vehicle routing problem. Time-dependency is presented for the situation that vehicle’s travel speed is affected by its departure time and the distance between two customers. The total transportation costs and time costs are two objectives optimized simultaneously through constructing a bi-objective mixed integer linear programming model. To deal with this problem, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to obtain the Pareto optimal solution set. In the numerical examples, the RC108 from Solomon's benchmark set is employed and the results in the Pareto front show the efficiency of NSGA-II for the TD-BO-VRPTW. To further test the performance of this algorithm, two objectives are optimized separately and then the sum of two objectives is also optimized. Through comparing these results with solutions in the Pareto front, it can be concluded that the algorithm is reliable, and the results in Pareto front are competitive because there is a trade-off between two objectives.
{"title":"Time-dependent and bi-objective vehicle routing problem with time windows","authors":"P. Zhao, W. Luo, X. Han","doi":"10.14743/APEM2019.2.322","DOIUrl":"https://doi.org/10.14743/APEM2019.2.322","url":null,"abstract":"The optimization of bi-objective vehicle routing problem has become a research hotspot in recent years. In this paper, a time-dependent and bi-objective vehicle routing problem with time windows (TD-BO-VRPTW) is proposed, which is a new extension of classical vehicle routing problem. Time-dependency is presented for the situation that vehicle’s travel speed is affected by its departure time and the distance between two customers. The total transportation costs and time costs are two objectives optimized simultaneously through constructing a bi-objective mixed integer linear programming model. To deal with this problem, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to obtain the Pareto optimal solution set. In the numerical examples, the RC108 from Solomon's benchmark set is employed and the results in the Pareto front show the efficiency of NSGA-II for the TD-BO-VRPTW. To further test the performance of this algorithm, two objectives are optimized separately and then the sum of two objectives is also optimized. Through comparing these results with solutions in the Pareto front, it can be concluded that the algorithm is reliable, and the results in Pareto front are competitive because there is a trade-off between two objectives.","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"180 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77327128","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":"Experimental investigation and multi-objective optimization of micro-wire electrical discharge machining of a titanium alloy using Jaya algorithm","authors":"Mahavir Singh, J. Ramkumar, R. V. Rao, J. Balic","doi":"10.14743/APEM2019.2.326","DOIUrl":"https://doi.org/10.14743/APEM2019.2.326","url":null,"abstract":"","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"1 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73633642","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}
The main objective of this paper is to develop a framework for characterising project complexity in International Development (ID) projects. Contemporary challenges in ID projects have led to their growth in their complexity, which in recent years has driven researches in recent years to publish numerous papers that deal with this topic, demonstrating its importance in current project management research. Nevertheless, existing literature lacks in generally accepted framework that considers specifics of project complexity in ID projects. Thus, new framework was developed, based on a two-round Delphi survey, building upon existing TOE (technology-organisation-environment) framework with new empirical insights given from the experts in the field of ID projects. The main contribution of the paper is the validation of existing TOE complexity factors, in the context of International Development projects. Additionally, eight new complexity factors were proposed by the experts, and it was concluded that Environmental complexity had the biggest impact on International Development projects. From a managerial perspective, proposed complexity framework can be used for making a complexity footprint, which could indicate the critical areas of the project where complexity could be expected. In addition, the model represents a novel theoretical lens for assessing complexity in ID projects. 2019 CPE, University of Maribor. All rights reserved.
{"title":"A new framework for complexity analysis in international development projects – Results from a Delphi study","authors":"S. Gajić, I. Palčič","doi":"10.14743/APEM2019.2.324","DOIUrl":"https://doi.org/10.14743/APEM2019.2.324","url":null,"abstract":"The main objective of this paper is to develop a framework for characterising project complexity in International Development (ID) projects. Contemporary challenges in ID projects have led to their growth in their complexity, which in recent years has driven researches in recent years to publish numerous papers that deal with this topic, demonstrating its importance in current project management research. Nevertheless, existing literature lacks in generally accepted framework that considers specifics of project complexity in ID projects. Thus, new framework was developed, based on a two-round Delphi survey, building upon existing TOE (technology-organisation-environment) framework with new empirical insights given from the experts in the field of ID projects. The main contribution of the paper is the validation of existing TOE complexity factors, in the context of International Development projects. Additionally, eight new complexity factors were proposed by the experts, and it was concluded that Environmental complexity had the biggest impact on International Development projects. From a managerial perspective, proposed complexity framework can be used for making a complexity footprint, which could indicate the critical areas of the project where complexity could be expected. In addition, the model represents a novel theoretical lens for assessing complexity in ID projects. 2019 CPE, University of Maribor. All rights reserved.","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"36 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84348331","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}
The cooperation between enterprises is actually at a certain risk of interruption, which has a significant impact on the robustness of manufacturing service system (MSS). Evaluating MSS’ robustness is integral to production and service provisioning, and thus the influence mechanism should be clearly revealed for assisting professionals in the company in improving the robust performance. In this paper, we present an effective methodology for explicating the impact of cooperation uncertainty on the robustness of MSS from a complex system standpoint. This methodology characterizes MSS as a topological network consisting of serval service subsystems, and constructs the measure metrics system of which the validity and applicability are proved theoretically from the dimension of structure and performance. Furthermore, it simulates the cooperation interruption from four different scenarios with algorithms, and finally takes an elevator manufacturing service network as the case to illustrate this novel methodology. The simulation findings suggest that identifying the critical paths in MSS and standardizing the cooperation mechanism within and among core manufacturing service principals outperform the other measures in improving the robustness of MSS.
{"title":"Impact of cooperation uncertainty on the robustness of manufacturing service system","authors":"P. Liang, C. Li","doi":"10.14743/APEM2019.2.321","DOIUrl":"https://doi.org/10.14743/APEM2019.2.321","url":null,"abstract":"The cooperation between enterprises is actually at a certain risk of interruption, which has a significant impact on the robustness of manufacturing service system (MSS). Evaluating MSS’ robustness is integral to production and service provisioning, and thus the influence mechanism should be clearly revealed for assisting professionals in the company in improving the robust performance. In this paper, we present an effective methodology for explicating the impact of cooperation uncertainty on the robustness of MSS from a complex system standpoint. This methodology characterizes MSS as a topological network consisting of serval service subsystems, and constructs the measure metrics system of which the validity and applicability are proved theoretically from the dimension of structure and performance. Furthermore, it simulates the cooperation interruption from four different scenarios with algorithms, and finally takes an elevator manufacturing service network as the case to illustrate this novel methodology. The simulation findings suggest that identifying the critical paths in MSS and standardizing the cooperation mechanism within and among core manufacturing service principals outperform the other measures in improving the robustness of MSS.","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"8 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87787042","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 investment strategy and capacity portfolio optimization in the supply chain with spillover effect based on artificial fish swarm algorithm","authors":"Z. Zheng, X. Bao","doi":"10.14743/APEM2019.2.325","DOIUrl":"https://doi.org/10.14743/APEM2019.2.325","url":null,"abstract":"","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"23 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85375550","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}
The split-delivery vehicle-routing problem in which delivery to a demand point can be served by any number of vehicles is an important branch of clas-sic VRP. Objective function is used to minimise travel distance while using the lowest number of vehicles. According to the maximum-minimum distance clustering method, a three-stage algorithm is proposed. First, the maximum-minimum distance method is employed to cluster customer points into the lowest number of groups. Second, according to the maximum vehicle capacity, the load demand in each group is adjusted to create suitable customer points in each clustering group by adopting 'push-out' and 'pull-in' operations. Third, a tabu search is used and an optimised route for each group is generated to minimise the total travel distance. Numerical experiments, some on the benchmark data set, are presented to verify the feasibility and effectiveness of the proposed algorithm. The computational results show that the performance of the proposed algorithm is better in terms of both optimised travel distance and less computation time when the problem size is less than 75. The results also show that when the customer points are in a cluster distribution around the depot, the algorithm achieves better performance.
{"title":"Maximum-minimum distance clustering method for split-delivery vehicle-routing problem: Case studies and performance comparisons","authors":"J. Min, C. Jin, L. Lu","doi":"10.14743/apem2019.1.316","DOIUrl":"https://doi.org/10.14743/apem2019.1.316","url":null,"abstract":"The split-delivery vehicle-routing problem in which delivery to a demand point can be served by any number of vehicles is an important branch of clas-sic VRP. Objective function is used to minimise travel distance while using the lowest number of vehicles. According to the maximum-minimum distance clustering method, a three-stage algorithm is proposed. First, the maximum-minimum distance method is employed to cluster customer points into the lowest number of groups. Second, according to the maximum vehicle capacity, the load demand in each group is adjusted to create suitable customer points in each clustering group by adopting 'push-out' and 'pull-in' operations. Third, a tabu search is used and an optimised route for each group is generated to minimise the total travel distance. Numerical experiments, some on the benchmark data set, are presented to verify the feasibility and effectiveness of the proposed algorithm. The computational results show that the performance of the proposed algorithm is better in terms of both optimised travel distance and less computation time when the problem size is less than 75. The results also show that when the customer points are in a cluster distribution around the depot, the algorithm achieves better performance.","PeriodicalId":48763,"journal":{"name":"Advances in Production Engineering & Management","volume":"21 1","pages":""},"PeriodicalIF":3.6,"publicationDate":"2019-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79325337","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
扫码关注我们
求助内容：
应助结果提醒方式：