This page has only limited features, please log in for full access.

Unclaimed
Panos M. Pardalos
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

Dr. Panos Pardalos is a Distinguished Professor in the Department of Industrial and Systems Engineering at the University of Florida, and an affiliated faculty of Biomedical Engineering and Computer Science & Information & Engineering departments. In addition, he is the director of the Center for Applied Optimization. Dr. Pardalos is a world renowned leader in Global Optimization, Mathematical Modeling, Energy Systems, and Data Sciences. He is a Fellow of AAAS, AIMBE, and INFORMS and was awarded the 2013 Constantin Caratheodory Prize of the International Society of Global Optimization. In addition, Dr. Pardalos has been awarded the 2013 EURO Gold Medal prize bestowed by the Association for European Operational Research Societies. This medal is the preeminent European award given to Operations Research (OR) professionals for “scientific contributions that stand the test of time.” Dr. Pardalos has been awarded a prestigious Humboldt Research Award (2018-2019). The Humboldt Research Award is granted in recognition of a researcher’s entire achievements to date – fundamental discoveries, new theories, insights that have had significant impact on their discipline.

Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 25 August 2021 in European Journal of Operational Research
Reads 0
Downloads 0

Travel time estimation is a crucial problem in the field of transportation. While this problem has been extensively studied for over-the-road and air travel modes of transportation and researchers have accomplished substantial advancements in improving the accuracy of the related models, we still observe a significant lack of accurate methods for estimating the travel time of freight trains. The planned train schedule is often dramatically affected by the delays that occur in complex networks due to various reasons such as train movement conflicts, resource unavailability, and unforeseen conditions. We develop a novel mixed integer programming model to address this problem. Considering the current train schedule, characteristics of the railroads, availability of resources, operational restrictions, different types of delay, and congestion-related factors, the proposed model obtains the estimated travel time of trains by minimizing the total amount of deviation from the planned timetable. This optimization scheme enables us to impose all business constraints and network restrictions on the model. Our proposed formulation is generic and can be utilized for other railway networks with minor modifications. To evaluate our model, we use the network characteristics and planned trains movement data of Prorail in Netherlands. The model is implemented in Julia and solved with Gurobi solver efficiently which demonstrates the superiority of our approach.

ACS Style

Bijan Taslimi; Farnaz Babaie Sarijaloo; Hongcheng Liu; Panos M. Pardalos. A Novel Mixed Integer Programming Model for Freight Train Travel Time Estimation. European Journal of Operational Research 2021, 1 .

AMA Style

Bijan Taslimi, Farnaz Babaie Sarijaloo, Hongcheng Liu, Panos M. Pardalos. A Novel Mixed Integer Programming Model for Freight Train Travel Time Estimation. European Journal of Operational Research. 2021; ():1.

Chicago/Turabian Style

Bijan Taslimi; Farnaz Babaie Sarijaloo; Hongcheng Liu; Panos M. Pardalos. 2021. "A Novel Mixed Integer Programming Model for Freight Train Travel Time Estimation." European Journal of Operational Research , no. : 1.

Article
Published: 28 July 2021 in Journal of Global Optimization
Reads 0
Downloads 0

In this research, stochastic geometric programming with joint chance constraints is investigated with elliptically distributed random parameters. The constraint’s random coefficient vectors are considered dependent, and the dependence of the random vectors is handled through copulas. Moreover, Archimedean copulas are used to derive the random rows distribution. A convex approximation optimization problem is proposed for this class of stochastic geometric programming problems using a standard variable transformation. Furthermore, a piecewise tangent approximation and sequential convex approximation are employed to obtain the lower and upper bounds for the convex optimization model, respectively. Finally, an illustrative optimization example on randomly generated data is presented to demonstrate the efficiency of the methods and algorithms.

ACS Style

Rashed Khanjani-Shiraz; Salman Khodayifar; Panos M. Pardalos. Copula theory approach to stochastic geometric programming. Journal of Global Optimization 2021, 1 -34.

AMA Style

Rashed Khanjani-Shiraz, Salman Khodayifar, Panos M. Pardalos. Copula theory approach to stochastic geometric programming. Journal of Global Optimization. 2021; ():1-34.

Chicago/Turabian Style

Rashed Khanjani-Shiraz; Salman Khodayifar; Panos M. Pardalos. 2021. "Copula theory approach to stochastic geometric programming." Journal of Global Optimization , no. : 1-34.

Article
Published: 13 May 2021 in Journal of Combinatorial Optimization
Reads 0
Downloads 0

In this study, we discuss and develop a distributionally robust joint chance-constrained optimization model and apply it for the shortest path problem under resource uncertainty. In sch a case, robust chance constraints are approximated by constraints that can be reformulated using convex programming. Since the issue we are discussing here is of the multi-resource type, the resource related to cost is deterministic; however, we consider a robust set for other resources where covariance and mean are known. Thus, the chance-constrained problem can be expressed in terms of a cone constraint. In addition, since our problem is joint chance-constrained optimization, we can use Bonferroni approximation to divide the problem into L separate problems in order to build convex approximations of distributionally robust joint chance constraints. Finally, numerical results are presented to illustrate the rigidity of the bounds and the value of the distributionally robust approach.

ACS Style

Rashed Khanjani-Shiraz; Ali Babapour-Azar; Zohreh Hosseini-Noudeh; Panos M. Pardalos. Distributionally robust maximum probability shortest path problem. Journal of Combinatorial Optimization 2021, 1 -28.

AMA Style

Rashed Khanjani-Shiraz, Ali Babapour-Azar, Zohreh Hosseini-Noudeh, Panos M. Pardalos. Distributionally robust maximum probability shortest path problem. Journal of Combinatorial Optimization. 2021; ():1-28.

Chicago/Turabian Style

Rashed Khanjani-Shiraz; Ali Babapour-Azar; Zohreh Hosseini-Noudeh; Panos M. Pardalos. 2021. "Distributionally robust maximum probability shortest path problem." Journal of Combinatorial Optimization , no. : 1-28.

Conference paper
Published: 30 March 2021 in Transactions on Petri Nets and Other Models of Concurrency XV
Reads 0
Downloads 0
ACS Style

Giuseppe Nicosia; Varun Ojha; Emanuele La Malfa; Giorgio Jansen; Vincenzo Sciacca; Panos Pardalos; Giovanni Giuffrida; Renato Umeton. Correction to: Machine Learning, Optimization, and Data Science. Transactions on Petri Nets and Other Models of Concurrency XV 2021, C1 -C1.

AMA Style

Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Giorgio Jansen, Vincenzo Sciacca, Panos Pardalos, Giovanni Giuffrida, Renato Umeton. Correction to: Machine Learning, Optimization, and Data Science. Transactions on Petri Nets and Other Models of Concurrency XV. 2021; ():C1-C1.

Chicago/Turabian Style

Giuseppe Nicosia; Varun Ojha; Emanuele La Malfa; Giorgio Jansen; Vincenzo Sciacca; Panos Pardalos; Giovanni Giuffrida; Renato Umeton. 2021. "Correction to: Machine Learning, Optimization, and Data Science." Transactions on Petri Nets and Other Models of Concurrency XV , no. : C1-C1.

Article
Published: 30 March 2021 in International Transactions in Operational Research
Reads 0
Downloads 0

Considering information security insurance, this paper investigates an information security investment game between two firms with complementary information assets. Each firm's information security investment and expected profit in Nash equilibrium (i.e., firms make decisions individually) and social optimum (i.e., firms make decisions jointly) are analyzed through rigorous theoretical analyses and numerical examples. We find that making decisions jointly will make the two firms as a whole obtain more profits than when they make decisions alone, whereas this does not mean that each firm will benefit from the joint decision‐making process. Our results show that a firm yields a smaller expected profit in the joint decision game than the individual decision game under some conditions. In addition, the impacts of a higher insurance price and a higher investment efficiency on a firm's information security investment and expected profit are explored. The results indicate that, for a single firm, a higher insurance price does not necessarily result in smaller profit, and a higher investment efficiency does not always lead to larger profit. Then we design a compensation‐based contract to coordinate the two firms’ information security investments when they make decisions individually. The contract will make the two firms achieve social optimum and ensure that each firm yields more profits than firms without the contract. Finally, we extend our research by setting the insurance amount as a decision variable to verify the above analyses.

ACS Style

Xiaofei Qian; Wujuan Yang; Jun Pei; Xinbao Liu; Panos M. Pardalos. A game of information security investment considering security insurance and complementary information assets. International Transactions in Operational Research 2021, 1 .

AMA Style

Xiaofei Qian, Wujuan Yang, Jun Pei, Xinbao Liu, Panos M. Pardalos. A game of information security investment considering security insurance and complementary information assets. International Transactions in Operational Research. 2021; ():1.

Chicago/Turabian Style

Xiaofei Qian; Wujuan Yang; Jun Pei; Xinbao Liu; Panos M. Pardalos. 2021. "A game of information security investment considering security insurance and complementary information assets." International Transactions in Operational Research , no. : 1.

Journal article
Published: 02 February 2021 in Annals of Mathematics and Artificial Intelligence
Reads 0
Downloads 0

Building a scalable machine learning system for unsupervised anomaly detection via representation learning is highly desirable. One of the prevalent methods is using a reconstruction error of variational autoencoder (VAE) by maximizing the evidence lower bound. We revisit VAE from the perspective of information theory to provide some theoretical foundations on using the reconstruction error and finally arrive at a simpler yet effective model for anomaly detection. In addition, to enhance the effectiveness of detecting anomalies, we incorporate a practical model uncertainty measure into the anomaly score. We show empirically the competitive performance of our approach on benchmark data sets.

ACS Style

Seonho Park; George Adosoglou; Panos M. Pardalos. Interpreting rate-distortion of variational autoencoder and using model uncertainty for anomaly detection. Annals of Mathematics and Artificial Intelligence 2021, 1 -18.

AMA Style

Seonho Park, George Adosoglou, Panos M. Pardalos. Interpreting rate-distortion of variational autoencoder and using model uncertainty for anomaly detection. Annals of Mathematics and Artificial Intelligence. 2021; ():1-18.

Chicago/Turabian Style

Seonho Park; George Adosoglou; Panos M. Pardalos. 2021. "Interpreting rate-distortion of variational autoencoder and using model uncertainty for anomaly detection." Annals of Mathematics and Artificial Intelligence , no. : 1-18.

Journal article
Published: 19 January 2021 in Transportation Research Part E: Logistics and Transportation Review
Reads 0
Downloads 0

This paper introduces a mixed integer programming model for the two-echelon production routing problem with cross-docking satellites. This problem is important in e-commerce, home delivery services, and city logistics. To solve this problem, we propose a branch-and-cut algorithm with proved valid inequalities and a matheuristic that can provide feasible initial solutions. Extensive computational results are reported, which are obtained on instances derived from benchmarks for the production routing problems and two echelon vehicle routing problems. Management insights on dynamic balance among handling costs, inventory costs, and routing costs are also drawn from the sensitivity analysis.

ACS Style

Yuzhuo Qiu; Dan Zhou; Yanan Du; Jie Liu; Panos M. Pardalos; Jun Qiao. The two-echelon production routing problem with cross-docking satellites. Transportation Research Part E: Logistics and Transportation Review 2021, 147, 102210 .

AMA Style

Yuzhuo Qiu, Dan Zhou, Yanan Du, Jie Liu, Panos M. Pardalos, Jun Qiao. The two-echelon production routing problem with cross-docking satellites. Transportation Research Part E: Logistics and Transportation Review. 2021; 147 ():102210.

Chicago/Turabian Style

Yuzhuo Qiu; Dan Zhou; Yanan Du; Jie Liu; Panos M. Pardalos; Jun Qiao. 2021. "The two-echelon production routing problem with cross-docking satellites." Transportation Research Part E: Logistics and Transportation Review 147, no. : 102210.

Journal article
Published: 01 January 2021 in Inverse Problems & Imaging
Reads 0
Downloads 0
ACS Style

Seonho Park; Maciej Rysz; Kaitlin L. Fair; Panos M. Pardalos. Synthetic-Aperture Radar image based positioning in GPS-denied environments using Deep Cosine Similarity Neural Networks. Inverse Problems & Imaging 2021, 15, 763 .

AMA Style

Seonho Park, Maciej Rysz, Kaitlin L. Fair, Panos M. Pardalos. Synthetic-Aperture Radar image based positioning in GPS-denied environments using Deep Cosine Similarity Neural Networks. Inverse Problems & Imaging. 2021; 15 (4):763.

Chicago/Turabian Style

Seonho Park; Maciej Rysz; Kaitlin L. Fair; Panos M. Pardalos. 2021. "Synthetic-Aperture Radar image based positioning in GPS-denied environments using Deep Cosine Similarity Neural Networks." Inverse Problems & Imaging 15, no. 4: 763.

Journal article
Published: 01 January 2021 in Journal of Industrial & Management Optimization
Reads 0
Downloads 0
ACS Style

Xu Zhang; Zhanglin Peng; Qiang Zhang; Xiaoan Tang; Panos M. Pardalos. Identifying and determining crowdsourcing service strategies: An empirical study on a crowdsourcing platform in china. Journal of Industrial & Management Optimization 2021, 1 .

AMA Style

Xu Zhang, Zhanglin Peng, Qiang Zhang, Xiaoan Tang, Panos M. Pardalos. Identifying and determining crowdsourcing service strategies: An empirical study on a crowdsourcing platform in china. Journal of Industrial & Management Optimization. 2021; ():1.

Chicago/Turabian Style

Xu Zhang; Zhanglin Peng; Qiang Zhang; Xiaoan Tang; Panos M. Pardalos. 2021. "Identifying and determining crowdsourcing service strategies: An empirical study on a crowdsourcing platform in china." Journal of Industrial & Management Optimization , no. : 1.

Journal article
Published: 01 January 2021 in Journal of Industrial & Management Optimization
Reads 0
Downloads 0
ACS Style

Junying Hu; Xiaofei Qian; Jun Pei; Changchun Tan; Panos M. Pardalos; Xinbao Liu. A novel quality prediction method based on feature selection considering high dimensional product quality data. Journal of Industrial & Management Optimization 2021, 1 .

AMA Style

Junying Hu, Xiaofei Qian, Jun Pei, Changchun Tan, Panos M. Pardalos, Xinbao Liu. A novel quality prediction method based on feature selection considering high dimensional product quality data. Journal of Industrial & Management Optimization. 2021; ():1.

Chicago/Turabian Style

Junying Hu; Xiaofei Qian; Jun Pei; Changchun Tan; Panos M. Pardalos; Xinbao Liu. 2021. "A novel quality prediction method based on feature selection considering high dimensional product quality data." Journal of Industrial & Management Optimization , no. : 1.

Journal article
Published: 22 December 2020 in Applied Sciences
Reads 0
Downloads 0

This paper seeks to underline the driving factors of farmers’ engagement in Participatory Research Projects (PRPs). This is a critical issue for formulating efficient and effective technology transfer channels, essential for improving the operational status of agricultural holdings. A survey was conducted on a sample of 326 Greek arable crops farmers. An explanatory framework consisting of three major factor categories and 11 variables was developed. A logistic regression analysis empirically tests the effect of the variables on the participation of farmers in PRP. Furthermore, the relative importance of variables and factors is extracted with the Shapley–Owen decomposition analysis. The results show that Farmers’ Willingness and Social Influences are the factors that mostly affect their decision to engage in a PRP. The farmers’ ability consisting of socioeconomic and demographic variables has a small effect on their decision-making process. The estimated effects can help decision-makers to shape and prioritize more targeted policies for farmers’ engagement in research. Additionally, this paper sets the basis for shifting research from simple estimations of the effect of variables on farmers’ decision-making, to a more comprehensive estimation that also accounts for the strength of these relationships. The paper fills a gap in the literature of studies on farmers’ decisions for participating in PRPs, by developing and testing an explanatory framework which also accounts for the relative importance of each factor/variable.

ACS Style

George Vlontzos; Spyros Niavis; Christina Kleisiari; Leonidas Sotirios Kyrgiakos; Christos Athanassiou; Panos Pardalos. Why Farmers Get Involved in Participatory Research Projects? The Case of Arable Crops Farmers in Greece. Applied Sciences 2020, 11, 6 .

AMA Style

George Vlontzos, Spyros Niavis, Christina Kleisiari, Leonidas Sotirios Kyrgiakos, Christos Athanassiou, Panos Pardalos. Why Farmers Get Involved in Participatory Research Projects? The Case of Arable Crops Farmers in Greece. Applied Sciences. 2020; 11 (1):6.

Chicago/Turabian Style

George Vlontzos; Spyros Niavis; Christina Kleisiari; Leonidas Sotirios Kyrgiakos; Christos Athanassiou; Panos Pardalos. 2020. "Why Farmers Get Involved in Participatory Research Projects? The Case of Arable Crops Farmers in Greece." Applied Sciences 11, no. 1: 6.

Si balcor 2017
Published: 02 November 2020 in Annals of Operations Research
Reads 0
Downloads 0

The preface introduces this special issue and describes in brief a number of OR applications in different scientific fields such as environment, forestry, engineering, finance and economics. The findings of this special issue verify the applicability and usefulness of OR different methodologies as a means of acquiring solutions for confronting ICT challenges in the contemporary digital world.

ACS Style

P. Pardalos; E. Zafeiriou; K. Vergidis. Preface: BALCOR 2017. Annals of Operations Research 2020, 294, 1 -7.

AMA Style

P. Pardalos, E. Zafeiriou, K. Vergidis. Preface: BALCOR 2017. Annals of Operations Research. 2020; 294 (1):1-7.

Chicago/Turabian Style

P. Pardalos; E. Zafeiriou; K. Vergidis. 2020. "Preface: BALCOR 2017." Annals of Operations Research 294, no. 1: 1-7.

Journal article
Published: 25 September 2020 in Expert Systems with Applications
Reads 0
Downloads 0

In recent years, there has been an increased interest from both academics and practitioners in automatically analyzing the textual part of companies’ financial reports to extract meaning rich in information for future outcomes. In particular, tracking textual changes among companies’ reports can have a large and significant impact on stock prices. This impact happens with a lag implying that investors only gradually realize the implications of the news hinted by document changes. However, the length of these documents as well as their complexity in terms of structure and language have been increasing dramatically making this process more and more difficult to perform. In this paper, we analyzed how to face this complexity by learning arbitrary dimensional vector representations for US corporate filings (10-Ks) from 1998 to 2018, exploiting and comparing different neural network embedding techniques which take into account words’ semantics through vectors proximity. We also compared their ability to capture changes associated with future risk-adjusted abnormal returns with other more commonly used approaches in literature. Finally, we propose a novel investment strategy named Semantic Similarity Portfolio (SSP) that exploits these neural network embeddings. We show that firms that do not change their 10-Ks in a semantically important way from the previous year tend to have large and statistically significant future risk-adjusted abnormal returns. We, also document an amplifying effect when we incorporate a momentum-related criterion, where the companies selected must also have had positive previous year returns. Specifically, a portfolio that buys “non-changers” based on this strategy earns up to 10% in yearly risk-adjusted abnormal returns (alpha).

ACS Style

George Adosoglou; Gianfranco Lombardo; Panos M. Pardalos. Neural network embeddings on corporate annual filings for portfolio selection. Expert Systems with Applications 2020, 164, 114053 .

AMA Style

George Adosoglou, Gianfranco Lombardo, Panos M. Pardalos. Neural network embeddings on corporate annual filings for portfolio selection. Expert Systems with Applications. 2020; 164 ():114053.

Chicago/Turabian Style

George Adosoglou; Gianfranco Lombardo; Panos M. Pardalos. 2020. "Neural network embeddings on corporate annual filings for portfolio selection." Expert Systems with Applications 164, no. : 114053.

Article
Published: 13 August 2020 in Journal of Global Optimization
Reads 0
Downloads 0

Consoli, S., Korst, J., Pauws, S., Geleijnse, G.: Improved metaheuristics for the quartet method of hierarchical clustering. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-019-00871-1 Article MATH Google Scholar Djogatović, V.R., Djogatović, M., Stanojević, M., Mladenović, N.: Revenue maximization of internet of things provider using variable neighbourhood search. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-020-00894-z Article MATH Google Scholar Gil-Borrás, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A.: GRASP with variable neighborhood descent for the online order batching problem. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-020-00910-2 Article Google Scholar Irawan, C.A., Salhi, S., Soemadi, K.: The continuous single-source capacitated multi-facility weber problem with setup costs: formulation and solution methods. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-019-00862-2 Article Google Scholar Kalatzantonakis, P., Sifaleras, A., Samaras, N.: Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-019-00866-y Article Google Scholar Krimi, I., Todosijević, R., Benmansour, R., Ratli, M., El Cadi, A.A., Aloullal, A.: Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Glob. Optim. (2020). https://doi.org/10.1007/s10898-020-00884-1 Article Google Scholar Martí, R., Pardalos, P.M., Resende, M.G. (eds.): Handbook of Heuristics. Springer, Berlin (2018) Google Scholar Sifaleras, A., Salhi, S., Brimberg, J. (eds.): Variable Neighborhood Search. 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4-7, 2018, Revised Selected Papers, LNCS, vol. 11328. Springer, Cham (2019) Download references Department of Applied Informatics, School of Information Sciences, University of Macedonia, 156 Egnatias Str., 54636, Thessaloniki, Greece Angelo Sifaleras Department of Industrial and Systems Engineering, Research Center on Digital Supply Chain and Operations Management, Khalifa University, Abu Dhabi, UAE Nenad Mladenović Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA Panos M. Pardalos You can also search for this author in PubMed Google Scholar You can also search for this author in PubMed Google Scholar You can also search for this author in PubMed Google Scholar Correspondence to Angelo Sifaleras. Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Reprints and Permissions Sifaleras, A., Mladenović, N. & Pardalos, P.M. Preface to the special issue “ICVNS 2018”. J Glob Optim (2020). https://doi.org/10.1007/s10898-020-00944-6 Download citation Published: 13 August 2020 DOI: https://doi.org/10.1007/s10898-020-00944-6

ACS Style

Angelo Sifaleras; Nenad MladenoviĆ; Panos M. Pardalos. Preface to the special issue “ICVNS 2018”. Journal of Global Optimization 2020, 78, 1 -2.

AMA Style

Angelo Sifaleras, Nenad MladenoviĆ, Panos M. Pardalos. Preface to the special issue “ICVNS 2018”. Journal of Global Optimization. 2020; 78 (2):1-2.

Chicago/Turabian Style

Angelo Sifaleras; Nenad MladenoviĆ; Panos M. Pardalos. 2020. "Preface to the special issue “ICVNS 2018”." Journal of Global Optimization 78, no. 2: 1-2.

Original paper
Published: 23 May 2020 in Optimization Letters
Reads 0
Downloads 0

In this paper, we show that the weighted vertex coloring problem can be solved in polynomial on the sum of vertex weights time for \(\{P_5,K_{2,3}, K^+_{2,3}\}\)-free graphs. As a corollary, this fact implies polynomial-time solvability of the unweighted vertex coloring problem for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs. As usual, \(P_5\) and \(K_{2,3}\) stands, respectively, for the simple path on 5 vertices and for the biclique with the parts of 2 and 3 vertices, \(K^+_{2,3}\) denotes the graph, obtained from a \(K_{2,3}\) by joining its degree 3 vertices with an edge.

ACS Style

D. S. Malyshev; O. O. Razvenskaya; P. M. Pardalos. The computational complexity of weighted vertex coloring for $$\{P_5,K_{2,3},K^+_{2,3}\}$$-free graphs. Optimization Letters 2020, 15, 137 -152.

AMA Style

D. S. Malyshev, O. O. Razvenskaya, P. M. Pardalos. The computational complexity of weighted vertex coloring for $$\{P_5,K_{2,3},K^+_{2,3}\}$$-free graphs. Optimization Letters. 2020; 15 (1):137-152.

Chicago/Turabian Style

D. S. Malyshev; O. O. Razvenskaya; P. M. Pardalos. 2020. "The computational complexity of weighted vertex coloring for $$\{P_5,K_{2,3},K^+_{2,3}\}$$-free graphs." Optimization Letters 15, no. 1: 137-152.

Article
Published: 13 April 2020 in Journal of Combinatorial Optimization
Reads 0
Downloads 0

In this paper, we investigate the constrained shortest path problem where the arc resources of the problem are dependent normally distributed random variables. A model is presented to maximize the probability of all constraints, while not exceeding a certain amount. We assume that the rows of the constraint matrix are dependent, so we use a marginal distribution of the Copula functions, instead of the distribution functions and the dependency is driven by an appropriate Archimedean Copula. Then, we transform the joint chance-constrained problems into deterministic problems of second-order cone programming. This is a new approach where considers the dependency between resource consumptions and connects Copulas to stochastic resource constrained shortest path problem (SRCSPP). The results indicate that the effect of marginal probability levels is considerable. Moreover, the linear relaxation of SRCSPP is generally not convex; thus we can use lower and upper bounds of the second-order cone programming approximation to solve the relaxation problem. The experimental results show that the SRCSPP with Copula theory can achieve efficient performance.

ACS Style

Zohreh Hosseini Nodeh; Ali Babapour Azar; Rashed Khanjani Shiraz; Salman Khodayifar; Panos M. Pardalos. Joint chance constrained shortest path problem with Copula theory. Journal of Combinatorial Optimization 2020, 40, 110 -140.

AMA Style

Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar, Panos M. Pardalos. Joint chance constrained shortest path problem with Copula theory. Journal of Combinatorial Optimization. 2020; 40 (1):110-140.

Chicago/Turabian Style

Zohreh Hosseini Nodeh; Ali Babapour Azar; Rashed Khanjani Shiraz; Salman Khodayifar; Panos M. Pardalos. 2020. "Joint chance constrained shortest path problem with Copula theory." Journal of Combinatorial Optimization 40, no. 1: 110-140.

Article
Published: 19 March 2020 in Journal of Combinatorial Optimization
Reads 0
Downloads 0

Any set function can be decomposed into the difference of two monotone nondecreasing submodular functions. This theorem plays an important role in the set function optimization theory. In this paper, we show a variation that any set function can be decomposed into the difference of two monotone nondecreasing supermodular functions. Meanwhile, we give an example in social network optimization and construct algorithmic solutions for the maximization problem of set functions with this variation of DS decomposition.

ACS Style

Xiang Li; H. George Du; Panos M. Pardalos. A variation of DS decomposition in set function optimization. Journal of Combinatorial Optimization 2020, 40, 36 -44.

AMA Style

Xiang Li, H. George Du, Panos M. Pardalos. A variation of DS decomposition in set function optimization. Journal of Combinatorial Optimization. 2020; 40 (1):36-44.

Chicago/Turabian Style

Xiang Li; H. George Du; Panos M. Pardalos. 2020. "A variation of DS decomposition in set function optimization." Journal of Combinatorial Optimization 40, no. 1: 36-44.

Journal article
Published: 02 December 2019 in IEEE Transactions on Industrial Informatics
Reads 0
Downloads 0
ACS Style

Marzieh Khakifirooz; Chen-Fu Chien; Mahdi Fathi; Panos M. Pardalos. Minimax Optimization for Recipe Management in High-Mixed Semiconductor Lithography Process. IEEE Transactions on Industrial Informatics 2019, 16, 4975 -4985.

AMA Style

Marzieh Khakifirooz, Chen-Fu Chien, Mahdi Fathi, Panos M. Pardalos. Minimax Optimization for Recipe Management in High-Mixed Semiconductor Lithography Process. IEEE Transactions on Industrial Informatics. 2019; 16 (8):4975-4985.

Chicago/Turabian Style

Marzieh Khakifirooz; Chen-Fu Chien; Mahdi Fathi; Panos M. Pardalos. 2019. "Minimax Optimization for Recipe Management in High-Mixed Semiconductor Lithography Process." IEEE Transactions on Industrial Informatics 16, no. 8: 4975-4985.

Journal article
Published: 26 October 2019 in Annals of Operations Research
Reads 0
Downloads 0

This paper investigates the uncertain stochastic resource allocation problem in which the results of a given allocation of resources are described as probabilities and these probabilities are considered to be uncertain from practical aspects. Here uncertainties are introduced by assuming that these probabilities depend on random parameters which are impacted by various factors. The redundancy allocation problem (RAP) and the multi-stage weapon-target assignment (MWTA) problem are special cases of stochastic resource allocation problems. Bi-objective models for the uncertain RAP and MWTA problem in which the conditional value-at-risk measure is used to control the risk brought by uncertainties are presented in this paper. The bi-objective formulation covers the objectives of minimizing the risk of failure of completing activities and the resulting cost of resources. With the aim of determining referenced Pareto fronts, a linearized formulation and an approximated linear formulation are put forward for RAPs and MWTA problems based on problem-specific characteristics, respectively. Two state-of-the-art decomposition-based multi-objective evolutionary algorithms (i.e., MOEA/D-AWA and DMOEA-\(\varepsilon \hbox {C}\)) are used to solve the formulated bi-objective problem. In view of differences between MOEA/D-AWA and DMOEA-\(\varepsilon \hbox {C}\), two matching schemes inspired by DMOEA-\(\varepsilon \hbox {C}\) are proposed and embedded in MOEA/D-AWA. Numerical experiments have been performed on a set of uncertain RAP and MWTA instances. Experimental results demonstrate that DMOEA-\(\varepsilon \hbox {C}\) outperforms MOEA/D-AWA on the majority of test instances and the superiority of DMOEA-\(\varepsilon \hbox {C}\) can be ascribed to the \(\varepsilon \)-constraint framework.

ACS Style

Juan Li; Bin Xin; Panos M. Pardalos; Jie Chen. Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms. Annals of Operations Research 2019, 296, 639 -666.

AMA Style

Juan Li, Bin Xin, Panos M. Pardalos, Jie Chen. Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms. Annals of Operations Research. 2019; 296 (1-2):639-666.

Chicago/Turabian Style

Juan Li; Bin Xin; Panos M. Pardalos; Jie Chen. 2019. "Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms." Annals of Operations Research 296, no. 1-2: 639-666.

Article
Published: 28 August 2019 in International Transactions in Operational Research
Reads 0
Downloads 0

Remanufacturing has been recognized both in literature and practice because of its greenness and cost saving. Since the reproduction processes could be affected by uncertain factors, remanufacturing is much more complex than producing new products. To investigate how yield uncertainty and market competition affect remanufacturing decisions, we compare the results under three classical market scenarios with random yield, that is, (a) Nash–Cournot, (b) monopoly, and (c) Stackelberg–Cournot. On comparing the expected remanufacturing scale, expected profit, and consumer surplus, it shows that as the number of remanufacturers increases, the planned collection quantity of a single remanufacturer decreases, while the total expected market output increases. Furthermore, we find that the largest expected profit and expected consumer surplus brought by market scenarios depend on a threshold remanufacturer number. We also relax the assumptions and extend our model to consider the scenario of m leaders and followers in a Stackelberg game. It is interesting to find that the first‐mover advantage in profit and market share of the leader remanufacturer would be challenged when the number of leader remanufacturers is no less than 2. The results can be potentially useful for managerial decisions and environmental administrations.

ACS Style

Xiaoxi Zhu; Miaomiao Wang; Jun Pei; Panos M. Pardalos. Investigating remanufacturing competition with yield uncertainty on market share, profit, and consumer surplus. International Transactions in Operational Research 2019, 27, 2584 -2615.

AMA Style

Xiaoxi Zhu, Miaomiao Wang, Jun Pei, Panos M. Pardalos. Investigating remanufacturing competition with yield uncertainty on market share, profit, and consumer surplus. International Transactions in Operational Research. 2019; 27 (5):2584-2615.

Chicago/Turabian Style

Xiaoxi Zhu; Miaomiao Wang; Jun Pei; Panos M. Pardalos. 2019. "Investigating remanufacturing competition with yield uncertainty on market share, profit, and consumer surplus." International Transactions in Operational Research 27, no. 5: 2584-2615.