D. Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, J. R. Nascimento
Network science is a growing field of study using Graph Theory as a modeling tool. In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles. In this sense, a role assignment permit to represent the network through a smaller graph modeling its roles. This leads to a problem called r -Role Assignment whose goal is deciding whether it exists such an assignment of r distinct roles. This problem is known to be NP-complete for any fixed r ≥ 2. The Cartesian product of graphs is a well studied graph operation, often used for modeling interconnection networks. Formally, the Cartesian product of G and H is a graph, denoted as G□H, whose vertex set is V (G) × V (H) and two vertices (u, v) and (x, y) are adjacent precisely if u = x and vy ∈ E(H), or ux ∈ E(G) and v = y. In a previous work, we showed that Cartesian product of graphs are always 2-role assignable, however the 3-Role Assignment problem is NP-complete on this class. In this paper, we prove that r -Role Assignment restricted to Cartesian product graphs is still NP-complete, for any fixed r ≥ 4.
{"title":"Computing role assignments of Cartesian product of graphs","authors":"D. Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, J. R. Nascimento","doi":"10.1051/ro/2023047","DOIUrl":"https://doi.org/10.1051/ro/2023047","url":null,"abstract":"Network science is a growing field of study using Graph Theory as a modeling tool. In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles. In this sense, a role assignment permit to represent the network through a smaller graph modeling its roles. This leads to a problem called r -Role Assignment whose goal is deciding whether it exists such an assignment of r distinct roles. This problem is known to be NP-complete for any fixed r ≥ 2. The Cartesian product of graphs is a well studied graph operation, often used for modeling interconnection networks. Formally, the Cartesian product of G and H is a graph, denoted as G□H, whose vertex set is V (G) × V (H) and two vertices (u, v) and (x, y) are adjacent precisely if u = x and vy ∈ E(H), or ux ∈ E(G) and v = y. In a previous work, we showed that Cartesian product of graphs are always 2-role assignable, however the 3-Role Assignment problem is NP-complete on this class. In this paper, we prove that r -Role Assignment restricted to Cartesian product graphs is still NP-complete, for any fixed r ≥ 4.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"12 1","pages":"1075-1086"},"PeriodicalIF":0.0,"publicationDate":"2023-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84183732","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}
Online product reviews are valuable resources to collect customer preferences for product improvement. To retrieve consumer preferences, it is important to automatically extract product features from online reviews. However, product feature extraction from Chinese online reviews is challenging due to the particularity of the Chinese language. This research focuses on how to accurately extract and prioritize product features and how to establish product improvement strategies based on the extracted product features. First, an ensemble deep learning based model (EDLM) is proposed to extract and classify product features from Chinese online reviews. Second, conjoint analysis is conducted to calculate the corresponding weight of each product feature and a weight-based Kano model (WKM) is proposed to classify and prioritize product features. Various comparative experiments show that the EDLM model achieves impressive results in product feature extraction and outperforms existing state-of-the-art models used for Chinese online reviews. Moreover, this study can help product managers select the product features that have significant impact on enhancing customer satisfaction and improve products accordingly.
{"title":"Product feature extraction from Chinese online reviews: application to product improvement","authors":"Li Shi, Jun Lin, Guoquan Liu","doi":"10.1051/ro/2023046","DOIUrl":"https://doi.org/10.1051/ro/2023046","url":null,"abstract":"Online product reviews are valuable resources to collect customer preferences for product improvement. To retrieve consumer preferences, it is important to automatically extract product features from online reviews. However, product feature extraction from Chinese online reviews is challenging due to the particularity of the Chinese language. This research focuses on how to accurately extract and prioritize product features and how to establish product improvement strategies based on the extracted product features. First, an ensemble deep learning based model (EDLM) is proposed to extract and classify product features from Chinese online reviews. Second, conjoint analysis is conducted to calculate the corresponding weight of each product feature and a weight-based Kano model (WKM) is proposed to classify and prioritize product features. Various comparative experiments show that the EDLM model achieves impressive results in product feature extraction and outperforms existing state-of-the-art models used for Chinese online reviews. Moreover, this study can help product managers select the product features that have significant impact on enhancing customer satisfaction and improve products accordingly.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"44 1","pages":"1125-1147"},"PeriodicalIF":0.0,"publicationDate":"2023-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76244319","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}
Motivated by the soaking process under separate heating mode in iron and steel enterprises, we study the parallel batch machine scheduling problem with incompatible deteriorating jobs. The objective is to minimize makespan. A soaking furnace can be seen as a parallel batch processing machine. In order to avoid the thermal stress caused by excessive temperature difference, initial temperature is needed for the ingot before processing. With the increasing of waiting time, the ingot temperature decreases and the soaking time increases. This property is called deterioration. Setup time is needed between incompatible jobs. We show that if jobs have the same sizes, an optimal solution can be found within O(n log n) time. If jobs have identical processing times, the problem is proved to be NP-hard in the strong sense. We propose an approximate algorithm whose absolute and asymptotic worst-case ratios are less than 2 and 11/9, respectively. When the jobs have arbitrary sizes and arbitrary processing times, the model is also NP-hard in the strong sense. An approximate algorithm with an absolute and asymptotic worst-case ratio less than 2 is proposed. The time complexity is O(n log n).
{"title":"Approximation algorithms for scheduling single batch machine with incompatible deteriorating jobs","authors":"B. Cheng, Haimei Yuan, Mi Zhou, Tan Qi","doi":"10.1051/ro/2023045","DOIUrl":"https://doi.org/10.1051/ro/2023045","url":null,"abstract":"Motivated by the soaking process under separate heating mode in iron and steel enterprises, we study the parallel batch machine scheduling problem with incompatible deteriorating jobs. The objective is to minimize makespan. A soaking furnace can be seen as a parallel batch processing machine. In order to avoid the thermal stress caused by excessive temperature difference, initial temperature is needed for the ingot before processing. With the increasing of waiting time, the ingot temperature decreases and the soaking time increases. This property is called deterioration. Setup time is needed between incompatible jobs. We show that if jobs have the same sizes, an optimal solution can be found within O(n log n) time. If jobs have identical processing times, the problem is proved to be NP-hard in the strong sense. We propose an approximate algorithm whose absolute and asymptotic worst-case ratios are less than 2 and 11/9, respectively. When the jobs have arbitrary sizes and arbitrary processing times, the model is also NP-hard in the strong sense. An approximate algorithm with an absolute and asymptotic worst-case ratio less than 2 is proposed. The time complexity is O(n log n).","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"57 1","pages":"1267-1284"},"PeriodicalIF":0.0,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73992898","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}
In this paper, we investigate a bilevel interval valued optimization problem. Reducing the problem into a one-level nonlinear and nonsmooth program, necessary optimality conditions are developed in terms of upper convexificators. Our approach consists of using an Abadie’s constraint qualification together with an appropriate optimal value reformulation. Later on, using an upper estimate for upper convexificators of the optimal value function, we give a more detailed result in terms of the initial data. The appearing functions are not necessarily Lipschitz continuous, and neither the objective function nor the constraint functions of the lower-level optimization problem are assumed to be convex. There are additional examples highlighting both our results and the limitations of certain past studies.
{"title":"On interval-valued bilevel optimization problems using upper convexificators","authors":"S. Dempe, N. Gadhi, Mohamed Ohda","doi":"10.1051/ro/2023044","DOIUrl":"https://doi.org/10.1051/ro/2023044","url":null,"abstract":"In this paper, we investigate a bilevel interval valued optimization problem. Reducing the problem into a one-level nonlinear and nonsmooth program, necessary optimality conditions are developed in terms of upper convexificators. Our approach consists of using an Abadie’s constraint qualification together with an appropriate optimal value reformulation. Later on, using an upper estimate for upper convexificators of the optimal value function, we give a more detailed result in terms of the initial data.\u0000The appearing functions are not necessarily Lipschitz continuous, and neither the objective function nor\u0000the constraint functions of the lower-level optimization problem are assumed to be convex. There are additional examples highlighting both our results and the limitations of certain past studies.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"53 1","pages":"1009-1025"},"PeriodicalIF":0.0,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87496991","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}
Shaktipada Bhuniya, Rekha Guchhait, B. Ganguly, Sarla Pareek, B. Sarkar, M. Sarkar
Deteriorating products require different handling procedures. Handling procedure includes prevention of the natural deterioration rate of the product. The production of deteriorating products requires prevention technology for those products to use for a long time. Overproduction of deteriorating types of products causes more trouble in preventing deterioration. This study uses a smart production system to control the production of deteriorating products. A controllable production rate controls the production of deteriorating products, and preservation technology reduces the deterioration rate of products. Preservation technology helps extend the life of products, but it requires a specific temperature-controlled environment to work at maximum efficiency. Transportation of these products uses refrigerated transportation to maintain the quality during the transportation time. The purpose of using all these features for deteriorating products is to reduce the deterioration rate, which helps to reduce waste generation from production. Besides, imperfect products from the production system pass through a remanufacturing process to support the waste reduction process. A sustainable supply chain management model under the above-stated strategies is described here. A classical optimization is used to find global optimum solution of the objective function. Then, the total cost of the supply chain is optimized using unique solutions of production rate, number of deliveries, delivery lot size, system reliability, and preservation investment. Global optimum solutions are established theoretically, and few propositions are developed. Some special cases, case studies, and a comparison graph are provided to validate the results. The beta distribution provides the minimum total cost of the system than uniform, gamma, triangular, and double triangular distribution. Smart production allows 72% system reliability with a negligible amount of imperfect products. Besides, the proposed policy gain 22.72% more profit than exiting literature. The model is more realistic through convex 3D graphs, sensitivity analyses, and managerial insights.
{"title":"An application of a smart production system to control deteriorated inventory","authors":"Shaktipada Bhuniya, Rekha Guchhait, B. Ganguly, Sarla Pareek, B. Sarkar, M. Sarkar","doi":"10.1051/ro/2023043","DOIUrl":"https://doi.org/10.1051/ro/2023043","url":null,"abstract":"Deteriorating products require different handling procedures. Handling procedure includes prevention of the natural deterioration rate of the product. The production of deteriorating products requires prevention technology for those products to use for a long time. Overproduction of deteriorating types of products causes more trouble in preventing deterioration. This study uses a smart production system to control the production of deteriorating products. A controllable production rate controls the production of deteriorating products, and preservation technology reduces the deterioration rate of products. Preservation technology helps extend the life of products, but it requires a specific temperature-controlled environment to work at maximum efficiency. Transportation of these products uses refrigerated transportation to maintain the quality during the transportation time. The purpose of using all these features for deteriorating products is to reduce the deterioration rate, which helps to reduce waste generation from production. Besides, imperfect products from the production system pass through a remanufacturing process to support the waste reduction process. A sustainable supply chain management model under the above-stated strategies is described here. A classical optimization is used to find global optimum solution of the objective function. Then, the total cost of the supply chain is optimized using unique solutions of production rate, number of deliveries, delivery lot size, system reliability, and preservation investment. Global optimum solutions are established theoretically, and few propositions are developed. Some special cases, case studies, and a comparison graph are provided to validate the results. The beta distribution provides the minimum total cost of the system than uniform, gamma, triangular, and double triangular distribution. Smart production allows 72% system reliability with a negligible amount of imperfect products. Besides, the proposed policy gain 22.72% more profit than exiting literature. The model is more realistic through convex 3D graphs, sensitivity analyses, and managerial insights.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"74 1","pages":"2435-2464"},"PeriodicalIF":0.0,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75327385","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}
An $mathcal{F}$-factor is a spanning subgraph $H$ such that each connected component of $H$ is isomorphic to some graph in $mathcal{F}$. We use $P_k$ and $K_{1,r}$ to denote the path of order $k$ and the star of order $r+1$, respectively. In particular, $H$ is called a ${P_2,P_3}$-factor of $G$ if $mathcal{F}={P_2,P_3}$; $H$ is called a $mathcal{P}_{geq k}$-factor of $G$ if $mathcal{F}={P_2,P_3,...,P_k}$, where $kgeq2$; $H$ is called an $mathcal{S}_n$-factor of $G$ if $mathcal{F}={P_2,P_3,K_{1,3},...,K_{1,n}}$, where $ngeq2$. A graph $G$ is called a $mathcal{P}_{geq k}$-factor covered graph if there is a $mathcal{P}_{geq k}$-factor of $G$ including $e$ for any $ein E(G)$. We call a graph $G$ is $K_{1,r}$-free if $G$ does not contain an induced subgraph isomorphic to $K_{1,r}$. In this paper, we give a minimum degree condition for the $K_{1,r}$-free graph with an $mathcal{S}_n$-factor and the $K_{1,r}$-free graph with a $mathcal{P}_{geq 3}$-factor, respectively. Further, we obtain sufficient conditions for $K_{1,r}$-free graphs to be $mathcal{P}_{geq 2}$-factor, $mathcal{P}_{geq 3}$-factor or ${P_2,P_3}$-factor covered graphs. In addition, examples show that our results are sharp.
{"title":"Remarks on component factors in K1,r-free graphs","authors":"Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang","doi":"10.1051/ro/2023042","DOIUrl":"https://doi.org/10.1051/ro/2023042","url":null,"abstract":"An $mathcal{F}$-factor is a spanning subgraph $H$ such that each connected component of $H$ is isomorphic to some graph in $mathcal{F}$. We use $P_k$ and $K_{1,r}$ to denote the path of order $k$ and the star of order $r+1$, respectively. In particular, $H$ is called a ${P_2,P_3}$-factor of $G$ if $mathcal{F}={P_2,P_3}$; $H$ is called a $mathcal{P}_{geq k}$-factor of $G$ if $mathcal{F}={P_2,P_3,...,P_k}$, where $kgeq2$; $H$ is called an $mathcal{S}_n$-factor of $G$ if $mathcal{F}={P_2,P_3,K_{1,3},...,K_{1,n}}$, where $ngeq2$. A graph $G$ is called a $mathcal{P}_{geq k}$-factor covered graph if there is a $mathcal{P}_{geq k}$-factor of $G$ including $e$ for any $ein E(G)$. We call a graph $G$ is $K_{1,r}$-free if $G$ does not contain an induced subgraph isomorphic to $K_{1,r}$.\u0000In this paper, we give a minimum degree condition for the $K_{1,r}$-free graph with an $mathcal{S}_n$-factor and the $K_{1,r}$-free graph with a $mathcal{P}_{geq 3}$-factor, respectively. Further, we obtain sufficient conditions for $K_{1,r}$-free graphs to be $mathcal{P}_{geq 2}$-factor, $mathcal{P}_{geq 3}$-factor or ${P_2,P_3}$-factor covered graphs. In addition, examples show that our results are sharp.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"51 1","pages":"837-846"},"PeriodicalIF":0.0,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90769510","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}
In this article, we describe a method to deal with a multi-dimensional variational problem with inequality constraints using an exponential penalty function. We formulate an unconstrained multi-dimensional variational problem and examine the relationships between the optimal solution to the considered multi-dimensional variational problem and the sequence of minimizers of the unconstrained multi-dimensional variational problem. The convergence of the proposed exponential penalty approach is also investigated, which shows that a convergent subsequence of the sequence of minimizers of the unconstrained multi-dimensional variational problem approaches an optimal solution to the multi-dimensional variational problem. Further, an illustrative application (to minimize a manufacturing cost functional of a production firm) is also presented to confirm the effectiveness of the proposed outcomes.
{"title":"On convergence of exponential penalty for the multi-dimensional variational problems","authors":"Anurag Jayswal, Ayush Baranwal","doi":"10.1051/ro/2023041","DOIUrl":"https://doi.org/10.1051/ro/2023041","url":null,"abstract":"In this article, we describe a method to deal with a multi-dimensional variational problem with inequality constraints using an exponential penalty function. We formulate an unconstrained multi-dimensional variational problem and examine the relationships between the optimal solution to the considered multi-dimensional variational problem and the sequence of minimizers of the unconstrained multi-dimensional variational problem. The convergence of the proposed exponential penalty approach is also investigated, which shows that a convergent subsequence of the sequence of minimizers of the unconstrained multi-dimensional variational problem approaches an optimal solution to the multi-dimensional variational problem. Further, an illustrative application (to minimize a manufacturing cost functional of a production firm) is also presented to confirm the effectiveness of the proposed outcomes.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"31 1","pages":"927-938"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76586460","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}
Given a graph $G$ and an integer $kgeq2$. A spanning subgraph $H$ of $G$ is called a $P_{geq k}$-factor of $G$ if every component of $H$ is a path with at least $k$ vertices. A graph $G$ is said to be $P_{geq k}$-factor covered if for any $ein E(G)$, $G$ admits a $P_{geq k}$-factor including $e$. A graph $G$ is called a $(P_{geq k},n)$-factor critical covered graph if $G-V'$ is $P_{geq k}$-factor covered for any $V'subseteq V(G)$ with $|V'|=n$. In this paper, we study the toughness and isolated toughness conditions for $(P_{geq k},n)$-factor critical covered graphs, where $k=2,3$. Let $G$ be a $(n+1)$-connected graph. It is shown that (i) $G$ is a $(P_{geq 2},n)$-factor critical covered graph if its toughness $tau(G)>frac{n+2}{3}$; (ii) $G$ is a $(P_{geq 2},n)$-factor critical covered graph if its isolated toughness $I(G)>frac{n+1}{2}$; (iii) $G$ is a $(P_{geq 3},n)$-factor critical covered graph if $tau(G)>frac{n+2}{3}$ and $|V(G)|geq n+3$; (iv) $G$ is a $(P_{geq 3},n)$-factor critical covered graph if $I(G)>frac{n+3}{2}$ and $|V(G)|geq n+3$. Furthermore, we claim that these conditions are best possible in some sense.
{"title":"Toughness and isolated toughness conditions for path-factor critical covered graphs","authors":"Guowei Dai","doi":"10.1051/ro/2023039","DOIUrl":"https://doi.org/10.1051/ro/2023039","url":null,"abstract":"Given a graph $G$ and an integer $kgeq2$. A spanning subgraph $H$ of $G$ is called a $P_{geq k}$-factor of $G$ if every component of $H$ is a path with at least $k$ vertices. A graph $G$ is said to be $P_{geq k}$-factor covered if for any $ein E(G)$, $G$ admits a $P_{geq k}$-factor including $e$. A graph $G$ is called a $(P_{geq k},n)$-factor critical covered graph if $G-V'$ is $P_{geq k}$-factor covered for any $V'subseteq V(G)$ with $|V'|=n$.\u0000In this paper, we study the toughness and isolated toughness conditions for $(P_{geq k},n)$-factor critical covered graphs, where $k=2,3$. Let $G$ be a $(n+1)$-connected graph. It is shown that\u0000(i) $G$ is a $(P_{geq 2},n)$-factor critical covered graph if its toughness $tau(G)>frac{n+2}{3}$;\u0000(ii) $G$ is a $(P_{geq 2},n)$-factor critical covered graph if its isolated toughness $I(G)>frac{n+1}{2}$;\u0000(iii) $G$ is a $(P_{geq 3},n)$-factor critical covered graph if $tau(G)>frac{n+2}{3}$ and $|V(G)|geq n+3$;\u0000(iv) $G$ is a $(P_{geq 3},n)$-factor critical covered graph if $I(G)>frac{n+3}{2}$ and $|V(G)|geq n+3$. \u0000Furthermore, we claim that these conditions are best possible in some sense.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"86 2-3 1","pages":"847-856"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77882146","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}
In this paper, we propose revisions of two existing scalarization approaches, namely the feasible-value constraint and the weighted constraint. These methods do not easily provide results on proper efficient solutions of a general multiobjective optimization problem. By proposing some novel modifications for these methods, we derive some interesting results concerning proper efficient solutions. These scalarization approaches need no convexity assumption of the objective functions. We also demonstrate the efficiency of the proposed method using numerical experiments. In particular, a rocket injector design problem involving four objective functions illustrates the performance of the proposed method.
{"title":"Modification of some scalarization approaches for multiobjective optimization","authors":"Vahid Amiri Khorasani, E. Khorram","doi":"10.1051/ro/2023040","DOIUrl":"https://doi.org/10.1051/ro/2023040","url":null,"abstract":"In this paper, we propose revisions of two existing scalarization approaches, namely the feasible-value constraint and the weighted constraint. These methods do not easily provide results on proper efficient solutions of a general multiobjective optimization problem. By proposing some novel modifications for these methods, we derive some interesting results concerning proper efficient solutions. These scalarization approaches need no convexity assumption of the objective functions. We also demonstrate the efficiency of the proposed method using numerical experiments. In particular, a rocket injector design problem involving four objective functions illustrates the performance of the proposed method.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"25 4","pages":"1027-1044"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91439495","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}
In order to ensure the normal operation of the communication network in the event of a small number of charging pile failures, it is necessary to establish a stable communication network between the charging pile groups. In this case, it is necessary to improve the stability and viability of the communication network between the pile groups. Based on this, this paper proposes a security optimization method for high-power inter pile communication networks under trusted tabu particle swarm optimization. Using 6LoWPAN technology to optimize the wireless communication network architecture of charging piles to reduce the probability of communication network paralysis; design a neighborhood end-to-end communication strategy, and conduct research on lightweight key management of charging piles by building a three-tier architecture for the communication environment of charging piles. The trusted taboo particle swarm optimization algorithm optimizes the security of the communication network between high-power charging piles to ensure the security of the communication network. The experimental results show that after the optimization of the proposed method, the stability and invulnerability of the communication network between the charging pile groups have been effectively improved, and the method has a high convergence speed.
{"title":"Security optimization method of high-power charging pile inter-group communication network under trusted taboo particle swarm optimization","authors":"Yigang Wang, Jianfeng Zhao","doi":"10.1051/ro/2023038","DOIUrl":"https://doi.org/10.1051/ro/2023038","url":null,"abstract":"In order to ensure the normal operation of the communication network in the event of a small number of charging pile failures, it is necessary to establish a stable communication network between the charging pile groups. In this case, it is necessary to improve the stability and viability of the communication network between the pile groups. Based on this, this paper proposes a security optimization method for high-power inter pile communication networks under trusted tabu particle swarm optimization. Using 6LoWPAN technology to optimize the wireless communication network architecture of charging piles to reduce the probability of communication network paralysis; design a neighborhood end-to-end communication strategy, and conduct research on lightweight key management of charging piles by building a three-tier architecture for the communication environment of charging piles. The trusted taboo particle swarm optimization algorithm optimizes the security of the communication network between high-power charging piles to ensure the security of the communication network. The experimental results show that after the optimization of the proposed method, the stability and invulnerability of the communication network between the charging pile groups have been effectively improved, and the method has a high convergence speed.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"2013 1","pages":"1329-1341"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86239276","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：