Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593226
J. Min, C. Jin, Lijun Lu
This paper describes a mathematical model of the split delivery vehicle routing problem. The objective is to minimize travel distance while using the lowest number of vehicles. A clustering first and routing later strategy is used to realize this objective. A three-stage approach is proposed: first, the maximum minimum distance method is employed to cluster the customer points into the lowest number groups; second, load demands in all groups are adjusted to form all possible routes according to the maximum vehicle load capacity by adopting the “push-out” and “pull-in” tactics; and third, possible routes are optimized to minimize the total travel distance. Case studies are introduced to verify the feasibility and effectiveness of this proposed algorithm. The results show that the performance of this three-stage proposed algorithm is better than the tabu search algorithm, the k-means clustering method, the BCO method and the sweep clustering algorithm in both the optimized travel distance and the less time consumption.
{"title":"A Three-Stage Approach for Split Delivery Vehicle Routing Problem Solving","authors":"J. Min, C. Jin, Lijun Lu","doi":"10.1109/LISS.2018.8593226","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593226","url":null,"abstract":"This paper describes a mathematical model of the split delivery vehicle routing problem. The objective is to minimize travel distance while using the lowest number of vehicles. A clustering first and routing later strategy is used to realize this objective. A three-stage approach is proposed: first, the maximum minimum distance method is employed to cluster the customer points into the lowest number groups; second, load demands in all groups are adjusted to form all possible routes according to the maximum vehicle load capacity by adopting the “push-out” and “pull-in” tactics; and third, possible routes are optimized to minimize the total travel distance. Case studies are introduced to verify the feasibility and effectiveness of this proposed algorithm. The results show that the performance of this three-stage proposed algorithm is better than the tabu search algorithm, the k-means clustering method, the BCO method and the sweep clustering algorithm in both the optimized travel distance and the less time consumption.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130829896","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593243
Huimin Zhang, Xiaochun Lu, Monique Nibagwire
Identifying regions with high demand for urban logistics can lay the foundation for studies related to urban logistics, such as the choice of distribution routes and the layout of logistics facilities. This paper presents kernel density estimation (KDE) method to study the issues related to the spatial distribution of urban logistics demand. The paper also applies this method to the study of logistics demand distribution in Beijing. First, it selects the Gaussian kernel as the kernel function to obtain the heat map of probability density distribution of logistics demand in Beijing. Secondly, this paper finds four regions with higher distribution density throughout the year. Additionally, the paper discusses the characteristics of monthly logistics distribution in these regions and their causes. Finally, it uses the rank sum test to analyze whether the differences in demand distribution of the four regions are significant.
{"title":"Analysis of Logistics Demand Distribution in Beijing Based on Kernel Density Estimation","authors":"Huimin Zhang, Xiaochun Lu, Monique Nibagwire","doi":"10.1109/LISS.2018.8593243","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593243","url":null,"abstract":"Identifying regions with high demand for urban logistics can lay the foundation for studies related to urban logistics, such as the choice of distribution routes and the layout of logistics facilities. This paper presents kernel density estimation (KDE) method to study the issues related to the spatial distribution of urban logistics demand. The paper also applies this method to the study of logistics demand distribution in Beijing. First, it selects the Gaussian kernel as the kernel function to obtain the heat map of probability density distribution of logistics demand in Beijing. Secondly, this paper finds four regions with higher distribution density throughout the year. Additionally, the paper discusses the characteristics of monthly logistics distribution in these regions and their causes. Finally, it uses the rank sum test to analyze whether the differences in demand distribution of the four regions are significant.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123419540","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593268
Meng Wei, Xu Ren, S. Hao
This paper analyzes the impact of knowledge transfer subjects’ motivation, capacity and cultural difference on project knowledge transfer from the perspective of the knowledge sender and knowledge receiver. Based on this, we construct a system dynamics model of project knowledge transfer and conduct the validity test and sensitivity analysis of the model by Vensim PLE software. The simulation result shows that the knowledge transfer motivation and expression capacity of the knowledge sender can promote knowledge transmission and reception in the project team, while knowledge transfer motivation and absorptive capacity of the knowledge receiver only affect knowledge reception. Meanwhile, the positive effect of knowledge innovation capacity of the both sides and the negative effect of cultural difference on project knowledge transmission and reception are also proved.
{"title":"Simulation of Knowledge Transfer within the Project Team","authors":"Meng Wei, Xu Ren, S. Hao","doi":"10.1109/LISS.2018.8593268","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593268","url":null,"abstract":"This paper analyzes the impact of knowledge transfer subjects’ motivation, capacity and cultural difference on project knowledge transfer from the perspective of the knowledge sender and knowledge receiver. Based on this, we construct a system dynamics model of project knowledge transfer and conduct the validity test and sensitivity analysis of the model by Vensim PLE software. The simulation result shows that the knowledge transfer motivation and expression capacity of the knowledge sender can promote knowledge transmission and reception in the project team, while knowledge transfer motivation and absorptive capacity of the knowledge receiver only affect knowledge reception. Meanwhile, the positive effect of knowledge innovation capacity of the both sides and the negative effect of cultural difference on project knowledge transmission and reception are also proved.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253760","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593266
Hanying Dang
In the green agricultural supply chain, the farmers who are at the top of the supply chain receive low income, and consumers who are at the end of the supply chain pay agricultural products with high prices for the lengthy intermediate links. In view of this phenomenon, this paper assumes that farmers provide the green agricultural products to consumers directly. We define a new parameter: brand grade coefficient and conduct the dynamic analysis of the evolution of the game between the farmers, the government and the consumers. We assign the parameters and then analyze the dynamic graph of evolutionary game under different initial strategies drawn with MATLAB. Finally, we conclude the final evolution trend of the three-dimensional evolutionary game. That is, the role of the government in the market slowly fades finally and the stability of the market mainly relies on the participation of consumers in the market and the game between consumers and farmers. The results indicate that consumers who take the initiative to participate in the market have a certain degree of substitution to supervision of the role of government regulators. Strengthening the consumer to participate in the market is conducive to maintaining market stability.
{"title":"Tripartite Game Model of Agricultural Product Supply Chain Based on Evolutionary Game","authors":"Hanying Dang","doi":"10.1109/LISS.2018.8593266","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593266","url":null,"abstract":"In the green agricultural supply chain, the farmers who are at the top of the supply chain receive low income, and consumers who are at the end of the supply chain pay agricultural products with high prices for the lengthy intermediate links. In view of this phenomenon, this paper assumes that farmers provide the green agricultural products to consumers directly. We define a new parameter: brand grade coefficient and conduct the dynamic analysis of the evolution of the game between the farmers, the government and the consumers. We assign the parameters and then analyze the dynamic graph of evolutionary game under different initial strategies drawn with MATLAB. Finally, we conclude the final evolution trend of the three-dimensional evolutionary game. That is, the role of the government in the market slowly fades finally and the stability of the market mainly relies on the participation of consumers in the market and the game between consumers and farmers. The results indicate that consumers who take the initiative to participate in the market have a certain degree of substitution to supervision of the role of government regulators. Strengthening the consumer to participate in the market is conducive to maintaining market stability.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127482127","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593246
Wen Xu, Ziyulong Wang, Bishal D. Sharma, Yuyan Tan
The application of cyclic train line plan has found an increasingly wide utilization in high-speed railway system while reasonable length of cycle also becomes an essential element of it. In order to apply the cyclic train line plan to Chinese high-speed rail system, the idea of candidate set is introduced and a Mixed Integer Programmer (MIP) model of periodic train line planning based on candidate set is established in this paper. The periodic train line planning problem is considered involving many general constraints, such as the passenger demand, the service frequency, the railway track capacity and variable constraints. The maximum service frequency is determined by specifying the maximum number of trains in every cycle. Besides, according to the data from Beijing-Shanghai high-speed railway, different cycle length of 1 hour, 2 hours and 4 hours is set to generate different cyclic train line plan. By comparing the service quality of the periodic train line plan and the existing one, the effectiveness of the proposed model and relevant method are verified.
{"title":"The Reasonable Cycle Length for Periodic Train Line Planning Problem","authors":"Wen Xu, Ziyulong Wang, Bishal D. Sharma, Yuyan Tan","doi":"10.1109/LISS.2018.8593246","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593246","url":null,"abstract":"The application of cyclic train line plan has found an increasingly wide utilization in high-speed railway system while reasonable length of cycle also becomes an essential element of it. In order to apply the cyclic train line plan to Chinese high-speed rail system, the idea of candidate set is introduced and a Mixed Integer Programmer (MIP) model of periodic train line planning based on candidate set is established in this paper. The periodic train line planning problem is considered involving many general constraints, such as the passenger demand, the service frequency, the railway track capacity and variable constraints. The maximum service frequency is determined by specifying the maximum number of trains in every cycle. Besides, according to the data from Beijing-Shanghai high-speed railway, different cycle length of 1 hour, 2 hours and 4 hours is set to generate different cyclic train line plan. By comparing the service quality of the periodic train line plan and the existing one, the effectiveness of the proposed model and relevant method are verified.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129887482","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593247
Wanyi Gong, M. Shi, Linzhong Xia
With the urbanization acceleration and the development of the endowment industry, people’s understanding of the endowment pattern is getting deeper and deeper. Therefore, people are no longer satisfied with the simple and traditional family endowment pattern, but prefer some new endowment patterns to meet the needs of people’s diversified endowment. This paper makes a thorough and in-depth study on the existing endowment patterns in China, and sums up ten typical endowment patterns with their own characteristics. In this paper, we did a large sample survey on the ten typical endowment patterns, and recover 1531 valid questionnaires. We obtained the important evidence about how people choose the endowment pattern based on analysis of the effective recovery questionnaires. In this paper, we built up an endowment pattern prediction model based on BP feed-forward neural network. By calculation and analysis, an 87.8% prediction accuracy self-recommendation system of endowment patterns successfully constructed. The self-recommendation system can well predict people’s choice of endowment patterns, which is of great significance to judge the future development of the endowment industry.
{"title":"Self-recommendation System of Endowment Pattern Based on Neural Network for China","authors":"Wanyi Gong, M. Shi, Linzhong Xia","doi":"10.1109/LISS.2018.8593247","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593247","url":null,"abstract":"With the urbanization acceleration and the development of the endowment industry, people’s understanding of the endowment pattern is getting deeper and deeper. Therefore, people are no longer satisfied with the simple and traditional family endowment pattern, but prefer some new endowment patterns to meet the needs of people’s diversified endowment. This paper makes a thorough and in-depth study on the existing endowment patterns in China, and sums up ten typical endowment patterns with their own characteristics. In this paper, we did a large sample survey on the ten typical endowment patterns, and recover 1531 valid questionnaires. We obtained the important evidence about how people choose the endowment pattern based on analysis of the effective recovery questionnaires. In this paper, we built up an endowment pattern prediction model based on BP feed-forward neural network. By calculation and analysis, an 87.8% prediction accuracy self-recommendation system of endowment patterns successfully constructed. The self-recommendation system can well predict people’s choice of endowment patterns, which is of great significance to judge the future development of the endowment industry.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117347070","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593235
Hao Zhang, Lei Tang
In order to prevent the safety incidents from becoming serious, the urgent task is to figure out the root cause of the accident. This paper expatiates the trading patterns of online-sold homemade food and their food safety situations. Then we present a brief overview of the existing related regulatory measures and current problems in online-sold homemade food safety supervision. On this basis, we use four subjects, included homemade food producers, third-party platform, regulators and consumers, to set the Nash equilibrium, analyzing the factors which can influence each related interest subject’s choosing strategies. The result shows that the third-party platform is a most essential part in the safety supervision chain, too much emphasis on regulating producers will only curb food safety incidents in the short term. Some suggestions are given to improve the safety supervision of online-sold homemade food.
{"title":"Regulation Research of Online-sold Homemade Food Safety Based on Nash Equilibrium Game Model","authors":"Hao Zhang, Lei Tang","doi":"10.1109/LISS.2018.8593235","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593235","url":null,"abstract":"In order to prevent the safety incidents from becoming serious, the urgent task is to figure out the root cause of the accident. This paper expatiates the trading patterns of online-sold homemade food and their food safety situations. Then we present a brief overview of the existing related regulatory measures and current problems in online-sold homemade food safety supervision. On this basis, we use four subjects, included homemade food producers, third-party platform, regulators and consumers, to set the Nash equilibrium, analyzing the factors which can influence each related interest subject’s choosing strategies. The result shows that the third-party platform is a most essential part in the safety supervision chain, too much emphasis on regulating producers will only curb food safety incidents in the short term. Some suggestions are given to improve the safety supervision of online-sold homemade food.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125216111","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593228
Shun Wu
Vehicle equipment is one of the core equipments of train control system in the high-speed railway, and it mainly depends on the experience of maintenance personnel to perform fault diagnosis when it fails, which is ineffective. The maintenance text data of vehicle equipment, which contains fault category information, is not fully utilized. The classification of maintenance text can well assist fault diagnosis of vehicle equipment. However, shortness and imbalanced class distribution of maintenance texts, which hinder the application of conventional text representation models and classification algorithms, pose challenges for classification task. In this paper, we propose a novel text feature selection algorithm based on multi-granularity latent Dirichlet allocation (LDA) to overcome shortness characteristic of maintenance text. To solve the problem of class imbalance, a cost-sensitive Support Vector Machine (SVM) is utilized to construct fault diagnosis model. Finally, we compare our proposed method with the state-of-the-art baseline over a vehicle maintenance text data set collected by Guangzhou railway corporation, and it outperforms traditional methods.
{"title":"Short Text Mining for Fault Diagnosis of Railway System Based on Multi-Granularity Topic Model","authors":"Shun Wu","doi":"10.1109/LISS.2018.8593228","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593228","url":null,"abstract":"Vehicle equipment is one of the core equipments of train control system in the high-speed railway, and it mainly depends on the experience of maintenance personnel to perform fault diagnosis when it fails, which is ineffective. The maintenance text data of vehicle equipment, which contains fault category information, is not fully utilized. The classification of maintenance text can well assist fault diagnosis of vehicle equipment. However, shortness and imbalanced class distribution of maintenance texts, which hinder the application of conventional text representation models and classification algorithms, pose challenges for classification task. In this paper, we propose a novel text feature selection algorithm based on multi-granularity latent Dirichlet allocation (LDA) to overcome shortness characteristic of maintenance text. To solve the problem of class imbalance, a cost-sensitive Support Vector Machine (SVM) is utilized to construct fault diagnosis model. Finally, we compare our proposed method with the state-of-the-art baseline over a vehicle maintenance text data set collected by Guangzhou railway corporation, and it outperforms traditional methods.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"49 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520190","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593258
Lan Yao, Huaiming Wei, Xuedong Wang
Location-inventory problem has long been a classic area of research on the integrated optimization of logistics system, the previous research about LIP focused on forward logistics network without taking the reverse logistics into account. In recent years, the explosive growth of e- commerce and frequently returns in the e-commerce activities makes that we have to consider the LIP with returns. Therefore, we complete the formulization of this problem as a nonlinear integer programming model and, and an effective heuristic algorithm based on the improved genetic algorithm is used to solve the model. Computational results show the validity and advancement of the model and algorithm.
{"title":"A Closed-Loop Location-Inventory Problem Considering Returns with Mixed Quality Defects in E-Commerce","authors":"Lan Yao, Huaiming Wei, Xuedong Wang","doi":"10.1109/LISS.2018.8593258","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593258","url":null,"abstract":"Location-inventory problem has long been a classic area of research on the integrated optimization of logistics system, the previous research about LIP focused on forward logistics network without taking the reverse logistics into account. In recent years, the explosive growth of e- commerce and frequently returns in the e-commerce activities makes that we have to consider the LIP with returns. Therefore, we complete the formulization of this problem as a nonlinear integer programming model and, and an effective heuristic algorithm based on the improved genetic algorithm is used to solve the model. Computational results show the validity and advancement of the model and algorithm.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114528749","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}
Pub Date : 2018-08-01DOI: 10.1109/LISS.2018.8593236
Fachao Li, Kaixin Feng
Multi-objective programming, as an effective mathematical model for dealing with multiple objectives, is widely used in the fields of complex system optimization, management decision analysis and artificial intelligence. This paper first analyzes the characteristics and deficiencies of the multi-objective planning model based on priority factors, and proposes a multi-objective planning method based on relative deviations. It mainly introduces the relative deviation to describe the degree of deviation from the target value and reflect the satisfactory state of the decision results. It establishes a planning model in which each objective is at the same level, and analyzes the effectiveness of the method in conjunction with a specific case. The comprehensive analysis and the corresponding conclusions show that the solution model established not only ensures the existence of the solution, but also guarantees the reliability of the decision-making result. It has strong explanatory and operability, and to a certain extent, enriches the existing fuzzy decision-making method.
{"title":"A Multi-objective Programming Method Based on Relative Deviation","authors":"Fachao Li, Kaixin Feng","doi":"10.1109/LISS.2018.8593236","DOIUrl":"https://doi.org/10.1109/LISS.2018.8593236","url":null,"abstract":"Multi-objective programming, as an effective mathematical model for dealing with multiple objectives, is widely used in the fields of complex system optimization, management decision analysis and artificial intelligence. This paper first analyzes the characteristics and deficiencies of the multi-objective planning model based on priority factors, and proposes a multi-objective planning method based on relative deviations. It mainly introduces the relative deviation to describe the degree of deviation from the target value and reflect the satisfactory state of the decision results. It establishes a planning model in which each objective is at the same level, and analyzes the effectiveness of the method in conjunction with a specific case. The comprehensive analysis and the corresponding conclusions show that the solution model established not only ensures the existence of the solution, but also guarantees the reliability of the decision-making result. It has strong explanatory and operability, and to a certain extent, enriches the existing fuzzy decision-making method.","PeriodicalId":338998,"journal":{"name":"2018 8th International Conference on Logistics, Informatics and Service Sciences (LISS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848456","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}