| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Lucchesi, C.L. and Murty, U.S.R. | Perfect Matchings A Theory of Matching Covered Graphs | 2024 | , pp. 1 online resource (584 pages) | misc | DOI |
| Abstract: Beginning with its origins in the pioneering work of W.T. Tutte in 1947, this monograph systematically traces through some of the impressive developments in matching theory. A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems. The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students. | |||||
BibTeX:
@misc{Lucchesi2024,
author = {Lucchesi, Cláudio L. and Murty, U. S. R.},
title = {Perfect Matchings A Theory of Matching Covered Graphs},
publisher = {Springer Nature Switzerland : Imprint: Springer,},
year = {2024},
pages = {1 online resource (584 pages)},
note = {: by Cláudio L. Lucchesi, U.S.R. Murty. Part I. Basic Theory -- Part II -- Brick and Brace Generation -- Part III -- Pfaffian Orientations -- A. Solutions to Selected Exercises -- References -- List of Figures -- Glossary -- Index. Algorithms and Computation in Mathematics ; 31},
doi = {https://doi.org/10.1007/978-3-031-47504-7}
}
|
|||||
| Alangari, N., Menai, M.E., Mathkour, H. and Almosallam, I. | Intrinsically Interpretable Gaussian Mixture Model | 2023 | Vol. 14(3) |
misc | DOI |
| Abstract: Understanding the reasoning behind a predictive model’s decision is an important and longstanding problem driven by ethical and legal considerations. Most recent research has focused on the interpretability of supervised models, whereas unsupervised learning has received less attention. However, the majority of the focus was on interpreting the whole model in a manner that undermined accuracy or model assumptions, while local interpretation received much less attention. Therefore, we propose an intrinsic interpretation for the Gaussian mixture model that provides both global insight and local interpretations. We employed the Bhattacharyya coefficient to measure the overlap and divergence across clusters to provide a global interpretation in terms of the differences and similarities between the clusters. By analyzing the GMM exponent with the Garthwaite–Kock corr-max transformation, the local interpretation is provided in terms of the relative contribution of each feature to the overall distance. Experimental results obtained on three datasets show that the proposed interpretation method outperforms the post hoc model-agnostic LIME in determining the feature contribution to the cluster assignment. | |||||
BibTeX:
@misc{Alangari2023,
author = {Alangari, Nourah and Menai, Mohamed E. and Mathkour, Hassan and Almosallam, Ibrahim},
title = {Intrinsically Interpretable Gaussian Mixture Model},
year = {2023},
volume = {14},
number = {3},
doi = {https://doi.org/10.3390/info14030164}
}
|
|||||
| Beck, A. | Introduction to nonlinear optimization : theory, algorithms and applications with Python and MATLAB | 2023 | , pp. pages cm. | book | |
| Abstract: "This book is a modern introduction to the area of optimization. Its objective is to provide the foundations of theory and algorithms of nonlinear optimization, as well as to present a variety of applications from diverse areas of applied sciences"-- | |||||
BibTeX:
@book{Beck2023,
author = {Beck, Amir},
title = {Introduction to nonlinear optimization : theory, algorithms and applications with Python and MATLAB},
publisher = {Society for Industrial and Applied Mathematics},
year = {2023},
pages = {pages cm.},
edition = {Second edition.},
note = {2023009070 Amir Beck, Tel Aviv University, Tel Aviv, Israel. Includes bibliographical references and index.}
}
|
|||||
| Beck, Y., Ljubić, I. and Schmidt, M. | A survey on bilevel optimization under uncertainty | 2023 | European Journal of Operational Research | article | DOI URL |
| Abstract: Bilevel optimization is a very active field of applied mathematics. The main reason is that bilevel optimization problems can serve as a powerful tool for modeling hierarchical decision making processes. This ability, however, also makes the resulting problems challenging to solve—both in theory and practice. Fortunately, there have been significant algorithmic advances in the field of bilevel optimization so that we can solve much larger and also more complicated problems today compared to what was possible to solve two decades ago. This results in more and more challenging bilevel problems that researchers try to solve today. This survey gives a detailed overview of one of these more challenging classes of bilevel problems: bilevel optimization under uncertainty. We review the classic ways of addressing uncertainties in bilevel optimization using stochastic or robust techniques. Moreover, we highlight that the sources of uncertainty in bilevel optimization are much richer than for usual, i.e., single-level, problems since not only the problem’s data can be uncertain but also the (observation of the) decisions of the two players can be subject to uncertainty. We thus also review the field of bilevel optimization under limited observability, the area of problems considering only near-optimal decisions, and discuss intermediate solution concepts between the optimistic and pessimistic cases. Finally, we also review the rich literature on applications studied using uncertain bilevel problems such as in energy, for interdiction games and security applications, in management sciences, and networks. | |||||
BibTeX:
@article{Beck2023a,
author = {Beck, Yasmine and Ljubić, Ivana and Schmidt, Martin},
title = {A survey on bilevel optimization under uncertainty},
journal = {European Journal of Operational Research},
year = {2023},
url = {https://www.sciencedirect.com/science/article/pii/S0377221723000073},
doi = {https://doi.org/10.1016/j.ejor.2023.01.008}
}
|
|||||
| Chen, B., Bai, R., Li, J., Liu, Y., Xue, N. and Ren, J. | A multiobjective single bus corridor scheduling using machine learning-based predictive models [BibTeX] |
2023 | International Journal of Production Research Vol. 61(1), pp. 131–145 |
article | DOI URL |
BibTeX:
@article{Chen2023,
author = {Chen, Bing and Bai, Ruibin and Li, Jiawei and Liu, Yueni and Xue, Ning and Ren, Jianfeng},
title = {A multiobjective single bus corridor scheduling using machine learning-based predictive models},
journal = {International Journal of Production Research},
year = {2023},
volume = {61},
number = {1},
pages = {131–145},
url = {https://doi.org/10.1080/00207543.2020.1766716},
doi = {https://doi.org/10.1080/00207543.2020.1766716}
}
|
|||||
| Echenique, F., Immorlica, N. and Vazirani, V.V. | Online and matching-based market design | 2023 | , pp. 1 online resource (xxii, 697 pages) | misc | DOI |
| Abstract: Written by more than fifty top researchers from economics, OR, and algorithm design, this text comprehensively covers a major inter-disciplinary field and its important applications from the basics to state of the art. Key chapters discuss efficiency, fairness and incentives, and market design and its relation to social choice theory. | |||||
BibTeX:
@misc{Echenique2023,
author = {Echenique, Federico and Immorlica, Nicole and Vazirani, Vijay V.},
title = {Online and matching-based market design},
publisher = {Cambridge University Press,},
year = {2023},
pages = {1 online resource (xxii, 697 pages)},
note = {edited by Federico Echenique, Nicole Immorlica, Vijay V. Vazirani ; with a foreword by Alvin E. Roth. illustrations (black and white), digital, PDF file(s) Specialized. Also issued in print: 2023. Includes bibliographical references and index. Description based on online resource; title from PDF title page},
doi = {https://doi.org/10.1017/9781108937535}
}
|
|||||
| Han, B., Zhang, Y., Wang, S. and Park, Y. | The efficient and stable planning for interrupted supply chain with dual‐sourcing strategy: a robust optimization approach considering decision maker's risk attitude | 2023 | Omega Vol. 115, pp. 102775 |
article | DOI URL |
| Abstract: ABSTRACT In the face of the complex market environment and the in-depth development of globalization, ensuring the supply chain's stability and cost leadership by developing a differentiated dual-source procurement strategy is extremely important. The present study contemplates the supply chain as the research object. It also considers disruption uncertainty and decision-makers’ risk attitudes. To minimize costs and shortages, we build a dual-objective robust optimization model for a dual-sourcing strategy under interruption risk. The authors aim to explore efficient and robust planning under supply disruption uncertainty in dual-sourcing strategies by different risk attitudes. The research employs the augmented ε-constraint method to solve the proposed model by transforming the model into a single-objective mixed-integer programming model. Additionally, our study uses enterprise examples to prove the feasibility and effectiveness of the model. Moreover, it conducts risk attitude analysis, dual objective function trade-off analysis, and superiority analysis of procurement strategies. Finally, we put forward some management insights to provide a new decision-making idea for real supply chain enterprises in the case of supply interruption risk. | |||||
BibTeX:
@article{Han2023,
author = {Han, Bing and Zhang, Ying and Wang, Song and Park, Yongshin},
title = {The efficient and stable planning for interrupted supply chain with dual‐sourcing strategy: a robust optimization approach considering decision maker's risk attitude},
journal = {Omega},
year = {2023},
volume = {115},
pages = {102775},
url = {https://www.sciencedirect.com/science/article/pii/S0305048322001827},
doi = {https://doi.org/10.1016/j.omega.2022.102775}
}
|
|||||
| Hünermund, P. and Bareinboim, E. | Causal Inference and Data Fusion in Econometrics | 2023 | The Econometrics Journal, pp. utad008 | article | DOI URL |
| Abstract: Learning about cause and effect is arguably the main goal in applied econometrics. In practice, the validity of these causal inferences is contingent on a number of critical assumptions regarding the type of data that has been collected and the substantive knowledge that is available about the phenomenon under investigation. For instance, unobserved confounding factors threaten the internal validity of estimates; data availability is often limited to non-random, selection-biased samples; causal effects need to be learned from surrogate experiments with imperfect compliance; and causal knowledge has to be extrapolated across structurally heterogeneous populations. A powerful and flexible causal inference framework is required in order to tackle all of these challenges, which plague essentially any data analysis to varying degrees. Building on the structural perspective on causality introduced by Haavelmo (1943) and the graph-theoretic approach proposed by Pearl (1995), the artificial intelligence (AI) literature has developed a wide array of techniques for causal inference that allow to leverage information from various imperfect, heterogeneous, and biased data sources (Bareinboim and Pearl, 2016). In this paper, we review recent advances made in this literature that have the potential to contribute to econometric methodology along three broad dimensions. First, they provide a unified and comprehensive framework for causal learning, in which the above-mentioned problems can be addressed in generality. Second, due to their origin in AI, they come together with sound, efficient, and complete (to be formally defined) algorithmic criteria for automation of the corresponding identification task. And third, because of the nonparametric description of structural models that graph-theoretic approaches build on, they combine the analytical rigor of structural econometrics with the flexibility of the potential outcomes framework, and thus offer a valuable complement to these two literature streams. | |||||
BibTeX:
@article{Huenermund2023,
author = {Hünermund, Paul and Bareinboim, Elias},
title = {Causal Inference and Data Fusion in Econometrics},
journal = {The Econometrics Journal},
year = {2023},
pages = {utad008},
url = {https://doi.org/10.1093/ectj/utad008},
doi = {https://doi.org/10.1093/ectj/utad008}
}
|
|||||
| Krüger, C., Schöbel, A., Fritzen, L. and Wiecek, M.M. | The point-based robustness gap for uncertain multiobjective optimization [BibTeX] |
2023 | Optimization, pp. 1–35 | article | DOI URL |
BibTeX:
@article{Krueger2023,
author = {Krüger, Corinna and Schöbel, Anita and Fritzen, Lena and Wiecek, Margaret M.},
title = {The point-based robustness gap for uncertain multiobjective optimization},
journal = {Optimization},
year = {2023},
pages = {1–35},
url = {https://doi.org/10.1080/02331934.2023.2181080},
doi = {https://doi.org/10.1080/02331934.2023.2181080}
}
|
|||||
| Ksciuk, J., Kuhlemann, S., Tierney, K. and Koberstein, A. | Uncertainty in maritime ship routing and scheduling: A Literature review | 2023 | European Journal of Operational Research Vol. 308(2), pp. 499–524 |
article | DOI URL |
| Abstract: The area of maritime transportation optimization has recently begun to achieve increasing success at solving large scale models, and industry is steadily adopting operations research-based models and algorithms. However, the parameters of models in the maritime domain, like many others, are beset with uncertainty. The travel times of ships, the handling times at port, the amounts of demand available at ports, fuel prices and more are all unknown and highly variable inputs to optimization methods. Recently, the maritime literature has started to address sources of uncertainty to provide higher quality decision making. We review this nascent area of the literature and provide a unifying view of different types of uncertainty across the main areas of maritime transport and varying problem types. | |||||
BibTeX:
@article{Ksciuk2023,
author = {Ksciuk, Jana and Kuhlemann, Stefan and Tierney, Kevin and Koberstein, Achim},
title = {Uncertainty in maritime ship routing and scheduling: A Literature review},
journal = {European Journal of Operational Research},
year = {2023},
volume = {308},
number = {2},
pages = {499–524},
url = {https://www.sciencedirect.com/science/article/pii/S037722172200649X},
doi = {https://doi.org/10.1016/j.ejor.2022.08.006}
}
|
|||||
| Liu, Q.X., Li, N., Jia, H.M., Qi, Q. and Abualigah, L. | A chimp-inspired remora optimization algorithm for multilevel thresholding image segmentation using cross entropy [BibTeX] |
2023 | Artificial Intelligence Review | article | DOI URL |
BibTeX:
@article{Liu2023,
author = {Liu, Q. X. and Li, N. and Jia, H. M. and Qi, Q. and Abualigah, L.},
title = {A chimp-inspired remora optimization algorithm for multilevel thresholding image segmentation using cross entropy},
journal = {Artificial Intelligence Review},
year = {2023},
note = {Liu, Qingxin Li, Ni Jia, Heming Qi, Qi Abualigah, Laith 1573-7462},
url = { |
|||||
| Mccauley, J., Shenker, S. and Varghese, G. | Extracting the Essential Simplicity of the Internet [BibTeX] |
2023 | Commun. ACM Vol. 66(2), pp. 64–74 |
article | DOI URL |
BibTeX:
@article{Mccauley2023,
author = {Mccauley, James and Shenker, Scott and Varghese, George},
title = {Extracting the Essential Simplicity of the Internet},
journal = {Commun. ACM},
year = {2023},
volume = {66},
number = {2},
pages = {64–74},
url = {https://doi.org/10.1145/3547137},
doi = {https://doi.org/10.1145/3547137}
}
|
|||||
| Qiu, H., Gu, W., Ning, C., Lu, X., Liu, P. and Wu, Z. | Multistage Mixed-Integer Robust Optimization for Power Grid Scheduling: An Efficient Reformulation Algorithm [BibTeX] |
2023 | IEEE Transactions on Sustainable Energy Vol. 14(1), pp. 254–271 |
article | DOI |
BibTeX:
@article{Qiu2023,
author = {Qiu, H. and Gu, W. and Ning, C. and Lu, X. and Liu, P. and Wu, Z.},
title = {Multistage Mixed-Integer Robust Optimization for Power Grid Scheduling: An Efficient Reformulation Algorithm},
journal = {IEEE Transactions on Sustainable Energy},
year = {2023},
volume = {14},
number = {1},
pages = {254–271},
doi = {https://doi.org/10.1109/TSTE.2022.3210214}
}
|
|||||
| Shani, C., Zarecki, J. and Shahaf, D. | The Lean Data Scientist: Recent Advances Toward Overcoming the Data Bottleneck [BibTeX] |
2023 | Commun. ACM Vol. 66(2), pp. 92–102 |
article | DOI URL |
BibTeX:
@article{Shani2023,
author = {Shani, Chen and Zarecki, Jonathan and Shahaf, Dafna},
title = {The Lean Data Scientist: Recent Advances Toward Overcoming the Data Bottleneck},
journal = {Commun. ACM},
year = {2023},
volume = {66},
number = {2},
pages = {92–102},
url = {https://doi.org/10.1145/3551635},
doi = {https://doi.org/10.1145/3551635}
}
|
|||||
| Front Matter | 2022 | Iterative Methods and Preconditioners for Systems of Linear Equations, pp. i–x | inbook | DOI URL | |
| Abstract: The front matter includes the title page, series page, copyright page, dedication page, TOC, preface. | |||||
BibTeX:
@inbook{2022,,
title = {Front Matter},
booktitle = {Iterative Methods and Preconditioners for Systems of Linear Equations},
publisher = {Society for Industrial and Applied Mathematics},
year = {2022},
pages = {i–x},
note = {doi:10.1137/1.9781611976908.fm},
url = {https://doi.org/10.1137/1.9781611976908.fm},
doi = {https://doi.org/10.1137/1.9781611976908.fm10.1137/1.9781611976908.fm}
}
|
|||||
| Achamrah, F.E., Riane, F. and Limbourg, S. | Spare parts inventory routing problem with transshipment and substitutions under stochastic demands | 2022 | Applied Mathematical Modelling Vol. 101, pp. 309–331 |
article | DOI URL |
| Abstract: We study a two-level spare parts supply chain in which a manufacturer supplies a central warehouse (CW) with original equipment manufacturer (OEM) and replacement or pattern parts (PP). The CW, distantly located from the manufacturer, distributes both OEM parts and PP to a given number of depots facing stochastic demands. The demand for spare parts is intermittent, exhibiting an infrequent rate and extreme dispersal over time periods. Along with lateral transshipment, PP can be used as substitutes for the OEM parts to sidestep shortage at depots. Assuming that emergency shipments are significantly longer and more expensive, we aim at underlining the relative effectiveness of such a new spare parts inventory management policy. A mixed-integer linear programming model is proposed to solve the inventory routing problem with transshipment and substitution under stochastic demands. The objective is to minimise costs of holding inventory, transportation which includes regular shipment and transshipment, substitution and lost sales. To solve the problem, Sample Average Approximation method is used. Based on empirical goodness-of-fit tests, three demand patterns are studied: Poisson distribution, stuttering Poisson distribution and negative binomial distribution. The model is tested on well-known benchmark instances generated for multi-product multi-vehicle IRP. Computational experiments highlight the benefits of promoting transshipment and substitution on the overall supply chain performance. Results also suggest insights, which are of interest to professionals who are willing to develop new decision support models for the most efficient management of such items. | |||||
BibTeX:
@article{Achamrah2022,
author = {Achamrah, Fatima Ezzahra and Riane, Fouad and Limbourg, Sabine},
title = {Spare parts inventory routing problem with transshipment and substitutions under stochastic demands},
journal = {Applied Mathematical Modelling},
year = {2022},
volume = {101},
pages = {309–331},
url = {https://www.sciencedirect.com/science/article/pii/S0307904X21004042},
doi = {https://doi.org/10.1016/j.apm.2021.08.029}
}
|
|||||
| Akkan, C., Gülcü, A. and Kuş, Z. | Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation | 2022 | Journal of Scheduling Vol. 25(4), pp. 477–501 |
article | DOI URL |
| Abstract: In the process of developing a university’s weekly course timetable, changes in the data, such as the available time periods of professors or rooms, render the timetable infeasible, requiring the administrators to repair or update the timetable. Since such changes almost always occur, it would be a sensible approach to identify a robust initial timetable, that is, one that can be repaired by making a limited number of changes, while still maintaining a high solution quality. This article formulates the problem as a bi-criteria optimization one, in which robustness is a stochastic objective, and the goal is to identify a good approximation to the Pareto frontier. It is assumed that multiple data changes, or disruptions, of multiple types can occur. The solution approach is a multi-objective simulated annealing (MOSA) algorithm, where a surrogate measure is used to approximate the robustness objective. Inspired by the concept of slack in machine and project scheduling, ten alternative measures of slack and a total of thirty surrogate measures are defined. Preliminary computational experiments are used to narrow the list of promising ones first to eight and then to two measures, which are then tested within a MOSA algorithm. Computational experiments show that one of these measures, when implemented in a multi-start MOSA algorithm, consistently provides the best Pareto frontier. | |||||
BibTeX:
@article{Akkan2022,
author = {Akkan, Can and Gülcü, Ayla and Kuş, Zeki},
title = {Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation},
journal = {Journal of Scheduling},
year = {2022},
volume = {25},
number = {4},
pages = {477–501},
url = {https://doi.org/10.1007/s10951-022-00722-0},
doi = {https://doi.org/10.1007/s10951-022-00722-0}
}
|
|||||
| Alamoush, A.S., Ölçer, A.I. and Ballini, F. | Ports’ role in shipping decarbonisation: A common port incentive scheme for shipping greenhouse gas emissions reduction | 2022 | Cleaner Logistics and Supply Chain Vol. 3, pp. 100021 |
article | DOI URL |
| Abstract: Shipping greenhouse gas (GHG) emissions reduction has always been slow, which has led to the tightening of international and regional regulations, e.g. IMO’s 2023 measures, and the EU Climate law. While the shipping industry is accelerating decarbonisation, questions are raised as to what roles ports can play in adopting measures to facilitate shipping GHG emissions reduction, particularly through the incentives schemes. Therefore, by means of a content analysis review, this study aims to investigate this phenomenon and scrutinise various existing incentive schemes. Findings indicate that there are various measures ports can adopt to facilitate ships’ GHG emissions reduction, but the current incentive schemes are onerous, and their uptake by shipping, and by ports as incentive provider, is still limited. The focus of these schemes is not solely on GHG emissions reduction, and thus, they don’t strongly support shipping decarbonisation. Given these issues, a framework of seven actions for a port common incentive scheme to reduce shipping GHG emissions at the ship-port interface, and in maritime supply chains, is proposed. The underlying actions have been developed to arrive at a successful scheme by sorting out the inherent challenges in existing incentive schemes. Thus, the framework suggests incentivising front-runner ships that implement decarbonisation technologies beyond regulations, harmonising requirements, minimising underlying obstacles, creating a level playing field, and ultimately aligning with the IMO forthcoming regulations. This study serves as a guiding framework for port managers and policymakers to either adopt the proposed common incentive scheme or, at least, to reconfigure the current adopted incentives. Identified fertile future research areas promote scholarly discussions in the field. | |||||
BibTeX:
@article{Alamoush2022,
author = {Alamoush, Anas S. and Ölçer, Aykut I. and Ballini, Fabio},
title = {Ports’ role in shipping decarbonisation: A common port incentive scheme for shipping greenhouse gas emissions reduction},
journal = {Cleaner Logistics and Supply Chain},
year = {2022},
volume = {3},
pages = {100021},
url = {https://www.sciencedirect.com/science/article/pii/S2772390921000214},
doi = {https://doi.org/10.1016/j.clscn.2021.100021}
}
|
|||||
| AlKheder, S., Naif, D., Musaed, D., Al Shrekah, S., Al Rshaid, M., Al. Anzi, N. and Baqer, I. | Maritime transport management in Kuwait toward an automated port logistical city | 2022 | Cleaner Logistics and Supply Chain Vol. 3, pp. 100031 |
article | DOI URL |
| Abstract: Maritime transport is the second source of income in Kuwait. The unorganized mechanism of truck traffic flow had caused severe congestion and increased the waiting time of containers transporting trucks both inside and outside the port. Also, the insufficiency of the container storage area had contributed to the reduction in the ship traffic and the unavailability of area for the basic infrastructure needed to accommodate and store the overstocked shipments inside the port. The objective of this study was to set the cornerstone of 2035 vision of a fully automated Kuwaiti Port. An automated Smart Gate was used to reduce the time required for both the passage of cargo and customs inspection. A LEED-certified warehouse was designed that earned 75 points scoring a gold certificate. A smart gate operating system by Camco Group was used to provide a smart portal that integrates the functions of both the port and customs administration. This will make it easier for the port customers and truck drivers to facilitate entry and exit procedures. Vissim was used to simulate, analyze, and compare the current and future logistical operations in Shuwaikh Port under different scenarios. The future operation scenario had decreased the average time a truck took to finish a route to 40%. | |||||
BibTeX:
@article{AlKheder2022,
author = {AlKheder, Sharaf and Naif, Dana and Musaed, Dana and Al Shrekah, Shoug and Al Rshaid, Munira and Al. Anzi, Nada and Baqer, Isra'a},
title = {Maritime transport management in Kuwait toward an automated port logistical city},
journal = {Cleaner Logistics and Supply Chain},
year = {2022},
volume = {3},
pages = {100031},
url = {https://www.sciencedirect.com/science/article/pii/S277239092200004X},
doi = {https://doi.org/10.1016/j.clscn.2022.100031}
}
|
|||||
| Alshehri, A.S. and You, F. | Machine learning for multiscale modeling in computational molecular design | 2022 | Current Opinion in Chemical Engineering Vol. 36, pp. 100752 |
article | DOI URL |
| Abstract: The chemical industry is facing ever-increasing challenges for developing novel products and processes capable of reducing environmental impacts and curbing resource depletion. Yet, the interplay between molecular phenomena and the design of products and processes are often oversimplified. Machine learning stands uniquely positioned to disentangle the complexity of multiscale modeling by leveraging data to navigate the design spaces of multifaceted molecular systems. Herein, we limit our survey of machine learning applications in computational molecular design (CMD) to four elements: property estimation, catalysis, synthesis planning, and design methods. Through this perspective, we aim to offer a roadmap for future work on multiscale modeling that better explores the interplay between nanoscale features and macroscale decisions in product and process design. | |||||
BibTeX:
@article{Alshehri2022,
author = {Alshehri, Abdulelah S. and You, Fengqi},
title = {Machine learning for multiscale modeling in computational molecular design},
journal = {Current Opinion in Chemical Engineering},
year = {2022},
volume = {36},
pages = {100752},
url = {https://www.sciencedirect.com/science/article/pii/S2211339821000848},
doi = {https://doi.org/10.1016/j.coche.2021.100752}
}
|
|||||
| Alzahrani, A., Petri, I., Ghoroughi, A. and Rezgui, Y. | A proposed roadmap for delivering zero carbon fishery ports | 2022 | Energy Reports Vol. 8, pp. 82–88 |
article | DOI URL |
| Abstract: Many seaports are facing increasing pressure to reduce their carbon footprint, while increasing their energy efficiency and global competitiveness. Moreover, energy consumption in seaports is continuously monitored to manage the increasing energy costs, these rising costs are reflected in the increased fuel demand. The fishing industry is one of the most energy intensive activity at seaports. In addition, the global human consumption of fish increased dramatically from 1950 to 2012. This paper will develop a roadmap to convert fishing ports into carbon-free ports. A number of techniques and methodologies will be used to analyze energy consumption in the port and buildings, and will include sustainability informed decision making. The overall objective of the net-zero port is to reduce energy dependence from the national grid by taking advantage of the electricity produced locally from solar energy. The roadmap that we have developed will contribute to the emergence of carbon-free fishery port ecosystem that can implement sustainable energy practices, including an assessment of the quality of the energy used in the fishery port and informed practices for promoting carbon-free societies. | |||||
BibTeX:
@article{Alzahrani2022,
author = {Alzahrani, Ateyah and Petri, Ioan and Ghoroughi, Ali and Rezgui, Yacine},
title = {A proposed roadmap for delivering zero carbon fishery ports},
journal = {Energy Reports},
year = {2022},
volume = {8},
pages = {82–88},
url = {https://www.sciencedirect.com/science/article/pii/S235248472200083X},
doi = {https://doi.org/10.1016/j.egyr.2022.01.083}
}
|
|||||
| Ananth, C.V. and Brandt, J.S. | A principled approach to mediation analysis in perinatal epidemiology | 2022 | American Journal of Obstetrics and Gynecology Vol. 226(1), pp. 24–32.e6 |
article | DOI URL |
| Abstract: For many research questions in perinatal epidemiology, gestational age is a mediator that features the causal pathway between exposure and outcome. A mediator is an intermediate variable between an exposure and outcome, which is influenced by the exposure on the causal pathway to the outcome. Therefore, conventional analyses that adjust, stratify, or match for gestational age or its proxy (eg, preterm vs term deliveries) are problematic. This practice, which is entrenched in perinatal research, induces an overadjustment bias. Depending on the causal question, it may be inappropriate to adjust (or condition) for a mediator, such as gestational age, by either design or statistical analysis, but its effect can be quantified through causal mediation analysis. In an exposition of such methods, we demonstrated the relationship between the exposure and outcome and provided a formal analytical framework to quantify the extent to which a causal effect is influenced by a mediator. We reviewed concepts of confounding and causal inference, introduced the concept of a mediator and illustrated the perils of adjusting for a mediator in an exposure-outcome paradigm for a given causal question, adopted causal methods that call for an evaluation of a mediator in a causal exposure effect on the outcome, and discussed unmeasured confounding assumptions in mediation analysis. Furthermore, we reviewed other developments in the causal mediation analysis literature, including decomposition of a total effect when the mediator interacts with the exposure (4-way decomposition), methods for multiple mediators, mediation methods for case-control studies, mediation methods for time-to-event outcomes, sample size and power analysis for mediation analysis, and available software to apply these methods. To illustrate these methods, we provided a clinical example to estimate the risk of perinatal mortality (outcome) concerning placental abruption (exposure) and to determine the extent to which preterm delivery (mediator; a proxy for gestational age) plays a role in this causal effect. We hoped that the adoption of mediation methods described in this review will move research in perinatal epidemiology away from biased adjustments of mediators toward a more nuanced quantification of effects that pose unique challenges and provide unique insights in our field. | |||||
BibTeX:
@article{Ananth2022,
author = {Ananth, Cande V. and Brandt, Justin S.},
title = {A principled approach to mediation analysis in perinatal epidemiology},
journal = {American Journal of Obstetrics and Gynecology},
year = {2022},
volume = {226},
number = {1},
pages = {24–32.e6},
url = {https://www.sciencedirect.com/science/article/pii/S0002937821011765},
doi = {https://doi.org/10.1016/j.ajog.2021.10.028}
}
|
|||||
| Andersson, M.P., Jones, M.N., Mikkelsen, K.V., You, F. and Mansouri, S.S. | Quantum computing for chemical and biomolecular product design | 2022 | Current Opinion in Chemical Engineering Vol. 36, pp. 100754 |
article | DOI URL |
| Abstract: Chemical process design has for long been benefiting from computer-aided methods and tools to develop new processes and services that can meet the needs of society. Chemical and biomolecular product design could also benefit from the use of computer-aided solution strategies and computational power to efficiently solve the problems at various scales as the complexity and size of problems grow. In this context, new modes of computation such as quantum computing are receiving increasing attention. While quantum computing has been in development for quite some time, the development of the technology to the point of making commercial use of such resources is quite recent, and still quite limited in scope. However, projections point to a rapid development of quantum computing resources becoming available to academia and industry, which opens potential application areas in chemical and biomolecular product design. With the advent of hybrid algorithms that are able to take advantage of both classical computing and quantum computing resources, as quantum computing grows, more and more problems relevant for chemical product design will become solvable. In this paper, some perspectives are given by identifying a set of needs and challenges for a selected set of opportunities, such as quantum chemistry-based property prediction, protein folding, complex multi-step chemical reactions, and molecular reaction dynamics. | |||||
BibTeX:
@article{Andersson2022,
author = {Andersson, Martin P. and Jones, Mark N. and Mikkelsen, Kurt V. and You, Fengqi and Mansouri, Seyed Soheil},
title = {Quantum computing for chemical and biomolecular product design},
journal = {Current Opinion in Chemical Engineering},
year = {2022},
volume = {36},
pages = {100754},
url = {https://www.sciencedirect.com/science/article/pii/S2211339821000861},
doi = {https://doi.org/10.1016/j.coche.2021.100754}
}
|
|||||
| Arrigo, A., Ordoudis, C., Kazempour, J., De Grève, Z., Toubeau, J.-F. and Vallée, F. | Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: An exact and physically-bounded formulation | 2022 | European Journal of Operational Research Vol. 296(1), pp. 304–322 |
article | DOI URL |
| Abstract: In the context of transition towards sustainable, cost-efficient and reliable energy systems, the improvement of current energy and reserve dispatch models is crucial to properly cope with the uncertainty of weather-dependent renewable power generation. In contrast to traditional approaches, distributionally robust optimization offers a risk-aware framework that provides performance guarantees when the distribution of uncertain parameters is not perfectly known. In this paper, we develop a distributionally robust chance-constrained optimization with a Wasserstein ambiguity set for energy and reserve dispatch, and provide an exact reformulation. While preserving the exactness, we then improve the model by enforcing physical bounds on the uncertainty space, resulting in a bilinear program. We solve the resulting bilinear model with an iterative algorithm which is computationally efficient and has convergence guarantee. A thorough out-of-sample analysis is performed to compare the proposed model against a scenario-based stochastic program. We also compare the performance of the proposed exact reformulation against an existing approximate technique in the literature, built upon a conditional-value-at-risk measure. We eventually show that the proposed physically-bounded exact reformulation outperforms the other methods by achieving a cost-optimal yet reliable trade-off between reserve procurement and load curtailment. | |||||
BibTeX:
@article{Arrigo2022,
author = {Arrigo, Adriano and Ordoudis, Christos and Kazempour, Jalal and De Grève, Zacharie and Toubeau, Jean-François and Vallée, François},
title = {Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: An exact and physically-bounded formulation},
journal = {European Journal of Operational Research},
year = {2022},
volume = {296},
number = {1},
pages = {304–322},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721003271},
doi = {https://doi.org/10.1016/j.ejor.2021.04.015}
}
|
|||||
| Atakan, S., Gangammanavar, H. and Sen, S. | Towards a Sustainable Power Grid: Stochastic Hierarchical Planning for High Renewable Integration | 2022 | European Journal of Operational Research | article | DOI URL |
| Abstract: Driven by ambitious renewable portfolio standards, large-scale inclusion of variable energy resources (such as wind and solar) are expected to introduce unprecedented levels of uncertainty into power system operations. The current practice of operations planning with deterministic optimization models may be ill-suited for a future with abundant uncertainty. To overcome the potential reliability and economic challenges, we present a stochastic hierarchical planning (SHP) framework for power systems coordinated by a centralized planner. This framework captures operations at day-ahead, short-term and hour-ahead timescales, along with the interactions between the stochastic processes and decisions. In contrast to earlier studies where stochastic optimization of individual problems (e.g., unit commitment, economic dispatch) have been studied, this paper studies an integrated framework of planning under uncertainty, where stochastic optimization models are stitched together in a hierarchical setting, which parallels the deterministic hierarchical planning approach that is widely adopted in the power industry. Our experiments, based on the NREL-118 dataset, reveal that under high renewable integration, significant operational improvements can be expected by transitioning to the SHP paradigm. In particular, the computational results show that significant improvements can be achieved in several metrics, including system reliability, environmental sustainability, and system economics, solely by making a strategic choice to adopt the new SHP paradigm. | |||||
BibTeX:
@article{Atakan2022,
author = {Atakan, Semih and Gangammanavar, Harsha and Sen, Suvrajeet},
title = {Towards a Sustainable Power Grid: Stochastic Hierarchical Planning for High Renewable Integration},
journal = {European Journal of Operational Research},
year = {2022},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721010985},
doi = {https://doi.org/10.1016/j.ejor.2021.12.042}
}
|
|||||
| Baggio, G., Carè, A., Scampicchio, A. and Pillonetto, G. | Bayesian frequentist bounds for machine learning and system identification | 2022 | Automatica Vol. 146, pp. 110599 |
article | DOI URL |
| Abstract: Estimating a function from noisy measurements is a crucial problem in statistics and engineering, with an impact on machine learning predictions and identification of dynamical systems. In view of robust control design and safety-critical applications such as autonomous driving and smart healthcare, estimates are required to be complemented with uncertainty bounds quantifying their reliability. Most of the available results are derived by constraining the estimates to belong to a deterministic function space; however, the returned bounds often result overly conservative and, hence, of limited usefulness. An alternative is to use a Bayesian framework. The regions thereby obtained however require complete specification of prior distributions whose choice may significantly affect the probability of inclusion. This study presents a framework for the effective computation of regions that include the unknown function with exact probability. In this setting, the users not only have the freedom to modulate the amount of prior knowledge that informs the constructed regions but can, on a different plane, finely modulate their commitment to such information. The result is a versatile certified estimation framework capable of addressing a multitude of problems, ranging from parametric estimation (where the probabilistic guarantees can be issued under no commitment to the prior information) to non-parametric problems (that call for fine exploitation of prior information). | |||||
BibTeX:
@article{Baggio2022,
author = {Baggio, Giacomo and Carè, Algo and Scampicchio, Anna and Pillonetto, Gianluigi},
title = {Bayesian frequentist bounds for machine learning and system identification},
journal = {Automatica},
year = {2022},
volume = {146},
pages = {110599},
url = {https://www.sciencedirect.com/science/article/pii/S0005109822004617},
doi = {https://doi.org/10.1016/j.automatica.2022.110599}
}
|
|||||
| Barro, D., Consigli, G. and Varun, V. | A stochastic programming model for dynamic portfolio management with financial derivatives | 2022 | Journal of Banking & Finance Vol. 140, pp. 106445 |
article | DOI URL |
| Abstract: Stochastic optimization models have been extensively applied to financial portfolios and have proven their effectiveness in asset and asset-liability management. Occasionally, however, they have been applied to dynamic portfolio problems including not only assets traded in secondary markets but also derivative contracts such as options or futures with their dedicated payoff functions. Such extension allows the construction of asymmetric payoffs for hedging or speculative purposes but also leads to several mathematical issues. Derivatives-based nonlinear portfolios in a discrete multistage stochastic programming (MSP) framework can be potentially very beneficial to shape dynamically a portfolio return distribution and attain superior performance. In this article we present a portfolio model with equity options, which extends significantly previous efforts in this area, and analyse the potential of such extension from a modeling and methodological viewpoints. We consider an asset universe and model portfolio set-up including equity, bonds, money market, a volatility-based exchange-traded-fund (ETF) and over-the-counter (OTC) option contracts on the equity. Relying on this market structure we formulate and analyse, to the best of our knowledge, for the first time, a comprehensive set of optimal option strategies in a discrete framework, including canonical protective puts, covered calls and straddles, as well as more advanced combined strategies based on equity options and the volatility index. The problem formulation relies on a data-driven scenario generation method for asset returns and option prices consistent with arbitrage-free conditions and incomplete market assumptions. The joint inclusion of option contracts and the VIX as asset class in a dynamic portfolio problem extends previous efforts in the domain of volatility-driven optimal policies. By introducing an optimal trade-off problem based on expected wealth and Conditional Value-at-Risk (CVaR), we formulate the problem as a stochastic linear program and present an extended set of numerical results across different market phases, to discuss the interplay among asset classes and options, relevant to financial engineers and fund managers. We find that options’ portfolios and trading in options strengthen an effective tail risk control, and help shaping portfolios returns’ distributions, consistently with an investor’s risk attitude. Furthermore the introduction of a volatility index in the asset universe, jointly with equity options, leads to superior risk-adjusted returns, both in- and out-of-sample, as shown in the final case-study. | |||||
BibTeX:
@article{Barro2022,
author = {Barro, Diana and Consigli, Giorgio and Varun, Vivek},
title = {A stochastic programming model for dynamic portfolio management with financial derivatives},
journal = {Journal of Banking & Finance},
year = {2022},
volume = {140},
pages = {106445},
url = {https://www.sciencedirect.com/science/article/pii/S0378426622000450},
doi = {https://doi.org/10.1016/j.jbankfin.2022.106445}
}
|
|||||
| Bellavia, S., Gurioli, G., Morini, B. and Toint, P.L. | Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100043 |
article | DOI URL |
| Abstract: A trust-region algorithm is presented for finding approximate minimizers of smooth unconstrained functions whose values and derivatives are subject to random noise. It is shown that, under suitable probabilistic assumptions, the new method finds (in expectation) an ϵ-approximate minimizer of arbitrary order q≥1 in at most O(ϵ−(q+1)) inexact evaluations of the function and its derivatives, providing the first such result for general optimality orders. The impact of intrinsic noise limiting the validity of the assumptions is also discussed and it is shown that difficulties are unlikely to occur in the first-order version of the algorithm for sufficiently large gradients. Conversely, should these assumptions fail for specific realizations, then “degraded” optimality guarantees are shown to hold when failure occurs. These conclusions are then discussed and illustrated in the context of subsampling methods for finite-sum optimization. | |||||
BibTeX:
@article{Bellavia2022,
author = {Bellavia, S. and Gurioli, G. and Morini, B. and Toint, Ph L.},
title = {Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100043},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000193},
doi = {https://doi.org/10.1016/j.ejco.2022.100043}
}
|
|||||
| Bødal, E.F., Botterud, A. and Korpås, M. | Capacity Expansion Planning with Stochastic Rolling Horizon Dispatch | 2022 | Electric Power Systems Research Vol. 205, pp. 107729 |
article | DOI URL |
| Abstract: Variable renewable energy sources introduce significant amounts of short-term uncertainty that should be considered when making investment decisions. In this work, we present a method for representing stochastic power system operation in day-ahead and balancing electricity markets within a capacity expansion model. We use Benders cuts and a stochastic rolling horizon dispatch to represent operational costs in the capacity expansion problem (CEP) and investigate different formulations for the cuts. We test the model on a two-bus case study with wind power, energy storage and a constrained transmission line. The case study shows that cuts created from the day-ahead problem gives the lowest expected total cost for the stochastic CEP. The stochastic CEP results in 3% lower expected total cost compared to the deterministic CEP capacities evaluated under uncertain operation. The number of required stochastic iterations is efficiently reduced by introducing a deterministic lower bound, while extending the horizon of the operational problem by persistence forecasting leads to reduced operational costs. | |||||
BibTeX:
@article{Boedal2022,
author = {Bødal, Espen Flo and Botterud, Audun and Korpås, Magnus},
title = {Capacity Expansion Planning with Stochastic Rolling Horizon Dispatch},
journal = {Electric Power Systems Research},
year = {2022},
volume = {205},
pages = {107729},
url = {https://www.sciencedirect.com/science/article/pii/S0378779621007100},
doi = {https://doi.org/10.1016/j.epsr.2021.107729}
}
|
|||||
| Böðvarsdóttir, E.B., Bagger, N.-C.F., Høffner, L.E. and Stidsen, T.J.R. | A flexible mixed integer programming-based system for real-world nurse rostering | 2022 | Journal of Scheduling Vol. 25(1), pp. 59–88 |
article | DOI URL |
| Abstract: Researchers have studied the nurse rostering problem for multiple decades. Initially, the formulations were rather primitive including only a few necessary restrictions, but down the road, the formulations have become more complex. Nonetheless, a fraction of the research reaches implementation in practice, and many wards still schedule nurses manually. In this article, we introduce a flexible nurse rostering system that employs mathematical optimization to automatically schedule nurses to shifts. We have developed this system in collaboration with practitioners to fully match their needs. The system consists of a comprehensive mixed integer programming (MIP) model along with a flexible framework. In addition to common constraints from the literature, the mathematical formulation includes three new constraints that further encourage healthy work schedules for each nurse. Additionally, we have reformulated some common constraints from the literature and allow for a complex shift structure that matches the needs of real hospital wards. This flexibility results in increased adaptability for different wards with different needs and is crucial to address the complex nurse rostering problem that practitioners face. We have successfully implemented this system in two wards at two Danish hospitals. We present the MIP model along with computational results for 12 real-world rostering instances. Furthermore, we discuss the practical impact of this system and provide general feedback from the practitioners using it. Overall, the results illustrate the capabilities of the system to tackle diverse nurse rostering instances and produce outstanding results. | |||||
BibTeX:
@article{Boeovarsdottir2022,
author = {Böðvarsdóttir, Elín Björk and Bagger, Niels-Christian Fink and Høffner, Laura Elise and Stidsen, Thomas J. R.},
title = {A flexible mixed integer programming-based system for real-world nurse rostering},
journal = {Journal of Scheduling},
year = {2022},
volume = {25},
number = {1},
pages = {59–88},
url = {https://doi.org/10.1007/s10951-021-00705-7},
doi = {https://doi.org/10.1007/s10951-021-00705-7}
}
|
|||||
| Bomze, I.M. and Gabl, M. | Optimization under uncertainty and risk: Quadratic and copositive approaches | 2022 | European Journal of Operational Research | article | DOI URL |
| Abstract: Robust optimization and stochastic optimization are the two main paradigms for dealing with the uncertainty inherent in almost all real-world optimization problems. The core principle of robust optimization is the introduction of parameterized families of constraints. Sometimes, these complicated semi-infinite constraints can be reduced to finitely many convex constraints, so that the resulting optimization problem can be solved using standard procedures. Hence flexibility of robust optimization is limited by certain convexity requirements on various objects. However, a recent strain of literature has sought to expand applicability of robust optimization by lifting variables to a properly chosen matrix space. Doing so allows to handle situations where convexity requirements are not met immediately, but rather intermediately. In the domain of (possibly nonconvex) quadratic optimization, the principles of copositive optimization act as a bridge leading to recovery of the desired convex structures. Copositive optimization has established itself as a powerful paradigm for tackling a wide range of quadratically constrained quadratic optimization problems, reformulating them into linear convex-conic optimization problems involving only linear constraints and objective, plus constraints forcing membership to some matrix cones, which can be thought of as generalizations of the positive-semidefinite matrix cone. These reformulations enable application of powerful optimization techniques, most notably convex duality, to problems which, in their original form, are highly nonconvex. In this text we want to offer readers an introduction and tutorial on these principles of copositive optimization, and to provide a review and outlook of the literature that applies these to optimization problems involving uncertainty. | |||||
BibTeX:
@article{Bomze2022,
author = {Bomze, Immanuel M. and Gabl, Markus},
title = {Optimization under uncertainty and risk: Quadratic and copositive approaches},
journal = {European Journal of Operational Research},
year = {2022},
url = {https://www.sciencedirect.com/science/article/pii/S0377221722008773},
doi = {https://doi.org/10.1016/j.ejor.2022.11.020}
}
|
|||||
| Borodich, E., Tominin, V., Tominin, Y., Kovalev, D., Gasnikov, A. and Dvurechensky, P. | Accelerated variance-reduced methods for saddle-point problems | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100048 |
article | DOI URL |
| Abstract: We consider composite minimax optimization problems where the goal is to find a saddle-point of a large sum of non-bilinear objective functions augmented by simple composite regularizers for the primal and dual variables. For such problems, under the average-smoothness assumption, we propose accelerated stochastic variance-reduced algorithms with optimal up to logarithmic factors complexity bounds. In particular, we consider strongly-convex-strongly-concave, convex-strongly-concave, and convex-concave objectives. To the best of our knowledge, these are the first nearly-optimal algorithms for this setting. | |||||
BibTeX:
@article{Borodich2022,
author = {Borodich, Ekaterina and Tominin, Vladislav and Tominin, Yaroslav and Kovalev, Dmitry and Gasnikov, Alexander and Dvurechensky, Pavel},
title = {Accelerated variance-reduced methods for saddle-point problems},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100048},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000247},
doi = {https://doi.org/10.1016/j.ejco.2022.100048}
}
|
|||||
| Bottalico, A., Vanelslander, T. and Verhoeven, P. | Innovation and labor in the port industry: A comparison between Genoa and Antwerp | 2022 | Journal of Business Logistics Vol. n/a(n/a) |
article | DOI URL |
| Abstract: Abstract With the advancement of innovation initiatives in the port industry, port labor has fundamentally changed in terms of new tasks, skills required, professional profiles, training, employment relations, work organization, and number of jobs. Current literature often focuses more on the assessment of investments in this particular sector rather than on the evaluation of innovative processes and the interaction with employment issues. In this article, the authors assess the relationship between innovation and employment in the port industry by comparing two distinct case studies?the ports of Antwerp and Genoa?which are characterized by partially common features and different socio-institutional contexts. Based on qualitative research conducted between 2016 and 2019, the comparative study finds that incremental innovative solutions produce a polarized port labor market in both cases, as previous studies assess. Nevertheless, the findings show that, in the case of Antwerp, a mediated and structured bargaining system interacts positively with employment issues and incremental innovative solutions, while in the case of Genoa, a disarticulated and less structured context reflects a weaker ability to influence virtuously the intertwine between innovation and employment. | |||||
BibTeX:
@article{Bottalico2022,
author = {Bottalico, Andrea and Vanelslander, Thierry and Verhoeven, Patrick},
title = {Innovation and labor in the port industry: A comparison between Genoa and Antwerp},
journal = {Journal of Business Logistics},
year = {2022},
volume = {n/a},
number = {n/a},
note = {https://doi.org/10.1111/jbl.12303},
url = {https://doi.org/10.1111/jbl.12303},
doi = {https://doi.org/10.1111/jbl.12303}
}
|
|||||
| Bounitsis, G.L., Papageorgiou, L.G. and Charitopoulos, V.M. | Data-driven scenario generation for two-stage stochastic programming | 2022 | Chemical Engineering Research and Design Vol. 187, pp. 206–224 |
article | DOI URL |
| Abstract: Optimisation under uncertainty has always been a focal point within the Process Systems Engineering (PSE) research agenda. In particular, the efficient manipulation of large amount of data for the uncertain parameters constitutes a crucial condition for effectively tackling stochastic programming problems. In this context, this work proposes a new data-driven Mixed-Integer Linear Programming (MILP) model for the Distribution & Moment Matching Problem (DMP). For cases with multiple uncertain parameters a copula-based simulation of initial scenarios is employed as preliminary step. Moreover, the integration of clustering methods and DMP in the proposed model is shown to enhance computational performance. Finally, we compare the proposed approach with state-of-the-art scenario generation methodologies. Through a number of case studies we highlight the benefits regarding the quality of the generated scenario trees by evaluating the corresponding obtained stochastic solutions. | |||||
BibTeX:
@article{Bounitsis2022,
author = {Bounitsis, Georgios L. and Papageorgiou, Lazaros G. and Charitopoulos, Vassilis M.},
title = {Data-driven scenario generation for two-stage stochastic programming},
journal = {Chemical Engineering Research and Design},
year = {2022},
volume = {187},
pages = {206–224},
url = {https://www.sciencedirect.com/science/article/pii/S0263876222004245},
doi = {https://doi.org/10.1016/j.cherd.2022.08.014}
}
|
|||||
| Bukljaš, M., Rogić, K. and Jerebić, V. | Distributionally Robust Model and Metaheuristic Frame for Liner Ships Fleet Deployment | 2022 | Vol. 14(9) |
misc | DOI |
| Abstract: The container shipping industry market is very dynamic and demanding, economically, politically, legally, and financially. Considering the high cost of core assets, ever rising operating costs, and the volatility of demand and supply of cargo space, the result is an industry under enormous pressure to remain profitable and competitive. To maximize profits while maintaining service levels and ensuring the smooth flow of cargo, it is essential to make strategic decisions in a timely and optimal manner. Fleet deployment selection, which includes the profile of vessel hire, as well as their capacity and port rotation, is one of the most important strategic and tactical decisions container shipping operators must make. Bearing in mind that maritime business is inherently stochastic and uncertain, the key aims of this paper are to address the problem of fleet deployment under uncertain operating conditions, and to provide an integrated and optimized tool in the form of a mathematical model, metaheuristic algorithm, and computer program. Furthermore, this paper will show that the properties of the provided solutions exceed those offered in the literature so far. Such a solution will provide the shipping operator with a decision tool to best deploy its fleet in a way that responds more closely to real life situations and to meet the maximum demand for cargo space with minimal expense. The final goal is to minimize the operating costs while managing cargo flows and reducing the risks of unfulfilled customer demands. | |||||
BibTeX:
@misc{Bukljas2022,
author = {Bukljaš, Mihaela and Rogić, Kristijan and Jerebić, Vladimir},
title = {Distributionally Robust Model and Metaheuristic Frame for Liner Ships Fleet Deployment},
year = {2022},
volume = {14},
number = {9},
doi = {https://doi.org/10.3390/su14095551}
}
|
|||||
| Campisi, T., Marinello, S., Costantini, G., Laghi, L., Mascia, S., Matteucci, F. and Serrau, D. | Locally integrated partnership as a tool to implement a Smart Port Management Strategy: The case of the port of Ravenna (Italy) | 2022 | Ocean & Coastal Management Vol. 224, pp. 106179 |
article | DOI URL |
| Abstract: The modern port structure is configured as territorial system of productive aggregation (hub) of a complex nature, strongly linked to the productive fabric of a larger territory and in close relationship with the context in which the port is physically located. In the development of processes of innovation and improvement of the sustainability of the activities connected to the port, a strong connection is necessary between all the local stakeholders who, each for the functions of their own competence, can activate improvement processes with common objectives. This paper describes a framework for the activation and coordination of a Locally Integrated Partnership (LIP) towards the development of a multi-term Smart Port Management Strategy (SPMS) to support innovation processes in the sustainable and safe management of the port. The methodology was applied to the case study of the port of Ravenna (Italy) where the state-owned areas managed by Port Authority (public authority managing the port area) are limited to 50 mt-width harbour quay, while the remaining areas are owned by private companies. The result was the development and the implementation of the roadmap for the development of the SPMS of Ravenna Port with a multi-stakeholder participatory approach. This process favoured the activation of many public funds to modernize port infrastructure, as well as private investments for the development and dissemination of innovations and for the sustainable use of port area. This has shown how the development and coordination of a local LIP makes it possible to make synergies between stakeholders more effective in accessing financing funds and sharing development strategies aimed at innovation and sustainability. The framework developed and tested to the case study demonstrated the benefits of a participatory and inclusive process in decision-making processes, with a benefit for all the key aspects of sustainability. This process can be used, following step-by-step, as a guideline for other port areas. | |||||
BibTeX:
@article{Campisi2022,
author = {Campisi, Tiziana and Marinello, Samuele and Costantini, Giacomo and Laghi, Luca and Mascia, Sabrina and Matteucci, Francesco and Serrau, Davide},
title = {Locally integrated partnership as a tool to implement a Smart Port Management Strategy: The case of the port of Ravenna (Italy)},
journal = {Ocean & Coastal Management},
year = {2022},
volume = {224},
pages = {106179},
url = {https://www.sciencedirect.com/science/article/pii/S0964569122001545},
doi = {https://doi.org/10.1016/j.ocecoaman.2022.106179}
}
|
|||||
| Campos, M.S., Costa, M.A., Gontijo, T.S. and Lopes-Ahn, A.L. | Robust stochastic frontier analysis applied to the Brazilian electricity distribution benchmarking method | 2022 | Decision Analytics Journal Vol. 3, pp. 100051 |
article | DOI URL |
| Abstract: A Data Envelopment Analysis (DEA) method has been applied by the Brazilian regulator to set regulatory operational costs for 61 electricity distribution utilities. Recent studies show evidence that the current method still requires improvements. This study evaluates the use of Stochastic Frontier Analysis (SFA) as an alternative method. Pros and cons are evaluated. Results show that the SFA is more flexible to deal with outliers. However, the SFA has major convergence problems. Convergence issues can be overcome using Bayesian computations. This study advocates the use of both DEA and SFA as the best alternatives, as indicated by European regulators. | |||||
BibTeX:
@article{Campos2022,
author = {Campos, Magno Silvério and Costa, Marcelo Azevedo and Gontijo, Tiago Silveira and Lopes-Ahn, Ana Lúcia},
title = {Robust stochastic frontier analysis applied to the Brazilian electricity distribution benchmarking method},
journal = {Decision Analytics Journal},
year = {2022},
volume = {3},
pages = {100051},
url = {https://www.sciencedirect.com/science/article/pii/S2772662222000169},
doi = {https://doi.org/10.1016/j.dajour.2022.100051}
}
|
|||||
| Caprari, E., Cerboni Baiardi, L. and Molho, E. | Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach | 2022 | Journal of Global Optimization Vol. 84(2), pp. 295–320 |
article | DOI URL |
| Abstract: The robust optimization approach can be used to tackle uncertain vector problems by considering worst case scenarios. In this context, notions of robust efficient solutions which are coherent with a set-valued minimization process have been introduced in literature in order to avoid unduly pessimistic attitudes (see e.g. Ehrgott et al. in Eur. J. Oper. Res. 239(1), 17–31, 2014). We address the question whether scalarization and robustification can be commuted in a non componentwise framework. We prove that the commutation of the two approaches is ensured under appropriate assumptions. To this purpose, we identify a class of scalarization processes that ensure necessary and sufficient robust optimality conditions through the direct scalarization of the uncertain vector optimization problem, without explicitly passing through the set-valued formulation of the problem. | |||||
BibTeX:
@article{Caprari2022,
author = {Caprari, Elisa and Cerboni Baiardi, Lorenzo and Molho, Elena},
title = {Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach},
journal = {Journal of Global Optimization},
year = {2022},
volume = {84},
number = {2},
pages = {295–320},
url = {https://doi.org/10.1007/s10898-022-01142-2},
doi = {https://doi.org/10.1007/s10898-022-01142-2}
}
|
|||||
| Chan–Renous-Legoubin, R. and Royer, C.W. | A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100044 |
article | DOI URL |
| Abstract: Nonlinear conjugate gradients are among the most popular techniques for solving continuous optimization problems. Although these schemes have long been studied from a global convergence standpoint, their worst-case complexity properties have yet to be fully understood, especially in the nonconvex setting. In particular, it is unclear whether nonlinear conjugate gradient methods possess better guarantees than first-order methods such as gradient descent. Meanwhile, recent experiments have shown impressive performance of standard nonlinear conjugate gradient techniques on certain nonconvex problems, even when compared with methods endowed with the best known complexity guarantees. In this paper, we propose a nonlinear conjugate gradient scheme based on a simple line-search paradigm and a modified restart condition. These two ingredients allow for monitoring the properties of the search directions, which is instrumental in obtaining complexity guarantees. Our complexity results illustrate the possible discrepancy between nonlinear conjugate gradient methods and classical gradient descent. A numerical investigation on nonconvex robust regression problems as well as a standard benchmark illustrate that the restarting condition can track the behavior of a standard implementation. | |||||
BibTeX:
@article{Chan–RenousLegoubin2022,
author = {Chan–Renous-Legoubin, Rémi and Royer, Clément W.},
title = {A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100044},
url = {https://www.sciencedirect.com/science/article/pii/S219244062200020X},
doi = {https://doi.org/10.1016/j.ejco.2022.100044}
}
|
|||||
| Chen, L., Ma, W., Natarajan, K., Simchi-Levi, D. and Yan, Z. | Distributionally Robust Linear and Discrete Optimization with Marginals | 2022 | Operations Research Vol. 70(3), pp. 1822–1834 |
article | DOI URL |
| Abstract: In optimization problems, decisions are often made in the face of uncertainty that might arise in the form of random costs or benefits. In ?Distributionally Robust Linear and Discrete Optimization with Marginals,? Louis Chen, Will Ma, Karthik Natarajan, David Simchi-Levi, and Zhenzhen Yan study a robust bound of linear and discrete optimization problems in which the objective coefficients are random and the set of admissible joint distributions is assumed to be specified only up to the marginals. They provide a primal-dual formulation for this problem, and in the process, unify existing results with new results. They establish NP-hardness of computing the bound for general polytopes and identify two sufficient conditions?one based on a dual formulation and one based on sublattices that provide a class of polytopes where the robust bounds are efficiently computable. | |||||
BibTeX:
@article{Chen2022,
author = {Chen, Louis and Ma, Will and Natarajan, Karthik and Simchi-Levi, David and Yan, Zhenzhen},
title = {Distributionally Robust Linear and Discrete Optimization with Marginals},
journal = {Operations Research},
year = {2022},
volume = {70},
number = {3},
pages = {1822–1834},
url = {https://doi.org/10.1287/opre.2021.2243},
doi = {https://doi.org/10.1287/opre.2021.2243}
}
|
|||||
| Chen, R., Meng, Q. and Jia, P. | Container port drayage operations and management: Past and future | 2022 | Transportation Research Part E: Logistics and Transportation Review Vol. 159, pp. 102633 |
article | DOI URL |
| Abstract: Although long-haul intermodal container transportation combines multiple transportation modes including shipping, the most critical aspect of enabling door-to-door service is container port drayage operation. Container port drayage connects customers and container ports and provides an effective solution to the first/last-mile problem faced by the container logistics industry. Therefore, container port drayage has a significant impact not only on the economic advantages of the long-haul intermodal container transportation chain, but also the management, environment and social benefits of the stakeholders involved. In this paper, we comprehensively review the existing literature on container port drayage studies from different methodological angles (e.g., model development and algorithm design) and technological angles (e.g., autonomous truck and blockchain). Moreover, with the shifting of industrial focus from traditional operations and management of container port drayage towards e-commerce platforms, we identify potential issues for future research directions. | |||||
BibTeX:
@article{Chen2022a,
author = {Chen, Rui and Meng, Qiang and Jia, Peng},
title = {Container port drayage operations and management: Past and future},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2022},
volume = {159},
pages = {102633},
url = {https://www.sciencedirect.com/science/article/pii/S136655452200031X},
doi = {https://doi.org/10.1016/j.tre.2022.102633}
}
|
|||||
| Cipolla, S. and Gondzio, J. | Training very large scale nonlinear SVMs using Alternating Direction Method of Multipliers coupled with the Hierarchically Semi-Separable kernel approximations | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100046 |
article | DOI URL |
| Abstract: Typically, nonlinear Support Vector Machines (SVMs) produce significantly higher classification quality when compared to linear ones but, at the same time, their computational complexity is prohibitive for large-scale datasets: this drawback is essentially related to the necessity to store and manipulate large, dense and unstructured kernel matrices. Despite the fact that at the core of training an SVM there is a simple convex optimization problem, the presence of kernel matrices is responsible for dramatic performance reduction, making SVMs unworkably slow for large problems. Aiming at an efficient solution of large-scale nonlinear SVM problems, we propose the use of the Alternating Direction Method of Multipliers coupled with Hierarchically Semi-Separable (HSS) kernel approximations. As shown in this work, the detailed analysis of the interaction among their algorithmic components unveils a particularly efficient framework and indeed, the presented experimental results demonstrate, in the case of Radial Basis Kernels, a significant speed-up when compared to the state-of-the-art nonlinear SVM libraries (without significantly affecting the classification accuracy). | |||||
BibTeX:
@article{Cipolla2022,
author = {Cipolla, S. and Gondzio, J.},
title = {Training very large scale nonlinear SVMs using Alternating Direction Method of Multipliers coupled with the Hierarchically Semi-Separable kernel approximations},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100046},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000223},
doi = {https://doi.org/10.1016/j.ejco.2022.100046}
}
|
|||||
| Coito, T., Martins, M.S.E., Firme, B., Figueiredo, J., Vieira, S.M. and Sousa, J.M.C. | Assessing the impact of automation in pharmaceutical quality control labs using a digital twin | 2022 | Journal of Manufacturing Systems Vol. 62, pp. 270–285 |
article | DOI URL |
| Abstract: Nowadays, pharmaceutical Quality Control (QC) laboratories have complex workflows where analysts test different samples simultaneously. Tests ensure the physical properties of drugs are expected and within guidelines. Each test follows an analytical procedure containing tasks. Cyber-Physical Production System (CPPS) improves tasks/operations; however, accurate cost analysis with reasoned data is challenging. Theoretical estimation of impacts requires a high level of abstraction and fails to capture the proper behavior of the workflow. This paper proposes a method for evaluating the introduction of automation in a pharmaceutical QC laboratory. In the proposed methodology, this paper developed a simulation model of the analytical workflow of the tests. The impact assessment compares the current As-Is and future To-Be workflows, reworking the affected tasks. The model of the new resource is a hybrid parallel process with an initial buffer. The paper analyses several scenarios on parameters such as throughput, resource occupation, and annual man-hours gained. The simulation model was validated against actual historical data and compared to theoretical projections on the impact of automation. From our results, we found the available equipment has a high impact. Using production data, we project an increase in the analyst availability of 4,7% and equipment availability of 1,2%. | |||||
BibTeX:
@article{Coito2022,
author = {Coito, Tiago and Martins, Miguel S. E. and Firme, Bernardo and Figueiredo, João and Vieira, Susana M. and Sousa, João M. C.},
title = {Assessing the impact of automation in pharmaceutical quality control labs using a digital twin},
journal = {Journal of Manufacturing Systems},
year = {2022},
volume = {62},
pages = {270–285},
url = {https://www.sciencedirect.com/science/article/pii/S0278612521002442},
doi = {https://doi.org/10.1016/j.jmsy.2021.11.014}
}
|
|||||
| Cuong, T.N., Kim, H.-S., You, S.-S. and Nguyen, D.A. | Seaport throughput forecasting and post COVID-19 recovery policy by using effective decision‐making strategy: A case study of Vietnam ports | 2022 | Computers & Industrial Engineering Vol. 168, pp. 108102 |
article | DOI URL |
| Abstract: This study deals with the dynamic interactions between seaports and decision-making strategy for seaport operations by utilizing four-dimensional fractional Lotka-Volterra competition model under frequently disrupted by time-delay factor. Nonlinear analysis methods, including equilibrium analysis, stability evaluation, and time series investigation, are intensely explored to describe the cooperation and competition dynamics in maritime logistics. The dynamical analysis indicates that the port competition system shows a complex and highly nonlinear behaviour, notably illustrating unstable equilibria and even chaotic phenomena. Besides, nonlinear dynamical interactions in seaport management have been analysed by exploiting fractional calculus (FC) and system dynamics theory. Novel multi-criteria decision-making strategies realized by the neural network prediction controller (NNC) and adaptive fractional-order super-twisting sliding mode control (AFOSTSM) have been presented for dealing with throughput dynamics under parametric perturbations and external disturbances. Particularly, the active control algorithms are implemented to ensure the recovery strategy for throughput growth of Vietnam ports in the post-coronavirus (COVID-19) pandemic era. The case study has confirmed the efficacy of the proposed strategy by using system dynamics and control theory. The simulation results show that the average growth rates of container throughput can be ensured up to 7.46% by exploiting resilience management scheme. The presented method can be also utilized for providing managerial insights and solutions on efficient port operations. In addition, the control strategies with neural network forecasting can help managers obtain timely and cost-effective decision-making policy for port sustainability against unprecedented impacts on global supply chains related to COVID-19 pandemic. | |||||
BibTeX:
@article{Cuong2022,
author = {Cuong, Truong Ngoc and Kim, Hwan-Seong and You, Sam-Sang and Nguyen, Duy Anh},
title = {Seaport throughput forecasting and post COVID-19 recovery policy by using effective decision‐making strategy: A case study of Vietnam ports},
journal = {Computers & Industrial Engineering},
year = {2022},
volume = {168},
pages = {108102},
url = {https://www.sciencedirect.com/science/article/pii/S0360835222001723},
doi = {https://doi.org/10.1016/j.cie.2022.108102}
}
|
|||||
| Curry, S., Lee, I., Ma, S. and Serban, N. | Global sensitivity analysis via a statistical tolerance approach | 2022 | European Journal of Operational Research Vol. 296(1), pp. 44–59 |
article | DOI URL |
| Abstract: Sensitivity analysis and multiparametric programming in optimization modeling study variations of optimal value and solutions in the presence of uncertain input parameters. In this paper, we consider simultaneous variations in the inputs of the objective and constraint (jointly called the RIM parameters), where the uncertainty is represented as a multivariate probability distribution. We introduce a tolerance approach based on principal component analysis, which obtains a tolerance region that is suited to the given distribution and can be considered a confidence set for the random input parameters. Since a tolerance region may contain parameters with different optimal bases, we extend the tolerance approach to the case where multiple optimal bases cover the tolerance region, by studying theoretical properties of critical regions (defined as the set of input parameters having the same optimal basis). We also propose a computational algorithm to find critical regions covering a given tolerance region in the RIM parameter space. Our theoretical results on geometric properties of critical regions contribute to the existing theory of parametric programming with an emphasis on the case where RIM parameters vary jointly, and provide deeper geometric understanding of critical regions. We evaluate the proposed framework using a series of experiments for sensitivity analysis, for model predictive control of an inventory management problem, and for large optimization problem instances. | |||||
BibTeX:
@article{Curry2022,
author = {Curry, Stewart and Lee, Ilbin and Ma, Simin and Serban, Nicoleta},
title = {Global sensitivity analysis via a statistical tolerance approach},
journal = {European Journal of Operational Research},
year = {2022},
volume = {296},
number = {1},
pages = {44–59},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721003167},
doi = {https://doi.org/10.1016/j.ejor.2021.04.004}
}
|
|||||
| Dammann, O., Dörk, T., Hillemanns, P. and Reydon, T. | Causation and causal inference in obstetrics-gynecology | 2022 | American Journal of Obstetrics and Gynecology Vol. 226(1), pp. 12–23 |
article | DOI URL |
| Abstract: Causation and causal inference are of utmost importance in obstetrics and gynecology. In many clinical situations, causal reasoning is involved in etiological explanations, diagnostic considerations, and conversations about prognosis. In this paper, we offer an overview of the philosophical accounts of causation that may not be familiar to, but still be appreciated by, the busy clinician. In our discussion, we do not try to simplify what is a rather complex range of ideas. We begin with an introduction to some important basic ideas, followed by 2 sections on the metaphysical and epistemological aspects of causality, which offer a more detailed discussion of some of its specific philosophical facets, using examples from obstetrical and gynecologic research and practice along the way. We hope our discussion will help deepen the thinking and discourse about causation and causal inference in gynecology and obstetrics. | |||||
BibTeX:
@article{Dammann2022,
author = {Dammann, Olaf and Dörk, Thilo and Hillemanns, Peter and Reydon, Thomas},
title = {Causation and causal inference in obstetrics-gynecology},
journal = {American Journal of Obstetrics and Gynecology},
year = {2022},
volume = {226},
number = {1},
pages = {12–23},
url = {https://www.sciencedirect.com/science/article/pii/S0002937821011510},
doi = {https://doi.org/10.1016/j.ajog.2021.09.047}
}
|
|||||
| Dekker, M.M., van Lieshout, R.N., Ball, R.C., Bouman, P.C., Dekker, S.C., Dijkstra, H.A., Goverde, R.M.P., Huisman, D., Panja, D., Schaafsma, A.A.M. and van den Akker, M. | A next step in disruption management: combining operations research and complexity science | 2022 | Public Transport Vol. 14(1), pp. 5–26 |
article | DOI URL |
| Abstract: Railway systems occasionally get into a state of being out-of-control, meaning that barely any train is running, even though the required resources (infrastructure, rolling stock and crew) are available. Because of the large number of affected resources and the absence of detailed, timely and accurate information, currently existing disruption management techniques cannot be applied in out-of-control situations. Most of the contemporary approaches assume that there is only one single disruption with a known duration, that all information about the resources is available, and that all stakeholders in the operations act as expected. Another limitation is the lack of knowledge about why and how disruptions accumulate and whether this process can be predicted. To tackle these problems, we develop a multidisciplinary framework combining techniques from complexity science and operations research, aiming at reducing the impact of these situations and—if possible—avoiding them. The key elements of this framework are (i) the generation of early warning signals for out-of-control situations, (ii) isolating a specific region such that delay stops propagating, and (iii) the application of decentralized decision making, more suited for information-sparse out-of-control situations. | |||||
BibTeX:
@article{Dekker2022,
author = {Dekker, Mark M. and van Lieshout, Rolf N. and Ball, Robin C. and Bouman, Paul C. and Dekker, Stefan C. and Dijkstra, Henk A. and Goverde, Rob M. P. and Huisman, Dennis and Panja, Debabrata and Schaafsma, Alfons A. M. and van den Akker, Marjan},
title = {A next step in disruption management: combining operations research and complexity science},
journal = {Public Transport},
year = {2022},
volume = {14},
number = {1},
pages = {5–26},
url = {https://doi.org/10.1007/s12469-021-00261-5},
doi = {https://doi.org/10.1007/s12469-021-00261-5}
}
|
|||||
| Densberger, N.L. and Bachkar, K. | Towards accelerating the adoption of zero emissions cargo handling technologies in California ports: Lessons learned from the case of the Ports of Los Angeles and Long Beach | 2022 | Journal of Cleaner Production Vol. 347, pp. 131255 |
article | DOI URL |
| Abstract: There is a growing global trend towards achieving net-zero emissions of greenhouse gases from port operations as consumers and governments become increasingly aware of the impacts of global climate change and ongoing environmental justice issues. However, the existing literature on the topic of zero-emissions ports is broad-based and focuses mainly on technology feasibility. Specifically, it provides insufficient guidance on how ports can best transition to zero emissions. To address this research gap, this review article examines the ongoing zero-emissions planning documents and demonstration projects at the Ports of Los Angeles and Long Beach and presents the key lessons learned from those efforts to accelerate the adoption of zero-emissions cargo handling equipment in California. Increasingly, the Ports of Los Angeles and Long Beach are emerging as leaders with a sustainable circular strategy by implementing zero-emissions cargo handling equipment projects at a higher rate than any other ports in California, making these two ports an ideal case study to evaluate their endeavors to transition their operations to zero emissions. The findings of this review study suggest that transitioning to zero-emissions cargo handling equipment across all California ports by 2035 is best achievable with: 1) a stronger collaboration between all key stakeholders, 2) the development of statewide regulations, 3) accelerated technology commercialization through increased demonstration projects and infrastructure standardization, 4) improved funding processes, 5) enhanced workforce training, and 6) increased resiliency planning. Although this evaluation and recommendations are largely California-specific, this article can be useful to policy-and decision-makers around the world for transitioning to sustainable, net-zero emissions ports. | |||||
BibTeX:
@article{Densberger2022,
author = {Densberger, Nicole Light and Bachkar, Khalid},
title = {Towards accelerating the adoption of zero emissions cargo handling technologies in California ports: Lessons learned from the case of the Ports of Los Angeles and Long Beach},
journal = {Journal of Cleaner Production},
year = {2022},
volume = {347},
pages = {131255},
url = {https://www.sciencedirect.com/science/article/pii/S0959652622008861},
doi = {https://doi.org/10.1016/j.jclepro.2022.131255}
}
|
|||||
| Du, L., Gao, R., Suganthan, P.N. and Wang, D.Z.W. | Bayesian optimization based dynamic ensemble for time series forecasting | 2022 | Information Sciences Vol. 591, pp. 155–175 |
article | DOI URL |
| Abstract: Among various time series (TS) forecasting methods, ensemble forecast is extensively acknowledged as a promising ensemble approach achieving great success in research and industry. Due to the high diversification of individual model assumptions, heterogeneous information fusion contributes to generating effective and robust forecasts for Economics, Meteorology, and Transportation. This paper proposes a Bayesian optimization-based dynamic ensemble (BODE) that overcomes the single model-based methods limitation and provides a dynamic ensemble forecast combination for TS with time-varying underlying patterns. The proposed BODE method combines ten disparate model candidates, including statistical methods, machine learning (ML)-based models, and the latest deep neural networks (DNN). We take into consideration their prediction performance for the recent past to adjust their weights for combination and apply the model-based Bayesian optimization algorithm (BOA) for the combination hyperparameter (HP) tuning to endow our method with higher adaptability and better generalization performance. Besides, the frequency impact of TS data on the ensemble forecast methods is under-researched in the current literature. Therefore, four groups of distinct seasonal TS datasets are investigated in this paper. The empirical result demonstrates that our method performs robustly better performance with the main reasons analyzed in a detailed ablation study. | |||||
BibTeX:
@article{Du2022,
author = {Du, Liang and Gao, Ruobin and Suganthan, Ponnuthurai Nagaratnam and Wang, David Z. W.},
title = {Bayesian optimization based dynamic ensemble for time series forecasting},
journal = {Information Sciences},
year = {2022},
volume = {591},
pages = {155–175},
url = {https://www.sciencedirect.com/science/article/pii/S0020025522000135},
doi = {https://doi.org/10.1016/j.ins.2022.01.010}
}
|
|||||
| Duong, T.D., Li, Q. and Xu, G. | Stochastic intervention for causal inference via reinforcement learning | 2022 | Neurocomputing Vol. 482, pp. 40–49 |
article | DOI URL |
| Abstract: Causal inference methods are widely applied in various decision-making domains such as precision medicine, optimal policy and economics. The main focus of causal inference is the treatment effect estimation of intervention strategies, such as changes in drug dosing and increases in financial aid. Existing methods are mostly restricted to the deterministic treatment and compare outcomes under different treatments. However, they are unable to address the substantial recent interests of treatment effect estimation under stochastic intervention, e.g., “how all units health status change if they adopt 50% dose reduction”. In other words, they lack the capability of addressing fine-grained treatment effect estimation to empower the decision-making applications. In this paper, we advance the causal inference research by proposing a new effective framework to estimate the treatment effect under the stochastic intervention. Particularly, we develop a stochastic intervention effect estimator (SIE) based on nonparametric influence function, with the theoretical guarantees of robustness and fast convergence rates. Additionally, we construct a customised reinforcement learning algorithm based on the random search solver which can effectively find the optimal policy to produce the greatest expected outcomes for the decision-making process. Finally, we conduct extensive empirical experiments to validate that our framework can achieve superior performance in comparison with state-of-the-art baselines. For reproducing experimental results, all the source codes and data are available at https://github.com/tridungduong16/Interpretable-Machine-Learning/tree/master/Source%20Code. | |||||
BibTeX:
@article{Duong2022,
author = {Duong, Tri Dung and Li, Qian and Xu, Guandong},
title = {Stochastic intervention for causal inference via reinforcement learning},
journal = {Neurocomputing},
year = {2022},
volume = {482},
pages = {40–49},
url = {https://www.sciencedirect.com/science/article/pii/S0925231222001072},
doi = {https://doi.org/10.1016/j.neucom.2022.01.086}
}
|
|||||
| Dutta, A., Bergou, E.H., Xiao, Y., Canini, M. and Richtárik, P. | Direct nonlinear acceleration | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100047 |
article | DOI URL |
| Abstract: Optimization acceleration techniques such as momentum play a key role in state-of-the-art machine learning algorithms. Recently, generic vector sequence extrapolation techniques, such as regularized nonlinear acceleration (RNA) of Scieur et al. [22], were proposed and shown to accelerate fixed point iterations. In contrast to RNA which computes extrapolation coefficients by (approximately) setting the gradient of the objective function to zero at the extrapolated point, we propose a more direct approach, which we call direct nonlinear acceleration (DNA). In DNA, we aim to minimize (an approximation of) the function value at the extrapolated point instead. We adopt a regularized approach with regularizers designed to prevent the model from entering a region in which the functional approximation is less precise. While the computational cost of DNA is comparable to that of RNA, our direct approach significantly outperforms RNA on both synthetic and real-world datasets. While the focus of this paper is on convex problems, we obtain very encouraging results in accelerating the training of neural networks. | |||||
BibTeX:
@article{Dutta2022,
author = {Dutta, Aritra and Bergou, El Houcine and Xiao, Yunming and Canini, Marco and Richtárik, Peter},
title = {Direct nonlinear acceleration},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100047},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000235},
doi = {https://doi.org/10.1016/j.ejco.2022.100047}
}
|
|||||
| Dvurechensky, P., Kamzolov, D., Lukashevich, A., Lee, S., Ordentlich, E., Uribe, C.A. and Gasnikov, A. | Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100045 |
article | DOI URL |
| Abstract: Statistical preconditioning enables fast methods for distributed large-scale empirical risk minimization problems. In this approach, multiple worker nodes compute gradients in parallel, which are then used by the central node to update the parameter by solving an auxiliary (preconditioned) smaller-scale optimization problem. The recently proposed Statistically Preconditioned Accelerated Gradient (SPAG) method [1] has complexity bounds superior to other such algorithms but requires an exact solution for computationally intensive auxiliary optimization problems at every iteration. In this paper, we propose an Inexact SPAG (InSPAG) and explicitly characterize the accuracy by which the corresponding auxiliary subproblem needs to be solved to guarantee the same convergence rate as the exact method. We build our results by first developing an inexact adaptive accelerated Bregman proximal gradient method for general optimization problems under relative smoothness and strong convexity assumptions, which may be of independent interest. Moreover, we explore the properties of the auxiliary problem in the InSPAG algorithm assuming Lipschitz third-order derivatives and strong convexity. For such problem class, we develop a linearly convergent Hyperfast second-order method and estimate the total complexity of the InSPAG method with hyperfast auxiliary problem solver. Finally, we illustrate the proposed method's practical efficiency by performing large-scale numerical experiments on logistic regression models. To the best of our knowledge, these are the first empirical results on implementing high-order methods on large-scale problems, as we work with data where the dimension is of the order of 3 million, and the number of samples is 700 million. | |||||
BibTeX:
@article{Dvurechensky2022,
author = {Dvurechensky, Pavel and Kamzolov, Dmitry and Lukashevich, Aleksandr and Lee, Soomin and Ordentlich, Erik and Uribe, César A. and Gasnikov, Alexander},
title = {Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100045},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000211},
doi = {https://doi.org/10.1016/j.ejco.2022.100045}
}
|
|||||
| Fan, Y.V., Jiang, P., Tan, R.R., Aviso, K.B., You, F., Zhao, X., Lee, C.T. and Klemeš, J.J. | Forecasting plastic waste generation and interventions for environmental hazard mitigation | 2022 | Journal of Hazardous Materials Vol. 424, pp. 127330 |
article | DOI URL |
| Abstract: Plastic waste and its environmental hazards have been attracting public attention as a global sustainability issue. This study builds a neural network model to forecast plastic waste generation of the EU-27 in 2030 and evaluates how the interventions could mitigate the adverse impact of plastic waste on the environment. The black-box model is interpreted using SHapley Additive exPlanations (SHAP) for managerial insights. The dependence on predictors (i.e., energy consumption, circular material use rate, economic complexity index, population, and real gross domestic product) and their interactions are discussed. The projected plastic waste generation of the EU-27 is estimated to reach 17 Mt/y in 2030. With an EU targeted recycling rate (55%) in 2030, the environmental impacts would still be higher than in 2018, especially global warming potential and plastic marine pollution. This result highlights the importance of plastic waste reduction, especially for the clustering algorithm-based grouped countries with a high amount of untreated plastic waste per capita. Compared to the other assessed scenarios, Scenario 4 with waste reduction (50% recycling, 47.6% energy recovery, 2.4% landfill) shows the lowest impact in acidification, eutrophication, marine aquatic toxicity, plastic marine pollution, and abiotic depletion. However, the global warming potential (8.78 Gt CO2eq) is higher than that in 2018, while Scenario 3 (55% recycling, 42.6% energy recovery, 2.4% landfill) is better in this aspect than Scenario 4. This comprehensive analysis provides pertinent insights into policy interventions towards environmental hazard mitigation. | |||||
BibTeX:
@article{Fan2022,
author = {Fan, Yee Van and Jiang, Peng and Tan, Raymond R. and Aviso, Kathleen B. and You, Fengqi and Zhao, Xiang and Lee, Chew Tin and Klemeš, Jiří Jaromír},
title = {Forecasting plastic waste generation and interventions for environmental hazard mitigation},
journal = {Journal of Hazardous Materials},
year = {2022},
volume = {424},
pages = {127330},
url = {https://www.sciencedirect.com/science/article/pii/S0304389421022986},
doi = {https://doi.org/10.1016/j.jhazmat.2021.127330}
}
|
|||||
| Fan, Z. and Xie, X. | A distributionally robust optimisation for COVID-19 testing facility territory design and capacity planning [BibTeX] |
2022 | International Journal of Production Research, pp. 1–24 | article | DOI URL |
BibTeX:
@article{Fan2022a,
author = {Fan, Zhenghao and Xie, Xiaolei},
title = {A distributionally robust optimisation for COVID-19 testing facility territory design and capacity planning},
journal = {International Journal of Production Research},
year = {2022},
pages = {1–24},
url = {https://doi.org/10.1080/00207543.2021.2022233},
doi = {https://doi.org/10.1080/00207543.2021.2022233}
}
|
|||||
| Ghorbani, M., Nourelfath, M. and Gendreau, M. | A two-stage stochastic programming model for selective maintenance optimization | 2022 | Reliability Engineering & System Safety Vol. 223, pp. 108480 |
article | DOI URL |
| Abstract: The problem of selective maintenance exists in many multicomponent systems carrying out an alternating sequence of missions, with scheduled breaks where only a limited number of components can be maintained due to time limit. In this paper, a stochastic programming approach is proposed for determining an optimum maintenance plan to minimize maintenance costs and expected failure costs, while maximizing the probability of successful accomplishment of the next mission under uncertainties in future operating conditions. Traditionally, future operating conditions that affect failure time distribution when calculating reliability in selective maintenance models were assumed as deterministic. In this study, future operating conditions are assumed to be uncertain. The system is subject to several uncertain condition scenarios of exposure, conditional, usage, stress, etc. Each scenario is modeled with its associated occurrence probability. The presented model is a two-stage stochastic mixed-integer nonlinear programming model with fixed recourse, where the first stage is associated with maintenance decisions made before uncertainties are revealed, and the second stage is modeled as a recourse function which is related to the occurrence probability of system failure. A numerical example of a series-parallel system is used to demonstrate the effectiveness of the suggested model. | |||||
BibTeX:
@article{Ghorbani2022,
author = {Ghorbani, Milad and Nourelfath, Mustapha and Gendreau, Michel},
title = {A two-stage stochastic programming model for selective maintenance optimization},
journal = {Reliability Engineering & System Safety},
year = {2022},
volume = {223},
pages = {108480},
url = {https://www.sciencedirect.com/science/article/pii/S0951832022001429},
doi = {https://doi.org/10.1016/j.ress.2022.108480}
}
|
|||||
| Groetzner, P. and Werner, R. | Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach | 2022 | European Journal of Operational Research Vol. 296(1), pp. 101–115 |
article | DOI URL |
| Abstract: Consider a multiobjective decision problem with uncertainty in the objective functions, given as a set of scenarios. In the single-criterion case, robust optimization methodology helps to identify solutions which remain feasible and of good quality for all possible scenarios. A well-known alternative method in the single-objective case is to compare possible decisions under uncertainty with the optimal decision with the benefit of hindsight, i.e. to minimize the (possibly scaled) regret of not having chosen the optimal decision. In this contribution, we extend the concept of regret from the single-objective case to the multiobjective setting and introduce a proper definition of multivariate (robust) (relative) regret. In contrast to the few existing ideas that mix scalarization and optimization, we clearly separate the modelling of multiobjective (robust) regret from its numerical solution. Moreover, our approach is not limited to a finite uncertainty set or interval uncertainty and furthermore, computations or at least approximations remain tractable in several important special cases. We illustrate all approaches based on a biobjective shortest path problem under uncertainty. | |||||
BibTeX:
@article{Groetzner2022,
author = {Groetzner, Patrick and Werner, Ralf},
title = {Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach},
journal = {European Journal of Operational Research},
year = {2022},
volume = {296},
number = {1},
pages = {101–115},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721003738},
doi = {https://doi.org/10.1016/j.ejor.2021.03.068}
}
|
|||||
| Hassan, A., Deka, D. and Dvorkin, Y. | Privacy-Aware Load Ensemble Control: A Linearly-Solvable MDP Approach [BibTeX] |
2022 | IEEE Transactions on Smart Grid Vol. 13(1), pp. 255–267 |
article | DOI |
BibTeX:
@article{Hassan2022,
author = {Hassan, A. and Deka, D. and Dvorkin, Y.},
title = {Privacy-Aware Load Ensemble Control: A Linearly-Solvable MDP Approach},
journal = {IEEE Transactions on Smart Grid},
year = {2022},
volume = {13},
number = {1},
pages = {255–267},
doi = {https://doi.org/10.1109/TSG.2021.3114370}
}
|
|||||
| Henríquez, R., Martínez de Osés, F.X. and Martínez Marín, J.E. | Technological drivers of seaports' business model innovation: An exploratory case study on the port of Barcelona | 2022 | Research in Transportation Business & Management Vol. 43, pp. 100803 |
article | DOI URL |
| Abstract: The role of seaports has evolved from being simple sea/land interfaces to becoming increasingly value-adding entities in global supply chains. A port that is today at the forefront of this trend is characterized as a fifth generation (5G) port, a “smart port” or, more recently, a Port 4.0. These characterisations, introduced by Maritime Studies literature, are closely equivalent to the business model concept developed by the Strategic Management literature in the last decades. This research paper inquires on the influence that Industry 4.0 technologies might have on the adoption of more sophisticated business models by seaports, and the mechanisms through which this influence is driven: in particular the role that technology push and market pull mechanisms might play. To this end, it develops a conceptual model that aims to provide an explanation of the relationship between the adoption of Industry 4.0 technologies and the evolution of seaports' business models. This model is then evaluated against an exploratory case study on the port of Barcelona. Finally, the paper explores what would “smartness” mean in a seaport context. | |||||
BibTeX:
@article{Henriquez2022,
author = {Henríquez, Ricardo and Martínez de Osés, F. Xavier and Martínez Marín, Jesús E.},
title = {Technological drivers of seaports' business model innovation: An exploratory case study on the port of Barcelona},
journal = {Research in Transportation Business & Management},
year = {2022},
volume = {43},
pages = {100803},
note = {Export Date: 07 July 2022; Cited By: 0},
url = {https://www.sciencedirect.com/science/article/pii/S2210539522000244},
doi = {https://doi.org/10.1016/j.rtbm.2022.100803}
}
|
|||||
| Herlau, T., Schmidt, M.N. and Mørup, M. | Bayesian dropout | 2022 | Procedia Computer Science Vol. 201, pp. 771–776 |
article | DOI URL |
| Abstract: In the past decade, Dropout has emerged as a powerful and simple method for training neural networks preventing co-adaptation by stochastically omitting neurons. Dropout is currently not grounded in explicit modelling assumptions which so far has precluded its adoption in Bayesian modeling. Using Bayesian entropic reasoning we show that dropout can be interpreted as optimal inference under constraints. We demonstrate this on an analytically tractable regression model providing a Bayesian interpretation of its mechanism for regularizing and preventing co-adaptation as well as its connection to other Bayesian techniques, and in our experiments we find that dropout can provide robustness under model misspecification. Our framework roots dropout as a theoretically justified and practical tool for statistical modeling allowing Bayesian practitioners to tap into the benefits of dropout training. | |||||
BibTeX:
@article{Herlau2022,
author = {Herlau, Tue and Schmidt, Mikkel N. and Mørup, Morten},
title = {Bayesian dropout},
journal = {Procedia Computer Science},
year = {2022},
volume = {201},
pages = {771–776},
url = {https://www.sciencedirect.com/science/article/pii/S187705092200518X},
doi = {https://doi.org/10.1016/j.procs.2022.03.105}
}
|
|||||
| Hermann, A., Jensen, T.V., Østergaard, J. and Kazempour, J. | A complementarity model for electric power transmission-distribution coordination under uncertainty | 2022 | European Journal of Operational Research Vol. 299(1), pp. 313–329 |
article | DOI URL |
| Abstract: The growing penetration of stochastic renewable energy sources increases the need for operational flexibility to cope with imbalances. Existing proposals for flexibility procurement are envisioning markets where the transmission system operator (TSO) can access flexible resources located at the distribution system operator (DSO)-level and vice versa, but the coordination between these two entities is a matter of active research. We consider two trading floors, i.e., day-ahead and real-time markets, and propose a method for day-ahead coordination on how to share flexible resources, described as a complementarity model. The proposed coordination approach is to optimize prices and capacity limits at the physical interface of TSO and DSO, the so-called “coordination variables”. For given values of these variables, the DSO pre-qualifies the participation of DSO-level resources in the day-ahead market by capping their quantity bids. This way, the DSO ensures that the constraints of its system, modeled by a conic program, will be respected. Pursuing computational tractability, we decompose the model using a multi-cut Benders’ decomposition approach. It separates the conic modeling of real-time power flows under each scenario from the mixed-integer linear formulation of the day-ahead market-clearing problem. We quantify the potential benefit of the proposed coordination method in terms of improved social welfare. Using an ex-post out-of-sample simulation, the performance of the proposed coordination method is assessed against two benchmarks: (i) a fully uncoordinated scheme which obtains a lower bound for the expected social welfare, and (ii) an ideal benchmark which co-optimizes the TSO and DSO problems, providing an upper bound for the expected social welfare. | |||||
BibTeX:
@article{Hermann2022,
author = {Hermann, Alexander and Jensen, Tue Vissing and Østergaard, Jacob and Kazempour, Jalal},
title = {A complementarity model for electric power transmission-distribution coordination under uncertainty},
journal = {European Journal of Operational Research},
year = {2022},
volume = {299},
number = {1},
pages = {313–329},
url = {https://www.sciencedirect.com/science/article/pii/S037722172100686X},
doi = {https://doi.org/10.1016/j.ejor.2021.08.018}
}
|
|||||
| Holzinger, A., Dehmer, M., Emmert-Streib, F., Cucchiara, R., Augenstein, I., Ser, J.D., Samek, W., Jurisica, I. and Díaz-Rodríguez, N. | Information fusion as an integrative cross-cutting enabler to achieve robust, explainable, and trustworthy medical artificial intelligence | 2022 | Information Fusion Vol. 79, pp. 263–278 |
article | DOI URL |
| Abstract: Medical artificial intelligence (AI) systems have been remarkably successful, even outperforming human performance at certain tasks. There is no doubt that AI is important to improve human health in many ways and will disrupt various medical workflows in the future. Using AI to solve problems in medicine beyond the lab, in routine environments, we need to do more than to just improve the performance of existing AI methods. Robust AI solutions must be able to cope with imprecision, missing and incorrect information, and explain both the result and the process of how it was obtained to a medical expert. Using conceptual knowledge as a guiding model of reality can help to develop more robust, explainable, and less biased machine learning models that can ideally learn from less data. Achieving these goals will require an orchestrated effort that combines three complementary Frontier Research Areas: (1) Complex Networks and their Inference, (2) Graph causal models and counterfactuals, and (3) Verification and Explainability methods. The goal of this paper is to describe these three areas from a unified view and to motivate how information fusion in a comprehensive and integrative manner can not only help bring these three areas together, but also have a transformative role by bridging the gap between research and practical applications in the context of future trustworthy medical AI. This makes it imperative to include ethical and legal aspects as a cross-cutting discipline, because all future solutions must not only be ethically responsible, but also legally compliant. | |||||
BibTeX:
@article{Holzinger2022,
author = {Holzinger, Andreas and Dehmer, Matthias and Emmert-Streib, Frank and Cucchiara, Rita and Augenstein, Isabelle and Ser, Javier Del and Samek, Wojciech and Jurisica, Igor and Díaz-Rodríguez, Natalia},
title = {Information fusion as an integrative cross-cutting enabler to achieve robust, explainable, and trustworthy medical artificial intelligence},
journal = {Information Fusion},
year = {2022},
volume = {79},
pages = {263–278},
url = {https://www.sciencedirect.com/science/article/pii/S1566253521002050},
doi = {https://doi.org/10.1016/j.inffus.2021.10.007}
}
|
|||||
| Inatsu, Y., Takeno, S., Karasuyama, M. and Takeuchi, I. | Bayesian Optimization for Distributionally Robust Chance-constrained Problem | 2022 | Vol. 162, pp. 9602––9621 |
misc | URL |
| Abstract: In black-box function optimization, we need to consider not only controllable design variables but also uncontrollable stochastic environment variables. In such cases, it is necessary to solve the optimization problem by taking into account the uncertainty of the environmental variables. Chance-constrained (CC) problem, the problem of maximizing the expected value under a certain level of constraint satisfaction probability, is one of the practically important problems in the presence of environmental variables. In this study, we consider distributionally robust CC (DRCC) problem and propose a novel DRCC Bayesian optimization method for the case where the distribution of the environmental variables cannot be precisely specified. We show that the proposed method can find an arbitrary accurate solution with high probability in a finite number of trials, and confirm the usefulness of the proposed method through numerical experiments. | |||||
BibTeX:
@misc{Inatsu2022,
author = {Inatsu, Yu and Takeno, Shion and Karasuyama, Masayuki and Takeuchi, Ichiro},
title = {Bayesian Optimization for Distributionally Robust Chance-constrained Problem},
publisher = {PMLR},
year = {2022},
volume = {162},
pages = {9602––9621},
url = {https://proceedings.mlr.press/v162/inatsu22a.html}
}
|
|||||
| Jayadev, G., Leibowicz, B.D., Bard, J.F. and Çalci, B. | Risk-averse stochastic bilevel programming: An application to natural gas markets | 2022 | Computers & Industrial Engineering Vol. 169, pp. 108151 |
article | DOI URL |
| Abstract: This paper presents a risk-based integer bilevel programming model that represents two players (leader and follower) who interact strategically over an infrastructure network. Both players seek to maximize their individual profits in the face of demand uncertainty. Variations of the basic model are proposed that allow us to identify optimal strategies under risk-neutral and risk-averse decision-making. To solve the resulting stochastic bilevel problem, we develop an algorithm that relies on iteratively solving a restricted version of the problem to obtain feasible solutions to the original model. Extensive computational experiments are performed to evaluate algorithmic tractability and solution quality. The methodology is demonstrated using an example that addresses emerging strategic issues in natural gas markets. The model considers two players, a liquefied natural gas (LNG) operator as the leader and a natural gas (NG) producer as the follower. The LNG operator makes decisions on the locations of LNG facilities and the amount of gas to buy from the producer. The NG producer decides how much gas to produce and how to ship it through the existing pipeline network. Both players face demand uncertainty in their respective markets and have to make investment, production, and sales decisions. Our case study focuses on the Gulf-Southwest region of the United States and demonstrates the impact of risk-averse decision-making on investment and operational decisions. | |||||
BibTeX:
@article{Jayadev2022,
author = {Jayadev, Gopika and Leibowicz, Benjamin D. and Bard, Jonathan F. and Çalci, Baturay},
title = {Risk-averse stochastic bilevel programming: An application to natural gas markets},
journal = {Computers & Industrial Engineering},
year = {2022},
volume = {169},
pages = {108151},
url = {https://www.sciencedirect.com/science/article/pii/S0360835222002212},
doi = {https://doi.org/10.1016/j.cie.2022.108151}
}
|
|||||
| Johannsmann, L.M., Craparo, E.M., Dieken, T.L., Fügenschuh, A.R. and Seitner, B.O. | Stochastic mixed-integer programming for a spare parts inventory management problem | 2022 | Computers & Operations Research Vol. 138, pp. 105568 |
article | DOI URL |
| Abstract: The German Armed Forces provide an operation contingent to support the North Atlantic Treaty Organization (NATO) Response Force (NRF). To fulfill a mission, the NRF operates a number of technical systems, mostly vehicles. Each system is composed of several parts which might fail over time, and it can only be used again in the mission if all broken parts are replaced. For short deployments (e.g., one month), the NRF troops bring with them a tightly constrained “warehouse” of spare parts. To ensure an optimal use of the space, we present a two-stage stochastic programming model where in the first stage spare parts are chosen, then failures occur at random, and in the second stage the parts are assigned to the broken systems. We carry out a scenario-based approach, where the failures are simulated by a Monte-Carlo approach. We demonstrate that the resulting mixed-integer linear program can be solved using standard numerical solvers. Using real-world input data provided by the German Armed Forces and simulated data, we analyze the sensitivity of the solutions with respect to the size of the warehouse, the service level, and the number of scenarios, and compare our approach with simpler, doctrine based warehousing strategies. | |||||
BibTeX:
@article{Johannsmann2022,
author = {Johannsmann, Leonie M. and Craparo, Emily M. and Dieken, Thor L. and Fügenschuh, Armin R. and Seitner, Björn O.},
title = {Stochastic mixed-integer programming for a spare parts inventory management problem},
journal = {Computers & Operations Research},
year = {2022},
volume = {138},
pages = {105568},
url = {https://www.sciencedirect.com/science/article/pii/S0305054821002975},
doi = {https://doi.org/10.1016/j.cor.2021.105568}
}
|
|||||
| Jović, M., Tijan, E., Brčić, D. and Pucihar, A. | Digitalization in Maritime Transport and Seaports: Bibliometric, Content and Thematic Analysis [BibTeX] |
2022 | Journal of Marine Science and Engineering Vol. 10(4) |
article | DOI URL |
BibTeX:
@article{Jovic2022,
author = {Jović, M. and Tijan, E. and Brčić, D. and Pucihar, A.},
title = {Digitalization in Maritime Transport and Seaports: Bibliometric, Content and Thematic Analysis},
journal = {Journal of Marine Science and Engineering},
year = {2022},
volume = {10},
number = {4},
note = {Export Date: 07 July 2022; Cited By: 0},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85128369688&doi=10.3390%2fjmse10040486&partnerID=40&md5=b33a4ee0470c0b7d91d80649b8ad68e7},
doi = {https://doi.org/10.3390/jmse10040486}
}
|
|||||
| Jung, P.H. and Thill, J.-C. | Sea-land interdependence and delimitation of port hinterland-foreland structures in the international transportation system | 2022 | Journal of Transport Geography Vol. 99, pp. 103297 |
article | DOI URL |
| Abstract: Acknowledging that sea-land intermodal integration and transshipment are core transformations of the contemporary international logistic system, we study the spatial and functional structure of a port system across land and sea in this context. Previous port-driven regional development models have focused only on landside port-hinterland spatial structures in the local vicinity of ports, not seaside inter-port connections together. By revisiting the concepts of port triptych and hinterland-foreland continuum, we argue that the spatial structure of a port system should consider both flows to and from ports together when tracing spatial structures of hinterlands and forelands. Incorporating the network-based analytical model of the nonparametric weighted stochastic blockmodel, we study the global-scale structures of hinterlands and forelands under integrated landside-seaside freight flow dynamics. We investigate the network block structures of cargo shipping routes between Europe and the United States based on micro-level shipping flow data. We find a rich and meaningful collection of different network blocks of hinterlands, feeder and hub ports, and forelands that mirror the functional division of logistic processes across space, the interdependent relationships between hinterlands and forelands along a logistical continuum. | |||||
BibTeX:
@article{Jung2022,
author = {Jung, Paul H. and Thill, Jean-Claude},
title = {Sea-land interdependence and delimitation of port hinterland-foreland structures in the international transportation system},
journal = {Journal of Transport Geography},
year = {2022},
volume = {99},
pages = {103297},
url = {https://www.sciencedirect.com/science/article/pii/S0966692322000205},
doi = {https://doi.org/10.1016/j.jtrangeo.2022.103297}
}
|
|||||
| Karakaya, Ş. and Köksal, G. | Product-line planning under uncertainty | 2022 | Computers & Operations Research Vol. 138, pp. 105565 |
article | DOI URL |
| Abstract: This study addresses a multi-period product-line-mix problem considering product interdependencies and uncertainties regarding price, demand, production cost, and the cannibalization effect of new products. The problem is modeled as a two-stage stochastic program. In the first-stage, decisions for the release times of new product-lines and capacity expansion are made without waiting for the realization of random events. Sales volumes are determined in the second-stage after more information about uncertainties is revealed. The solution approach employs a sample average approximation technique based on the Monte Carlo bounding, and multi-cut version of the L-shaped method to solve approximate problems efficiently. The model and solution approach are tested on different cases considering the value-of-stochastic-solution (VSS) and the expected-value-of-perfect-information (EVPI) as performance measures, under the assumption that the decision-maker is risk-neutral. Data collected through experimental studies are analyzed using ANOVA and Random Forest method to determine the impact of both deterministic and uncertain parameters on the performance of the stochastic approach, and to generate some rule-based inferences about the behavior of the proposed model. The results demonstrate the problem environments in which the stochastic model can generate the highest benefit to the business. It is mainly found the model can provide more expected profit than the mean-value solution in problems having uncertainties, particularly when selling prices and production costs are uncertain. | |||||
BibTeX:
@article{Karakaya2022,
author = {Karakaya, Şakir and Köksal, Gülser},
title = {Product-line planning under uncertainty},
journal = {Computers & Operations Research},
year = {2022},
volume = {138},
pages = {105565},
url = {https://www.sciencedirect.com/science/article/pii/S0305054821002951},
doi = {https://doi.org/10.1016/j.cor.2021.105565}
}
|
|||||
| Klerkx, R. and Pelsser, A. | Narrative-based robust stochastic optimization | 2022 | Journal of Economic Behavior & Organization Vol. 196, pp. 266–277 |
article | DOI URL |
| Abstract: Many portfolio optimization techniques rely heavily on past data and modeling assumptions. In an uncertain and ambiguous world, these techniques are prone to amplify model misspecification and therefore have poor out of sample results. Robust optimization explicitly recognizes uncertainty in model specification and performs better out of sample. The Achilles’ heel of the method is the selection of the uncertainty set. In this paper we focus on the construction of the uncertainty set around the stochastic model specification. We propose to use narratives to select the elements in the uncertainty set to avoid using a logically inconsistent or too large uncertainty set. The narratives provide useful tools in a qualitative sense to the portfolio management process. | |||||
BibTeX:
@article{Klerkx2022,
author = {Klerkx, Rik and Pelsser, Antoon},
title = {Narrative-based robust stochastic optimization},
journal = {Journal of Economic Behavior & Organization},
year = {2022},
volume = {196},
pages = {266–277},
url = {https://www.sciencedirect.com/science/article/pii/S0167268122000531},
doi = {https://doi.org/10.1016/j.jebo.2022.02.007}
}
|
|||||
| Koch, T., Berthold, T., Pedersen, J. and Vanaret, C. | Progress in mathematical programming solvers from 2001 to 2020 | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100031 |
article | DOI URL |
| Abstract: This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today. On average, we found out that for solving lp/milp, computer hardware got about 20 times faster, and the algorithms improved by a factor of about nine for lp and around 50 for milp, which gives a total speed-up of about 180 and 1,000 times, respectively. However, these numbers have a very high variance and they considerably underestimate the progress made on the algorithmic side: many problem instances can nowadays be solved within seconds, which the old codes are not able to solve within any reasonable time. | |||||
BibTeX:
@article{Koch2022,
author = {Koch, Thorsten and Berthold, Timo and Pedersen, Jaap and Vanaret, Charlie},
title = {Progress in mathematical programming solvers from 2001 to 2020},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100031},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000077},
doi = {https://doi.org/10.1016/j.ejco.2022.100031}
}
|
|||||
| Krakovsky, M. | Solving for why [BibTeX] |
2022 | Commun. ACM Vol. 65(2), pp. 11–13 |
article | DOI URL |
BibTeX:
@article{Krakovsky2022,
author = {Krakovsky, Marina},
title = {Solving for why},
journal = {Commun. ACM},
year = {2022},
volume = {65},
number = {2},
pages = {11–13},
url = {https://doi-org.ezproxy.utm.my/10.1145/3503777},
doi = {https://doi.org/10.1145/3503777}
}
|
|||||
| Küçükyavuz, S. and Jiang, R. | Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100030 |
article | DOI URL |
| Abstract: Chance-constrained programming (CCP) is one of the most difficult classes of optimization problems that has attracted the attention of researchers since the 1950s. In this survey, we focus on cases when only limited information on the distribution is available, such as a sample from the distribution, or the moments of the distribution. We first review recent developments in mixed-integer linear formulations of chance-constrained programs that arise from finite discrete distributions (or sample average approximation). We highlight successful reformulations and decomposition techniques that enable the solution of large-scale instances. We then review active research in distributionally robust CCP, which is a framework to address the ambiguity in the distribution of the random data. The focal point of our review is on scalable formulations that can be readily implemented with state-of-the-art optimization software. Furthermore, we highlight the prevalence of CCPs with a review of applications across multiple domains. | |||||
BibTeX:
@article{Kuecuekyavuz2022,
author = {Küçükyavuz, Simge and Jiang, Ruiwei},
title = {Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100030},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000065},
doi = {https://doi.org/10.1016/j.ejco.2022.100030}
}
|
|||||
| Langenus, M., Dooms, M., Haezendonck, E., Notteboom, T. and Verbeke, A. | Modal shift ambitions of large North European ports: A contract-theory perspective on the role of port managing bodies | 2022 | Maritime Transport Research Vol. 3, pp. 100049 |
article | DOI URL |
| Abstract: Port managing bodies (PMBs) need to respond to increased societal pressures for improving environmental performance. For many PMBs, a modal shift (MS) from road to rail and barge transport (where available) represents a strategic priority. Yet, in practice, few PMBs have set clear MS targets or have been able to achieve their MS objectives at the level of the port cluster. In this context, the extant port management literature has not yet provided actionable and generally applicable conceptual guidance for PMBs towards achieving ambitious MS goals. In this paper, we develop such guidance by following a contract theory approach to the effectiveness of MS strategies implemented by PMBs. We argue that a PMB, in its role of port cluster manager, can facilitate a MS through strategically deploying governance mechanisms based on sound economic theory. Here, an arsenal of incentives and penalties can be used to push port users (PUs) towards achieving MS targets. Building upon insight from contract theory, we also assess the importance of information management as a prerequisite for a successful MS strategy. We formulate strategic directions for PMBs and identify a future research agenda that should allow improved understanding of how MS goals can be achieved in real world settings. | |||||
BibTeX:
@article{Langenus2022,
author = {Langenus, M. and Dooms, M. and Haezendonck, E. and Notteboom, T. and Verbeke, A.},
title = {Modal shift ambitions of large North European ports: A contract-theory perspective on the role of port managing bodies},
journal = {Maritime Transport Research},
year = {2022},
volume = {3},
pages = {100049},
url = {https://www.sciencedirect.com/science/article/pii/S2666822X21000368},
doi = {https://doi.org/10.1016/j.martra.2021.100049}
}
|
|||||
| Lee, C. | A robust optimization approach with probe-able uncertainty | 2022 | European Journal of Operational Research Vol. 296(1), pp. 218–239 |
article | DOI URL |
| Abstract: We consider optimization problems whose objective functions have uncertain coefficients. We assumed that, initially, the uncertain data are given as ranges, and probing of the true values of data is possible. The complete probing of all uncertain data will yield the true optimal solution. However, probing all uncertain data is undesirable because each probing may require cost or time depending on the methods of probing. We are interested in finding a solution, which we call Γ-optimal, that is guaranteed to remain the best solution even after additional Γ probings of uncertain data. An iterative algorithm to find the Γ-optimal solution is developed with theoretical probability bounds of the Γ-optimal solution being true optimal. Special algorithms are also developed for the problems on networks. The extensive computational study shows that the proposed approach could find the true optimal solutions at very high percentages, even with small numbers of probings. | |||||
BibTeX:
@article{Lee2022,
author = {Lee, Chungmok},
title = {A robust optimization approach with probe-able uncertainty},
journal = {European Journal of Operational Research},
year = {2022},
volume = {296},
number = {1},
pages = {218–239},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005956},
doi = {https://doi.org/10.1016/j.ejor.2021.06.064}
}
|
|||||
| Li, C., Conejo, A.J., Liu, P., Omell, B.P., Siirola, J.D. and Grossmann, I.E. | Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems | 2022 | European Journal of Operational Research Vol. 297(3), pp. 1071–1082 |
article | DOI URL |
| Abstract: With the increasing penetration of renewable generating units, especially in remote areas not well connected with load demand, there are growing interests to co-optimize generation and transmission expansion planning (GTEP) in power systems. Due to the volatility in renewable generation, a planner needs to include the operating decisions into the planning model to guarantee feasibility. However, solving the GTEP problem with hourly operating decisions throughout the planning horizon is computationally intractable. Therefore, we propose several spatial and temporal simplifications to the problem. Built on the generation expansion planning (GEP) formulation of Lara et al. (2018), we propose a mixed-integer linear programming formulation for the GTEP problem. Three different formulations, i.e., a big-M formulation, a hull formulation, and an alternative big-M formulation, are reported for transmission expansion. We theoretically compare the tightness of the LP relaxations of the three formulations. The proposed MILP GTEP model typically involves millions or tens of millions of variables, which makes the model not directly solvable by the commercial solvers. To address this computational challenge, we propose a nested Benders decomposition algorithm and a tailored Benders decomposition algorithm that exploit the structure of the GTEP problem. Using a case study from Electric Reliability Council of Texas (ERCOT), we are able to show that the proposed tailored Benders decomposition outperforms the nested Benders decomposition. The coordination in the optimal generation and transmission expansion decisions from the ERCOT study implies that there is an additional value in solving GEP and TEP simultaneously. | |||||
BibTeX:
@article{Li2022,
author = {Li, Can and Conejo, Antonio J. and Liu, Peng and Omell, Benjamin P. and Siirola, John D. and Grossmann, Ignacio E.},
title = {Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems},
journal = {European Journal of Operational Research},
year = {2022},
volume = {297},
number = {3},
pages = {1071–1082},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005397},
doi = {https://doi.org/10.1016/j.ejor.2021.06.024}
}
|
|||||
| de Lima, V.L., Alves, C., Clautiaux, F., Iori, M. and Valério de Carvalho, J.M. | Arc flow formulations based on dynamic programming: Theoretical foundations and applications | 2022 | European Journal of Operational Research Vol. 296(1), pp. 3–21 |
article | DOI URL |
| Abstract: Network flow formulations are among the most successful tools to solve optimization problems. Such formulations correspond to determining an optimal flow in a network. One particular class of network flow formulations is the arc flow, where variables represent flows on individual arcs of the network. For NP-hard problems, polynomial-sized arc flow models typically provide weak linear relaxations and may have too much symmetry to be efficient in practice. Instead, arc flow models with a pseudo-polynomial size usually provide strong relaxations and are efficient in practice. The interest in pseudo-polynomial arc flow formulations has grown considerably in the last twenty years, in which they have been used to solve many open instances of hard problems. A remarkable advantage of pseudo-polynomial arc flow models is the possibility to solve practical-sized instances directly by a Mixed Integer Linear Programming solver, avoiding the implementation of complex methods based on column generation. In this survey, we present theoretical foundations of pseudo-polynomial arc flow formulations, by showing a relation between their network and Dynamic Programming (DP). This relation allows a better understanding of the strength of these formulations, through a link with models obtained by Dantzig-Wolfe decomposition. The relation with DP also allows a new perspective to relate state-space relaxation methods for DP with arc flow models. We also present a dual point of view to contrast the linear relaxation of arc flow models with that of models based on paths and cycles. To conclude, we review the main solution methods and applications of arc flow models based on DP in several domains such as cutting, packing, scheduling, and routing. | |||||
BibTeX:
@article{Lima2022,
author = {de Lima, Vinícius L. and Alves, Cláudio and Clautiaux, François and Iori, Manuel and Valério de Carvalho, José M.},
title = {Arc flow formulations based on dynamic programming: Theoretical foundations and applications},
journal = {European Journal of Operational Research},
year = {2022},
volume = {296},
number = {1},
pages = {3–21},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721003386},
doi = {https://doi.org/10.1016/j.ejor.2021.04.024}
}
|
|||||
| Lin, Q., Zhao, Q. and Lev, B. | Influenza vaccine supply chain coordination under uncertain supply and demand | 2022 | European Journal of Operational Research Vol. 297(3), pp. 930–948 |
article | DOI URL |
| Abstract: Influenza vaccine supply chains are subject to yield and demand uncertainty, which leads to the mismatch between supply and demand. This paper studies the production and procurement decisions in the influenza vaccine supply chain consisting of a manufacturer facing uncertain production yield and a social planner who faces uncertain demand and is responsible for social infection costs. We develop a novel model framework considering the risks resulting from uncertainties on both supply and demand sides that the manufacturer may delay part of delivery and the social planner may order under or over demand. Based on the framework, we first discuss the production and procurement decision-making problem in a centralized and a decentralized system. By comparing the two systems, we present the existence and extent of the inefficiency in the influenza vaccine supply chain. Further, we propose a procurement strategy that provides the social planner with two ordering opportunities and explore the conditions under which the two members would be willing to accept the strategy. The results show that such a strategy is effective on improving the influenza vaccine supply chain coordination. Additionally, considering large-scale outbreaks of influenza epidemics, we extend the models with a piecewise linear infection probability function to those with a generic one and describe the characteristics of the extended models and their solutions. | |||||
BibTeX:
@article{Lin2022,
author = {Lin, Qi and Zhao, Qiuhong and Lev, Benjamin},
title = {Influenza vaccine supply chain coordination under uncertain supply and demand},
journal = {European Journal of Operational Research},
year = {2022},
volume = {297},
number = {3},
pages = {930–948},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721004537},
doi = {https://doi.org/10.1016/j.ejor.2021.05.025}
}
|
|||||
| Liu, K., Cheng, J. and Yi, J. | Copper price forecasted by hybrid neural network with Bayesian Optimization and wavelet transform | 2022 | Resources Policy Vol. 75, pp. 102520 |
article | DOI URL |
| Abstract: The metal prices play an important role in many aspects of economics. Copper, a widely used metal in the industry, has received an extensive attention recently. Due to the high fluctuations in copper price that makes it difficult to predict especially when using the traditional statistical models, in this work, a hybrid Neural Network with Bayesian Optimization and Wavelet Transform is applied to forecast the copper price in both short- and long-terms, in which Bayesian Optimization Algorithm is used on the hyperparameter searching task, the Wavelet Transform is applied to denoise the data and eliminate the irrelevant information, and Long Short Time Memory (LSTM) and Gated Recurrent Units (GRU) are employed to train the data and predict future copper price, respectively. The results indicate that our methods, either LSTM or GRU, can appropriately predict the copper price for both short- and long-terms with mean squared error both below 3% and this hybrid Neural Network is robust to remove the irrelevant information and search the optimized set of hyperparameters. Meanwhile, it is easily and readily applicable to predict the prices of other commodities (i.e., stock market). | |||||
BibTeX:
@article{Liu2022,
author = {Liu, Kailei and Cheng, Jinhua and Yi, Jiahui},
title = {Copper price forecasted by hybrid neural network with Bayesian Optimization and wavelet transform},
journal = {Resources Policy},
year = {2022},
volume = {75},
pages = {102520},
url = {https://www.sciencedirect.com/science/article/pii/S0301420721005274},
doi = {https://doi.org/10.1016/j.resourpol.2021.102520}
}
|
|||||
| Liu, Q., Li, N., Jia, H., Qi, Q., Abualigah, L. and Liu, Y. | A Hybrid Arithmetic Optimization and Golden Sine Algorithm for Solving Industrial Engineering Design Problems | 2022 | Vol. 10(9) |
misc | DOI |
| Abstract: Arithmetic Optimization Algorithm (AOA) is a physically inspired optimization algorithm that mimics arithmetic operators in mathematical calculation. Although the AOA has an acceptable exploration and exploitation ability, it also has some shortcomings such as low population diversity, premature convergence, and easy stagnation into local optimal solutions. The Golden Sine Algorithm (Gold-SA) has strong local searchability and fewer coefficients. To alleviate the above issues and improve the performance of AOA, in this paper, we present a hybrid AOA with Gold-SA called HAGSA for solving industrial engineering design problems. We divide the whole population into two subgroups and optimize them using AOA and Gold-SA during the searching process. By dividing these two subgroups, we can exchange and share profitable information and utilize their advantages to find a satisfactory global optimal solution. Furthermore, we used the Levy flight and proposed a new strategy called Brownian mutation to enhance the searchability of the hybrid algorithm. To evaluate the efficiency of the proposed work, HAGSA, we selected the CEC 2014 competition test suite as a benchmark function and compared HAGSA against other well-known algorithms. Moreover, five industrial engineering design problems were introduced to verify the ability of algorithms to solve real-world problems. The experimental results demonstrate that the proposed work HAGSA is significantly better than original AOA, Gold-SA, and other compared algorithms in terms of optimization accuracy and convergence speed. | |||||
BibTeX:
@misc{Liu2022a,
author = {Liu, Qingxin and Li, Ni and Jia, Heming and Qi, Qi and Abualigah, Laith and Liu, Yuxiang},
title = {A Hybrid Arithmetic Optimization and Golden Sine Algorithm for Solving Industrial Engineering Design Problems},
year = {2022},
volume = {10},
number = {9},
doi = {https://doi.org/10.3390/math10091567}
}
|
|||||
| Liu, X., Huang, B., Li, R., Zhang, J., Gou, Q., Zhou, T. and Huang, Z. | Wind environment assessment and planning of urban natural ventilation corridors using GIS: Shenzhen as a case study | 2022 | Urban Climate Vol. 42, pp. 101091 |
article | DOI URL |
| Abstract: The development of high-density cities has aggravated the harshness of the urban microclimate in face of global warming. However, an adequate urban ventilation system can introduce clean and cool air into high-temperature areas of a city, which can alleviate the urban heat island (UHI) effect and increase residents' thermal comfort. In this study, we devise an integrated air ventilation assessment (IAVA) method to assess the urban wind environment using multi-source data, with Shenzhen as an example. The IAVA map illustrates that developed areas in the south and west of Shenzhen form a “wind wall” that reduces wind speeds and prevents wind flow into inland areas. In light of the results of the IAVA, potential ventilation corridors across Shenzhen are then created using the least cost path method. Subsequently, the optimized ventilation corridors are generated via super-imposition over a satellite image and the identification of functioning and compensating areas. Notably, the IAVA introduces the effects of terrain, vegetation, and open space, thus providing a more pragmatic evaluation of the wind environment than frontal area density results. Furthermore, it provides planning guidance for local governments that considers the quality of the urban wind environment in the low-cost and efficient construction of ecological and livable cities. | |||||
BibTeX:
@article{Liu2022b,
author = {Liu, Xiaoqian and Huang, Bo and Li, Rongrong and Zhang, Junhua and Gou, Qiang and Zhou, Tao and Huang, Zhihui},
title = {Wind environment assessment and planning of urban natural ventilation corridors using GIS: Shenzhen as a case study},
journal = {Urban Climate},
year = {2022},
volume = {42},
pages = {101091},
url = {https://www.sciencedirect.com/science/article/pii/S2212095522000098},
doi = {https://doi.org/10.1016/j.uclim.2022.101091}
}
|
|||||
| Lu, X., Jordan, K.E., Wheeler, M.F., Pyzer-Knapp, E.O. and Benatan, M. | Bayesian optimization for field-scale geological carbon storage | 2022 | Engineering | article | DOI URL |
| Abstract: We present a framework that couples a high-fidelity compositional reservoir simulator with Bayesian optimization (BO) for injection well scheduling optimization in geological carbon sequestration. This work represents one of the first at tempts to apply BO and high-fidelity physics models to geological carbon storage. The implicit parallel accurate reservoir simulator (IPARS) is utilized to accurately capture the underlying physical processes during CO2 sequestration. IPARS provides a framework for several flow and mechanics models and thus supports both stand-alone and coupled simulations. In this work, we use the compositional flow module to simulate the geological carbon storage process. The compositional flow model, which includes a hysteretic three-phase relative permeability model, accounts for three major CO2 trapping mechanisms: structural trapping, residual gas trapping, and solubility trapping. Furthermore, IPARS is coupled to the International Business Machines (IBM) Corporation Bayesian Optimization Accelerator (BOA) for parallel optimizations of CO2 injection strategies during field-scale CO2 sequestration. BO builds a probabilistic surrogate for the objective function using a Bayesian machine learning algorithm—the Gaussian process regression, and then uses an acquisition function that leverages the uncertainty in the surrogate to decide where to sample. The IBM BOA addresses the three weaknesses of standard BO that limits its scalability in that IBM BOA supports parallel (batch) executions, scales better for high-dimensional problems, and is more robust to initializations. We demonstrate these merits by applying the algorithm in the optimization of the CO2 injection schedule in the Cranfield site in Mississippi, USA, using field data. The optimized injection schedule achieves 16% more gas storage volume and 56% less water/surfactant usage compared with the baseline. The performance of BO is compared with that of a genetic algorithm (GA) and a covariance matrix adaptation (CMA)-evolution strategy (ES). The results demonstrate the superior performance of BO, in that it achieves a competitive objective function value with over 60% fewer forward model evaluations. | |||||
BibTeX:
@article{Lu2022,
author = {Lu, Xueying and Jordan, Kirk E. and Wheeler, Mary F. and Pyzer-Knapp, Edward O. and Benatan, Matthew},
title = {Bayesian optimization for field-scale geological carbon storage},
journal = {Engineering},
year = {2022},
url = {https://www.sciencedirect.com/science/article/pii/S2095809922004957},
doi = {https://doi.org/10.1016/j.eng.2022.06.011}
}
|
|||||
| Lu, Z., Geng, Z., Li, W., Zhu, S. and Jia, J. | Evaluating Causes of Effects by Posterior Effects of Causes | 2022 | Biometrika, pp. asac038 | article | DOI URL |
| Abstract: For the case with a single causal variable, Dawid et al. (2014) defined the probability of causation and Pearl (2000) defined the probability of necessity to assess the causes of effects. For a case with multiple causes which may affect each other, this paper defines the posterior total and direct causal effects based on the evidences observed for post-treatment variables, which could be viewed as measurements of causes of effects. Posterior causal effects involve the probabilities of counterfactual variables. Thus, like probability of causation, probability of necessity and the direct causal effects, the identifiability of posterior total and direct causal effects requires more assumptions than the identifiability of traditional causal effects conditional on pre-treatment variables. We present assumptions required for the identifiability of posterior causal effects and provide identification equations. Further, when the causal relationships among multiple causes and an endpoint may be depicted by causal networks, we can simplify both the required assumptions and the identification equations of the posterior total and direct causal effects. Finally, using numerical examples, we compare the posterior total and direct causal effects with other measures for evaluating the causes of effects and the population attributable risks. | |||||
BibTeX:
@article{Lu2022a,
author = {Lu, Zitong and Geng, Zhi and Li, Wei and Zhu, Shengyu and Jia, Jinzhu},
title = {Evaluating Causes of Effects by Posterior Effects of Causes},
journal = {Biometrika},
year = {2022},
pages = {asac038},
url = {https://doi.org/10.1093/biomet/asac038},
doi = {https://doi.org/10.1093/biomet/asac038}
}
|
|||||
| Maier-Hein, L., Eisenmann, M., Sarikaya, D., März, K., Collins, T., Malpani, A., Fallert, J., Feussner, H., Giannarou, S., Mascagni, P., Nakawala, H., Park, A., Pugh, C., Stoyanov, D., Vedula, S.S., Cleary, K., Fichtinger, G., Forestier, G., Gibaud, B., Grantcharov, T., Hashizume, M., Heckmann-Nötzel, D., Kenngott, H.G., Kikinis, R., Mündermann, L., Navab, N., Onogur, S., Roß, T., Sznitman, R., Taylor, R.H., Tizabi, M.D., Wagner, M., Hager, G.D., Neumuth, T., Padoy, N., Collins, J., Gockel, I., Goedeke, J., Hashimoto, D.A., Joyeux, L., Lam, K., Leff, D.R., Madani, A., Marcus, H.J., Meireles, O., Seitel, A., Teber, D., Ückert, F., Müller-Stich, B.P., Jannin, P. and Speidel, S. | Surgical data science – from concepts toward clinical translation | 2022 | Medical Image Analysis Vol. 76, pp. 102306 |
article | DOI URL |
| Abstract: Recent developments in data science in general and machine learning in particular have transformed the way experts envision the future of surgery. Surgical Data Science (SDS) is a new research field that aims to improve the quality of interventional healthcare through the capture, organization, analysis and modeling of data. While an increasing number of data-driven approaches and clinical applications have been studied in the fields of radiological and clinical data science, translational success stories are still lacking in surgery. In this publication, we shed light on the underlying reasons and provide a roadmap for future advances in the field. Based on an international workshop involving leading researchers in the field of SDS, we review current practice, key achievements and initiatives as well as available standards and tools for a number of topics relevant to the field, namely (1) infrastructure for data acquisition, storage and access in the presence of regulatory constraints, (2) data annotation and sharing and (3) data analytics. We further complement this technical perspective with (4) a review of currently available SDS products and the translational progress from academia and (5) a roadmap for faster clinical translation and exploitation of the full potential of SDS, based on an international multi-round Delphi process. | |||||
BibTeX:
@article{MaierHein2022,
author = {Maier-Hein, Lena and Eisenmann, Matthias and Sarikaya, Duygu and März, Keno and Collins, Toby and Malpani, Anand and Fallert, Johannes and Feussner, Hubertus and Giannarou, Stamatia and Mascagni, Pietro and Nakawala, Hirenkumar and Park, Adrian and Pugh, Carla and Stoyanov, Danail and Vedula, Swaroop S. and Cleary, Kevin and Fichtinger, Gabor and Forestier, Germain and Gibaud, Bernard and Grantcharov, Teodor and Hashizume, Makoto and Heckmann-Nötzel, Doreen and Kenngott, Hannes G. and Kikinis, Ron and Mündermann, Lars and Navab, Nassir and Onogur, Sinan and Roß, Tobias and Sznitman, Raphael and Taylor, Russell H. and Tizabi, Minu D. and Wagner, Martin and Hager, Gregory D. and Neumuth, Thomas and Padoy, Nicolas and Collins, Justin and Gockel, Ines and Goedeke, Jan and Hashimoto, Daniel A. and Joyeux, Luc and Lam, Kyle and Leff, Daniel R. and Madani, Amin and Marcus, Hani J. and Meireles, Ozanan and Seitel, Alexander and Teber, Dogu and Ückert, Frank and Müller-Stich, Beat P. and Jannin, Pierre and Speidel, Stefanie},
title = {Surgical data science – from concepts toward clinical translation},
journal = {Medical Image Analysis},
year = {2022},
volume = {76},
pages = {102306},
url = {https://www.sciencedirect.com/science/article/pii/S1361841521003510},
doi = {https://doi.org/10.1016/j.media.2021.102306}
}
|
|||||
| Nonato, L.G., Peixoto, P., Pereira, T., Sagastizábal, C. and Silva, P.J.S. | Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100025 |
article | DOI URL |
| Abstract: Robot Dance is a computational optimization platform developed in response to the COVID-19 outbreak, to support the decision-making on public policies at a regional level. The tool is suitable for understanding and suggesting levels of intervention needed to contain the spread of infectious diseases when the mobility of inhabitants through a regional network is a concern. Such is the case for the SARS-CoV-2 virus that is highly contagious and, therefore, makes it crucial to incorporate the circulation of people in the epidemiological compartmental models. Robot Dance anticipates the spread of an epidemic in a complex regional network, helping to identify fragile links where applying differentiated measures of containment, testing, and vaccination is important. Based on stochastic optimization, the model determines efficient strategies on the basis of commuting of individuals and the situation of hospitals in each district. Uncertainty in the capacity of intensive care beds is handled by a chance-constraint approach. Some functionalities of Robot Dance are illustrated in the state of São Paulo in Brazil, using real data for a region with more than forty million inhabitants. | |||||
BibTeX:
@article{Nonato2022,
author = {Nonato, Luis Gustavo and Peixoto, Pedro and Pereira, Tiago and Sagastizábal, Claudia and Silva, Paulo J. S.},
title = {Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100025},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000016},
doi = {https://doi.org/10.1016/j.ejco.2022.100025}
}
|
|||||
| Pagano, P., Antonelli, S. and Tardo, A. | C-Ports: A proposal for a comprehensive standardization and implementation plan of digital services offered by the “Port of the Future” | 2022 | Computers in Industry Vol. 134, pp. 103556 |
article | DOI URL |
| Abstract: In this paper we address the topic of a possible path to standardize the ICT services expected to be delivered by the so-called “Port of the Future”. How the most relevant technologies and Information Systems are used by the Port Communities for their businesses is discussed together with a detailed analysis of the on-going actions carried on by Standard Setting Organizations. Considering the examples given by the C-ITS Platform and the C-Roads programme at EU level, a proposal of contents to be considered in a comprehensive standardization action is given. The innovation services are therefore grouped into four bundles: (i) Vessel & Marine Navigation, (ii) e-Freight & (Intermodal) Logistics, (iii) Passenger Transport, (iv) Environmental sustainability. The standardized version of these applications will be finally labeled as C-Port services. Alongside the standardization plan, a proposal for ranking the ports on the basis of a specially-defined C-Port vector is discussed with the purpose of addressing the well-known lack of consensus around the mathematical definition of the Smart Port Index. Considering the good practice and the background offered by the Port of Livorno in terms of innovation actions, the prospected final user applications are then labeled as Day 1, Day 1.5, and Day 2 services in consideration of the technical and commercial gaps to be filled. As a case study about the evolution in the C-Port vector experienced by the Port of Livorno in the last years will also be discussed. | |||||
BibTeX:
@article{Pagano2022,
author = {Pagano, Paolo and Antonelli, Silvia and Tardo, Alexandr},
title = {C-Ports: A proposal for a comprehensive standardization and implementation plan of digital services offered by the “Port of the Future”},
journal = {Computers in Industry},
year = {2022},
volume = {134},
pages = {103556},
url = {https://www.sciencedirect.com/science/article/pii/S0166361521001639},
doi = {https://doi.org/10.1016/j.compind.2021.103556}
}
|
|||||
| Peng, B. | Performance comparison of two recently proposed copositivity tests | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100037 |
article | DOI URL |
| Abstract: Recently and simultaneously, two MILP-based approaches to copositivity testing were proposed. This note tries a performance comparison, using a group of test sets containing a large number of designed instances. According to the numerical results, we find that one copositivity detection approach performs better when the function value of the defined function h of a matrix is large while the other one performs better when the dimension of problems is increasing moderately. A problem set that is hard for both approaches is also presented, which may be used as a test bed for future competing approaches. An improved variant of one of the approaches is also proposed to handle those hard instances more efficiently. | |||||
BibTeX:
@article{Peng2022,
author = {Peng, Bo},
title = {Performance comparison of two recently proposed copositivity tests},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100037},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000132},
doi = {https://doi.org/10.1016/j.ejco.2022.100037}
}
|
|||||
| Ponio, G., Rashed, Y., van Hassel, E. and Verhoeven, P. | Modelling regulatory capture in the port sector: a case study in the Philippines | 2022 | Case Studies on Transport Policy | article | DOI URL |
| Abstract: Public service sectors have been a common topic for the study of the theory of economic regulation due to the natural monopolistic tendencies they pose. The study attempts to model regulatory capture by examining the impact of economic regulation and corruption on efficiency in one of these public service sectors, the port sector. The empirical analysis focuses on the port sector of the Philippines and its central port authority, the Philippine Ports Authority. Employing regression analysis on a limited time series dataset from 1990-2018, we show that, while controlling for relevant factors, corruption has significant negative influence on port efficiency. | |||||
BibTeX:
@article{Ponio2022,
author = {Ponio, Gideon and Rashed, Yasmine and van Hassel, Edwin and Verhoeven, Patrick},
title = {Modelling regulatory capture in the port sector: a case study in the Philippines},
journal = {Case Studies on Transport Policy},
year = {2022},
url = {https://www.sciencedirect.com/science/article/pii/S2213624X22000669},
doi = {https://doi.org/10.1016/j.cstp.2022.03.014}
}
|
|||||
| Qi, Y., Liao, K., Liu, T. and Zhang, Y. | Originating multiple-objective portfolio selection by counter-COVID measures and analytically instigating robust optimization by mean-parameterized nondominated paths | 2022 | Operations Research Perspectives Vol. 9, pp. 100252 |
article | DOI URL |
| Abstract: The COVID-19 pandemic is unleashing crises of humanity, economy, and finance. Portfolio selection is widely recognized as the foundation of modern financial economics. Therefore, it is naturally crucial and inviting to utilize portfolio selection in order to counter COVID-19 in stock markets. We originate a counter-COVID measure for stocks, extend portfolio selection, and construct multiple-objective portfolio selection. Because of the uncertainty in measuring counter-COVID, we perform robust optimization. Specifically, we analytically compute the optimal solutions as a trail of an optimal portfolio due to the change of counter-COVID. We call the trail as mean-parameterized nondominated path. Moreover, the path is a continuous function of the change, so the portfolio relatively mildly varies for the change. In contrast, researchers typically still focus on 2-objective robust illustrations and infrequently explicitly compute the optimal solutions for multiple-objective portfolio optimization. To the best of our knowledge, there is limited research for multiple-objective portfolio selection of COVID and for the robust optimization of multiple-objective portfolio selection. In such an area, this paper contributes to the literature. The implications to fight COVID are that investors minimize risk, maximize return, and maximize counter-COVID in stock markets and that investors ascertain the multiple-objective portfolio selection as relatively robust. | |||||
BibTeX:
@article{Qi2022,
author = {Qi, Yue and Liao, Kezhi and Liu, Tongyang and Zhang, Yu},
title = {Originating multiple-objective portfolio selection by counter-COVID measures and analytically instigating robust optimization by mean-parameterized nondominated paths},
journal = {Operations Research Perspectives},
year = {2022},
volume = {9},
pages = {100252},
url = {https://www.sciencedirect.com/science/article/pii/S2214716022000239},
doi = {https://doi.org/10.1016/j.orp.2022.100252}
}
|
|||||
| Roberts, L. and Smyth, E. | A simplified convergence theory for Byzantine resilient stochastic gradient descent | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100038 |
article | DOI URL |
| Abstract: In distributed learning, a central server trains a model according to updates provided by nodes holding local data samples. In the presence of one or more malicious servers sending incorrect information (a Byzantine adversary), standard algorithms for model training such as stochastic gradient descent (SGD) fail to converge. In this paper, we present a simplified convergence theory for the generic Byzantine Resilient SGD method originally proposed by Blanchard et al. (2017) [3]. Compared to the existing analysis, we shown convergence to a stationary point in expectation under standard assumptions on the (possibly nonconvex) objective function and flexible assumptions on the stochastic gradients. | |||||
BibTeX:
@article{Roberts2022,
author = {Roberts, Lindon and Smyth, Edward},
title = {A simplified convergence theory for Byzantine resilient stochastic gradient descent},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100038},
url = {https://www.sciencedirect.com/science/article/pii/S2192440622000144},
doi = {https://doi.org/10.1016/j.ejco.2022.100038}
}
|
|||||
| Rocha, H.L., de O. Silva, J.V., Silva, R.S., Lima, E.A.B.F. and Almeida, R.C. | Bayesian inference using Gaussian process surrogates in cancer modeling | 2022 | Computer Methods in Applied Mechanics and Engineering Vol. 399, pp. 115412 |
article | DOI URL |
| Abstract: Parametric multiscale tumor models have been used nowadays as tools to understand and predict the behavior of tumor onset, development, and decrease under treatments. In order to obtain a useful model, its parameters have to be accurately estimated, often requiring numerous model evaluations. This can be computationally prohibitive for complex problems. In this work, we propose an approximate Bayesian computation approach for estimating model parameters using a low-fidelity Gaussian Process Regression metamodel. We develop an adaptive procedure to build the data-driven surrogate model by sequentially enriching the data set in the parametric space regions where the surrogate is not accurate enough. At the end of the process, we obtain good emulators of the original models over the entire parametric space at a low computational cost. We investigate the use of the proposed framework for the calibration of two tumor growth models, reaching high accuracy and computational efficiency, which may be key issues in many complex problems. | |||||
BibTeX:
@article{Rocha2022,
author = {Rocha, Heber L. and de O. Silva, João Vitor and Silva, Renato S. and Lima, Ernesto A. B. F. and Almeida, Regina C.},
title = {Bayesian inference using Gaussian process surrogates in cancer modeling},
journal = {Computer Methods in Applied Mechanics and Engineering},
year = {2022},
volume = {399},
pages = {115412},
url = {https://www.sciencedirect.com/science/article/pii/S0045782522004650},
doi = {https://doi.org/10.1016/j.cma.2022.115412}
}
|
|||||
| Sadiev, A., Borodich, E., Beznosikov, A., Dvinskikh, D., Chezhegov, S., Tappenden, R., Takáč, M. and Gasnikov, A. | Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes | 2022 | EURO Journal on Computational Optimization Vol. 10, pp. 100041 |
article | DOI URL |
| Abstract: This paper considers the problem of decentralized, personalized federated learning. For centralized personalized federated learning, a penalty that measures the deviation from the local model and its average, is often added to the objective function. However, in a decentralized setting this penalty is expensive in terms of communication costs, so here, a different penalty — one that is built to respect the structure of the underlying computational network — is used instead. We present lower bounds on the communication and local computation costs for this problem formulation and we also present provably optimal methods for decentralized personalized federated learning. Numerical experiments are presented to demonstrate the practical performance of our methods. | |||||
BibTeX:
@article{Sadiev2022,
author = {Sadiev, Abdurakhmon and Borodich, Ekaterina and Beznosikov, Aleksandr and Dvinskikh, Darina and Chezhegov, Saveliy and Tappenden, Rachael and Takáč, Martin and Gasnikov, Alexander},
title = {Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes},
journal = {EURO Journal on Computational Optimization},
year = {2022},
volume = {10},
pages = {100041},
url = {https://www.sciencedirect.com/science/article/pii/S219244062200017X},
doi = {https://doi.org/10.1016/j.ejco.2022.100041}
}
|
|||||
| Santos, D. and Marques, I. | Designing master surgery schedules with downstream unit integration via stochastic programming | 2022 | European Journal of Operational Research Vol. 299(3), pp. 834–852 |
article | DOI URL |
| Abstract: Surgical activity has a substantial impact in all areas of hospitals. Additionally, social concerns arise related to equity and speed of access. Therefore, operating room management is paramount in modern society. This work studies the master surgery scheduling problem which is the problem of assigning surgical specialties to operating room blocks, which represent a shift of an operating room. For a master surgery schedule to be applicable in practice, multiple considerations must be taken into account. The particular focus of this work is in the integration of downstream units (i.e., wards or the ICU). Although, in a tactical planning scenario, operational bed requirements are unknown, these may be estimated based on historical data. We propose a novel stochastic programming model that captures the uncertainty in the bed requirements, with a recourse function that penalizes the overutilization of beds. A solution approach based on Benders decomposition is developed and results for generated instances mimicking real-life data are presented. | |||||
BibTeX:
@article{Santos2022,
author = {Santos, Daniel and Marques, Inês},
title = {Designing master surgery schedules with downstream unit integration via stochastic programming},
journal = {European Journal of Operational Research},
year = {2022},
volume = {299},
number = {3},
pages = {834–852},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721008055},
doi = {https://doi.org/10.1016/j.ejor.2021.09.030}
}
|
|||||
| Sebastiani, M., Vacchi, C., Manfredi, A. and Cassone, G. | Personalized Medicine and Machine Learning: A Roadmap for the Future | 2022 | Journal of Clinical Medicine Vol. 11(14) |
article | DOI |
| Abstract: In the last ten years, many advances have been made in the treatment and diagnosis of immune-mediated diseases [...] | |||||
BibTeX:
@article{Sebastiani2022,
author = {Sebastiani, Marco and Vacchi, Caterina and Manfredi, Andreina and Cassone, Giulia},
title = {Personalized Medicine and Machine Learning: A Roadmap for the Future},
journal = {Journal of Clinical Medicine},
year = {2022},
volume = {11},
number = {14},
doi = {https://doi.org/10.3390/jcm11144110}
}
|
|||||
| Shabtay, D. and Gilenson, M. | A state-of-the-art survey on multi-scenario scheduling | 2022 | European Journal of Operational Research | article | DOI URL |
| Abstract: In classical deterministic scheduling models, it is common to assume that each of the parameters has only a single predefined value. However, in many applications this is not the case, and there is a certain level of uncertainty in the values of the parameters. The multi-scenario approach is one of the most common approaches to model uncertainty. In this approach, each scenario defines a different possible realization of the parameters and the scheduler has to decide upon the exact schedule prior to knowing the exact scenario realization. Different scenarios may arise for a large number of reasons, such as: (i) the assignment of different workers to the processing operations, where the identity of the worker is beyond the scheduler’s control; (ii) unpredictable changes in weather conditions; or (iii) a possible strike at the port, which may affect job release dates. The purpose of this paper is to offer a unified framework for scheduling in a multi-scenario environment by presenting an up-to-date survey of results in this field. We also included some new results, presented here for the first time, and suggest many challenges for future research. | |||||
BibTeX:
@article{Shabtay2022,
author = {Shabtay, Dvir and Gilenson, Miri},
title = {A state-of-the-art survey on multi-scenario scheduling},
journal = {European Journal of Operational Research},
year = {2022},
url = {https://www.sciencedirect.com/science/article/pii/S0377221722008712},
doi = {https://doi.org/10.1016/j.ejor.2022.11.014}
}
|
|||||
| Shavazipour, B., Podkopaev, D. and Miettinen, K. | Interactive decision support and trade-off analysis for sustainable forest landscape planning under deep uncertainty | 2022 | Canadian Journal of Forest Research Vol. 52(11), pp. 1423–1438 |
article | DOI URL |
| Abstract: Sustainable environmental management often involves long-term time horizons and multiple conflicting objectives and, by nature, is affected by different sources of uncertainty. Many sources of uncertainty, such as climate change or government policies, cannot be addressed using probabilistic models, and, therefore, they can be seen to contain deep uncertainty. In this setting, the variety of possible future states is represented as a set of scenarios lacking any information about the likelihood of occurring. Integrating deep uncertainty into multiobjective decision support increases complexity, calling for the elaboration of appropriate methods and tools. This paper proposes a novel interactive multi-scenario multiobjective approach to support decision-making and trade-off analysis in sustainable forest landscape planning under multiple sources of uncertainty. It includes new preference simulation models aimed at reducing the decision-maker?s cognitive load and supporting the preference elicitation process. The proposed approach is applied in a case study of long-term forest landscape planning with four sustainability objectives in 12 scenarios and a forestry expert as the decision-maker. The approach is demonstrated to be efficient in exploring trade-offs in different scenarios, helping the expert gain deep insights into the problem, understand the consequences of alternative strategies, and find the most preferred robust strategy. | |||||
BibTeX:
@article{Shavazipour2022,
author = {Shavazipour, Babooshka and Podkopaev, Dmitry and Miettinen, Kaisa},
title = {Interactive decision support and trade-off analysis for sustainable forest landscape planning under deep uncertainty},
journal = {Canadian Journal of Forest Research},
year = {2022},
volume = {52},
number = {11},
pages = {1423–1438},
url = {https://doi.org/10.1139/cjfr-2022-0084},
doi = {https://doi.org/10.1139/cjfr-2022-0084}
}
|
|||||
| Shen, L., Yang, Q., Hou, Y. and Lin, J. | Research on information sharing incentive mechanism of China's port cold chain logistics enterprises based on blockchain | 2022 | Ocean & Coastal Management Vol. 225, pp. 106229 |
article | DOI URL |
| Abstract: Blockchain technology resolves the bottleneck of traditional centralized data storage technology. It can better facilitate the seamless operation and supervision of port cold chain logistics and can meet the massive business demand for cold chain imports and the surging demand for pandemic prevention and control. However, it is a challenging task to incentivize cold chain enterprises in the maritime industry to adopt blockchain technology and actively participate in information sharing platform. Using evolutionary game theory, through an analysis of evolutionary stability strategies, this paper explores the evolutionary path of port cold chain logistics enterprises that participate in information sharing. An incentive mechanism based on blockchain smart contract is designed to encourage cold chain logistics enterprises to actively participate in information sharing within chains. Smart contracts can continuously encourage enterprises to participate in information sharing by timely adjusting the incentive participation costs of participating enterprises. | |||||
BibTeX:
@article{Shen2022,
author = {Shen, Lixin and Yang, Qin and Hou, Yunxia and Lin, Jinglin},
title = {Research on information sharing incentive mechanism of China's port cold chain logistics enterprises based on blockchain},
journal = {Ocean & Coastal Management},
year = {2022},
volume = {225},
pages = {106229},
url = {https://www.sciencedirect.com/science/article/pii/S0964569122002058},
doi = {https://doi.org/10.1016/j.ocecoaman.2022.106229}
}
|
|||||
| Soeffker, N., Ulmer, M.W. and Mattfeld, D.C. | Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review | 2022 | European Journal of Operational Research Vol. 298(3), pp. 801–820 |
article | DOI URL |
| Abstract: Stochastic dynamic vehicle routing problems have become an essential part of logistics and mobility services. In such problems, a sequence of vehicle routing decisions has to be made in reaction and anticipation of newly revealed stochastic information. To this end, a variety of computational operations research methods has emerged in the literature, increasingly integrating potential future information in their decision making. The integration of information models into decision models via computational methods is known as prescriptive analytics, the most recent advance of business analytics. In this paper, we explore the existing work and future potential of prescriptive analytics for stochastic dynamic vehicle routing. We identify the characteristics of decision models and information models unique in stochastic dynamic vehicle routing and analyze how different methodology meets the characteristics' requirements. We use the insights to derive recommendations about promising methodology when approaching specific stochastic dynamic vehicle routing problems. | |||||
BibTeX:
@article{Soeffker2022,
author = {Soeffker, Ninja and Ulmer, Marlin W. and Mattfeld, Dirk C.},
title = {Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review},
journal = {European Journal of Operational Research},
year = {2022},
volume = {298},
number = {3},
pages = {801–820},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721006093},
doi = {https://doi.org/10.1016/j.ejor.2021.07.014}
}
|
|||||
| Song, R., Cui, W., Vanthienen, J., Huang, L. and Wang, Y. | Business process redesign towards IoT-enabled context-awareness: the case of a Chinese bulk port | 2022 | Business Process Management Journal Vol. 28(3), pp. 656–683 |
article | DOI URL |
| Abstract: Purpose The purpose of this paper is to contribute to the extant literature about the co-evolvement of Business Process Management (BPM) and the Internet of Things (IoT) by proposing the IoT-enabled Context-aware BPM (IoT-CaBPM) framework to bridge from the IoT infrastructure to context-aware business processes. Design/methodology/approach Motivated by the “Three Waves” of BPM research, IoT-enabled context-awareness is, therefore, expected to be achieved for enhancing the business process design, which pilots a new wave of BPR (Business Process Redesign/Reengineering) to enable the business process coevolve with IoT and analytics. This paper reports an illustrative case study of BPR in a Chinese bulk port, one of the hub seaports that widely adopted IoT technologies over the last few years. Findings The IoT implementation and data analytics has increased the efficiency and improve the monitoring effectively. The proposed IoT-CaBPM framework availably helps to identify and match nodes of IoT devices, business decisions and analytic models in order to redesign a business process towards context-aware variability. As IoT is rapidly becoming the new dominant IT paradigm is moving towards mature implementation in various industries, the corresponding BPR must be planned and executed strategically for achieving better benefits. Originality/value Despite some research extend BPM standard by integrating IoT devices as a sort of resources or report generically that the ports operations are affected by IoT, there is still a lack of layers from the IoT infrastructure to context-aware business processes. An industrial BPR case with business models in detail is also a lack for presenting the specific implications and effectiveness of the adoption of such technologies. This paper fills in this gap. | |||||
BibTeX:
@article{Song2022,
author = {Song, Rongjia and Cui, Weiping and Vanthienen, Jan and Huang, Lei and Wang, Ying},
title = {Business process redesign towards IoT-enabled context-awareness: the case of a Chinese bulk port},
journal = {Business Process Management Journal},
year = {2022},
volume = {28},
number = {3},
pages = {656–683},
url = {https://doi.org/10.1108/BPMJ-09-2021-0569},
doi = {https://doi.org/10.1108/BPMJ-09-2021-0569}
}
|
|||||
| Spengler, T. and Tovar, B. | Environmental valuation of in-port shipping emissions per shipping sector on four Spanish ports | 2022 | Marine Pollution Bulletin Vol. 178, pp. 113589 |
article | DOI URL |
| Abstract: This work provides an insight into the external costs associated with ships which had been berthed in four Spanish ports before COVID-19 was on the agenda. Firstly, on a port-by-port level and by individual vessel types, as this can also provide valuable insights. The economic valuation is based on the combination of the significant bottom-up European studies which follow the impact pathway approach (IPA) to calculating costs from transport air emissions. Our results showed higher total external costs for Las Palmas de Gran Canaria (€74.4 m), followed by Tenerife (€20 m), Palma de Mallorca (€19.5 m) and Pasaia (€1.5 m). The external costs by shipping subsectors give more insights into the relationships between ship types and external costs. This has been done to correctly assign the responsibilities among the different shipping sectors inside a port and to better understand the potential benefits of implementing abatement technologies, such as cold ironing. Potential benefits from cold ironing were found to differ hugely among the different ports analysed. | |||||
BibTeX:
@article{Spengler2022,
author = {Spengler, Thomas and Tovar, Beatriz},
title = {Environmental valuation of in-port shipping emissions per shipping sector on four Spanish ports},
journal = {Marine Pollution Bulletin},
year = {2022},
volume = {178},
pages = {113589},
url = {https://www.sciencedirect.com/science/article/pii/S0025326X22002715},
doi = {https://doi.org/10.1016/j.marpolbul.2022.113589}
}
|
|||||
| Syafiq, M., Sirojuzilam, Badaruddin and Purwoko, A. | The influences of accessibility, information technology and social capital on coastal development in Indonesia: The mediating role of port development | 2022 | Ocean & Coastal Management Vol. 223, pp. 106156 |
article | DOI URL |
| Abstract: Port as a transportation terminal plays a significant role in developing coastal areas. Some of the factors supporting its development in coastal areas are accessibility, information technology, and social capital. Therefore, this research analyzes the influence of accessibility, information technology, and social capital on the development of the Bagan Asahan Port and its surrounding coastal areas in the Asahan Regency. This is a quantitative research with data collected from 392 respondents through a questionnaire and analyzed using Structural Equation Modeling. The results showed that accessibility and information technology had no significant effect on port and coastal area development. Conversely, social capital significantly affected the port area with no significant impact on coastal development. Subsequently, port development also has a substantial effect on developing coastal areas with mediating influence on social capital. Numerous implications and recommendations for future research are then discussed and presented. | |||||
BibTeX:
@article{Syafiq2022,
author = {Syafiq, Muhammad and Sirojuzilam and Badaruddin and Purwoko, Agus},
title = {The influences of accessibility, information technology and social capital on coastal development in Indonesia: The mediating role of port development},
journal = {Ocean & Coastal Management},
year = {2022},
volume = {223},
pages = {106156},
url = {https://www.sciencedirect.com/science/article/pii/S0964569122001314},
doi = {https://doi.org/10.1016/j.ocecoaman.2022.106156}
}
|
|||||
| Tay, L. | Rethinking graphical causal models | 2022 | Nature Reviews Psychology | article | DOI URL |
| Abstract: In this Journal Club, Li Qian Tay describes a paper on a method for causal analysis. | |||||
BibTeX:
@article{Tay2022,
author = {Tay, Li Qian},
title = {Rethinking graphical causal models},
journal = {Nature Reviews Psychology},
year = {2022},
url = {https://doi.org/10.1038/s44159-022-00088-2},
doi = {https://doi.org/10.1038/s44159-022-00088-2}
}
|
|||||
| Tay, S.S., Foo, C.S., Daisuke, U., Leong, R. and Low, B.K.H. | Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity | 2022 | Vol. 162, pp. 21180––21204 |
misc | URL |
| Abstract: In distributionally robust Bayesian optimization (DRBO), an exact computation of the worst-case expected value requires solving an expensive convex optimization problem. We develop a fast approximation of the worst-case expected value based on the notion of worst-case sensitivity that caters to arbitrary convex distribution distances. We provide a regret bound for our novel DRBO algorithm with the fast approximation, and empirically show it is competitive with that using the exact worst-case expected value while incurring significantly less computation time. In order to guide the choice of distribution distance to be used with DRBO, we show that our approximation implicitly optimizes an objective close to an interpretable risk-sensitive value. | |||||
BibTeX:
@misc{Tay2022a,
author = {Tay, Sebastian Shenghong and Foo, Chuan Sheng and Daisuke, Urano and Leong, Richalynn and Low, Bryan Kian Hsiang},
title = {Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity},
publisher = {PMLR},
year = {2022},
volume = {162},
pages = {21180––21204},
url = {https://proceedings.mlr.press/v162/tay22a.html}
}
|
|||||
| Uncuoglu, E., Citakoglu, H., Latifoglu, L., Bayram, S., Laman, M., Ilkentapar, M. and Oner, A.A. | Comparison of neural network, Gaussian regression, support vector machine, long short-term memory, multi-gene genetic programming, and M5 Trees methods for solving civil engineering problems | 2022 | Applied Soft Computing Vol. 129, pp. 109623 |
article | DOI URL |
| Abstract: In this study, it was investigated that how machine learning (ML) methods show performance in different problems having different characteristics. Six ML approaches including Artificial neural networks (ANN), gaussian process regression (GPR), support vector machine regression (SVMR), long short-term memory (LSTM), multi-gene genetic programming (MGGP) and M5 model tree (M5Tree) were utilized to analyze three independent civil engineering problems belonging to construction management, geotechnical engineering, and hydrological engineering sub-disciplines. Mean absolute percentage error (MAPE), root mean square error (RMSE), coefficient of determination (R2), relative root means square error (RRMSE), Nash–Sutcliffe efficiency (NSE), Kling–Gupta efficiency (KGE), and overall index of model performance (OI) criteria were used to evaluate the performances of the models. Besides performance criteria, the relative performances of the six ML models were assessed using Taylor diagram, Violin diagram and One-Tailed Wilcoxon Signed-Rank Test. For each of the problem considered in this study, the effectiveness of the input parameters on the output parameter has been defined using the Relief Method and Correlation Coefficient. The results show that ANN and MGGP models yielded the most successful estimations for three different problems considered. The best prediction was achieved by MGGP model for hydrological engineering problem. For the construction management, geotechnical engineering problems, the best results were obtained using the ANN model. All models were reliable to solve the geotechnical engineering and hydrological engineering problems while LSTM and SVMR models are not reliable to solve the construction management problem. The most and least effective input parameters on output parameter were contract cost (CC) and work definition number (WDN) for the managerial data set. On the other hand, the most and least effective input parameters on the output parameters for the experimental and natural data sets have been obtained as width of the pile (B), rotation degree (R) and minimum temperature (Tmin), streamflow (Q) data, respectively. The number of data and data selection have a significant effect on the homogeneity of the data set and its representativeness of the problem. The error values obtained in test stage are affected from this condition. The equations to calculate the outputs of each of the problem considered were obtained using MGGP and M5Tree models. | |||||
BibTeX:
@article{Uncuoglu2022,
author = {Uncuoglu, Erdal and Citakoglu, Hatice and Latifoglu, Levent and Bayram, Savas and Laman, Mustafa and Ilkentapar, Mucella and Oner, A. Alper},
title = {Comparison of neural network, Gaussian regression, support vector machine, long short-term memory, multi-gene genetic programming, and M5 Trees methods for solving civil engineering problems},
journal = {Applied Soft Computing},
year = {2022},
volume = {129},
pages = {109623},
url = {https://www.sciencedirect.com/science/article/pii/S156849462200672X},
doi = {https://doi.org/10.1016/j.asoc.2022.109623}
}
|
|||||
| Valentini, G., Hamann, H. and Dorigo, M. | Global-to-Local Design for Self-Organized Task Allocation in Swarms [BibTeX] |
2022 | Intelligent Computing Vol. 2022, pp. 9761694 |
article | DOI URL |
BibTeX:
@article{Valentini2022,
author = {Valentini, Gabriele and Hamann, Heiko and Dorigo, Marco},
title = {Global-to-Local Design for Self-Organized Task Allocation in Swarms},
journal = {Intelligent Computing},
year = {2022},
volume = {2022},
pages = {9761694},
url = {https://doi.org/10.34133/2022/9761694},
doi = {https://doi.org/10.34133/2022/9761694}
}
|
|||||
| Warne, D.J., Prescott, T.P., Baker, R.E. and Simpson, M.J. | Multifidelity multilevel Monte Carlo to accelerate approximate Bayesian parameter inference for partially observed stochastic processes | 2022 | Journal of Computational Physics Vol. 469, pp. 111543 |
article | DOI URL |
| Abstract: Models of stochastic processes are widely used in almost all fields of science. Theory validation, parameter estimation, and prediction all require model calibration and statistical inference using data. However, data are almost always incomplete observations of reality. This leads to a great challenge for statistical inference because the likelihood function will be intractable for almost all partially observed stochastic processes. This renders many statistical methods, especially within a Bayesian framework, impossible to implement. Therefore, computationally expensive likelihood-free approaches are applied that replace likelihood evaluations with realisations of the model and observation process. For accurate inference, however, likelihood-free techniques may require millions of expensive stochastic simulations. To address this challenge, we develop a new method based on recent advances in multilevel and multifidelity methods for parameter inference using partially observed Markov processes. Our novel approach combines the multilevel Monte Carlo telescoping summation, applied to a sequence of approximate Bayesian posterior targets, with a multifidelity rejection sampler that learns from computationally inexpensive model approximations to minimise the number of computationally expensive exact simulations required for accurate inference. We present the derivation of our new algorithm for likelihood-free Bayesian inference, discuss practical implementation details, and demonstrate substantial performance improvements. Using examples from systems biology, we demonstrate improvements of more than two orders of magnitude over standard rejection sampling techniques. Our approach is generally applicable to accelerate other sampling schemes, such as sequential Monte Carlo, to enable feasible Bayesian analysis for realistic practical applications in physics, chemistry, biology, epidemiology, ecology and economics. We provide source code implementations of our methods and demonstrations (available at https://github.com/davidwarne/MLMCandMultifidelityForABC). | |||||
BibTeX:
@article{Warne2022,
author = {Warne, David J. and Prescott, Thomas P. and Baker, Ruth E. and Simpson, Matthew J.},
title = {Multifidelity multilevel Monte Carlo to accelerate approximate Bayesian parameter inference for partially observed stochastic processes},
journal = {Journal of Computational Physics},
year = {2022},
volume = {469},
pages = {111543},
url = {https://www.sciencedirect.com/science/article/pii/S0021999122006052},
doi = {https://doi.org/10.1016/j.jcp.2022.111543}
}
|
|||||
| Weaver, G.A., Feddersen, B., Marla, L., Wei, D., Rose, A. and Van Moer, M. | Estimating economic losses from cyber-attacks on shipping ports: An optimization-based approach | 2022 | Transportation Research Part C: Emerging Technologies Vol. 137, pp. 103423 |
article | DOI URL |
| Abstract: The Maritime Transportation System (MTS) accounts for more than 80% of global merchandise trade in volume and roughly one-sixth of the Total Gross Output of the United States. Given that national and global economies depend upon efficient supply chains, port stakeholders must develop security plans to respond to all hazards, natural and manmade. Given recent cyber-attacks affecting shipping ports, along with the multi-billion dollar cyber insurance gap, ports need to understand the tradeoffs between increased competitiveness and higher risk through investment in automation and advanced logistics technologies. This article addresses the need to understand the economic impact of cyber-attacks that affect shipping port operations and thereby enable risk assessments that holistically evaluate interactions among port Information Technology (IT) and Operational Technology (OT) systems. Using a Nearly-Orthogonal Latin Hypercube (NOLH) experimental design, we construct transportation disruption profiles based on actual cyber-attacks that specify the range of operational effects of IT/OT dependencies on stakeholder transportation assets. To capture the costs of the physical disruption, we extend Boland et al’s Dynamic Discretization Discovery (DDD) algorithm to capture capacity constraints and enable delay modeling to accommodate commodities arriving late due to disruption. Economic loss functions for seven commodity categories based on the willingness to pay literature are used to compute delay costs so that stakeholders can estimate the range of economic and operational impacts within a disruption profile. Results based on data for cyber-attacks on landlord port and terminal operator assets provided by Port Everglades, FL illustrate impacts at 80,000 and 1.2M on average during one week in October 2017 and at 141,000 and 2.8M for May 2017 respectively. The runtime performance of our enhanced DDD algorithm improves on the state of the art by an order of magnitude and on larger problem sizes based on real-world port networks. | |||||
BibTeX:
@article{Weaver2022,
author = {Weaver, Gabriel A. and Feddersen, Brett and Marla, Lavanya and Wei, Dan and Rose, Adam and Van Moer, Mark},
title = {Estimating economic losses from cyber-attacks on shipping ports: An optimization-based approach},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2022},
volume = {137},
pages = {103423},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X21004174},
doi = {https://doi.org/10.1016/j.trc.2021.103423}
}
|
|||||
| Xiong, W., Guo, B. and Yan, S. | Energy consumption optimization of processor scheduling for real-time embedded systems under the constraints of sequential relationship and reliability [BibTeX] |
2022 | Alexandria Engineering Journal Vol. 61(1), pp. 73–80 |
article | DOI URL |
BibTeX:
@article{Xiong2022,
author = {Xiong, Wei and Guo, Bing and Yan, Shen},
title = {Energy consumption optimization of processor scheduling for real-time embedded systems under the constraints of sequential relationship and reliability},
journal = {Alexandria Engineering Journal},
year = {2022},
volume = {61},
number = {1},
pages = {73–80},
url = {https://www.sciencedirect.com/science/article/pii/S1110016821003136},
doi = {https://doi.org/10.1016/j.aej.2021.04.071}
}
|
|||||
| Yanıkoğlu, İ. and Yavuz, T. | Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times | 2022 | European Journal of Operational Research Vol. 301(3), pp. 875–895 |
article | DOI URL |
| Abstract: This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization reformulation of the related machine scheduling problem and discuss several important properties of the mathematical model and the reformulation approach. The proposed model generalizes robust parallel machine scheduling problems by including sequence-dependent setup times and ellipsoidal uncertainty sets. Another key contribution of the paper is to show that scheduling problems usually have alternative optimal solutions for the worst-case tardiness objective, whose performance under nominal processing times may vary or vice a versa. This issue has been addressed by studying the Pareto efficient extensions of the proposed robust optimization models to provide solutions that are immune to changes in processing times. A branch-and-price algorithm has been developed to solve realistically sized instances in less than one hour, which a commercial solver cannot achieve. Numerical results show the effectiveness of the proposed approach since realistically sized instances such as (4 machines, 32 jobs) and (150 machines, 300 jobs) can be solved to optimality within the time limit, and the (average) objective function value improvement made by the robust approach can get as high as 56% compared with the (nominal) optimal solutions that ignore uncertainty in problem data. | |||||
BibTeX:
@article{Yanikoglu2022,
author = {Yanıkoğlu, İhsan and Yavuz, Tonguc},
title = {Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times},
journal = {European Journal of Operational Research},
year = {2022},
volume = {301},
number = {3},
pages = {875–895},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721009747},
doi = {https://doi.org/10.1016/j.ejor.2021.11.023}
}
|
|||||
| Zhang, A., Xing, L., Zou, J. and Wu, J.C. | Shifting machine learning for healthcare from development to deployment and from models to data | 2022 | Nature Biomedical Engineering, pp. 1–16 | article | DOI |
| Abstract: In the past decade, the application of machine learning (ML) to healthcare has helped drive the automation of physician tasks as well as enhancements in clinical capabilities and access to care. This progress has emphasized that, from model development to model deployment, data play central roles. In this Review, we provide a data-centric view of the innovations and challenges that are defining ML for healthcare. We discuss deep generative models and federated learning as strategies to augment datasets for improved model performance, as well as the use of the more recent transformer models for handling larger datasets and enhancing the modelling of clinical text. We also discuss data-focused problems in the deployment of ML, emphasizing the need to efficiently deliver data to ML models for timely clinical predictions and to account for natural data shifts that can deteriorate model performance. This Review discusses the use of deep generative models, federated learning and transformer models to address challenges in the deployment of machine learning for healthcare. | |||||
BibTeX:
@article{Zhang2022,
author = {Zhang, Angela and Xing, Lei and Zou, James and Wu, Joseph C.},
title = {Shifting machine learning for healthcare from development to deployment and from models to data},
journal = {Nature Biomedical Engineering},
year = {2022},
pages = {1–16},
doi = {https://doi.org/10.1038/s41551-022-00898-y}
}
|
|||||
| Zhang, Y., Teoh, B.K. and Zhang, L. | Integrated Bayesian networks with GIS for electric vehicles charging site selection | 2022 | Journal of Cleaner Production Vol. 344, pp. 131049 |
article | DOI URL |
| Abstract: Location selection of charging stations of electric vehicles (EVs) contributes to long-term sustainable urban development. This study proposes a hybrid approach integrated with the Geographical information system (GIS) and Bayesian network (BN) to deal with the location selection problem for EVs. GIS serves for capturing spatial and geographical data, which provides dynamic and visual information for selecting charging sites. BN is employed to process various criteria and demonstrate the cause-effect relationship in alternative site selection. A BN model consisting of nine criteria from three aspects is established to determine the most suitable locations for charging stations of EVs. A total of ten alternative locations in Singapore is used to verify the applicability and effectiveness of the developed hybrid approach. Results indicate that (1) Criteria, including the number of MRT stations, household units, and charging efficiency, are identified as the most sensitive factors to the location selection; (2) The transportation efficiency has the strongest linkage with the location selection (with an average value of the strength of 0.445), revealing that the transportation efficiency is more important than the social and economic efficiency. The novelty of this research lies in the development of the hybrid GIS-based BN approach that is more accurate and stable under noise interruption compared to the traditional decision-making method (e.g., TOPSIS). The developed approach can be used as a decision tool to identify the major contributing factors and update the optimal decisions given new observation data in GIS in an automatic manner. | |||||
BibTeX:
@article{Zhang2022a,
author = {Zhang, Yan and Teoh, Bak Koon and Zhang, Limao},
title = {Integrated Bayesian networks with GIS for electric vehicles charging site selection},
journal = {Journal of Cleaner Production},
year = {2022},
volume = {344},
pages = {131049},
url = {https://www.sciencedirect.com/science/article/pii/S0959652622006837},
doi = {https://doi.org/10.1016/j.jclepro.2022.131049}
}
|
|||||
| Zhao, X., Klemeš, J.J. and Fengqi, Y. | Energy and environmental sustainability of waste personal protective equipment (PPE) treatment under COVID-19 | 2022 | Renewable and Sustainable Energy Reviews Vol. 153, pp. 111786 |
article | DOI URL |
| Abstract: Combating the COVID-19 pandemic has raised the demand for and disposal of personal protective equipment in the United States. This work proposes a novel waste personal protective equipment processing system that enables energy recovery through producing renewable fuels and other basic chemicals. Exergy analysis and environmental assessment through a detailed life cycle assessment approach are performed to evaluate the energy and environmental sustainability of the processing system. Given the environmental advantages in reducing 35.42% of total greenhouse gas emissions from the conventional incineration and 43.50% of total fossil fuel use from landfilling processes, the optimal number, sizes, and locations of establishing facilities within the proposed personal protective equipment processing system in New York State are then determined by an optimization-based site selection methodology, proposing to build two pre-processing facilities in New York County and Suffolk County and one integrated fast pyrolysis plant in Rockland County. Their optimal annual treatment capacities are 1,708 t/y, 8,000 t/y, and 9,028 t/y. The proposed optimal personal protective equipment processing system reduces 31.5% of total fossil fuel use and 35.04% of total greenhouse gas emissions compared to the personal protective equipment incineration process. It also avoids 41.52% and 47.64% of total natural land occupation from the personal protective equipment landfilling and incineration processes. | |||||
BibTeX:
@article{Zhao2022,
author = {Zhao, Xiang and Klemeš, Jiří Jaromír and Fengqi, You},
title = {Energy and environmental sustainability of waste personal protective equipment (PPE) treatment under COVID-19},
journal = {Renewable and Sustainable Energy Reviews},
year = {2022},
volume = {153},
pages = {111786},
url = {https://www.sciencedirect.com/science/article/pii/S1364032121010558},
doi = {https://doi.org/10.1016/j.rser.2021.111786}
}
|
|||||
| Ziran, J., Chunfang, P., Huayou, Z., Chengjin, W. and Shilin, Y. | Temporal and spatial evolution and influencing factors of the port system in Yangtze River Delta Region from the perspective of dual circulation: Comparing port domestic trade throughput with port foreign trade throughput | 2022 | Transport Policy Vol. 118, pp. 79–90 |
article | DOI URL |
| Abstract: Under the new development pattern of “dual circulation” in China, it is of great theoretical and practical significance to study the spatial pattern and evolution law of port systems. This study takes the port system in the Yangtze River Delta Region (YRDR) as an example, based on the panel data from 2000 to 2019, analyses the spatial pattern and evolution characteristics of port domestic trade throughput (PDTT) and port foreign trade throughput (PFTT) from the perspective of dual circulation. The key influencing factors in the evolutionary process are explained, and the spatio-temporal evolution characteristics of the two types of port throughput are compared. The results show that (1) in spatial evolution, the PDTT and PFTT of the port system in the YRDR fluctuate and increase significantly, showing a typical three-level echelon structure in space. (2) From the perspective of spatial equilibrium, the two types of port throughput are markedly discrete; however, the degree of agglomeration of PFTT is greater than that of PDTT. (3) In spatial patterns, the centers of gravity of PDTT and PFTT are distributed in Suzhou and Jiaxing, respectively. Both are distributed from northwest to southeast. However, the rotation angle of PFTT was larger, and the north-south differentiation was more evident than that of PDTT. (4) In influencing factors, the throughput pattern of the port system in the YRDR is driven by multiple factors, and some differences exist in the driving mechanism between PDTT and PFTT. | |||||
BibTeX:
@article{Ziran2022,
author = {Ziran, Jiang and Chunfang, Pi and Huayou, Zhu and Chengjin, Wang and Shilin, Ye},
title = {Temporal and spatial evolution and influencing factors of the port system in Yangtze River Delta Region from the perspective of dual circulation: Comparing port domestic trade throughput with port foreign trade throughput},
journal = {Transport Policy},
year = {2022},
volume = {118},
pages = {79–90},
url = {https://www.sciencedirect.com/science/article/pii/S0967070X22000282},
doi = {https://doi.org/10.1016/j.tranpol.2022.01.022}
}
|
|||||
| AbdelAziz, A.M., Alarabi, L., Basalamah, S. and Hendawi, A. | A Multi-Objective Optimization Method for Hospital Admission Problem—A Case Study on Covid-19 Patients [BibTeX] |
2021 | Algorithms Vol. 14(2), pp. 38 |
article | URL |
BibTeX:
@article{AbdelAziz2021,
author = {AbdelAziz, Amr Mohamed and Alarabi, Louai and Basalamah, Saleh and Hendawi, Abdeltawab},
title = {A Multi-Objective Optimization Method for Hospital Admission Problem—A Case Study on Covid-19 Patients},
journal = {Algorithms},
year = {2021},
volume = {14},
number = {2},
pages = {38},
url = {https://www.mdpi.com/1999-4893/14/2/38}
}
|
|||||
| Ackermann, H., Diessel, E. and Krumke, S.O. | Robust flows with adaptive mitigation | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100002 |
article | DOI URL |
| Abstract: We consider an adjustable robust optimization problem arising in the area of supply chains: given sets of suppliers and demand nodes, we wish to find a flow that is robust with respect to failures of the suppliers. The objective is to determine a flow that minimizes the amount of shortage in the worst-case after an optimal mitigation has been performed. An optimal mitigation is an additional flow in the residual network that mitigates as much shortage at the demand sites as possible. For this problem we give a mathematical formulation, yielding a robust flow problem with three stages where the mitigation of the last stage can be chosen adaptively depending on the scenario. We show that already evaluating the robustness of a solution is NP-hard. For optimizing with respect to this NP-hard objective function, we compare three algorithms. Namely an algorithm based on iterative cut generation that solves medium-sized instances efficiently, a simple Outer Linearization Algorithm and a Scenario Enumeration algorithm. We illustrate the performance by numerical experiments. The results show that this instance of fully adjustable robust optimization problems can be solved exactly with a reasonable performance. We also describe possible extensions to the model and the algorithm. | |||||
BibTeX:
@article{Ackermann2021,
author = {Ackermann, Heiner and Diessel, Erik and Krumke, Sven O.},
title = {Robust flows with adaptive mitigation},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100002},
url = {https://www.sciencedirect.com/science/article/pii/S2192440620300022},
doi = {https://doi.org/10.1016/j.ejco.2020.100002}
}
|
|||||
| Ahmad, R.W., Hasan, H., Jayaraman, R., Salah, K. and Omar, M. | Blockchain applications and architectures for port operations and logistics management | 2021 | Research in Transportation Business & Management Vol. 41, pp. 100620 |
article | DOI URL |
| Abstract: Efficient port logistic operations and management are critical for global trade and transportation services. The current port logistic handling systems are highly centralized and offer limited opportunities for collaboration among diverse stakeholders. Moreover, existing systems fall short of providing traceability, transparency, information security, and immutability of data stored and exchanged during various operational pro- cesses. As a result, the productivity of port terminals is adversely affected. Blockchain is an emerging technology that provides traceability, transparency, auditability through immutable prove- nance data of on-chain trusted transactions, in a decentralized manner without intermediaries or trusted third parties. In this paper, we discuss the potential role of blockchain technology in transforming port logistic operations and services, provide use cases and frameworks that improve port logistics operations. Furthermore, we employ permissioned blockchain architectures to map port logistics services to highlight system components, participants, and deployment alternatives to automate logistics operations. Finally, we outline open research issues and chal- lenges that are barriers to adoption | |||||
BibTeX:
@article{Ahmad2021,
author = {Ahmad, Raja Wasim and Hasan, Haya and Jayaraman, Raja and Salah, Khaled and Omar, Mohammed},
title = {Blockchain applications and architectures for port operations and logistics management},
journal = {Research in Transportation Business & Management},
year = {2021},
volume = {41},
pages = {100620},
url = {https://www.sciencedirect.com/science/article/pii/S2210539521000031},
doi = {https://doi.org/10.1016/j.rtbm.2021.100620}
}
|
|||||
| Ajagekar, A. and You, F. | Quantum computing based hybrid deep learning for fault diagnosis in electrical power systems | 2021 | Applied Energy Vol. 303, pp. 117628 |
article | DOI URL |
| Abstract: Quantum computing (QC) and deep learning have shown promise of supporting transformative advances and have recently gained popularity in a wide range of areas. This paper proposes a hybrid QC-based deep learning framework for fault diagnosis of electrical power systems that combine the feature extraction capabilities of conditional restricted Boltzmann machine with an efficient classification of deep networks. Computational challenges stemming from the complexities of such deep learning models are overcome by QC-based training methodologies that effectively leverage the complementary strengths of quantum assisted learning and classical training techniques. The proposed hybrid QC-based deep learning framework is tested on a simulated electrical power system with 30 buses and wide variations of substation and transmission line faults, to demonstrate the framework’s applicability, efficiency, and generalization capabilities. High computational efficiency is enjoyed by the proposed hybrid approach in terms of computational effort required and quality of diagnosis performance over classical training methods. In addition, superior and reliable fault diagnosis performance with faster response time is achieved over state-of-the-art pattern recognition methods based on artificial neural networks (ANN) and decision trees (DT). | |||||
BibTeX:
@article{Ajagekar2021,
author = {Ajagekar, Akshay and You, Fengqi},
title = {Quantum computing based hybrid deep learning for fault diagnosis in electrical power systems},
journal = {Applied Energy},
year = {2021},
volume = {303},
pages = {117628},
url = {https://www.sciencedirect.com/science/article/pii/S030626192100996X},
doi = {https://doi.org/10.1016/j.apenergy.2021.117628}
}
|
|||||
| Alarie, S., Audet, C., Gheribi, A.E., Kokkolaras, M. and Le Digabel, S. | Two decades of blackbox optimization applications | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100011 |
article | DOI URL |
| Abstract: This article reviews blackbox optimization applications of direct search optimization methods over the past twenty years. Emphasis is placed on the Mesh Adaptive Direct Search (Mads) derivative-free optimization algorithm. The main focus is on applications in three specific fields: energy, materials science, and computational engineering design. Nevertheless, other applications in science and engineering, including patents, are also considered. The breadth of applications demonstrates the versatility of Mads and highlights the evolution of its accompanying software NOMAD as a standard tool for blackbox optimization. | |||||
BibTeX:
@article{Alarie2021,
author = {Alarie, Stéphane and Audet, Charles and Gheribi, Aïmen E. and Kokkolaras, Michael and Le Digabel, Sébastien},
title = {Two decades of blackbox optimization applications},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100011},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001386},
doi = {https://doi.org/10.1016/j.ejco.2021.100011}
}
|
|||||
| Ambrosino, D., Asta, V. and Crainic, T.G. | Optimization challenges and literature overview in the intermodal rail-sea terminal | 2021 | Transportation Research Procedia Vol. 52, pp. 163–170 |
article | DOI URL |
| Abstract: This work focuses on a particular node of the intermodal chain of transportation, i.e. the maritime port area that represents the link between rail and sea transportation modes. Since this exchange node of the chain has not been addressed much yet, the aim of the present study is to provide a description of the process of rail operations in port area, to give an overview of the optimization challenges and to review the existing literature on it. The purpose of the paper is to attract the researchers attention on this particular intermodal node, where there is room for improvements. | |||||
BibTeX:
@article{Ambrosino2021,
author = {Ambrosino, Daniela and Asta, Veronica and Crainic, Teodor Gabriel},
title = {Optimization challenges and literature overview in the intermodal rail-sea terminal},
journal = {Transportation Research Procedia},
year = {2021},
volume = {52},
pages = {163–170},
url = {https://www.sciencedirect.com/science/article/pii/S2352146521001423},
doi = {https://doi.org/10.1016/j.trpro.2021.01.089}
}
|
|||||
| Anderson, E. and Philpott, A. | Improving Sample Average Approximation Using Distributional Robustness | 2021 | INFORMS Journal on Optimization | article | DOI URL |
| Abstract: Sample average approximation is a popular approach to solving stochastic optimization problems. It has been widely observed that some form of robustification of these problems often improves the out-of-sample performance of the solution estimators. In estimation problems, this improvement boils down to a trade-off between the opposing effects of bias and shrinkage. This paper aims to characterize the features of more general optimization problems that exhibit this behaviour when a distributionally robust version of the sample average approximation problem is used. The paper restricts attention to quadratic problems for which sample average approximation solutions are unbiased and shows that expected out-of-sample performance can be calculated for small amounts of robustification and depends on the type of distributionally robust model used and properties of the underlying ground-truth probability distribution of random variables. The paper was written as part of a New Zealand funded research project that aimed to improve stochastic optimization methods in the electric power industry. The authors of the paper have worked together in this domain for the past 25 years. | |||||
BibTeX:
@article{Anderson2021,
author = {Anderson, Edward and Philpott, Andy},
title = {Improving Sample Average Approximation Using Distributional Robustness},
journal = {INFORMS Journal on Optimization},
year = {2021},
url = {https://doi.org/10.1287/ijoo.2021.0061},
doi = {https://doi.org/10.1287/ijoo.2021.0061}
}
|
|||||
| Andrade-Michel, A., Ríos-Solís, Y.A. and Boyer, V. | Vehicle and reliable driver scheduling for public bus transportation systems | 2021 | Transportation Research Part B: Methodological Vol. 145, pp. 290–301 |
article | DOI URL |
| Abstract: We propose the bus vehicle and reliable driver scheduling problem that is an integrated approach for the vehicle and the crew scheduling problems considering driver’s reliability information to reduce the number of no-covered trips along the day and thus improve the user’s satisfaction. An exact constraint programming model is proposed and compared with a variable neighborhood search that incorporates the driver’s reliability and the trip’s importance. The obtained trip-vehicle-driver assignments are evaluated on many scenarios with a Monte Carlo method to simulate the driver’s absenteeism. Experimental results on randomly generated instances based on a real case study show our methodologies’ efficiency and the enormous gains in covered trips when the drivers’ reliability is considered. | |||||
BibTeX:
@article{AndradeMichel2021,
author = {Andrade-Michel, Alejandro and Ríos-Solís, Yasmín A. and Boyer, Vincent},
title = {Vehicle and reliable driver scheduling for public bus transportation systems},
journal = {Transportation Research Part B: Methodological},
year = {2021},
volume = {145},
pages = {290–301},
url = {https://www.sciencedirect.com/science/article/pii/S0191261521000217},
doi = {https://doi.org/10.1016/j.trb.2021.01.011}
}
|
|||||
| Asadi, E., Schultz, M. and Fricke, H. | Optimal schedule recovery for the aircraft gate assignment with constrained resources | 2021 | Computers & Industrial Engineering Vol. 162, pp. 107682 |
article | DOI URL |
| Abstract: Efficient ground handling at airports contributes significantly to the performance of the entire air transport network. In this network, airports are coupled by flights that depend on passenger and crew connections, effective local airport operations, and efficient ground handling resource management. In addition, airport stakeholders must consider different time scales (look-ahead times), process estimates, and both bounded and multiple-dependent solution spaces for their decision-making processes. In this context, we aim to solve the NP-hard problem of combined aircraft turnaround time and airport gate allocation optimization. We developed a hybrid meta-heuristic algorithm based on the Shuffled Frog-Leaping Algorithm (SFLA) and the Grasshopper Optimization Algorithm (GOA). Our hybrid SFLA-GOA approach overcomes the drawback of each algorithm and achieves a preferred solution at a reduced computational cost. We test our approach with a scenario derived from Frankfurt Airport operations, including gate positions, terminal layout, and flight plan information. In all defined problem sizes, the hybrid SFLA-GOA algorithm outperforms an independent implementation of the SFLA algorithm. Also, the SFLA-GOA algorithm provides an improved solution by at least nearly 12% up to 40% over the standard mixed-integer programming solvers. | |||||
BibTeX:
@article{Asadi2021,
author = {Asadi, Ehsan and Schultz, Michael and Fricke, Hartmut},
title = {Optimal schedule recovery for the aircraft gate assignment with constrained resources},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {162},
pages = {107682},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221005866},
doi = {https://doi.org/10.1016/j.cie.2021.107682}
}
|
|||||
| Bänsch, K., Busse, J., Meisel, F., Rieck, J., Scholz, S., Volling, T. and Wichmann, M.G. | Energy-aware decision support models in production environments: A systematic literature review | 2021 | Computers & Industrial Engineering Vol. 159, pp. 107456 |
article | DOI URL |
| Abstract: The substantial amount of energy consumed through industrial production has given rise to a large number of research papers that incorporate environmental aspects and increased energy-awareness into production management. Nowadays, initiatives that push sustainable energy sources like wind and solar power together with new technologies for on-site power generation and energy storage open up a multitude of new options for making industrial energy consumption more environmental friendly. With this paper, we review the recent literature that attempts to reflect these options within industrial decision support models. We conduct a systematic literature review that identifies relevant papers from fields like machine scheduling, lot sizing, and other energy-intensive processes. For classifying the literature, a multi-dimensional scheme is developed that helps identifying areas that already received substantial scientific interest and areas that are not yet well understood. To this end, we actively address areas of future research that were mentioned in earlier review papers and show to what extent these gaps where closed by recent publications. Through this, we observe substantial progress with regard to various aspects such as pushing system boundaries, coming up with advanced conceptual approaches, and striving for more practical relevance. Nevertheless, there remains a substantial number of issues that have not yet been approached thoroughly. | |||||
BibTeX:
@article{Baensch2021,
author = {Bänsch, Kristian and Busse, Jan and Meisel, Frank and Rieck, Julia and Scholz, Sebastian and Volling, Thomas and Wichmann, Matthias G.},
title = {Energy-aware decision support models in production environments: A systematic literature review},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {159},
pages = {107456},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221003600},
doi = {https://doi.org/10.1016/j.cie.2021.107456}
}
|
|||||
| Bakker, S.J., Kleiven, A., Fleten, S.-E. and Tomasgard, A. | Mature offshore oil field development: Solving a real options problem using stochastic dual dynamic integer programming | 2021 | Computers & Operations Research Vol. 136, pp. 105480 |
article | DOI URL |
| Abstract: Oil and gas companies are facing low output prices and are forced to focus on the development of mature fields. Relevant investment decisions for operators include lifetime-enhancing activities, such as drilling new wells or permanent shutdown. We study the problem of optimal timing of investments in mature oil and gas fields in the presence of price uncertainty, which is an example of a complex real options problem consisting of a portfolio of interdependent options. We formulate a multistage stochastic integer programming model that incorporates a detailed representation of the uncertain oil price, and demonstrate how such a complex real options problem can be efficiently solved using the Stochastic Dual Dynamic Integer Programming algorithm. The paper presents a numerical example based on realistic data and discusses our computational results. We find that only a small number of Markov states are required to represent the uncertain price process, while obtaining convergence of the lower and upper bounds of the objective function. The value of stochastic solution of 11% is considerable in this example. It is concluded that the shutdown decision tends to be postponed as a result of high decommissioning costs, high discount rates, high price uncertainty and low operational expenditures, while it generally is accelerated if the decommissioning costs increase over time. | |||||
BibTeX:
@article{Bakker2021,
author = {Bakker, Steffen J. and Kleiven, Andreas and Fleten, Stein-Erik and Tomasgard, Asgeir},
title = {Mature offshore oil field development: Solving a real options problem using stochastic dual dynamic integer programming},
journal = {Computers & Operations Research},
year = {2021},
volume = {136},
pages = {105480},
url = {https://www.sciencedirect.com/science/article/pii/S0305054821002276},
doi = {https://doi.org/10.1016/j.cor.2021.105480}
}
|
|||||
| Barata, J. | The fourth industrial revolution of supply chains: A tertiary study | 2021 | Journal of Engineering and Technology Management Vol. 60, pp. 101624 |
article | DOI URL |
| Abstract: This paper unfolds the ongoing fourth revolution of supply chains (4SC) and proposes guidelines for future research. The review of sixty-five literature reviews follows three stages: bibliometric analysis of Industry 4.0, its synergies with supply chain transformation, and state-of-the-art assessment. 4SC is a context-bound technological change driven by organizational and cultural priorities, aiming to create more sustainable networks to serve the customers and support responsible decisions in the supply lifecycle. The proposed framework can assist future literature reviews and digital transformation proposals for 4SC that need to frame their context and incorporate functions to endure change. | |||||
BibTeX:
@article{Barata2021,
author = {Barata, João},
title = {The fourth industrial revolution of supply chains: A tertiary study},
journal = {Journal of Engineering and Technology Management},
year = {2021},
volume = {60},
pages = {101624},
url = {https://www.sciencedirect.com/science/article/pii/S0923474821000138},
doi = {https://doi.org/10.1016/j.jengtecman.2021.101624}
}
|
|||||
| Birolini, S., Jacquillat, A., Cattaneo, M. and Antunes, A.P. | Airline Network Planning: Mixed-integer non-convex optimization with demand–supply interactions | 2021 | Transportation Research Part B: Methodological Vol. 154, pp. 100–124 |
article | DOI URL |
| Abstract: Airlines routinely use analytics tools to support flight scheduling, fleet assignment, revenue management, crew scheduling, and many other operational decisions. However, decision support systems are less prevalent to support strategic planning. This paper fills that gap with an original mixed-integer non-convex optimization model, named Airline Network Planning with Supply and Demand interactions (ANPSD). The ANPSD optimizes network planning (including route selection, flight frequencies and fleet composition), while capturing interdependencies between airline supply and passenger demand. We first estimate a demand model as a function of flight frequencies and network configuration, using a two-stage least-squares procedure fitted to historical data, and then formalize the ANPSD by integrating the empirical demand function into an optimization model. The model is formulated as a non-convex mixed-integer program. To solve it, we develop an exact cutting plane algorithm, named 2αECP, which iteratively generates hyperplanes to develop an outer approximation of the non-linear demand functions. Computational results show that the 2αECP algorithm outperforms state-of-the-art benchmarks and generates tight solution quality guarantees. A case study based on the network of a major European carrier shows that the ANPSD provides much stronger solutions than baselines that ignore – fully or partially – demand–supply interactions. | |||||
BibTeX:
@article{Birolini2021,
author = {Birolini, Sebastian and Jacquillat, Alexandre and Cattaneo, Mattia and Antunes, António Pais},
title = {Airline Network Planning: Mixed-integer non-convex optimization with demand–supply interactions},
journal = {Transportation Research Part B: Methodological},
year = {2021},
volume = {154},
pages = {100–124},
url = {https://www.sciencedirect.com/science/article/pii/S0191261521001703},
doi = {https://doi.org/10.1016/j.trb.2021.09.003}
}
|
|||||
| Bistritz, I., Baharav, T.Z., Leshem, A. and Bambos, N. | One for All and All for One: Distributed Learning of Fair Allocations With Multi-Player Bandits [BibTeX] |
2021 | IEEE Journal on Selected Areas in Information Theory Vol. 2(2), pp. 584–598 |
article | DOI |
BibTeX:
@article{Bistritz2021,
author = {Bistritz, I. and Baharav, T. Z. and Leshem, A. and Bambos, N.},
title = {One for All and All for One: Distributed Learning of Fair Allocations With Multi-Player Bandits},
journal = {IEEE Journal on Selected Areas in Information Theory},
year = {2021},
volume = {2},
number = {2},
pages = {584–598},
doi = {https://doi.org/10.1109/JSAIT.2021.3073065}
}
|
|||||
| Bolić, T., Castelli, L., Corolli, L. and Scaini, G. | Flexibility in strategic flight planning | 2021 | Transportation Research Part E: Logistics and Transportation Review Vol. 154, pp. 102450 |
article | DOI URL |
| Abstract: A deterministic model that indicates flexibility of flights at the strategic level (up to 6 months ahead) taking into account changing airspace configurations and capacity is formulated. Flexibility is quantified by means of time windows (TWs). Flights complying with TWs guarantee that they will not impact negatively any other flight. Three variants of the model and three types of TWs are tested on a large-size data instance (the European network for an entire day of traffic). The model output specifies the constrained flights (i.e., with TWs shorter than the maximum size allowed for their definition), the constraining sector-hours and provides a list of saturated sector-hours. The meaning of each of the results is explored, across the three TW model variants, as well as the capability of the model variants to assure that capacity limits will not be exceeded. The criticality index, a measure of the sector-hour saturation, is introduced. This index can be used to identify areas for potential improvements. Sharing the information obtained from the TW model results at a strategic level can help both airlines and air navigation service providers (ANSPs) to improve the network status: airlines can decide to re-route heavily constrained flights (e.g., with one minute wide TWs), whereas ANSPs could decide to re-organise the capacity provision of the saturated airspace portions. The TW model can be re-run with the proposed changes, with the goal to assess the impact on both the individual stakeholders and the network. Thus, the model offers the measure of flight flexibility, and can be used as a tool to assess the impact of changes, helping in decision-making processes of airlines and ANSPs. | |||||
BibTeX:
@article{Bolic2021,
author = {Bolić, Tatjana and Castelli, Lorenzo and Corolli, Luca and Scaini, Giovanni},
title = {Flexibility in strategic flight planning},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2021},
volume = {154},
pages = {102450},
url = {https://www.sciencedirect.com/science/article/pii/S1366554521002143},
doi = {https://doi.org/10.1016/j.tre.2021.102450}
}
|
|||||
| Bouarfa, S., Aydoğan, R. and Sharpanskykh, A. | Formal modelling and verification of a multi-agent negotiation approach for airline operations control | 2021 | Journal of Reliable Intelligent Environments | article | DOI URL |
| Abstract: This paper proposes and evaluates a new airline disruption management strategy using multi-agent system modelling, simulation, and verification. This new strategy is based on a multi-agent negotiation protocol and is compared with three airline strategies based on established industry practices. The application concerns Airline Operations Control whose core functionality is disruption management. To evaluate the new strategy, a rule-based multi-agent system model of the AOC and crew processes has been developed. This model is used to assess the effects of multi-agent negotiation on airline performance in the context of a challenging disruption scenario. For the specific scenario considered, the multi-agent negotiation strategy outperforms the established strategies when the agents involved in the negotiation are experts. Another important contribution is that the paper presents a logic-based ontology used for formal modelling and analysis of AOC workflows. | |||||
BibTeX:
@article{Bouarfa2021,
author = {Bouarfa, Soufiane and Aydoğan, Reyhan and Sharpanskykh, Alexei},
title = {Formal modelling and verification of a multi-agent negotiation approach for airline operations control},
journal = {Journal of Reliable Intelligent Environments},
year = {2021},
url = {https://doi.org/10.1007/s40860-020-00123-0},
doi = {https://doi.org/10.1007/s40860-020-00123-0}
}
|
|||||
| Bunker, R., Fujii, K., Hanada, H. and Takeuchi, I. | Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: An application to rugby union | 2021 | PLOS ONE Vol. 16(9), pp. e0256329 |
article | DOI URL |
| Abstract: Given a set of sequences comprised of time-ordered events, sequential pattern mining is useful to identify frequent subsequences from different sequences or within the same sequence. However, in sport, these techniques cannot determine the importance of particular patterns of play to good or bad outcomes, which is often of greater interest to coaches and performance analysts. In this study, we apply a recently proposed supervised sequential pattern mining algorithm called safe pattern pruning (SPP) to 490 labelled event sequences representing passages of play from one rugby team’s matches in the 2018 Japan Top League season. We obtain patterns that are the most discriminative between scoring and non-scoring outcomes from both the team’s and opposition teams’ perspectives using SPP, and compare these with the most frequent patterns obtained with well-known unsupervised sequential pattern mining algorithms when applied to subsets of the original dataset, split on the label. From our obtained results, line breaks, successful line-outs, regained kicks in play, repeated phase-breakdown play, and failed exit plays by the opposition team were found to be the patterns that discriminated most between the team scoring and not scoring. Opposition team line breaks, errors made by the team, opposition team line-outs, and repeated phase-breakdown play by the opposition team were found to be the patterns that discriminated most between the opposition team scoring and not scoring. It was also found that, probably because of the supervised nature and pruning/safe-screening mechanisms of SPP, compared to the patterns obtained by the unsupervised methods, those obtained by SPP were more sophisticated in terms of containing a greater variety of events, and when interpreted, the SPP-obtained patterns would also be more useful for coaches and performance analysts. | |||||
BibTeX:
@article{Bunker2021,
author = {Bunker, Rory and Fujii, Keisuke and Hanada, Hiroyuki and Takeuchi, Ichiro},
title = {Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: An application to rugby union},
journal = {PLOS ONE},
year = {2021},
volume = {16},
number = {9},
pages = {e0256329},
url = {https://doi.org/10.1371/journal.pone.0256329},
doi = {https://doi.org/10.1371/journal.pone.0256329}
}
|
|||||
| Castiglioni, I., Rundo, L., Codari, M., Di Leo, G., Salvatore, C., Interlenghi, M., Gallivanone, F., Cozzi, A., D'Amico, N.C. and Sardanelli, F. | AI applications to medical images: From machine learning to deep learning | 2021 | Physica Medica Vol. 83, pp. 9–24 |
article | DOI URL |
| Abstract: Purpose Artificial intelligence (AI) models are playing an increasing role in biomedical research and healthcare services. This review focuses on challenges points to be clarified about how to develop AI applications as clinical decision support systems in the real-world context. Methods A narrative review has been performed including a critical assessment of articles published between 1989 and 2021 that guided challenging sections. Results We first illustrate the architectural characteristics of machine learning (ML)/radiomics and deep learning (DL) approaches. For ML/radiomics, the phases of feature selection and of training, validation, and testing are described. DL models are presented as multi-layered artificial/convolutional neural networks, allowing us to directly process images. The data curation section includes technical steps such as image labelling, image annotation (with segmentation as a crucial step in radiomics), data harmonization (enabling compensation for differences in imaging protocols that typically generate noise in non-AI imaging studies) and federated learning. Thereafter, we dedicate specific sections to: sample size calculation, considering multiple testing in AI approaches; procedures for data augmentation to work with limited and unbalanced datasets; and the interpretability of AI models (the so-called black box issue). Pros and cons for choosing ML versus DL to implement AI applications to medical imaging are finally presented in a synoptic way. Conclusions Biomedicine and healthcare systems are one of the most important fields for AI applications and medical imaging is probably the most suitable and promising domain. Clarification of specific challenging points facilitates the development of such systems and their translation to clinical practice. | |||||
BibTeX:
@article{Castiglioni2021,
author = {Castiglioni, Isabella and Rundo, Leonardo and Codari, Marina and Di Leo, Giovanni and Salvatore, Christian and Interlenghi, Matteo and Gallivanone, Francesca and Cozzi, Andrea and D'Amico, Natascha Claudia and Sardanelli, Francesco},
title = {AI applications to medical images: From machine learning to deep learning},
journal = {Physica Medica},
year = {2021},
volume = {83},
pages = {9–24},
url = {https://www.sciencedirect.com/science/article/pii/S1120179721000946},
doi = {https://doi.org/10.1016/j.ejmp.2021.02.006}
}
|
|||||
| Chen, W.H. and You, F. | Semiclosed Greenhouse Climate Control Under Uncertainty via Machine Learning and Data-Driven Robust Model Predictive Control [BibTeX] |
2021 | IEEE Transactions on Control Systems Technology, pp. 1–12 | article | DOI |
BibTeX:
@article{Chen2021,
author = {Chen, W. H. and You, F.},
title = {Semiclosed Greenhouse Climate Control Under Uncertainty via Machine Learning and Data-Driven Robust Model Predictive Control},
journal = {IEEE Transactions on Control Systems Technology},
year = {2021},
pages = {1–12},
doi = {https://doi.org/10.1109/TCST.2021.3094999}
}
|
|||||
| Chen, Y. and Lin, Y. | Combining model-based and model-free methods for stochastic control of distributed energy resources | 2021 | Applied Energy Vol. 283, pp. 116204 |
article | DOI URL |
| Abstract: Modern distribution systems are experiencing a fast transformation with the growing penetration of distributed energy resources (DERs). Along with the economic and environmental benefits of DERs, challenges arise to address the uncertainties caused by their inherent volatility. If properly coordinated, however, DERs have the potential to provide the controllability that grid operators need. In the paper, we propose a hierarchical control framework that combines the model-based and model-free methods for stochastic DER control in distribution systems. The upper-level scheduler considers a chance-constrained optimal power flow problem (model-based) that schedules DER setpoints to minimize the operational cost and maintain the operating reserve. The lower-level distributed DER controllers absorb real-time disturbances and uncertainties using the extremum seeking control (model-free) to achieve grid objectives. The combination of model-based and model-free methods allows us to take the advantages of both methods to effectively manage the uncertainty in distribution systems. The proposed work is demonstrated on the IEEE 13-node feeder. | |||||
BibTeX:
@article{Chen2021a,
author = {Chen, Yue and Lin, Yashen},
title = {Combining model-based and model-free methods for stochastic control of distributed energy resources},
journal = {Applied Energy},
year = {2021},
volume = {283},
pages = {116204},
url = {https://www.sciencedirect.com/science/article/pii/S0306261920316019},
doi = {https://doi.org/10.1016/j.apenergy.2020.116204}
}
|
|||||
| Cocchi, G., Lapucci, M. and Mansueto, P. | Pareto front approximation through a multi-objective augmented Lagrangian method | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100008 |
article | DOI URL |
| Abstract: In this manuscript, we consider smooth multi-objective optimization problems with convex constraints. We propose an extension of a multi-objective augmented Lagrangian Method from recent literature. The new algorithm is specifically designed to handle sets of points and produce good approximations of the whole Pareto front, as opposed to the original one which converges to a single solution. We prove properties of global convergence to Pareto stationarity for the sequences of points generated by our procedure. We then compare the performance of the proposed method with those of the main state-of-the-art algorithms available for the considered class of problems. The results of our experiments show the effectiveness and general superiority w.r.t. competitors of our proposed approach. | |||||
BibTeX:
@article{Cocchi2021,
author = {Cocchi, Guido and Lapucci, Matteo and Mansueto, Pierluigi},
title = {Pareto front approximation through a multi-objective augmented Lagrangian method},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100008},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001350},
doi = {https://doi.org/10.1016/j.ejco.2021.100008}
}
|
|||||
| Cohen, I., Azencot, O., Lifshits, P. and Gilboa, G. | Modes of Homogeneous Gradient Flows [BibTeX] |
2021 | SIAM Journal on Imaging Sciences Vol. 14(3), pp. 913–945 |
article | DOI URL |
BibTeX:
@article{Cohen2021,
author = {Cohen, Ido and Azencot, Omri and Lifshits, Pavel and Gilboa, Guy},
title = {Modes of Homogeneous Gradient Flows},
journal = {SIAM Journal on Imaging Sciences},
year = {2021},
volume = {14},
number = {3},
pages = {913–945},
note = {doi: 10.1137/20M1388577},
url = {https://doi.org/10.1137/20M1388577},
doi = {https://doi.org/10.1137/20M1388577}
}
|
|||||
| Cui, Y. and Pang, J.-S. | Modern Nonconvex Nondifferentiable Optimization [BibTeX] |
2021 | , pp. 776 | book | DOI URL |
BibTeX:
@book{Cui2021,
author = {Cui, Ying and Pang, Jong-Shi},
title = {Modern Nonconvex Nondifferentiable Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2021},
pages = {776},
note = {doi:10.1137/1.9781611976748},
url = {https://doi.org/10.1137/1.9781611976748},
doi = {https://doi.org/10.1137/1.9781611976748}
}
|
|||||
| Dai, T. and Fan, X. | Multi-Stove Scheduling for Sustainable On-Demand Food Delivery | 2021 | Sustainability Vol. 13(23) |
article | DOI |
| Abstract: Ordering food through mobile apps and crowdsourcing resources has become increasingly popular in the digital age. Restaurants can improve customer satisfaction to satisfy on-demand food orders by shortening waiting time and achieving sustainability through fuel reduction. In the present study, we construct a double-layer scheduling model, which is developed using the characteristics of on-demand food preparation, including the use of multiple stoves, a variety of dishes in one order, and the integration of the same dishes from different customers. The bottom layer is a multi-stove dish package scheduling model based on parallel machine scheduling. The upper layer is an order selection model based on the knapsack problem. To identify the optimal solution, four strategies for calculating the weight coefficient of the dish package are proposed to shorten the waiting time and realize sustainability. Numerical experiments are designed to analyze the differences of the final scheduling results under the four strategies. The bottom layer is extended to another model based on the vehicle routing optimization model, given the switch time between different dishes. The extension of the model is also compared in the numerical experiments. Our paper confirms the necessity of using a double-layer model for multi-strategy comparison in order to achieve sustainable on-demand scheduling. | |||||
BibTeX:
@article{Dai2021,
author = {Dai, Tao and Fan, Xiangqi},
title = {Multi-Stove Scheduling for Sustainable On-Demand Food Delivery},
journal = {Sustainability},
year = {2021},
volume = {13},
number = {23},
doi = {https://doi.org/10.3390/su132313133}
}
|
|||||
| Dalmau, R., Ballerini, F., Naessens, H., Belkoura, S. and Wangnick, S. | An explainable machine learning approach to improve take-off time predictions | 2021 | Journal of Air Transport Management Vol. 95, pp. 102090 |
article | DOI URL |
| Abstract: Accurate aircraft trajectory predictions are necessary to compute exact traffic demand figures, which are crucial for an efficient and effective air traffic flow and capacity management. At present, the uncertainty of the take-off time is one of the major contributions to the loss of trajectory predictability. In the EUROCONTROL Maastricht Upper Area Control Centre, the predicted take-off time for each individual flight relies on the information received from the Enhanced Traffic Flow Management System. However, aircraft do not always take-off at the times reported by this system due to several factors, which effects and interactions are too complex to be expressed with hard-coded rules. Previous work proposed a machine learning model that, based on historical data, was able to predict the take-off time of individual flights from a set of input features that effectively captures some of these elements. The model demonstrated to reduce by 30% the take-off time prediction errors of the current system one hour before the time that flight is scheduled to depart from the parking position. This paper presents an extension of the model, which overcomes this look-ahead time constraint and allows to improve take-off time predictions as early as the initial flight plan is received. In addition, a subset of the original set of input features has been meticulously selected to facilitate the implementation of the solution in an operational air traffic flow and capacity management system, while minimising the loss of predictive power. Finally, the importance and interactions of the input features are thoroughly analysed with additive feature attribution methods. | |||||
BibTeX:
@article{Dalmau2021,
author = {Dalmau, Ramon and Ballerini, Franck and Naessens, Herbert and Belkoura, Seddik and Wangnick, Sebastian},
title = {An explainable machine learning approach to improve take-off time predictions},
journal = {Journal of Air Transport Management},
year = {2021},
volume = {95},
pages = {102090},
url = {https://www.sciencedirect.com/science/article/pii/S0969699721000739},
doi = {https://doi.org/10.1016/j.jairtraman.2021.102090}
}
|
|||||
| Da Veiga, S., Gamboa, F., Iooss, B. and Prieur, C. | Basics and Trends in Sensitivity Analysis [BibTeX] |
2021 | , pp. 307 | book | DOI URL |
BibTeX:
@book{DaVeiga2021,
author = {Da Veiga, Sébastien and Gamboa, Fabrice and Iooss, Bertrand and Prieur, Clémentine},
title = {Basics and Trends in Sensitivity Analysis},
publisher = {Society for Industrial and Applied Mathematics},
year = {2021},
pages = {307},
note = {doi:10.1137/1.9781611976694},
url = {https://doi.org/10.1137/1.9781611976694},
doi = {https://doi.org/10.1137/1.9781611976694}
}
|
|||||
| DeGrave, A.J., Janizek, J.D. and Lee, S.-I. | AI for radiographic COVID-19 detection selects shortcuts over signal | 2021 | Nature Machine Intelligence Vol. 3(7), pp. 610–619 |
article | DOI URL |
| Abstract: Artificial intelligence (AI) researchers and radiologists have recently reported AI systems that accurately detect COVID-19 in chest radiographs. However, the robustness of these systems remains unclear. Using state-of-the-art techniques in explainable AI, we demonstrate that recent deep learning systems to detect COVID-19 from chest radiographs rely on confounding factors rather than medical pathology, creating an alarming situation in which the systems appear accurate, but fail when tested in new hospitals. We observe that the approach to obtain training data for these AI systems introduces a nearly ideal scenario for AI to learn these spurious ‘shortcuts’. Because this approach to data collection has also been used to obtain training data for the detection of COVID-19 in computed tomography scans and for medical imaging tasks related to other diseases, our study reveals a far-reaching problem in medical-imaging AI. In addition, we show that evaluation of a model on external data is insufficient to ensure AI systems rely on medically relevant pathology, because the undesired ‘shortcuts’ learned by AI systems may not impair performance in new hospitals. These findings demonstrate that explainable AI should be seen as a prerequisite to clinical deployment of machine-learning healthcare models. | |||||
BibTeX:
@article{DeGrave2021,
author = {DeGrave, Alex J. and Janizek, Joseph D. and Lee, Su-In},
title = {AI for radiographic COVID-19 detection selects shortcuts over signal},
journal = {Nature Machine Intelligence},
year = {2021},
volume = {3},
number = {7},
pages = {610–619},
url = {https://doi.org/10.1038/s42256-021-00338-7},
doi = {https://doi.org/10.1038/s42256-021-00338-7}
}
|
|||||
| Delage, E. and Saif, A. | The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems | 2021 | INFORMS Journal on Computing Vol. 34(1), pp. 333–353 |
article | DOI URL |
| Abstract: Randomized decision making refers to the process of making decisions randomly according to the outcome of an independent randomization device, such as a dice roll or a coin flip. The concept is unconventional, and somehow counterintuitive, in the domain of mathematical programming, in which deterministic decisions are usually sought even when the problem parameters are uncertain. However, it has recently been shown that using a randomized, rather than a deterministic, strategy in nonconvex distributionally robust optimization (DRO) problems can lead to improvements in their objective values. It is still unknown, though, what is the magnitude of improvement that can be attained through randomization or how to numerically find the optimal randomized strategy. In this paper, we study the value of randomization in mixed-integer DRO problems and show that it is bounded by the improvement achievable through its continuous relaxation. Furthermore, we identify conditions under which the bound is tight. We then develop algorithmic procedures, based on column generation, for solving both single- and two-stage linear DRO problems with randomization that can be used with both moment-based and Wasserstein ambiguity sets. Finally, we apply the proposed algorithm to solve three classical discrete DRO problems: the assignment problem, the uncapacitated facility location problem, and the capacitated facility location problem and report numerical results that show the quality of our bounds, the computational efficiency of the proposed solution method, and the magnitude of performance improvement achieved by randomized decisions.Summary of Contribution: In this paper, we present both theoretical results and algorithmic tools to identify optimal randomized strategies for discrete distributionally robust optimization (DRO) problems and evaluate the performance improvements that can be achieved when using them rather than classical deterministic strategies. On the theory side, we provide improvement bounds based on continuous relaxation and identify the conditions under which these bound are tight. On the algorithmic side, we propose a finitely convergent, two-layer, column-generation algorithm that iterates between identifying feasible solutions and finding extreme realizations of the uncertain parameter. The proposed algorithm was implemented to solve distributionally robust stochastic versions of three classical optimization problems and extensive numerical results are reported. The paper extends a previous, purely theoretical work of the first author on the idea of randomized strategies in nonconvex DRO problems by providing useful bounds and algorithms to solve this kind of problems. | |||||
BibTeX:
@article{Delage2021,
author = {Delage, Erick and Saif, Ahmed},
title = {The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems},
journal = {INFORMS Journal on Computing},
year = {2021},
volume = {34},
number = {1},
pages = {333–353},
url = {https://doi.org/10.1287/ijoc.2020.1042},
doi = {https://doi.org/10.1287/ijoc.2020.1042}
}
|
|||||
| Delgado, L., Gurtner, G., Bolić, T. and Castelli, L. | Estimating economic severity of Air Traffic Flow Management regulations | 2021 | Transportation Research Part C: Emerging Technologies Vol. 125, pp. 103054 |
article | DOI URL |
| Abstract: The development of trajectory-based operations and the rolling network operations plan in European air traffic management network implies a move towards more collaborative, strategic flight planning. This opens up the possibility for inclusion of additional information in the collaborative decision-making process. With that in mind, we define the indicator for the economic risk of network elements (e.g., sectors or airports) as the expected costs that the elements impose on airspace users due to Air Traffic Flow Management (ATFM) regulations. The definition of the indicator is based on the analysis of historical ATFM regulations data, that provides an indication of the risk of accruing delay. This risk of delay is translated into a monetary risk for the airspace users, creating the new metric of the economic risk of a given airspace element. We then use some machine learning techniques to find the parameters leading to this economic risk. The metric is accompanied by an indication of the accuracy of the delay–cost prediction model. Lastly, the economic risk is transformed into a qualitative economic severity classification. The economic risks and consequently economic severity can be estimated for different temporal horizons and time periods providing an indicator which can be used by Air Navigation Service Providers to identify areas which might need the implementation of strategic measures (e.g., resectorisation or capacity provision change), and by Airspace Users to consider operation of routes which use specific airspace regions. | |||||
BibTeX:
@article{Delgado2021,
author = {Delgado, Luis and Gurtner, Gérald and Bolić, Tatjana and Castelli, Lorenzo},
title = {Estimating economic severity of Air Traffic Flow Management regulations},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {125},
pages = {103054},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X21000838},
doi = {https://doi.org/10.1016/j.trc.2021.103054}
}
|
|||||
| Denkena, B., Schinkel, F., Pirnay, J. and Wilmsmeier, S. | Quantum algorithms for process parallel flexible job shop scheduling | 2021 | CIRP Journal of Manufacturing Science and Technology Vol. 33, pp. 100–114 |
article | DOI URL |
| Abstract: Flexible Job Shop Scheduling is one of the most difficult optimization problems known. In addition, modern production planning and control strategies require continuous and process-parallel optimization of machine allocation and processing sequences. Therefore, this paper presents a new method for process parallel Flexible Job Shop Scheduling using the concept of quantum computing based optimization. A scientific benchmark and the application to a realistic use-case demonstrates the good performance and practicability of this new approach. A managerial insight shows how the approach for process parallel flexible job shop scheduling can be integrated in existing production planning and control IT-infrastructure. | |||||
BibTeX:
@article{Denkena2021,
author = {Denkena, Berend and Schinkel, Fritz and Pirnay, Jonathan and Wilmsmeier, Sören},
title = {Quantum algorithms for process parallel flexible job shop scheduling},
journal = {CIRP Journal of Manufacturing Science and Technology},
year = {2021},
volume = {33},
pages = {100–114},
url = {https://www.sciencedirect.com/science/article/pii/S1755581721000432},
doi = {https://doi.org/10.1016/j.cirpj.2021.03.006}
}
|
|||||
| Diouane, Y. | A merit function approach for evolution strategies | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100001 |
article | DOI URL |
| Abstract: In this paper, we extend a class of globally convergent evolution strategies to handle general constrained optimization problems. The proposed framework handles quantifiable relaxable constraints using a merit function approach combined with a specific restoration procedure. The unrelaxable constraints, when present, can be treated either by using the extreme barrier function or through a projection approach. Under reasonable assumptions, the introduced extension guarantees to the regarded class of evolution strategies global convergence properties for first order stationary constraints. Numerical experiments are carried out on a set of problems from the CUTEst collection as well as on known global optimization problems. | |||||
BibTeX:
@article{Diouane2021,
author = {Diouane, Youssef},
title = {A merit function approach for evolution strategies},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100001},
url = {https://www.sciencedirect.com/science/article/pii/S2192440620300010},
doi = {https://doi.org/10.1016/j.ejco.2020.100001}
}
|
|||||
| Djelassi, H., Mitsos, A. and Stein, O. | Recent advances in nonconvex semi-infinite programming: Applications and algorithms | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100006 |
article | DOI URL |
| Abstract: The goal of this literature review is to give an update on the recent developments for semi-infinite programs (SIPs), approximately over the last 20 years. An overview of the different solution approaches and the existing algorithms is given. We focus on deterministic algorithms for SIPs which do not make any convexity assumptions. In particular, we consider the case that the constraint function is non-concave with respect to parameters. Advantages and disadvantages of the different algorithms are discussed. We also highlight recent SIP applications. The article closes with a discussion on remaining challenges and future research directions. | |||||
BibTeX:
@article{Djelassi2021,
author = {Djelassi, Hatim and Mitsos, Alexander and Stein, Oliver},
title = {Recent advances in nonconvex semi-infinite programming: Applications and algorithms},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100006},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621000034},
doi = {https://doi.org/10.1016/j.ejco.2021.100006}
}
|
|||||
| Dvurechensky, P., Shtern, S. and Staudigl, M. | First-Order Methods for Convex Optimization | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100015 |
article | DOI URL |
| Abstract: First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various applications, including most importantly machine learning, signal processing, imaging and control theory. First-order methods have the potential to provide low accuracy solutions at low computational complexity which makes them an attractive set of tools in large-scale optimization problems. In this survey, we cover a number of key developments in gradient-based optimization methods. This includes non-Euclidean extensions of the classical proximal gradient method, and its accelerated versions. Additionally we survey recent developments within the class of projection-free methods, and proximal versions of primal-dual schemes. We give complete proofs for various key results, and highlight the unifying aspects of several optimization algorithms. | |||||
BibTeX:
@article{Dvurechensky2021,
author = {Dvurechensky, Pavel and Shtern, Shimrit and Staudigl, Mathias},
title = {First-Order Methods for Convex Optimization},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100015},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001428},
doi = {https://doi.org/10.1016/j.ejco.2021.100015}
}
|
|||||
| D’Amico, G., Szopik-Depczyńska, K., Dembińska, I. and Ioppolo, G. | Smart and sustainable logistics of Port cities: A framework for comprehending enabling factors, domains and goals | 2021 | Sustainable Cities and Society Vol. 69, pp. 102801 |
article | DOI URL |
| Abstract: Digital technologies integrated into port logistics are becoming increasingly decisive among port cities around the world. This growing importance is due to the need for policymakers, urban managers, port authorities, local administrators, shipping companies, couriers, and so on to develop increasingly digitalized and sustainable logistic processes. Therefore, in a global context characterized by intense datafication and globalization of trade, the data-based approach has become a necessary modus operandi to promote smart and sustainable logistics development. This forward-looking model of port logistics uses technologies such as IoT, sensors, cloud computing platforms, Big Data analytics, Artificial Intelligence (AI), GPS tracking systems, radars, drones, real-time monitoring stations, smart grids, and so on in order to collect, process, monitor and analyse data and information concerning the economic, environmental, social and technological sphere of port cities. In this sense, mobile and fixed platforms help logistics operators to optimize the management of flows (e.g., water, waste, emissions, raw materials, people, monetary investments, etc.) in an efficient and digitized manner. The study proposes a systematic literature review of the most recurring themes concerning smart and sustainable logistics initiatives within port cities in order to develop a multidimensional framework capable of holistically integrating the prevailing enabling factors (Ecosystem, Internal Organization, Data and Security, Policy and Regulation, Finance and Funding, and Digital and Technology), domains (Mobility, Environment, Economy, Telecommunications, Safety and Security, Government, and Community) and goals (Sustainable Development and Digitalization) that characterize smart and sustainable logistical development. To this end, the best practices of several pioneering port cities such as Rotterdam, Hamburg, Singapore, Los Angeles, Amsterdam, etc. implemented in partnerships with technology companies such as Cisco, IBM, Huawei and SAP were also analysed. Therefore, the results of this research show that smart and sustainable logistics initiatives in port cities: (a) have the potential to enhance the efficiency of the economic, environmental, social and technological flows; (b) increase the involvement and awareness of stakeholders such as couriers, shippers, shipping companies, citizens, port authorities, municipalities, security officers, gate and terminal personnel, and so on; and (c) provide a detailed overview of the enabling factors, domains and goals that must be activated by port cities to foster a smart and sustainable logistic transition. | |||||
BibTeX:
@article{D’Amico2021,
author = {D’Amico, Gaspare and Szopik-Depczyńska, Katarzyna and Dembińska, Izabela and Ioppolo, Giuseppe},
title = {Smart and sustainable logistics of Port cities: A framework for comprehending enabling factors, domains and goals},
journal = {Sustainable Cities and Society},
year = {2021},
volume = {69},
pages = {102801},
url = {https://www.sciencedirect.com/science/article/pii/S2210670721000937},
doi = {https://doi.org/10.1016/j.scs.2021.102801}
}
|
|||||
| Edwards, C. | Shrinking artificial intelligence [BibTeX] |
2021 | Commun. ACM Vol. 65(1), pp. 12–14 |
article | DOI URL |
BibTeX:
@article{Edwards2021,
author = {Edwards, Chris},
title = {Shrinking artificial intelligence},
journal = {Commun. ACM},
year = {2021},
volume = {65},
number = {1},
pages = {12–14},
url = {https://doi.org/10.1145/3495562},
doi = {https://doi.org/10.1145/3495562}
}
|
|||||
| Eichfelder, G. | Twenty years of continuous multiobjective optimization in the twenty-first century | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100014 |
article | DOI URL |
| Abstract: The survey highlights some of the research topics which have attracted attention in the last two decades within the area of mathematical optimization of multiple objective functions. We give insights into topics where a huge progress can be seen within the last years. We give short introductions to the specific sub-fields as well as some selected references for further reading. Primarily, the survey covers the progress in the development of algorithms. In particular, we discuss publicly available solvers and approaches for new problem classes such as non-convex and mixed integer problems. Moreover, bilevel optimization problems and the handling of uncertainties by robust approaches and their relation to set optimization are presented. In addition, we discuss why numerical approaches which do not use scalarization techniques are of interest. | |||||
BibTeX:
@article{Eichfelder2021,
author = {Eichfelder, Gabriele},
title = {Twenty years of continuous multiobjective optimization in the twenty-first century},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100014},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001416},
doi = {https://doi.org/10.1016/j.ejco.2021.100014}
}
|
|||||
| Evler, J., Asadi, E., Preis, H. and Fricke, H. | Airline ground operations: Optimal schedule recovery with uncertain arrival times | 2021 | Journal of Air Transport Management Vol. 92, pp. 102021 |
article | DOI URL |
| Abstract: Airline operations are subject to a number of stochastic influences which result into variable ground and block times for same flights on different days. Our research explores how airline operations control centers may benefit from an integrated decision support system for schedule recovery during aircraft ground operations. In this paper, we study the sensitivity of an optimal set of schedule recovery options towards uncertain arrival times. The calculation of recovery options is based upon an integrated and iterative scheduling and optimization algorithm, which incorporates uncertainties for arrival flights as a function of a given look-ahead time. Potential recovery options include stand re-allocation, quick-turnaround, quick passenger transfer, waiting for transfer passengers, cancellation of passenger or crew connections, and arrival prioritization. Within a case study setting at Frankfurt Airport, 20 aircraft turnarounds are analysed during a morning peak with their respective estimated arrival times (including potential arrival delays). The analysis of simulation results reveals an almost identical set of selected recovery options under high uncertainty circumstances and from post-operational point-of-view, which indicates high solution stability. | |||||
BibTeX:
@article{Evler2021,
author = {Evler, Jan and Asadi, Ehsan and Preis, Henning and Fricke, Hartmut},
title = {Airline ground operations: Optimal schedule recovery with uncertain arrival times},
journal = {Journal of Air Transport Management},
year = {2021},
volume = {92},
pages = {102021},
url = {https://www.sciencedirect.com/science/article/pii/S0969699721000041},
doi = {https://doi.org/10.1016/j.jairtraman.2021.102021}
}
|
|||||
| Fahim, P.B.M., An, R., Rezaei, J., Pang, Y., Montreuil, B. and Tavasszy, L. | An information architecture to enable track-and-trace capability in Physical Internet ports | 2021 | Computers in Industry Vol. 129, pp. 103443 |
article | DOI URL |
| Abstract: The Physical Internet (PI), a new vision for the future of the global freight transport and logistics system, describes a geographical hierarchy of interconnected networks of networks, from the urban, to the national, the continental, and the global level. Like today, in PI the maritime ports will fulfil roles as continental and global hubs. Differently than ports today, however, decisions to split and bundle cargo across ships and other modes will not be made solely on the basis of long-term agreements by ports, but rather ever more dynamically and in real-time, aiming to reconsolidate shipments within the port area. This implies a need to reconsider the currently used information systems (ISs), and to gain understanding of future requirements to satisfy their needs. We exploit a design science research (DSR) approach to shape these requirements. Among the many components of future ISs, we study ports’ track-and-trace (T&T) capability. The proposed information architecture (IA) enables to integrate T&T capability in PI ports by means of information carried on PI containers into the logistics chain via an open interface platform, which also supports interoperability among the various actors’ ISs. The design is based on the Reference Architecture Model for Industry 4.0 (RAMI 4.0). This model supports the analysis of PI ports in key dimensions along with hierarchical logistics entities, which could be used as a blueprint for IAs of PI ports, globally. We provide insights into the approach’s applicability by means of the illustrative case of Teesport, located in Northeast England (United Kingdom). | |||||
BibTeX:
@article{Fahim2021,
author = {Fahim, Patrick B. M. and An, Rowoon and Rezaei, Jafar and Pang, Yusong and Montreuil, Benoit and Tavasszy, Lorant},
title = {An information architecture to enable track-and-trace capability in Physical Internet ports},
journal = {Computers in Industry},
year = {2021},
volume = {129},
pages = {103443},
url = {https://www.sciencedirect.com/science/article/pii/S0166361521000506},
doi = {https://doi.org/10.1016/j.compind.2021.103443}
}
|
|||||
| Fahim, P.B.M., Martinez de Ubago Alvarez de Sotomayor, M., Rezaei, J., van Binsbergen, A., Nijdam, M. and Tavasszy, L. | On the evolution of maritime ports towards the Physical Internet | 2021 | Futures Vol. 134, pp. 102834 |
article | DOI URL |
| Abstract: The Physical Internet (PI) is a novel, comprehensive and long-term vision of the future global freight transport and logistics (FTL) system, which is aimed at radically improving its efficiency and sustainability. As research on the PI concept is still young, the functioning of maritime ports in the context of the PI is still underexplored. Our aim is to contribute to the scientific debate about radically different futures for maritime ports around the world, by identifying their possible future development paths towards the PI. We construct an evolutionary port development framework that identifies the main dimensions of the PI in relation to ports, including governance, operational, and digital aspects. To design the future development paths towards the PI, we conducted a scenario analysis and used a Delphi survey amongst port development and PI experts. The resulting expectation is that a fully globally functioning of the PI may not be reached by 2040. Also, our analysis shows that global governance of FTL systems is critical for the pace of development and adoption. Building on the identified potential future development paths, we provide a discussion, relevant for port authorities and other stakeholders, as well as avenues for future research. | |||||
BibTeX:
@article{Fahim2021a,
author = {Fahim, Patrick B. M. and Martinez de Ubago Alvarez de Sotomayor, Manuel and Rezaei, Jafar and van Binsbergen, Arjan and Nijdam, Michiel and Tavasszy, Lorant},
title = {On the evolution of maritime ports towards the Physical Internet},
journal = {Futures},
year = {2021},
volume = {134},
pages = {102834},
url = {https://www.sciencedirect.com/science/article/pii/S0016328721001440},
doi = {https://doi.org/10.1016/j.futures.2021.102834}
}
|
|||||
| Farrokhifar, M., Bahmani, H., Faridpak, B., Safari, A., Pozo, D. and Aiello, M. | Model predictive control for demand side management in buildings: A survey | 2021 | Sustainable Cities and Society Vol. 75, pp. 103381 |
article | DOI URL |
| Abstract: Buildings are responsible for a large portion of the world’s energy consumption. Any measure that can be taken to optimize the use of energy related to them must be considered. Demand Side Management (DSM) can be used to shave demand peaks and to avoid bootstrapping highly polluting fast ramp-up generators. This though brings a control problem that is complicated by the increasing diffusion of small-scale, renewable energy sources and local storage facilities which are decentralized and, in general, hard to predict reliably. The overall goal of the control strategy is to balance energy, demand/supply, and to minimize costs. This survey focuses on control strategies to support DSM, considering buildings as the load to be managed. Among the various control strategies, model predictive control (MPC) has a predominant role due to its broad applicability and easy portability to many diverse contexts. The method is suitable for any nonlinear, multi-variable, and linear parameter varying system. The survey provides a general, unifying mathematical characterization of the approaches and lays the foundations for comparing and evaluating MPC-based DSM in buildings. | |||||
BibTeX:
@article{Farrokhifar2021,
author = {Farrokhifar, Meisam and Bahmani, Hamidreza and Faridpak, Behdad and Safari, Amin and Pozo, David and Aiello, Marco},
title = {Model predictive control for demand side management in buildings: A survey},
journal = {Sustainable Cities and Society},
year = {2021},
volume = {75},
pages = {103381},
url = {https://www.sciencedirect.com/science/article/pii/S2210670721006545},
doi = {https://doi.org/10.1016/j.scs.2021.103381}
}
|
|||||
| Feng, W., Feng, Y. and Zhang, Q. | Multistage robust mixed-integer optimization under endogenous uncertainty | 2021 | European Journal of Operational Research Vol. 294(2), pp. 460–475 |
article | DOI URL |
| Abstract: Endogenous, i.e. decision-dependent, uncertainty has received increased interest in the stochastic programming community. In the robust optimization context, however, it has rarely been considered. This work addresses multistage robust mixed-integer optimization with decision-dependent uncertainty sets. The proposed framework allows us to consider both continuous and integer recourse, including recourse decisions that affect the uncertainty set. We derive a tractable reformulation of the problem by leveraging recent advances in the construction of nonlinear decision rules, and introduce discontinuous piecewise linear decision rules for continuous recourse. Computational experiments are performed to gain insights on the impact of endogenous uncertainty, the benefit of discrete recourse, and computational performance. Our results indicate that the level of conservatism in the solution can be significantly reduced if endogenous uncertainty and mixed-integer recourse are properly modeled. | |||||
BibTeX:
@article{Feng2021,
author = {Feng, Wei and Feng, Yiping and Zhang, Qi},
title = {Multistage robust mixed-integer optimization under endogenous uncertainty},
journal = {European Journal of Operational Research},
year = {2021},
volume = {294},
number = {2},
pages = {460–475},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721000783},
doi = {https://doi.org/10.1016/j.ejor.2021.01.048}
}
|
|||||
| Fengming, L., Xiaolei, F. and Zheming, G. | Distributionally Robust Optimization: A review on theory and applications [BibTeX] |
2021 | Numerical Algebra, Control & Optimization Vol. 12(1), pp. 159–212 |
article | DOI URL |
BibTeX:
@article{Fengming2021,
author = {Fengming, Lin and Xiaolei, Fang and Zheming, Gao},
title = {Distributionally Robust Optimization: A review on theory and applications},
journal = {Numerical Algebra, Control & Optimization},
year = {2021},
volume = {12},
number = {1},
pages = {159–212},
url = {http://aimsciences.org//article/id/5a228ac4-f49b-4499-aab6-0656d63eb577},
doi = {https://doi.org/10.3934/naco.2021057}
}
|
|||||
| Ferahtia, S., Djeroui, A., Mesbahi, T., Houari, A., Zeghlache, S., Rezk, H. and Paul, T. | Optimal Adaptive Gain LQR-Based Energy Management Strategy for Battery–Supercapacitor Hybrid Power System | 2021 | Energies Vol. 14(6) |
article | DOI |
| Abstract: This paper aims at presenting an energy management strategy (EMS) based upon optimal control theory for a battery–supercapacitor hybrid power system. The hybrid power system consists of a lithium-ion battery and a supercapacitor with associated bidirectional DC/DC converters. The proposed EMS aims at computing adaptive gains using the salp swarm algorithm and load following control technique to assign the power reference for both the supercapacitor and the battery while achieving optimal performance and stable voltage. The DC/DC converter model is derived utilizing the first-principles method and computes the required gains to achieve the desired power. The fact that the developed algorithm takes disturbances into account increases the power elements’ life expectancies and supplies the power system with the required power. | |||||
BibTeX:
@article{Ferahtia2021,
author = {Ferahtia, Seydali and Djeroui, Ali and Mesbahi, Tedjani and Houari, Azeddine and Zeghlache, Samir and Rezk, Hegazy and Paul, Théophile},
title = {Optimal Adaptive Gain LQR-Based Energy Management Strategy for Battery–Supercapacitor Hybrid Power System},
journal = {Energies},
year = {2021},
volume = {14},
number = {6},
doi = {https://doi.org/10.3390/en14061660}
}
|
|||||
| Fleszar, K. | A branch-and-bound algorithm for the quadratic multiple knapsack problem | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: We present a new branch-and-bound algorithm for the Quadratic Multiple Knapsack Problem. A key component of our algorithm is a new upper bound that divides the pairwise item values among individual items, estimates the maximum potential value contributed by each individual item, and calculates the upper bound via a transportation model. A local search is used to adjust the division of pairwise item values in order to improve the upper bound. Reduced costs from the solution of the transportation problem are used to forbid some item-to-knapsack assignments. Information from the upper bound is also used in selecting the item to branch on next. Computational experiments are carried out on three sets of benchmark instances from the literature, two sets of smaller instances with 20–35 items and 3–10 knapsacks per instance, and one set of larger instances with 40–60 items and 3–10 knapsacks per instance. Our algorithm finds and verifies optimal solutions for all small benchmark instances in less than one hour of CPU time apiece and outperforms the best previously proposed algorithms for the problem in terms of both the average computation time and the number of instances for which optimality is verified. For the larger benchmark instances, our algorithm obtains smaller average gaps than the best previously proposed methods. | |||||
BibTeX:
@article{Fleszar2021,
author = {Fleszar, Krzysztof},
title = {A branch-and-bound algorithm for the quadratic multiple knapsack problem},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005336},
doi = {https://doi.org/10.1016/j.ejor.2021.06.018}
}
|
|||||
| Fortnow, L. | Fifty years of P vs. NP and the possibility of the impossible [BibTeX] |
2021 | Commun. ACM Vol. 65(1), pp. 76–85 |
article | DOI URL |
BibTeX:
@article{Fortnow2021,
author = {Fortnow, Lance},
title = {Fifty years of P vs. NP and the possibility of the impossible},
journal = {Commun. ACM},
year = {2021},
volume = {65},
number = {1},
pages = {76–85},
url = {https://doi.org/10.1145/3460351},
doi = {https://doi.org/10.1145/3460351}
}
|
|||||
| Fowler, J.W. and Mönch, L. | A survey of scheduling with parallel batch (p-batch) processing | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: Multiple jobs are processed simultaneously on a given batch processing machine in parallel batching. The resulting batch is called a p-batch. Batching can lead to reduced production costs, but depending how the jobs are grouped into a batch can lead to better or worse delivery times of products. Scheduling jobs on batch processing machines requires grouping decisions in addition to the conventional assignment and sequencing decisions. Parallel batching is important in such diverse areas such as semiconductor manufacturing, aircraft manufacturing, shoe manufacturing, and healthcare. This paper surveys the literature on parallel batching and will focus primarily on deterministic scheduling. We provide a taxonomy of parallel batching problems, distinguishing the compatible case where all jobs can be used to form a batch from the incompatible families setting where only jobs from the same family can be used to form a batch. Makespan, flow time-, and due date-related measures are considered. We discuss scheduling approaches for single machines, parallel machines, and other environments such as flow shops and job shops. In addition to the discussion of archived and current papers, we discuss also recent trends in scheduling jobs on machines with parallel batch processing. Finally, we provide a discussion of future research directions for p-batch scheduling. | |||||
BibTeX:
@article{Fowler2021,
author = {Fowler, John W. and Mönch, Lars},
title = {A survey of scheduling with parallel batch (p-batch) processing},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S037722172100518X},
doi = {https://doi.org/10.1016/j.ejor.2021.06.012}
}
|
|||||
| Garcia Santa Cruz, B., Bossa, M.N., Sölter, J. and Husch, A.D. | Public Covid-19 X-ray datasets and their impact on model bias – A systematic review of a significant problem | 2021 | Medical Image Analysis Vol. 74, pp. 102225 |
article | DOI URL |
| Abstract: Computer-aided-diagnosis and stratification of COVID-19 based on chest X-ray suffers from weak bias assessment and limited quality-control. Undetected bias induced by inappropriate use of datasets, and improper consideration of confounders prevents the translation of prediction models into clinical practice. By adopting established tools for model evaluation to the task of evaluating datasets, this study provides a systematic appraisal of publicly available COVID-19 chest X-ray datasets, determining their potential use and evaluating potential sources of bias. Only 9 out of more than a hundred identified datasets met at least the criteria for proper assessment of risk of bias and could be analysed in detail. Remarkably most of the datasets utilised in 201 papers published in peer-reviewed journals, are not among these 9 datasets, thus leading to models with high risk of bias. This raises concerns about the suitability of such models for clinical use. This systematic review highlights the limited description of datasets employed for modelling and aids researchers to select the most suitable datasets for their task. | |||||
BibTeX:
@article{GarciaSantaCruz2021,
author = {Garcia Santa Cruz, Beatriz and Bossa, Matías Nicolás and Sölter, Jan and Husch, Andreas Dominik},
title = {Public Covid-19 X-ray datasets and their impact on model bias – A systematic review of a significant problem},
journal = {Medical Image Analysis},
year = {2021},
volume = {74},
pages = {102225},
url = {https://www.sciencedirect.com/science/article/pii/S136184152100270X},
doi = {https://doi.org/10.1016/j.media.2021.102225}
}
|
|||||
| Gill, P.E., Murray, W. and Wright, M.H. | Numerical Linear Algebra and Optimization [BibTeX] |
2021 | , pp. 448 | book | DOI URL |
BibTeX:
@book{Gill2021,
author = {Gill, Philip E. and Murray, Walter and Wright, Margaret H.},
title = {Numerical Linear Algebra and Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2021},
pages = {448},
note = {doi:10.1137/1.9781611976571},
url = {https://doi.org/10.1137/1.9781611976571},
doi = {https://doi.org/10.1137/1.9781611976571}
}
|
|||||
| Guigues, V., Monteiro, R. and Svaiter, B. | Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems [BibTeX] |
2021 | SIAM Journal on Optimization Vol. 31(3), pp. 2084–2110 |
article | DOI URL |
BibTeX:
@article{Guigues2021,
author = {Guigues, Vincent and Monteiro, Renato and Svaiter, Benar},
title = {Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems},
journal = {SIAM Journal on Optimization},
year = {2021},
volume = {31},
number = {3},
pages = {2084–2110},
url = {https://doi.org/10.1137/20M1330075},
doi = {https://doi.org/10.1137/20M1330075}
}
|
|||||
| Gumuskaya, V., van Jaarsveld, W., Dijkman, R., Grefen, P. and Veenstra, A. | Integrating stochastic programs and decision trees in capacitated barge planning with uncertain container arrivals | 2021 | Transportation Research Part C: Emerging Technologies Vol. 132, pp. 103383 |
article | DOI URL |
| Abstract: In this paper, we propose an approach that combines optimization techniques with machine learning to improve capacitated barge planning with uncertain container arrivals. The main idea is to use the predictions of a decision tree in the scenario generation of a 2-stage stochastic program to plan the barge calls (i.e. visits) of a barge operator. The predictions of container arrivals help to generate more accurate scenarios, which in turn leads to more informed decisions and less costs. The approach is tested with an iterative method of periodic planning and simulation for a one year duration so that the long term performance is evaluated. A computational experiment is conducted using the historical data of an inland terminal and the Port of Rotterdam. The results show that the proposed approach improves total costs up to 2.07% over the traditional stochastic approach, and up to 4.57% over the current method used in industry. | |||||
BibTeX:
@article{Gumuskaya2021,
author = {Gumuskaya, Volkan and van Jaarsveld, Willem and Dijkman, Remco and Grefen, Paul and Veenstra, Albert},
title = {Integrating stochastic programs and decision trees in capacitated barge planning with uncertain container arrivals},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {132},
pages = {103383},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X2100382X},
doi = {https://doi.org/10.1016/j.trc.2021.103383}
}
|
|||||
| Gurzhiy, A., Kalyazina, S., Maydanova, S. and Marchenko, R. | Port and City Integration: Transportation Aspect | 2021 | Transportation Research Procedia Vol. 54, pp. 890–899 |
article | DOI URL |
| Abstract: ICTs enable city governments to interact directly with communities and urban infrastructure to keep track of what is happening in the city, how the city is developing, and what ways can improve the quality of life. A digital-enabled network and an IT strategy that combines land and sea traffic management help to maintain economic feasibility. City residents can move around easily and port operations become more efficient. In this article 3 big ports were observed: Shanghai, Rotterdam and Hamburg. There are many criteria by which to rate a big port. This is, in particular, the area it occupies, its cargo turnover. Transport planning allows to achieve coordinated development of all types of transport in conjunction with urban planning activities, as well as a reasonable choice of the most effective measures for the development of the transport system. The logistic control can increase the quality using IT technologies and in the paper major aspects are observed. The effective planning can be reached according to main strategic aspect of every particular port. | |||||
BibTeX:
@article{Gurzhiy2021,
author = {Gurzhiy, Anastasia and Kalyazina, Sofia and Maydanova, Svetlana and Marchenko, Roman},
title = {Port and City Integration: Transportation Aspect},
journal = {Transportation Research Procedia},
year = {2021},
volume = {54},
pages = {890–899},
url = {https://www.sciencedirect.com/science/article/pii/S2352146521003239},
doi = {https://doi.org/10.1016/j.trpro.2021.02.144}
}
|
|||||
| Hartleb, J. and Schmidt, M. | Railway timetabling with integrated passenger distribution | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: Timetabling for railway services often aims at optimizing travel times for passengers. At the same time, restricting assumptions on passenger behavior and passenger modeling are made. While research has shown that discrete choice models are suitable to estimate the distribution of passengers on routes, this has not been considered in timetabling yet. We investigate how to integrate a passenger distribution into an optimization framework for timetabling and present two mixed integer linear programs for this problem. Both approaches design timetables and simultaneously find a corresponding passenger distribution on available routes. One model uses a linear distribution model to estimate passenger route choices. The other model uses an integrated simulation framework to approximate a passenger distribution according to the logit model, a commonly used route choice model. We compare both new approaches with three state-of-the-art timetabling methods and a heuristic approach on a set of artificial instances and a partial network of Netherlands Railways (NS). Our experiments provide insights into the impact of considering multiple routes instead of a single route, and of integrated route choice versus predetermined route assignment with respect to the solution quality. | |||||
BibTeX:
@article{Hartleb2021,
author = {Hartleb, Johann and Schmidt, Marie},
title = {Railway timetabling with integrated passenger distribution},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005403},
doi = {https://doi.org/10.1016/j.ejor.2021.06.025}
}
|
|||||
| Haruhiko, S. | Optimization of Cutting Tool Allocation to Enhance Workload Balance and Total Completion Time in Parallel-Type FMS [BibTeX] |
2021 | International Journal of Automation Technology VL - 15 IS - 6 SP - 804 EP - 812 PY - 2021 DO - 10.20965/ijat.2021.p0804 ER - | article | |
BibTeX:
@article{Haruhiko2021,
author = {Haruhiko, Suwa},
title = {Optimization of Cutting Tool Allocation to Enhance Workload Balance and Total Completion Time in Parallel-Type FMS},
journal = {International Journal of Automation Technology VL - 15 IS - 6 SP - 804 EP - 812 PY - 2021 DO - 10.20965/ijat.2021.p0804 ER -},
year = {2021}
}
|
|||||
| Hassan, L.K., Santos, B.F. and Vink, J. | Airline disruption management: A literature review and practical challenges | 2021 | Computers & Operations Research Vol. 127, pp. 105137 |
article | DOI URL |
| Abstract: Airline disruption management is an active field of research. In recent years, there has been an increase in publications, in particular, in of works integrating two or more resources (i.e., aircraft, crew, passengers) in the recovery analysis. Given that more than 50% of the papers have been published after the last literature review paper (Clausen et al., 2010), this paper provides a critical review and classification of the literature between 2009 and 2018 regarding airline disruption management, including aircraft, crew, passenger, and integrated recovery. Furthermore, this paper discusses various ways to close the gap between the reality faced in Airline Operations Control Centers (AOCCs) and defines a set of potential future lines of research. | |||||
BibTeX:
@article{Hassan2021,
author = {Hassan, L. K. and Santos, B. F. and Vink, J.},
title = {Airline disruption management: A literature review and practical challenges},
journal = {Computers & Operations Research},
year = {2021},
volume = {127},
pages = {105137},
url = {http://www.sciencedirect.com/science/article/pii/S0305054820302549},
doi = {https://doi.org/10.1016/j.cor.2020.105137}
}
|
|||||
| Hejazi, T.-H. | State-dependent resource reallocation plan for health care systems: A simulation optimization approach | 2021 | Computers & Industrial Engineering Vol. 159, pp. 107502 |
article | DOI URL |
| Abstract: Health care services in any country influence a considerable part of the economic, social, and political systems; researchers are trying to improve the quality of health care to realize the patients' needs and service quality in various fields. This study is conducted to provide an optimal system to reduce waiting time and increase the level of services according to various system conditions and increase the output rate in a medical center according to a key performance indicator, i.e., the patient's average waiting time. Discrete-event simulation has been applied to analyze the process, and simulation optimization has been employed to achieve optimal values. The tools used include ARENA software to simulate and OptQuest to optimize the simulation model. The system has been simulated separately for two purposes: a) resource optimization and b) resource planning according to the system state, and the results indicate that the system state-dependent model is the ideal model to reduce the waiting time for people and increase the output rate without decreasing the quality of service. State-dependent modeling approach has an advantage that if the resources are employed in shifts in the more crowded wards, then the waiting time for patients can be significantly reduced in the health care center. | |||||
BibTeX:
@article{Hejazi2021,
author = {Hejazi, Taha-Hossein},
title = {State-dependent resource reallocation plan for health care systems: A simulation optimization approach},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {159},
pages = {107502},
url = {https://www.sciencedirect.com/science/article/pii/S036083522100406X},
doi = {https://doi.org/10.1016/j.cie.2021.107502}
}
|
|||||
| Hellendoorn, V.J. and Sawant, A.A. | The growing cost of deep learning for source code [BibTeX] |
2021 | Commun. ACM Vol. 65(1), pp. 31–33 |
article | DOI URL |
BibTeX:
@article{Hellendoorn2021,
author = {Hellendoorn, Vincent J. and Sawant, Anand Ashok},
title = {The growing cost of deep learning for source code},
journal = {Commun. ACM},
year = {2021},
volume = {65},
number = {1},
pages = {31–33},
url = {https://doi.org/10.1145/3501261},
doi = {https://doi.org/10.1145/3501261}
}
|
|||||
| Hesse, M. | [BibTeX] |
2021 | Journal of Transport Geography Vol. 96, pp. 103170 |
article | DOI URL |
BibTeX:
@article{Hesse2021,
author = {Hesse, Markus},
journal = {Journal of Transport Geography},
year = {2021},
volume = {96},
pages = {103170},
url = {https://www.sciencedirect.com/science/article/pii/S0966692321002234},
doi = {https://doi.org/10.1016/j.jtrangeo.2021.103170}
}
|
|||||
| Ho-Nguyen, N., Kılınç-Karzan, F., Küçükyavuz, S. and Lee, D. | Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity | 2021 | Mathematical Programming | article | DOI URL |
| Abstract: We consider exact deterministic mixed-integer programming (MIP) reformulations of distributionally robust chance-constrained programs (DR-CCP) with random right-hand sides over Wasserstein ambiguity sets. The existing MIP formulations are known to have weak continuous relaxation bounds, and, consequently, for hard instances with small radius, or with large problem sizes, the branch-and-bound based solution processes suffer from large optimality gaps even after hours of computation time. This significantly hinders the practical application of the DR-CCP paradigm. Motivated by these challenges, we conduct a polyhedral study to strengthen these formulations. We reveal several hidden connections between DR-CCP and its nominal counterpart (the sample average approximation), mixing sets, and robust 0–1 programming. By exploiting these connections in combination, we provide an improved formulation and two classes of valid inequalities for DR-CCP. We test the impact of our results on a stochastic transportation problem numerically. Our experiments demonstrate the effectiveness of our approach; in particular our improved formulation and proposed valid inequalities reduce the overall solution times remarkably. Moreover, this allows us to significantly scale up the problem sizes that can be handled in such DR-CCP formulations by reducing the solution times from hours to seconds. | |||||
BibTeX:
@article{HoNguyen2021,
author = {Ho-Nguyen, Nam and Kılınç-Karzan, Fatma and Küçükyavuz, Simge and Lee, Dabeen},
title = {Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity},
journal = {Mathematical Programming},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01605-y},
doi = {https://doi.org/10.1007/s10107-020-01605-y}
}
|
|||||
| Houssein, E.H., Gad, A.G., Wazery, Y.M. and Suganthan, P.N. | Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends | 2021 | Swarm and Evolutionary Computation Vol. 62, pp. 100841 |
article | DOI URL |
| Abstract: Cloud computing is a recently looming-evoked paradigm, the aim of which is to provide on-demand, pay-as-you-go, internet-based access to shared computing resources (hardware and software) in a metered, self-service, dynamically scalable fashion. A related hot topic at the moment is task scheduling, which is well known for delivering critical cloud service performance. However, the dilemmas of resources being underutilized (underloaded) and overutilized (overloaded) may arise as a result of improper scheduling, which in turn leads to either wastage of cloud resources or degradation in service performance, respectively. Thus, the idea of incorporating meta-heuristic algorithms into task scheduling emerged in order to efficiently distribute complex and diverse incoming tasks (cloudlets) across available limited resources, within a reasonable time. Meta-heuristic techniques have proven very capable of solving scheduling problems, which is fulfilled herein from a cloud perspective by first providing a brief on traditional and heuristic scheduling methods before diving deeply into the most popular meta-heuristics for cloud task scheduling followed by a detailed systematic review featuring a novel taxonomy of those techniques, along with their advantages and limitations. More specifically, in this study, the basic concepts of cloud task scheduling are addressed smoothly, as well as diverse swarm, evolutionary, physical, emerging, and hybrid meta-heuristic scheduling techniques are categorized as per the nature of the scheduling problem (i.e., single- or multi-objective), the primary objective of scheduling, task-resource mapping scheme, and scheduling constraint. Armed with these methods, some of the most recent relevant literature are surveyed, and insights into the identification of existing challenges are presented, along with a trail to potential solutions. Furthermore, guidelines to future research directions drawn from recently emerging trends are outlined, which should definitely contribute to assisting current researchers and practitioners as well as pave the way for newbies excited about cloud task scheduling to pursue their own glory in the field. | |||||
BibTeX:
@article{Houssein2021,
author = {Houssein, Essam H. and Gad, Ahmed G. and Wazery, Yaser M. and Suganthan, Ponnuthurai Nagaratnam},
title = {Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends},
journal = {Swarm and Evolutionary Computation},
year = {2021},
volume = {62},
pages = {100841},
url = {https://www.sciencedirect.com/science/article/pii/S221065022100002X},
doi = {https://doi.org/10.1016/j.swevo.2021.100841}
}
|
|||||
| Hu, Y., Zhang, P., Fan, B., Zhang, S. and Song, J. | Integrated recovery of aircraft and passengers with passengers’ willingness under various itinerary disruption situations | 2021 | Computers & Industrial Engineering Vol. 161, pp. 107664 |
article | DOI URL |
| Abstract: This paper aims to study the aircraft rerouting problem considering passengers’ recovery with willingness under various itinerary disruption situation, which breaks thorough the traditional study assuming the passenger obey the airline assignment. We study how passengers’ willingness is considered in the optimization problem of aircraft rerouting and passengers’ recovery to reduce the dual losses of airlines and passengers. We consider passengers’ willingness under various itinerary disruption situations, composed of delay itineraries and disrupted itineraries. Passengers’ willingness mainly includes staying within the original itineraries, endorsing, and refunding tickets. We first construct an integer programming model with the following two objectives: to minimize airline recovery cost and reduce passenger recovery loss, and bounded rationality is applied to reformulate the passengers’ recovery loss. We then design an effective heuristic combined with multi-directional and stochastic variable neighborhood search algorithm to solve the problem. Finally, experiments based on real data are performed to show the stability and efficiency of the algorithm in various situations. Outcomes can provide theoretical and practical support for airline operations to improve passengers’ satisfaction. | |||||
BibTeX:
@article{Hu2021,
author = {Hu, Yuzhen and Zhang, Pu and Fan, Bo and Zhang, Song and Song, Jianghai},
title = {Integrated recovery of aircraft and passengers with passengers’ willingness under various itinerary disruption situations},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {161},
pages = {107664},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221005684},
doi = {https://doi.org/10.1016/j.cie.2021.107664}
}
|
|||||
| Hughes, M., Goerigk, M. and Dokka, T. | Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming | 2021 | Computers & Operations Research Vol. 133, pp. 105364 |
article | DOI URL |
| Abstract: We develop algorithms capable of tackling robust black-box optimisation problems, where the number of model runs is limited. When a desired solution cannot be implemented exactly the aim is to find a robust one, where the worst case in an uncertainty neighbourhood around a solution still performs well. To investigate improved methods we employ an automatic generation of algorithms approach: Grammar-Guided Genetic Programming. We develop algorithmic building blocks in a Particle Swarm Optimisation framework, define the rules for constructing heuristics from these components, and evolve populations of search algorithms for robust problems. Our algorithmic building blocks combine elements of existing techniques and new features, resulting in the investigation of a novel heuristic solution space. We obtain algorithms which improve upon the current state of the art. We also analyse the component level breakdowns of the populations of algorithms developed against their performance, to identify high-performing heuristic components for robust problems. | |||||
BibTeX:
@article{Hughes2021,
author = {Hughes, Martin and Goerigk, Marc and Dokka, Trivikram},
title = {Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming},
journal = {Computers & Operations Research},
year = {2021},
volume = {133},
pages = {105364},
url = {https://www.sciencedirect.com/science/article/pii/S0305054821001398},
doi = {https://doi.org/10.1016/j.cor.2021.105364}
}
|
|||||
| Huo, Y., Delahaye, D. and Sbihi, M. | A probabilistic model based optimization for aircraft scheduling in terminal area under uncertainty | 2021 | Transportation Research Part C: Emerging Technologies Vol. 132, pp. 103374 |
article | DOI URL |
| Abstract: Air traffic management relies strongly on the accuracy of prediction, while uncertainties such as weather, navigation accuracy, pilot operations, etc. may weaken the performance of predictive tools and cause potential safety issues or reduced capacity. Among all controlled airspace, the Terminal Maneuvering Area (TMA) is one of the most complex areas in which flight safety can be easily affected by unpredictable disturbances. This paper addresses an aircraft scheduling problem under uncertainty with the aim of providing a robust schedule for arrival flights. Uncertainty quantification and propagation along the routes are realized in a trajectory model that formulates the time information as random variables. Conflict detection and resolution are performed at waypoints of a predefined network based on the predicted time information from the trajectory model. By minimizing the expected number of conflicts, consecutively operated flights can be well separated. Apart from the proposed model, two other models - the deterministic model and a model that incorporates separation buffers - are presented as benchmarks. A meta-heuristic simulated annealing algorithm combined with a time decomposition sliding window is proposed for solving a case study of the Paris Charles de Gaulle (CDG) airport. Further, a simulation framework based on the Monte-Carlo approach is implemented so as to evaluate the optimized solutions obtained from the three models. Statistical comparison among the results shows instability of the model that incorporates the separation buffers, in contrast, the proposed model has absolute advantages in both stability and the conflict absorbing ability when uncertainty arises. | |||||
BibTeX:
@article{Huo2021,
author = {Huo, Ying and Delahaye, Daniel and Sbihi, Mohammed},
title = {A probabilistic model based optimization for aircraft scheduling in terminal area under uncertainty},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {132},
pages = {103374},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X21003764},
doi = {https://doi.org/10.1016/j.trc.2021.103374}
}
|
|||||
| Inatsu, Y., Iwazaki, S. and Takeuchi, I. | Active Learning for Distributionally Robust Level-Set Estimation | 2021 | Vol. 139, pp. 4574––4584 |
misc | URL |
| Abstract: Many cases exist in which a black-box function f with high evaluation cost depends on two types of variables bm x and bm w, where bm x is a controllable design variable and bm w are uncontrollable environmental variables that have random variation following a certain distribution P. In such cases, an important task is to find the range of design variables bm x such that the function f(bm x, bm w) has the desired properties by incorporating the random variation of the environmental variables bm w. A natural measure of robustness is the probability that f(bm x, bm w) exceeds a given threshold h, which is known as the probability threshold robustness (PTR) measure in the literature on robust optimization. However, this robustness measure cannot be correctly evaluated when the distribution P is unknown. In this study, we addressed this problem by considering the distributionally robust PTR (DRPTR) measure, which considers the worst-case PTR within given candidate distributions. Specifically, we studied the problem of efficiently identifying a reliable set H, which is defined as a region in which the DRPTR measure exceeds a certain desired probability α, which can be interpreted as a level set estimation (LSE) problem for DRPTR. We propose a theoretically grounded and computationally efficient active learning method for this problem. We show that the proposed method has theoretical guarantees on convergence and accuracy, and confirmed through numerical experiments that the proposed method outperforms existing methods. | |||||
BibTeX:
@misc{Inatsu2021,
author = {Inatsu, Yu and Iwazaki, Shogo and Takeuchi, Ichiro},
title = {Active Learning for Distributionally Robust Level-Set Estimation},
publisher = {PMLR},
year = {2021},
volume = {139},
pages = {4574––4584},
url = {https://proceedings.mlr.press/v139/inatsu21a.html}
}
|
|||||
| Iwazaki, S., Inatsu, Y. and Takeuchi, I. | Mean-Variance Analysis in Bayesian Optimization under Uncertainty | 2021 | Vol. 130, pp. 973––981 |
misc | URL |
| Abstract: We consider active learning (AL) in an uncertain environment in which trade-off between multiple risk measures need to be considered. As an AL problem in such an uncertain environment, we study Mean-Variance Analysis in Bayesian Optimization (MVA-BO) setting. Mean-variance analysis was developed in the field of financial engineering and has been used to make decisions that take into account the trade-off between the average and variance of investment uncertainty. In this paper, we specifically focus on BO setting with an uncertain component and consider multi-task, multi-objective, and constrained optimization scenarios for the mean-variance trade-off of the uncertain component. When the target blackbox function is modeled by Gaussian Process (GP), we derive the bounds of the two risk measures and propose AL algorithm for each of the above three scenarios based on the risk measure bounds. We show the effectiveness of the proposed AL algorithms through theoretical analysis and numerical experiments. | |||||
BibTeX:
@misc{Iwazaki2021,
author = {Iwazaki, Shogo and Inatsu, Yu and Takeuchi, Ichiro},
title = {Mean-Variance Analysis in Bayesian Optimization under Uncertainty},
publisher = {PMLR},
year = {2021},
volume = {130},
pages = {973––981},
url = {https://proceedings.mlr.press/v130/iwazaki21a.html}
}
|
|||||
| Jia, X. and Cui, Y. | Examining interrelationships of barriers in the evolution of maritime port smartification from a systematic perspective | 2021 | Transport Policy Vol. 114, pp. 49–58 |
article | DOI URL |
| Abstract: The smartification of maritime ports is assumed to improve operational efficiency, which results in a reduction of port costs and harmful emissions. This study seeks to estimate the interrelationships among barriers in the evolution of maritime port smartification (MPS) using the case of China. The research framework exhibits fifteen barriers selected from the previous literature and experts’ inputs. The causal relationships among the identified barriers were examined by using an integration of grey theory and the decision-making trial and evaluation laboratory method (DEMATEL). The barriers were divided into a causal group with eight barriers and an effect group with seven barriers. Further analysis of the results leads to the identification of nine key barriers such as unfavorable policies of investing and financing, low level of cooperation between port business and government functions, shortage of talents in smart ports. Insufficient government support in R&D is the most influential causal barrier, and undeveloped awareness of the benefits of new technologies has the most association with other barriers. The findings encourage more detailed investigations on the barriers and help policy-makers formulate strategies to accelerate the evolution of MPS. | |||||
BibTeX:
@article{Jia2021,
author = {Jia, Xiaohui and Cui, Yongmei},
title = {Examining interrelationships of barriers in the evolution of maritime port smartification from a systematic perspective},
journal = {Transport Policy},
year = {2021},
volume = {114},
pages = {49–58},
url = {https://www.sciencedirect.com/science/article/pii/S0967070X21002699},
doi = {https://doi.org/10.1016/j.tranpol.2021.09.004}
}
|
|||||
| Kampa, A. and Paprocka, I. | Analysis of Energy Efficient Scheduling of the Manufacturing Line with Finite Buffer Capacity and Machine Setup and Shutdown Times [BibTeX] |
2021 | Energies Vol. 14(21), pp. 7446 |
article | URL |
BibTeX:
@article{Kampa2021,
author = {Kampa, Adrian and Paprocka, Iwona},
title = {Analysis of Energy Efficient Scheduling of the Manufacturing Line with Finite Buffer Capacity and Machine Setup and Shutdown Times},
journal = {Energies},
year = {2021},
volume = {14},
number = {21},
pages = {7446},
url = {https://www.mdpi.com/1996-1073/14/21/7446}
}
|
|||||
| Kannan, R. and Luedtke, J.R. | A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs | 2021 | Mathematical Programming Computation Vol. 13(4), pp. 705–751 |
article | DOI URL |
| Abstract: We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the efficient frontier of optimal objective value versus risk of constraints violation. To this end, we construct a reformulated problem whose objective is to minimize the probability of constraints violation subject to deterministic convex constraints (which includes a bound on the objective function value). We adapt existing smoothing-based approaches for chance-constrained problems to derive a convergent sequence of smooth approximations of our reformulated problem, and apply a projected stochastic subgradient algorithm to solve it. In contrast with exterior sampling-based approaches (such as sample average approximation) that approximate the original chance-constrained program with one having finite support, our proposal converges to stationary solutions of a smooth approximation of the original problem, thereby avoiding poor local solutions that may be an artefact of a fixed sample. Our proposal also includes a tailored implementation of the smoothing-based approach that chooses key algorithmic parameters based on problem data. Computational results on four test problems from the literature indicate that our proposed approach can efficiently determine good approximations of the efficient frontier. | |||||
BibTeX:
@article{Kannan2021,
author = {Kannan, Rohit and Luedtke, James R.},
title = {A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs},
journal = {Mathematical Programming Computation},
year = {2021},
volume = {13},
number = {4},
pages = {705–751},
url = {https://doi.org/10.1007/s12532-020-00199-y},
doi = {https://doi.org/10.1007/s12532-020-00199-y}
}
|
|||||
| Kapkaeva, N., Gurzhiy, A., Maydanova, S. and Levina, A. | Digital Platform for Maritime Port Ecosystem: Port of Hamburg Case | 2021 | Transportation Research Procedia Vol. 54, pp. 909–917 |
article | DOI URL |
| Abstract: The majority of ports have systems for exchanging information between different agents involved in a supply chain. Port information systems are a form of a “single window” for trade, and are similar in function to airport information systems. One of the most useful functions of a port communications system is the ability to automatically extract the information required by customs authorities from information flows from private port operators. Modern infrastructure allows ports to solve a number of problems, such as identification of employees, ships and vehicles, tracking the movement of containers around the port, ordering trucks and train configuration Thus, the paper provides a modern informational view of port operations and aims to bridge the gap between industry solutions and scientific work. | |||||
BibTeX:
@article{Kapkaeva2021,
author = {Kapkaeva, Natalia and Gurzhiy, Anastasia and Maydanova, Svetlana and Levina, Anastasia},
title = {Digital Platform for Maritime Port Ecosystem: Port of Hamburg Case},
journal = {Transportation Research Procedia},
year = {2021},
volume = {54},
pages = {909–917},
url = {https://www.sciencedirect.com/science/article/pii/S2352146521003252},
doi = {https://doi.org/10.1016/j.trpro.2021.02.146}
}
|
|||||
| Katsigiannis, F.A., Zografos, K.G. and Fairbrother, J. | Modelling and solving the airport slot-scheduling problem with multi-objective, multi-level considerations | 2021 | Transportation Research Part C: Emerging Technologies Vol. 124, pp. 102914 |
article | DOI URL |
| Abstract: In overly congested airports requests for landing and take-off slots are allocated according to the IATA World Scheduling Guidelines (WSG). A central concept of these guidelines is the prioritization of the satisfaction of the requested slots according to a hierarchy that recognizes historic usage rights of slots. A number of criteria have been proposed in the literature to optimize airport slot allocation decisions. Multi-objective programming models have been proposed to investigate the trade-offs of the slot allocation objectives for the same level of the slot hierarchy. However, the literature currently lacks models that can study in a systematic way the trade-offs among the scheduling objectives across all levels of the hierarchy and the airport schedule as a whole. To close the existing literature gap, we are proposing a new tri-objective slot allocation model (TOSAM) that considers total schedule displacement, maximum schedule displacement and demand-based fairness, and we introduce a multi-level, multi-objective algorithm to solve it. We are using real world slot request and airport capacity data to demonstrate the applicability of the proposed approach. Our computational results suggest that the systematic consideration of the interactions among the objectives of the different levels of the slot hierarchy, results to improved schedule-wide slot scheduling performance. In particular, we found that small sacrifices made for the attainment of the scheduling objectives of the upper echelons of the slot hierarchy, result in significant improvements of the schedule-wide objectives. | |||||
BibTeX:
@article{Katsigiannis2021,
author = {Katsigiannis, Fotios A. and Zografos, Konstantinos G. and Fairbrother, Jamie},
title = {Modelling and solving the airport slot-scheduling problem with multi-objective, multi-level considerations},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {124},
pages = {102914},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X20308135},
doi = {https://doi.org/10.1016/j.trc.2020.102914}
}
|
|||||
| Khan, W.A., Ma, H.-L., Chung, S.-H. and Wen, X. | Hierarchical integrated machine learning model for predicting flight departure delays and duration in series | 2021 | Transportation Research Part C: Emerging Technologies Vol. 129, pp. 103225 |
article | DOI URL |
| Abstract: Flight delays may propagate through the entire aviation network and are becoming an important research topic. This paper proposes a novel hierarchical integrated machine learning model for predicting flight departure delays and duration in series rather than in parallel to avoid ambiguity in decision making. The paper analyses the proposed model using various machine learning algorithms in combination with different sampling techniques. The highly noisy, unbalanced, dispersed, and skewed historical high dimensional data provided by an international airline operating in Hong Kong was used to demonstrate the practical application of the model. The result shows that for a 4-h forecast horizon, a constructive neural network machine learning algorithm with the Synthetic Minority Over Sampling Technique-Tomek Links (SMOTETomek) sampling technique was able to achieve better average balanced recall accuracies of 65.5%, 61.5%, 59% for classifying delay status and predicting delay duration at thresholds of 60 min and 30 min, respectively. Similarly, for minority labels, the precision-recall and area under the curve showed that the proposed model achieved better results of 32.44% and 35.14% compared to the parallel model of 26.43% and 21.02% for thresholds of 60 min and 30 min, respectively. The effect of different sampling techniques, sampling approaches, and estimation mechanisms on prediction performance is also studied. | |||||
BibTeX:
@article{Khan2021,
author = {Khan, Waqar Ahmed and Ma, Hoi-Lam and Chung, Sai-Ho and Wen, Xin},
title = {Hierarchical integrated machine learning model for predicting flight departure delays and duration in series},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {129},
pages = {103225},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X21002394},
doi = {https://doi.org/10.1016/j.trc.2021.103225}
}
|
|||||
| Kılınç-Karzan, F., Küçükyavuz, S. and Lee, D. | Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens | 2021 | Mathematical Programming | article | DOI URL |
| Abstract: A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly a knapsack constraint). In this paper, we first revisit basic mixing sets by establishing a strong and previously unrecognized connection to submodularity. In particular, we show that mixing inequalities with binary variables are nothing but the polymatroid inequalities associated with a specific submodular function. This submodularity viewpoint enables us to unify and extend existing results on valid inequalities and convex hulls of the intersection of multiple mixing sets with common binary variables. Then, we study such intersections under an additional linking constraint lower bounding a linear function of the continuous variables. This is motivated from the desire to exploit the information encoded in the knapsack constraint arising in joint linear CCPs via the quantile cuts. We propose a new class of valid inequalities and characterize when this new class along with the mixing inequalities are sufficient to describe the convex hull. | |||||
BibTeX:
@article{KilincKarzan2021,
author = {Kılınç-Karzan, Fatma and Küçükyavuz, Simge and Lee, Dabeen},
title = {Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens},
journal = {Mathematical Programming},
year = {2021},
url = {https://doi.org/10.1007/s10107-021-01688-1},
doi = {https://doi.org/10.1007/s10107-021-01688-1}
}
|
|||||
| Kim, P.T. | Addressing algorithmic discrimination [BibTeX] |
2021 | Commun. ACM Vol. 65(1), pp. 25–27 |
article | DOI URL |
BibTeX:
@article{Kim2021,
author = {Kim, Pauline T.},
title = {Addressing algorithmic discrimination},
journal = {Commun. ACM},
year = {2021},
volume = {65},
number = {1},
pages = {25–27},
url = {https://doi.org/10.1145/3498660},
doi = {https://doi.org/10.1145/3498660}
}
|
|||||
| Kleinert, T., Labbé, M., Ljubić, I. and Schmidt, M. | A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100007 |
article | DOI URL |
| Abstract: Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes. This is appealing for modeling real-world problems, but it also makes the resulting optimization models hard to solve in theory and practice. The scientific interest in computational bilevel optimization increased a lot over the last decade and is still growing. Independent of whether the bilevel problem itself contains integer variables or not, many state-of-the-art solution approaches for bilevel optimization make use of techniques that originate from mixed-integer programming. These techniques include branch-and-bound methods, cutting planes and, thus, branch-and-cut approaches, or problem-specific decomposition methods. In this survey article, we review bilevel-tailored approaches that exploit these mixed-integer programming techniques to solve bilevel optimization problems. To this end, we first consider bilevel problems with convex or, in particular, linear lower-level problems. The discussed solution methods in this field stem from original works from the 1980’s but, on the other hand, are still actively researched today. Second, we review modern algorithmic approaches to solve mixed-integer bilevel problems that contain integrality constraints in the lower level. Moreover, we also briefly discuss the area of mixed-integer nonlinear bilevel problems. Third, we devote some attention to more specific fields such as pricing or interdiction models that genuinely contain bilinear and thus nonconvex aspects. Finally, we sketch a list of open questions from the areas of algorithmic and computational bilevel optimization, which may lead to interesting future research that will further propel this fascinating and active field of research. | |||||
BibTeX:
@article{Kleinert2021,
author = {Kleinert, Thomas and Labbé, Martine and Ljubić, Ivana and Schmidt, Martin},
title = {A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100007},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001349},
doi = {https://doi.org/10.1016/j.ejco.2021.100007}
}
|
|||||
| Knopp, S., Biesinger, B. and Prandtstetter, M. | Mobility offer allocations in corporate settings | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100010 |
article | DOI URL |
| Abstract: Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use of battery electric vehicles. We introduce the mobility offer allocation problemas the core concept of a flexible booking system for corporate mobility. The problem is equivalent to interval scheduling on dedicated unrelated parallel machines. We show that the problem is NP-hard to approximate within any factor. We describe problem specific conflict graphs for representing and exploring the structure of feasible solutions. A characterization of all maximum cliques in these conflict graphs reveals symmetries which allow to formulate stronger integer linear programming models. We also present an adaptive large neighborhood search based approach which makes use of conflict graphs as well. In a computational study, the approaches are evaluated. It was found that greedy heuristics perform best if very tight run-time requirements are given, a solver for the integer linear programming model performs best on small and medium instances, and the adaptive large neighborhood search performs best on large instances. | |||||
BibTeX:
@article{Knopp2021,
author = {Knopp, Sebastian and Biesinger, Benjamin and Prandtstetter, Matthias},
title = {Mobility offer allocations in corporate settings},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100010},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001374},
doi = {https://doi.org/10.1016/j.ejco.2021.100010}
}
|
|||||
| Kotzur, L., Nolting, L., Hoffmann, M., Groß, T., Smolenko, A., Priesmann, J., Büsing, H., Beer, R., Kullmann, F., Singh, B., Praktiknjo, A., Stolten, D. and Robinius, M. | A modeler's guide to handle complexity in energy systems optimization | 2021 | Advances in Applied Energy Vol. 4, pp. 100063 |
article | DOI URL |
| Abstract: Determining environmentally- and economically-optimal energy systems designs and operations is complex. In particular, the integration of weather-dependent renewable energy technologies into energy system optimization models presents new challenges to computational tractability that cannot only be solved by advancements in computational resources. In consequence, energy system modelers must tackle the complexity of their models by applying various methods to manipulate the underlying data and model structure, with the ultimate goal of finding optimal solutions. As which complexity reduction method is suitable for which research question is often unclear, herein we review different approaches for handling complexity. We first analyze the determinants of complexity and note that many drivers of complexity could be avoided a priori with a tailored model design. Second, we conduct a review of systematic complexity reduction methods for energy system optimization models, which can range from simple linearization performed by modelers to sophisticated multi-level approaches combining aggregation and decomposition methods. Based on this overview, we develop a guide for energy system modelers who encounter computational limitations. | |||||
BibTeX:
@article{Kotzur2021,
author = {Kotzur, Leander and Nolting, Lars and Hoffmann, Maximilian and Groß, Theresa and Smolenko, Andreas and Priesmann, Jan and Büsing, Henrik and Beer, Robin and Kullmann, Felix and Singh, Bismark and Praktiknjo, Aaron and Stolten, Detlef and Robinius, Martin},
title = {A modeler's guide to handle complexity in energy systems optimization},
journal = {Advances in Applied Energy},
year = {2021},
volume = {4},
pages = {100063},
url = {https://www.sciencedirect.com/science/article/pii/S266679242100055X},
doi = {https://doi.org/10.1016/j.adapen.2021.100063}
}
|
|||||
| de Langen, P.W. | Seaports as Clusters of Economic Activities | 2021 | International Encyclopedia of Transportation, pp. 310–315 | inbook | DOI URL |
| Abstract: Companies related directly or indirectly to ships and international commodity chains and located in the port area can jointly be considered as a port cluster. The colocation of such interrelated companies in ports creates synergies, such as the shared use of infrastructure and services and the availability of specialized knowledge and skills. The port cluster concept has proven to be a useful “lens” for analyzing ports. With the cluster “lens” scholars address research issues that are complementary to the established lens of treating a port as a transport node. A port cluster consists of four components, transport-related activities, logistics and value-added activities, manufacturing activities, and leisure and tourism-related activities. A port cluster is in various ways different from the more widely studied “tech clusters.” This has important implications for the analysis of port clusters. First, port clusters are vulnerable to technological change. Second, the core challenge for port clusters lies in the absorptive capacity. R&D activities in port clusters are limited; the dominant innovation challenge is the (early) application of new knowledge (e.g., regarding digitalization, recycling technologies, bio-based chemicals, and smart grids). Third, contrary to most “tech clusters,” in which governance is rather loose, chaotic, and decentralized, structured governance mechanisms may be critical to enhancing the competitiveness of port clusters. A state-owned commercially run “port cluster developer” often plays a central role. | |||||
BibTeX:
@inbook{Langen2021,
author = {de Langen, Peter W.},
title = {Seaports as Clusters of Economic Activities},
booktitle = {International Encyclopedia of Transportation},
publisher = {Elsevier},
year = {2021},
pages = {310–315},
url = {https://www.sciencedirect.com/science/article/pii/B9780081026717102611},
doi = {https://doi.org/10.1016/B978-0-08-102671-7.10261-1}
}
|
|||||
| Leng, J., Wang, D., Shen, W., Li, X., Liu, Q. and Chen, X. | Digital twins-based smart manufacturing system design in Industry 4.0: A review | 2021 | Journal of Manufacturing Systems Vol. 60, pp. 119–137 |
article | DOI URL |
| Abstract: A smart manufacturing system (SMS) is a multi-field physical system with complex couplings among various components. Usually, designers in various fields can only design subsystems of an SMS based on the limited cognition of dynamics. Conducting SMS designs concurrently and developing a unified model to effectively imitate every interaction and behavior of manufacturing processes are challenging. As an emerging technology, digital twins can achieve semi-physical simulations to reduce the vast time and cost of physical commissioning/reconfiguration by the early detection of design errors/flaws of the SMS. However, the development of the digital twins concept in the SMS design remains vague. An innovative Function-Structure-Behavior-Control-Intelligence-Performance (FSBCIP) framework is proposed to review how digital twins technologies are integrated into and promote the SMS design based on a literature search in the Web of Science database. The definitions, frameworks, major design steps, new blueprint models, key enabling technologies, design cases, and research directions of digital twins-based SMS design are presented in this survey. It is expected that this survey will shed new light on urgent industrial concerns in developing new SMSs in the Industry 4.0 era. | |||||
BibTeX:
@article{Leng2021,
author = {Leng, Jiewu and Wang, Dewen and Shen, Weiming and Li, Xinyu and Liu, Qiang and Chen, Xin},
title = {Digital twins-based smart manufacturing system design in Industry 4.0: A review},
journal = {Journal of Manufacturing Systems},
year = {2021},
volume = {60},
pages = {119–137},
url = {https://www.sciencedirect.com/science/article/pii/S0278612521001151},
doi = {https://doi.org/10.1016/j.jmsy.2021.05.011}
}
|
|||||
| Leonard, K.C., Hasan, F., Sneddon, H.F. and You, F. | Can Artificial Intelligence and Machine Learning Be Used to Accelerate Sustainable Chemistry and Engineering? [BibTeX] |
2021 | ACS Sustainable Chemistry & Engineering Vol. 9(18), pp. 6126–6129 |
article | DOI URL |
BibTeX:
@article{Leonard2021,
author = {Leonard, Kevin C. and Hasan, Faruque and Sneddon, Helen F. and You, Fengqi},
title = {Can Artificial Intelligence and Machine Learning Be Used to Accelerate Sustainable Chemistry and Engineering?},
journal = {ACS Sustainable Chemistry & Engineering},
year = {2021},
volume = {9},
number = {18},
pages = {6126–6129},
note = {doi: 10.1021/acssuschemeng.1c02741},
url = {https://doi.org/10.1021/acssuschemeng.1c02741},
doi = {https://doi.org/10.1021/acssuschemeng.1c02741}
}
|
|||||
| Li, J., Zhang, W. and Yeh, W.W.G. | A Proposed Multi-Objective, Multi-Stage Stochastic Programming With Recourse Model for Reservoir Management and Operation | 2021 | Water Resources Research Vol. 57(10), pp. e2020WR029200 |
article | DOI URL |
| Abstract: Abstract We present a multi-objective, multi-stage stochastic programming with recourse model for reservoir management and operation, where we use utility theory to select the best compromise solution from the Pareto front. A multi-stage streamflow scenario tree is generated first by the neural gas method. Then the Pareto front at each stage is produced by a modified constrained NSGA-II. A single best compromise solution on the Pareto front must be selected for the immediate stage and the model moves forward one stage and is re-optimized over a moving planning horizon of fixed duration. A key contribution of this study is the selection of the best compromise solution, which is achieved by a proposed linear spline utility function allied with regression. Our proposed utility function has the following advantages: (a) It satisfies the law of diminishing marginal rate of substitution, (b) it does not rely on the pre-specified weight or goal, and (c) it selects the best compromise solution that is likely to fall in the ?knee regions? of the Pareto front. We apply the proposed optimization model to the Three Gorges Reservoir in China. The two conflicting objectives are (a) maximizing the total expected energy output in the planning horizon, and (b) maximizing the average expected ecological benefits in the planning horizon. The results show that the proposed model produces the optimal water release policy successfully under different hydrological scenarios, considering both the inflow uncertainty and the tradeoff between the two conflicting objectives. | |||||
BibTeX:
@article{Li2021,
author = {Li, Jinshu and Zhang, Wei and Yeh, William W. G.},
title = {A Proposed Multi-Objective, Multi-Stage Stochastic Programming With Recourse Model for Reservoir Management and Operation},
journal = {Water Resources Research},
year = {2021},
volume = {57},
number = {10},
pages = {e2020WR029200},
note = {https://doi.org/10.1029/2020WR029200},
url = {https://doi.org/10.1029/2020WR029200},
doi = {https://doi.org/10.1029/2020WR029200}
}
|
|||||
| Lin, Q., Li, N., Qi, Q. and Hu, J. | Using API Call Sequences for IoT Malware Classification Based on Convolutional Neural Networks | 2021 | International Journal of Software Engineering and Knowledge Engineering Vol. 31(04), pp. 587–612 |
article | DOI URL |
| Abstract: Internet of Things (IoT) devices built on different processor architectures have increasingly become targets of adversarial attacks. In this paper, we propose an algorithm for the malware classification problem of the IoT domain to deal with the increasingly severe IoT security threats. Application executions are represented by sequences of consecutive API calls. The time series of data is analyzed and filtered based on the improved information gains. It performs more effectively than chi-square statistics, in reducing the sequence lengths of input data meanwhile keeping the important information, according to the experimental results. We use a multi-layer convolutional neural network to classify various types of malwares, which is suitable for processing time series data. When the convolution window slides down the time sequence, it can obtain higher-level positions by collecting different sequence features, thereby understanding the characteristics of the corresponding sequence position. By comparing the iterative efficiency of different optimization algorithms in the model, we select an algorithm that can approximate the optimal solution to a small number of iterations to speed up the convergence of the model training. The experimental results from real world IoT malware sample show that the classification accuracy of this approach can reach more than 98%. Overall, our method has demonstrated practical suitability for IoT malware classification with high accuracies and low computational overheads by undergoing a comprehensive evaluation. | |||||
BibTeX:
@article{Lin2021,
author = {Lin, Qianguang and Li, Ni and Qi, Qi and Hu, Jiabin},
title = {Using API Call Sequences for IoT Malware Classification Based on Convolutional Neural Networks},
journal = {International Journal of Software Engineering and Knowledge Engineering},
year = {2021},
volume = {31},
number = {04},
pages = {587–612},
url = {https://doi.org/10.1142/S021819402140009X},
doi = {https://doi.org/10.1142/S021819402140009X}
}
|
|||||
| Liu, T. and Duan, G. | Task allocation optimization model in mechanical product development based on Bayesian network and ant colony algorithm | 2021 | The Journal of Supercomputing Vol. 77(12), pp. 13963–13991 |
article | DOI URL |
| Abstract: A task allocation optimization model in mechanical product development was proposed. First, Bayesian network was introduced and used to describe quality characteristic (QC) relations of mechanical products. The quality characteristic importance was then analyzed based on the Bayesian network. Weights were assigned to QCs according to the QCs importance. QCs are generally manufactured by different types of manufacturing resources, such as machine tools, cutting tools, measuring tools, and fixtures. For convenience, these manufacturing resources were encapsulated as manufacturing cells. QCs were considered as tasks to be completed by manufacturing cells. Numerous tasks and manufacturing cells were involved in mechanical product development; therefore, the core problem was to allocate these tasks to manufacturing cells in an optimal way to achieve better product quality. Time and cost were considered as the main constraints. The ant colony algorithm was used to solve the task allocation optimization problem. A numerical case study was also presented to indicate the effectiveness of the proposed model. | |||||
BibTeX:
@article{Liu2021,
author = {Liu, Taotao and Duan, Guijiang},
title = {Task allocation optimization model in mechanical product development based on Bayesian network and ant colony algorithm},
journal = {The Journal of Supercomputing},
year = {2021},
volume = {77},
number = {12},
pages = {13963–13991},
url = {https://doi.org/10.1007/s11227-021-03831-3},
doi = {https://doi.org/10.1007/s11227-021-03831-3}
}
|
|||||
| Locatelli, M. and Schoen, F. | (Global) Optimization: Historical notes and recent developments | 2021 | EURO Journal on Computational Optimization Vol. 9, pp. 100012 |
article | DOI URL |
| Abstract: Recent developments in (Global) Optimization are surveyed in this paper. We collected and commented quite a large number of recent references which, in our opinion, well represent the vivacity, deepness, and width of scope of current computational approaches and theoretical results about nonconvex optimization problems. Before the presentation of the recent developments, which are subdivided into two parts related to heuristic and exact approaches, respectively, we briefly sketch the origin of the discipline and observe what, from the initial attempts, survived, what was not considered at all as well as a few approaches which have been recently rediscovered, mostly in connection with machine learning. | |||||
BibTeX:
@article{Locatelli2021,
author = {Locatelli, Marco and Schoen, Fabio},
title = {(Global) Optimization: Historical notes and recent developments},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100012},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621001398},
doi = {https://doi.org/10.1016/j.ejco.2021.100012}
}
|
|||||
| Lu, Y. and Sa, C.D. | Optimal Complexity in Decentralized Training | 2021 | Vol. 139, pp. 7111––7123 |
misc | URL |
| Abstract: Decentralization is a promising method of scaling up parallel machine learning systems. In this paper, we provide a tight lower bound on the iteration complexity for such methods in a stochastic non-convex setting. Our lower bound reveals a theoretical gap in known convergence rates of many existing decentralized training algorithms, such as D-PSGD. We prove by construction this lower bound is tight and achievable. Motivated by our insights, we further propose DeTAG, a practical gossip-style decentralized algorithm that achieves the lower bound with only a logarithm gap. Empirically, we compare DeTAG with other decentralized algorithms on image classification tasks, and we show DeTAG enjoys faster convergence compared to baselines, especially on unshuffled data and in sparse networks. | |||||
BibTeX:
@misc{Lu2021,
author = {Lu, Yucheng and Sa, Christopher De},
title = {Optimal Complexity in Decentralized Training},
publisher = {PMLR},
year = {2021},
volume = {139},
pages = {7111––7123},
url = {https://proceedings.mlr.press/v139/lu21a.html}
}
|
|||||
| M.S, I. and Cherukuri, A.K. | Quantum-inspired ensemble approach to multi-attributed and multi-agent decision-making | 2021 | Applied Soft Computing Vol. 106, pp. 107283 |
article | DOI URL |
| Abstract: Decision-making is the process of selecting a belief among several other candidate beliefs. The selected belief is usually regarded as a decision while the agent that performs the decision-making process is called as a decision-maker. The decision-making process that makes use of multiple attribute cue pattern as well as multiple decision makers to select a belief is called as multi-attribute and multi-agent decision making. This research proposes quantum inspired approach to multi-attribute and multi-agent decision making process considering the ability of quantum theories to model several complex human cognitive processes as reported in the literature. The main contributions of this work are: a) quantum object based encoding of multi-attribute cue pattern b) ensemble based representation of multi-agent decision making. Further, an analogy between proposed work and double slit experiment to illustrate the interference effect in decision making is also presented. The novelty of this work lies in: a) proposing a quantum inspired ensemble approach to model multi-attribute and multi-agent decision making b) the proposed work outperforms the quantum approach as well as ensemble approach to the decision making with Pima Indiana Diabetes (PID) dataset. The proposed work yields a best accuracy of 90.5% with PID dataset. | |||||
BibTeX:
@article{M.S2021,
author = {M.S, Ishwarya and Cherukuri, Aswani Kumar},
title = {Quantum-inspired ensemble approach to multi-attributed and multi-agent decision-making},
journal = {Applied Soft Computing},
year = {2021},
volume = {106},
pages = {107283},
url = {https://www.sciencedirect.com/science/article/pii/S1568494621002064},
doi = {https://doi.org/10.1016/j.asoc.2021.107283}
}
|
|||||
| Matabuena, M., Rodríguez-Mier, P., García-Meixide, C. and Leborán, V. | COVID-19: Estimation of the transmission dynamics in Spain using a stochastic simulator and black-box optimization techniques | 2021 | Computer Methods and Programs in Biomedicine Vol. 211, pp. 106399 |
article | DOI URL |
| Abstract: Background and objectives: Epidemiological models of epidemic spread are an essential tool for optimizing decision-making. The current literature is very extensive and covers a wide variety of deterministic and stochastic models. However, with the increase in computing resources, new, more general, and flexible procedures based on simulation models can assess the effectiveness of measures and quantify the current state of the epidemic. This paper illustrates the potential of this approach to build a new dynamic probabilistic model to estimate the prevalence of SARS-CoV-2 infections in different compartments. Methods: We propose a new probabilistic model in which, for the first time in the epidemic literature, parameter learning is carried out using gradient-free stochastic black-box optimization techniques simulating multiple trajectories of the infection dynamics in a general way, solving an inverse problem that is defined employing the daily information from mortality records. Results: After the application of the new proposal in Spain in the first and successive waves, the result of the model confirms the accuracy to estimate the seroprevalence and allows us to know the real dynamics of the pandemic a posteriori to assess the impact of epidemiological measures by the Spanish government and to plan more efficiently the subsequent decisions with the prior knowledge obtained. Conclusions:The model results allow us to estimate the daily patterns of COVID-19 infections in Spain retrospectively and examine the population’s exposure to the virus dynamically in contrast to seroprevalence surveys. Furthermore, given the flexibility of our simulation framework, we can model situations —even using non-parametric distributions between the different compartments in the model— that other models in the existing literature cannot. Our general optimization strategy remains valid in these cases, and we can easily create other non-standard simulation epidemic models that incorporate more complex and dynamic structures. | |||||
BibTeX:
@article{Matabuena2021,
author = {Matabuena, Marcos and Rodríguez-Mier, Pablo and García-Meixide, Carlos and Leborán, Victor},
title = {COVID-19: Estimation of the transmission dynamics in Spain using a stochastic simulator and black-box optimization techniques},
journal = {Computer Methods and Programs in Biomedicine},
year = {2021},
volume = {211},
pages = {106399},
url = {https://www.sciencedirect.com/science/article/pii/S0169260721004739},
doi = {https://doi.org/10.1016/j.cmpb.2021.106399}
}
|
|||||
| Matinrad, N., Andersson Granberg, T. and Angelakis, V. | Modeling uncertain task compliance in dispatch of volunteers to out-of-hospital cardiac arrest patients | 2021 | Computers & Industrial Engineering Vol. 159, pp. 107515 |
article | DOI URL |
| Abstract: In countries such as Sweden, Italy, Switzerland, and the Netherlands, projects in which volunteers are dispatched to out-of-hospital cardiac arrest (OHCA) patients with the use of mobile phones exist. Once an OHCA case is reported, a notification is sent to the mobile phones of registered volunteers that are in the vicinity of the patient. These projects mostly use static dispatch methods to determine which volunteers should be sent directly to the patient and which ones should pick up an automatic external defibrillator (AED). However, such schemes do not consider uncertainties associated with these task assignment decisions (e.g., if volunteers will do as instructed, or do something else). In this paper, we propose a method for optimized task assignment and dispatch of volunteers to OHCA patients that considers the uncertainty related to volunteers’ actions once assigned a task. We then compare the results of our method to those of a static dispatch method used in an ongoing mobile phone volunteer dispatch project in Sweden and validate them using simulation. Furthermore, we perform a sensitivity analysis on several parameters to investigate their effect on the performance of the proposed method. With the comparative results we show that the proposed method may help increase the survivability of OHCA patients. | |||||
BibTeX:
@article{Matinrad2021,
author = {Matinrad, Niki and Andersson Granberg, Tobias and Angelakis, Vangelis},
title = {Modeling uncertain task compliance in dispatch of volunteers to out-of-hospital cardiac arrest patients},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {159},
pages = {107515},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221004198},
doi = {https://doi.org/10.1016/j.cie.2021.107515}
}
|
|||||
| Mazzi, N., Grothey, A., McKinnon, K. and Sugishita, N. | Benders decomposition with adaptive oracles for large scale optimization | 2021 | Mathematical Programming Computation Vol. 13(4), pp. 683–703 |
article | DOI URL |
| Abstract: This paper proposes an algorithm to efficiently solve large optimization problems which exhibit a column bounded block-diagonal structure, where subproblems differ in right-hand side and cost coefficients. Similar problems are often tackled using cutting-plane algorithms, which allow for an iterative and decomposed solution of the problem. When solving subproblems is computationally expensive and the set of subproblems is large, cutting-plane algorithms may slow down severely. In this context we propose two novel adaptive oracles that yield inexact information, potentially much faster than solving the subproblem. The first adaptive oracle is used to generate inexact but valid cutting planes, and the second adaptive oracle gives a valid upper bound of the true optimal objective. These two oracles progressively “adapt” towards the true exact oracle if provided with an increasing number of exact solutions, stored throughout the iterations. These adaptive oracles are embedded within a Benders-type algorithm able to handle inexact information. We compare the Benders with adaptive oracles against a standard Benders algorithm on a stochastic investment planning problem. The proposed algorithm shows the capability to substantially reduce the computational effort to obtain an 𝜖 -optimal solution: an illustrative case is 31.9 times faster for a 1.00%convergence tolerance and 15.4 times faster for a 0.01%tolerance. | |||||
BibTeX:
@article{Mazzi2021,
author = {Mazzi, Nicolò and Grothey, Andreas and McKinnon, Ken and Sugishita, Nagisa},
title = {Benders decomposition with adaptive oracles for large scale optimization},
journal = {Mathematical Programming Computation},
year = {2021},
volume = {13},
number = {4},
pages = {683–703},
url = {https://doi.org/10.1007/s12532-020-00197-0},
doi = {https://doi.org/10.1007/s12532-020-00197-0}
}
|
|||||
| Miśkowicz, M. | Unfairness of Random Access with Collision Avoidance in Industrial Internet of Things Networks | 2021 | Sensors Vol. 21(21) |
article | DOI |
| Abstract: This paper is focused on the analysis of unfairness of random media access in Local Operating Networks (LON), which is one of the commercial platforms of the Industrial Internet of Things (IIoT). The unfairness in accessing the LON channel is introduced by a collision avoidance mechanism in the predictive p-persistent CSMA protocol adopted at the media access control layer. The study on the bandwidth share in predictive p-persistent CSMA calls for the analysis of multiple memoryless backoff. In this paper, it is shown that the channel access in LON systems is unfair in the short term for medium traffic load conditions, and in the long term for heavy loaded networks. Furthermore, it is explained that the average bandwidth allocated to a particular node is determined implicitly by the load scenario, while an actual node bandwidth fluctuates in time according to stochastic dynamics of the predictive p-persistent CSMA. Next, it is formally proven that the average bandwidth available to a node is a linear function of its backoff state and does not depend on backoff states of the other stations. Finally, it is demonstrated that possibly unfair bandwidth share in LON networks determined implicitly by load scenario is stable because, with lowering a fraction of actual network bandwidth accessible by a given station, the probability to decrease it in the future also drops. | |||||
BibTeX:
@article{Miskowicz2021,
author = {Miśkowicz, Marek},
title = {Unfairness of Random Access with Collision Avoidance in Industrial Internet of Things Networks},
journal = {Sensors},
year = {2021},
volume = {21},
number = {21},
doi = {https://doi.org/10.3390/s21217135}
}
|
|||||
| Modica, T., Colicchia, C., Tappia, E. and Melacini, M. | Empowering freight transportation through Logistics 4.0: a maturity model for value creation [BibTeX] |
2021 | Production Planning & Control, pp. 1–16 | article | DOI URL |
BibTeX:
@article{Modica2021,
author = {Modica, Tiziana and Colicchia, Claudia and Tappia, Elena and Melacini, Marco},
title = {Empowering freight transportation through Logistics 4.0: a maturity model for value creation},
journal = {Production Planning & Control},
year = {2021},
pages = {1–16},
url = {https://doi.org/10.1080/09537287.2021.1988176},
doi = {https://doi.org/10.1080/09537287.2021.1988176}
}
|
|||||
| Mosa, M.A. and Ali, A.A. | Energy management system of low voltage dc microgrid using mixed-integer nonlinear programing and a global optimization technique | 2021 | Electric Power Systems Research Vol. 192, pp. 106971 |
article | DOI URL |
| Abstract: Integration of a group of distributed generators (DGs) and loads in the form of a microgrid (MG) enhances the supply reliability, reduces the amount of greenhouse gasses (GHG) emission, and reduces the generation cost. However, this integration requires a refined energy management system (EMS). The MG-EMS dispatches the power between DGs to optimize either of the generation cost, the amount of GHG emissions, or both simultaneously. Minimum cost scenario needs an accurate generation cost model for each DG. In this paper, generation cost model includes the no-load cost and nonlinear behavior of losses inside the DG. In addition, the start/stop cost of DGs and power losses within the MG are also considered. The proposed optimization problem becomes a non-convex mixed integer nonlinear (MINL) problem which is hard to solve. The paper suggests using branch and reduce optimization navigator (BARON) algorithm, a global optimization technique. Minimum cost and minimum emission scenarios are single objective problems, while operation at reasonable emission and cost is a multi-objective scenario. Results of the single objective scenarios are exploited to determine feasible constraints to optimize the multi-objective scenario using constraints approach. Eventually, the capability of an energy storage system (ESS) to compensate generation shortage and minimize the emission is also investigated. The study is carried out on a DC microgrid comprised of photovoltaic (PV), fuel cell (FC), microturbine (MT), diesel generator (DE), battery ESS, and Egyptian grid load profiles over four seasons of the year. | |||||
BibTeX:
@article{Mosa2021,
author = {Mosa, Magdi A. and Ali, A. A.},
title = {Energy management system of low voltage dc microgrid using mixed-integer nonlinear programing and a global optimization technique},
journal = {Electric Power Systems Research},
year = {2021},
volume = {192},
pages = {106971},
url = {https://www.sciencedirect.com/science/article/pii/S0378779620307690},
doi = {https://doi.org/10.1016/j.epsr.2020.106971}
}
|
|||||
| Nguyen, H.-T.-M., Ha, P.V. and Kompas, T. | Optimal surveillance against bioinvasions: a sample average approximation method applied to an agent-based spread model | 2021 | Ecological Applications Vol. 31(8), pp. e02449 |
article | DOI URL |
| Abstract: Abstract Trade-offs exist between the point of early detection and the future cost of controlling any invasive species. Finding optimal levels of early detection, with post-border active surveillance, where time, space and randomness are explicitly considered, is computationally challenging. We use a stochastic programming model to find the optimal level of surveillance and predict damages, easing the computational challenge by combining a sample average approximation (SAA) approach and parallel processing techniques. The model is applied to the case of Asian Papaya Fruit Fly (PFF), a highly destructive pest, in Queensland, Australia. To capture the non-linearity in PFF spread, we use an agent-based model (ABM), which is calibrated to a highly detailed land-use raster map (50?m???50?m) and weather-related data, validated against a historical outbreak. The combination of SAA and ABM sets our work apart from the existing literature. Indeed, despite its increasing popularity as a powerful analytical tool, given its granularity and capability to model the system of interest adequately, the complexity of ABM limits its application in optimizing frameworks due to considerable uncertainty about solution quality. In this light, the use of SAA ensures quality in the optimal solution (with a measured optimality gap) while still being able to handle large-scale decision-making problems. With this combination, our application suggests that the optimal (economic) trap grid size for PFF in Queensland is ?0.7?km, much smaller than the currently implemented level of 5?km. Although the current policy implies a much lower surveillance cost per year, compared with the 2.08?million under our optimal policy, the expected total cost of an outbreak is 23.92?million, much higher than the optimal policy of roughly $7.74?million. | |||||
BibTeX:
@article{Nguyen2021,
author = {Nguyen, Hoa-Thi-Minh and Ha, Pham Van and Kompas, Tom},
title = {Optimal surveillance against bioinvasions: a sample average approximation method applied to an agent-based spread model},
journal = {Ecological Applications},
year = {2021},
volume = {31},
number = {8},
pages = {e02449},
note = {https://doi.org/10.1002/eap.2449},
url = {https://doi.org/10.1002/eap.2449},
doi = {https://doi.org/10.1002/eap.2449}
}
|
|||||
| Nikolaidis, P. and Chatzis, S. | Gaussian process-based Bayesian optimization for data-driven unit commitment | 2021 | International Journal of Electrical Power & Energy Systems Vol. 130, pp. 106930 |
article | DOI URL |
| Abstract: Global efforts aiming to shift towards de-carbonization give rise to remarkable challenges for power systems and their operators. Modern power systems need to deal with the uncertain and volatile behavior of their components (especially, renewable energy generation); this necessitates the use of increased operating reserves. To ameliorate this expensive requirement, intelligent systems for determining appropriate unit commitment schedules have risen as a promising solution. This is especially the case for weak power systems with low dispatching flexibility and high dependency on imported fossil fuels. In this work, we introduce a radically new paradigm for addressing the optimal unit commitment problem, that is capable of accounting for the largely unaddressed challenge of the uncertain and volatile behavior of modern power systems. Our solution leverages widely adopted developments in the field of uncertainty-aware machine learning models, namely Bayesian optimization. This framework enables the effective discovery of the best possible configuration of a volatile system with uncertain and unknown dynamics, without the need of introducing restrictive prior assumptions. Based on appropriately selected acquisition function and Gaussian process regression, it constitutes a radically different from existing approaches, which heavily rely on heuristic approximations and do not allow to account for volatile behavioral patterns. On the contrary, it guarantees global optimum solutions in non-convex optimization tasks in the least possible number of trials. The demonstrated results show better performance in terms of total production cost and number of function evaluations, inspiring system operators to better schedule their power networks in the forthcoming, de-carbonized grids. | |||||
BibTeX:
@article{Nikolaidis2021,
author = {Nikolaidis, Pavlos and Chatzis, Sotirios},
title = {Gaussian process-based Bayesian optimization for data-driven unit commitment},
journal = {International Journal of Electrical Power & Energy Systems},
year = {2021},
volume = {130},
pages = {106930},
url = {https://www.sciencedirect.com/science/article/pii/S0142061521001708},
doi = {https://doi.org/10.1016/j.ijepes.2021.106930}
}
|
|||||
| Nycander, E., Morales-España, G. and Söder, L. | Security constrained unit commitment with continuous time-varying reserves | 2021 | Electric Power Systems Research Vol. 199, pp. 107276 |
article | DOI URL |
| Abstract: This paper presents a security constrained unit commitment (SCUC) with continuous intra-hour time-varying reserves. The hourly formulation extends the power-based UC formulation and has reserves which vary continuously within the hour, as opposed to the traditional hourly energy-based SCUC that uses constant reserves within the hour. We show that the traditional hourly energy-based formulation cannot ensure N-1 security at all times, since this formulation is not able to take the power trajectories of units within the hour into account. This is remedied by an hourly power-based version which allows the formulation of contingency constraints to guarantee N-1 security at all times within the hour. The proposed formulation uses continuous time-varying reserves which lowers the cost for providing reserves and makes better use of units’ flexibility while still ensuring N-1 security. The energy-based and power-based formulations are evaluated using different versions of a 5-min security-constrained economic dispatch (SCED) based on real load data, thus simulating the real time operation of the system under different assumptions for reserve procurement. The results show that the power-based formulation increases security compared to the energy-based formulation, both if reserves are fixed to the values from the SCUC or co-optimized in real time by the SCED. | |||||
BibTeX:
@article{Nycander2021,
author = {Nycander, Elis and Morales-España, Germán and Söder, Lennart},
title = {Security constrained unit commitment with continuous time-varying reserves},
journal = {Electric Power Systems Research},
year = {2021},
volume = {199},
pages = {107276},
url = {https://www.sciencedirect.com/science/article/pii/S0378779621002571},
doi = {https://doi.org/10.1016/j.epsr.2021.107276}
}
|
|||||
| de Oliveira, H.C., You, J. and Coelho, A.P. | Governing coalitions and key performance indicators of port governance | 2021 | Maritime Transport Research Vol. 2, pp. 100023 |
article | DOI URL |
| Abstract: The port is a crucial part of the international transportation of goods. As technological advances in the maritime industry have driven drastic changes in port policies, scholars have studied decisions on cargo shipping, port regulatory frameworks, and the interests involved in such changes. However, the connection of policy actors to port performance in the maritime transport literature remains largely understudied due to the complexity and heterogeneity of institutional designs chosen by countries. To move towards filling the gap, this paper explores links between governing coalitions and key performance indicators of port governance. We propose eight typologies for classifying governing coalitions of port governance, drawing insights from the Advocacy Coalition Framework. We then explore how different port governance forms are associated with key performance indicators of 17 countries. This paper finds that countries opting for decentralization do not necessarily support trade liberalization or port privatization. The results also show that decentralized governing coalitions are positively associated with higher key performance indicators of port governance. | |||||
BibTeX:
@article{Oliveira2021,
author = {de Oliveira, Henrique Campos and You, Jongeun and Coelho, André Pires},
title = {Governing coalitions and key performance indicators of port governance},
journal = {Maritime Transport Research},
year = {2021},
volume = {2},
pages = {100023},
url = {https://www.sciencedirect.com/science/article/pii/S2666822X21000150},
doi = {https://doi.org/10.1016/j.martra.2021.100023}
}
|
|||||
| Ordoudis, C., Nguyen, V.A., Kuhn, D. and Pinson, P. | Energy and reserve dispatch with distributionally robust joint chance constraints | 2021 | Operations Research Letters Vol. 49(3), pp. 291–299 |
article | DOI URL |
| Abstract: We develop a two-stage stochastic program for energy and reserve dispatch of a joint power and gas system with a high penetration of renewables. Data-driven distributionally robust chance constraints ensure that there is no load shedding and renewable spillage with high probability. We solve this problem efficiently using conditional value-at-risk approximations and linear decision rules. Out-of-sample experiments show that this model dominates the corresponding stochastic program without chance constraints that models the effects of load shedding and renewable spillage explicitly. | |||||
BibTeX:
@article{Ordoudis2021,
author = {Ordoudis, Christos and Nguyen, Viet Anh and Kuhn, Daniel and Pinson, Pierre},
title = {Energy and reserve dispatch with distributionally robust joint chance constraints},
journal = {Operations Research Letters},
year = {2021},
volume = {49},
number = {3},
pages = {291–299},
url = {https://www.sciencedirect.com/science/article/pii/S0167637721000213},
doi = {https://doi.org/10.1016/j.orl.2021.01.012}
}
|
|||||
| Pang, J., Huang, Y., Xie, Z., Han, Q. and Cai, Z. | Realizing the Heterogeneity: A Self-Organized Federated Learning Framework for IoT [BibTeX] |
2021 | IEEE Internet of Things Journal Vol. 8(5), pp. 3088–3098 |
article | DOI |
BibTeX:
@article{Pang2021,
author = {Pang, J. and Huang, Y. and Xie, Z. and Han, Q. and Cai, Z.},
title = {Realizing the Heterogeneity: A Self-Organized Federated Learning Framework for IoT},
journal = {IEEE Internet of Things Journal},
year = {2021},
volume = {8},
number = {5},
pages = {3088–3098},
doi = {https://doi.org/10.1109/JIOT.2020.3007662}
}
|
|||||
| Paprocka, I., Krenczyk, D. and Burduk, A. | The Method of Production Scheduling with Uncertainties Using the Ants Colony Optimisation [BibTeX] |
2021 | Applied Sciences Vol. 11(1), pp. 171 |
article | URL |
BibTeX:
@article{Paprocka2021,
author = {Paprocka, Iwona and Krenczyk, Damian and Burduk, Anna},
title = {The Method of Production Scheduling with Uncertainties Using the Ants Colony Optimisation},
journal = {Applied Sciences},
year = {2021},
volume = {11},
number = {1},
pages = {171},
url = {https://www.mdpi.com/2076-3417/11/1/171}
}
|
|||||
| de la Peña Zarzuelo, I. | Cybersecurity in ports and maritime industry: Reasons for raising awareness on this issue | 2021 | Transport Policy Vol. 100, pp. 1–4 |
article | DOI URL |
| Abstract: The port industry is constantly evolving and this evolution brings about change in many different areas. Some of these areas are: operational and infrastructural capabilities, governance models and administrative frameworks, the introduction of new technologies or alliances and business strategies. Nowadays, one of the main drivers of changes in the ports sector is the digital transformation that smart ports are experiencing. The level of integration of different devices, agents and activities, together with an increasing connectivity between different ports has created a new ecosystem in which new risks have appeared. Cybersecurity is one of the challenges of the industry and policymakers should work alongside the private sector to ensure these critical infrastructures are adequately protected while facilitating the full development of new technologies in a sector that has relatively lagged behind others in transitioning to the new ‘4.0 world’. | |||||
BibTeX:
@article{PenaZarzuelo2021,
author = {de la Peña Zarzuelo, Ignacio},
title = {Cybersecurity in ports and maritime industry: Reasons for raising awareness on this issue},
journal = {Transport Policy},
year = {2021},
volume = {100},
pages = {1–4},
url = {https://www.sciencedirect.com/science/article/pii/S0967070X20308945},
doi = {https://doi.org/10.1016/j.tranpol.2020.10.001}
}
|
|||||
| Pichler, A. and Shapiro, A. | Mathematical Foundations of Distributionally Robust Multistage Optimization [BibTeX] |
2021 | SIAM Journal on Optimization Vol. 31(4), pp. 3044–3067 |
article | DOI URL |
BibTeX:
@article{Pichler2021,
author = {Pichler, Alois and Shapiro, Alexander},
title = {Mathematical Foundations of Distributionally Robust Multistage Optimization},
journal = {SIAM Journal on Optimization},
year = {2021},
volume = {31},
number = {4},
pages = {3044–3067},
url = {https://doi.org/10.1137/21M1390517},
doi = {https://doi.org/10.1137/21M1390517}
}
|
|||||
| Pregnolato, M., Kermanshah, A. and Wisetjindawat, W. | Effects of Weather | 2021 | International Encyclopedia of Transportation, pp. 742–750 | inbook | DOI URL |
| Abstract: Transportation systems are the lifeblood of countries and cities, supporting mobility for people, goods exchange, and businesses connectivity. The efficient and sustainable performance of these systems is crucial in all urban, rural, and in between spaces, not least for emergency management (e.g., evacuation, rescue, and recovery). Urban transportation systems (UTSs) are under increasing pressure due to increase of demand, aging and deterioration, and the impacts from weather-related hazards. These hazards can be very disruptive for transportation systems, both at financial and societal level. The focus of this chapter is on safety of UTSs. After a general overview of all major impacts to UTSs due to natural and man-made hazards, the chapter emphasizes how roadway conditions are influenced by a variety of adverse weather events (e.g., snow, rain, heat, and windstorm) in terms of safety, service delivery, and accessibility. This chapter also provides the thresholds of adverse weather events that can impact roadway conditions in different countries around the world to give the readers a better understanding of geographical location importance in the context of road safety. This chapter will also introduce three international case studies within transportation networks, putting them in the wider context of traditional approaches to study these systems. The topic is discussed by underlining multi-disciplinary cross-cutting issues to invite the reader to personal reflection and creative thinking. | |||||
BibTeX:
@inbook{Pregnolato2021,
author = {Pregnolato, Maria and Kermanshah, Amirhassan and Wisetjindawat, Wisinee},
title = {Effects of Weather},
booktitle = {International Encyclopedia of Transportation},
publisher = {Elsevier},
year = {2021},
pages = {742–750},
url = {https://www.sciencedirect.com/science/article/pii/B9780081026717102076},
doi = {https://doi.org/10.1016/B978-0-08-102671-7.10207-6}
}
|
|||||
| Rupp, J., Boysen, N. and Briskorn, D. | Optimizing consolidation processes in hubs: The hub-arrival-departure problem | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: To realize economies of scale in transportation, hubs are important entities in today’s distribution networks. Hubs, such as cross docks for trucks, central ports for container vessels, transshipment yards for freight trains, and air hubs for airplanes, allow to consolidate less-than-vehicle-load shipments and to improve the utilization of transport capacities. In this context, we consider a generic optimization problem to streamline hub processes. We assign vehicles consolidating their shipments at a central hub each an arrival time slot where a vehicle is unloaded and a later departure time slot where it is loaded with the goods it takes back to its designated territory. Since the processing of goods inside a hub terminal takes some time, we want to synchronize the exchange of goods among vehicles such that three different consolidation-oriented objectives are optimized. For instance, we aim to minimize the number of goods missing their dedicated departures after a fixed consolidation time for goods inside the hub. We prove important structural properties, provide a comprehensive analysis of computational complexity, and derive suited solution procedures. Our problem occurs in the real world at the air hub of postal service provider DHL in Leipzig, where freight airplanes from all over the world exchange goods and need to be assigned landing and departure slots on the runway. Our problem, however, is generic, and we sketch some extensions in order to adapt it to further hubs. | |||||
BibTeX:
@article{Rupp2021,
author = {Rupp, Johannes and Boysen, Nils and Briskorn, Dirk},
title = {Optimizing consolidation processes in hubs: The hub-arrival-departure problem},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005968},
doi = {https://doi.org/10.1016/j.ejor.2021.07.001}
}
|
|||||
| Safipour, H., Abdollahi, A., Hajmohammadi, M.S. and Alizadeh, M.I. | A novel evolving framework for energy management in wind-gas reinforced unit commitment with demand response | 2021 | IET Renewable Power Generation Vol. n/a(n/a) |
article | DOI URL |
| Abstract: Abstract This research work tries to investigate the provision of flexibility on both sides of production and demand security constraint unit commitment (SCUC) before the schedule is considered. To this end, a powerful heuristic technique based on modified firefly algorithm (FA) is devised to achieve the optimal solution. Moreover, fast-starting gas units (FGUs) are considered as providers of lateral flexibility as a result of their quickness in starting work and high ramp capability. Considering the fact that the normal operation of units is subject to the supply of reliable gas through connected gas transmission lines, the uncertainty of gas supply in the suggested model is considered to imitate the effects of deviation in the volume of gas over pipelines. The application of the suggested model has been tested on IEEE-118 bus. | |||||
BibTeX:
@article{Safipour2021,
author = {Safipour, Hamed and Abdollahi, Amir and Hajmohammadi, Mohammad Sadegh and Alizadeh, Mohammad Iman},
title = {A novel evolving framework for energy management in wind-gas reinforced unit commitment with demand response},
journal = {IET Renewable Power Generation},
year = {2021},
volume = {n/a},
number = {n/a},
note = {https://doi.org/10.1049/rpg2.12294},
url = {https://doi.org/10.1049/rpg2.12294},
doi = {https://doi.org/10.1049/rpg2.12294}
}
|
|||||
| Saha, G. and Abouzeid, A.A. | Optimal Spectrum Partitioning and Licensing in Tiered Access Under Stochastic Market Models [BibTeX] |
2021 | IEEE/ACM Transactions on Networking Vol. 29(5), pp. 1948–1961 |
article | DOI |
BibTeX:
@article{Saha2021,
author = {Saha, G. and Abouzeid, A. A.},
title = {Optimal Spectrum Partitioning and Licensing in Tiered Access Under Stochastic Market Models},
journal = {IEEE/ACM Transactions on Networking},
year = {2021},
volume = {29},
number = {5},
pages = {1948–1961},
doi = {https://doi.org/10.1109/TNET.2021.3077643}
}
|
|||||
| Samorani, M., Harris, S.L., Blount, L.G., Lu, H. and Santoro, M.A. | Overbooked and Overlooked: Machine Learning and Racial Bias in Medical Appointment Scheduling | 2021 | Manufacturing & Service Operations Management | article | DOI URL |
| Abstract: Problem definition: Machine learning is often employed in appointment scheduling to identify the patients with the greatest no-show risk, so as to schedule them into or right after overbooked slots. That scheduling decision maximizes the clinic performance, as measured by a weighted sum of all patients? waiting time and the provider?s overtime and idle time. However, if a racial group is characterized by a higher no-show risk, then the patients belonging to that racial group will be scheduled into or right after overbooked slots disproportionately to the general population. Academic/Practical Relevance: That scheduling decision is problematic because patients scheduled in those slots tend to have a worse service experience than the other patients, as measured by the time they spend in the waiting room. Thus, the challenge becomes minimizing the schedule cost while avoiding racial disparities. Methodology: Motivated by the real-world case of a large specialty clinic whose black patients have a higher no-show probability than non-black patients, we analytically study racial disparity in this context. Then, we propose new objective functions that minimize both schedule cost and racial disparity and that can be readily adopted by researchers and practitioners. We develop a race-aware objective, which instead of minimizing the waiting times of all patients, minimizes the waiting times of the racial group expected to wait the longest. We also develop race-unaware methodologies that do not consider race explicitly. We validate our findings both on simulated and real-world data. Results: We demonstrate that state-of-the-art scheduling systems cause the black patients in our data set to wait about 30% longer than nonblack patients. Our race-aware methodology achieves both goals of eliminating racial disparity and obtaining a similar schedule cost as that obtained by the state-of-the-art scheduling method, whereas the race-unaware methodologies fail to obtain both efficiency and fairness. Managerial implications: Our work uncovers that the traditional objective of minimizing schedule cost may lead to unintended racial disparities. Both efficiency and fairness can be achieved by adopting a race-aware objective. | |||||
BibTeX:
@article{Samorani2021,
author = {Samorani, Michele and Harris, Shannon L. and Blount, Linda Goler and Lu, Haibing and Santoro, Michael A.},
title = {Overbooked and Overlooked: Machine Learning and Racial Bias in Medical Appointment Scheduling},
journal = {Manufacturing & Service Operations Management},
year = {2021},
note = {doi: 10.1287/msom.2021.0999},
url = {https://doi.org/10.1287/msom.2021.0999},
doi = {https://doi.org/10.1287/msom.2021.0999}
}
|
|||||
| Schultz, M., Reitmann, S. and Alam, S. | Predictive classification and understanding of weather impact on airport performance through machine learning | 2021 | Transportation Research Part C: Emerging Technologies Vol. 131, pp. 103119 |
article | DOI URL |
| Abstract: Efficient airport operations depend on appropriate actions and reactions to current constraints. Local weather events and their impact on airport performance may have network-wide effects. The classification of expected weather impacts enables efficient consideration in airport operations on a tactical level. We classify airport performance with recurrent and convolutional neural networks considering weather data. We are using London–Gatwick Airport to apply our developed approach. The weather data is derived from local meteorological reports and airport performance is derived from both flight plan data and reported delays. We show that the application of machine learning approaches is an appropriate method to quantify the correlation between decreased airport performance and the severity of local weather events. The developed models could achieve prediction accuracy higher than 90% for departure movements. We see our approach as one key element for a deeper understanding of interdependencies between local and network operations in the air transportation system. | |||||
BibTeX:
@article{Schultz2021,
author = {Schultz, Michael and Reitmann, Stefan and Alam, Sameer},
title = {Predictive classification and understanding of weather impact on airport performance through machine learning},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2021},
volume = {131},
pages = {103119},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X21001388},
doi = {https://doi.org/10.1016/j.trc.2021.103119}
}
|
|||||
| Sedghi, M., Kauppila, O., Bergquist, B., Vanhatalo, E. and Kulahci, M. | A taxonomy of railway track maintenance planning and scheduling: A review and research trends | 2021 | Reliability Engineering & System Safety Vol. 215, pp. 107827 |
article | DOI URL |
| Abstract: Railway track maintenance and renewal are vital for railway safety, train punctuality, and travel comfort. Therefore, having cost-effective maintenance is critical in managing railway infrastructure assets. There has been a considerable amount of research performed on mathematical and decision support models for improving the application of railway track maintenance planning and scheduling. This article reviews the literature in decision support models for railway track maintenance planning and scheduling and transforms the results into a problem taxonomy. Furthermore, the article discusses current approaches in optimising maintenance planning and scheduling, research trends, and possible gaps in the related decision-making models. | |||||
BibTeX:
@article{Sedghi2021,
author = {Sedghi, Mahdieh and Kauppila, Osmo and Bergquist, Bjarne and Vanhatalo, Erik and Kulahci, Murat},
title = {A taxonomy of railway track maintenance planning and scheduling: A review and research trends},
journal = {Reliability Engineering & System Safety},
year = {2021},
volume = {215},
pages = {107827},
url = {https://www.sciencedirect.com/science/article/pii/S0951832021003483},
doi = {https://doi.org/10.1016/j.ress.2021.107827}
}
|
|||||
| Shapiro, A. | Distributionally robust Optimal Control and MDP modeling | 2021 | Operations Research Letters Vol. 49(5), pp. 809–814 |
article | DOI URL |
| Abstract: In this paper we discuss Optimal Control and Markov Decision Process (MDP) formulations of multistage optimization problems when the involved probability distributions are not known exactly, but rather are assumed to belong to specified ambiguity families. The aim of this paper is to clarify a connection between such distributionally robust approaches to multistage stochastic optimization. | |||||
BibTeX:
@article{Shapiro2021,
author = {Shapiro, Alexander},
title = {Distributionally robust Optimal Control and MDP modeling},
journal = {Operations Research Letters},
year = {2021},
volume = {49},
number = {5},
pages = {809–814},
url = {https://www.sciencedirect.com/science/article/pii/S0167637721001310},
doi = {https://doi.org/10.1016/j.orl.2021.08.013}
}
|
|||||
| Shapiro, A. | Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming | 2021 | European Journal of Operational Research Vol. 288(1), pp. 1–13 |
article | DOI URL |
| Abstract: In this tutorial we discuss several aspects of modeling and solving multistage stochastic programming problems. In particular we discuss distributionally robust and risk averse approaches to multistage stochastic programming, and the involved concept of time consistency. This tutorial is aimed at presenting a certain point of view on multistage stochastic optimization, rather than a complete survey of the topic. | |||||
BibTeX:
@article{Shapiro2021a,
author = {Shapiro, Alexander},
title = {Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming},
journal = {European Journal of Operational Research},
year = {2021},
volume = {288},
number = {1},
pages = {1–13},
url = {https://www.sciencedirect.com/science/article/pii/S0377221720302988},
doi = {https://doi.org/10.1016/j.ejor.2020.03.065}
}
|
|||||
| Shapiro, A., Dentcheva, D. and Ruszczynski, A. | Lectures on Stochastic Programming: Modeling and Theory, Third Edition [BibTeX] |
2021 | , pp. 542 | book | DOI URL |
BibTeX:
@book{Shapiro2021b,
author = {Shapiro, Alexander and Dentcheva, Darinka and Ruszczynski, Andrzej},
title = {Lectures on Stochastic Programming: Modeling and Theory, Third Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2021},
pages = {542},
note = {doi:10.1137/1.9781611976595},
url = {https://doi.org/10.1137/1.9781611976595},
doi = {https://doi.org/10.1137/1.9781611976595}
}
|
|||||
| Shavazipour, B., Kwakkel, J.H. and Miettinen, K. | Multi-scenario multi-objective robust optimization under deep uncertainty: A posteriori approach | 2021 | Environmental Modelling & Software Vol. 144, pp. 105134 |
article | DOI URL |
| Abstract: This paper proposes a novel optimization approach for multi-scenario multi-objective robust decision making, as well as an alternative way for scenario discovery and identifying vulnerable scenarios even before any solution generation. To demonstrate and test the novel approach, we use the classic shallow lake problem. We compare the results obtained with the novel approach to those obtained with previously used approaches. We show that the novel approach guarantees the feasibility and robust efficiency of the produced solutions under all selected scenarios, while decreasing computation cost, addresses the scenario-dependency issues, and enables the decision-makers to explore the trade-off between optimality/feasibility in any selected scenario and robustness across a broader range of scenarios. We also find that the lake problem is ill-suited for reflecting trade-offs in robust performance over the set of scenarios and Pareto optimality in any specific scenario, highlighting the need for novel benchmark problems to properly evaluate novel approaches. | |||||
BibTeX:
@article{Shavazipour2021,
author = {Shavazipour, Babooshka and Kwakkel, Jan H. and Miettinen, Kaisa},
title = {Multi-scenario multi-objective robust optimization under deep uncertainty: A posteriori approach},
journal = {Environmental Modelling & Software},
year = {2021},
volume = {144},
pages = {105134},
url = {https://www.sciencedirect.com/science/article/pii/S1364815221001778},
doi = {https://doi.org/10.1016/j.envsoft.2021.105134}
}
|
|||||
| Shone, R., Glazebrook, K. and Zografos, K.G. | Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty | 2021 | European Journal of Operational Research Vol. 292(1), pp. 1–26 |
article | DOI URL |
| Abstract: In this paper we provide a wide-ranging review of the literature on stochastic modeling applications within aviation, with a particular focus on problems involving demand and capacity management and the mitigation of air traffic congestion. From an operations research perspective, the main techniques of interest include analytical queueing theory, stochastic optimal control, robust optimization and stochastic integer programming. Applications of these techniques include the prediction of operational delays at airports, pre-tactical control of aircraft departure times, dynamic control and allocation of scarce airport resources and various others. We provide a critical review of recent developments in the literature and identify promising research opportunities for stochastic modelers within air traffic management. | |||||
BibTeX:
@article{Shone2021,
author = {Shone, Rob and Glazebrook, Kevin and Zografos, Konstantinos G.},
title = {Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty},
journal = {European Journal of Operational Research},
year = {2021},
volume = {292},
number = {1},
pages = {1–26},
url = {https://www.sciencedirect.com/science/article/pii/S0377221720309164},
doi = {https://doi.org/10.1016/j.ejor.2020.10.039}
}
|
|||||
| Siozos-Rousoulis, L., Robert, D. and Verbeke, W. | A study of the U.S. domestic air transportation network: temporal evolution of network topology and robustness from 2001 to 2016 | 2021 | Journal of Transportation Security Vol. 14(1), pp. 55–78 |
article | DOI URL |
| Abstract: The U.S. air transportation network (ATN) is critical to the mobility and the functioning of the United States. It is thus necessary to ensure that it is well-connected, efficient, robust, and secure. Despite extensive research on its topology, the temporal evolution of the network’s robustness remains largely unexplored. In the present paper, a methodology is proposed to identify long-term trends in the evolution of the network’s topology and robustness over time. The study of the U.S. domestic ATN’s robustness was performed based on annual flight data from 1996 to 2016 and network analytics were used to examine the effects of restructuring that followed the 9/11 events. Centrality measures were computed and a node deletion method was applied to assess the network’s tolerance to a targeted attack scenario. The outcome of this study indicated that the 9/11 terrorist attacks triggered vast restructuring of the network, in terms of efficiency and security. Air traffic expanded, as new airports and air routes were introduced, allowing the network to recover rapidly and become more efficient. Security concerns resulted in significant improvement of the network’s robustness. Since 2001, the global traffic and topological properties of the U.S. ATN have displayed continuous growth, due to the network’s expansion. On the other hand, the results suggest that although the system’s ability to sustain its operational level under extreme circumstances has lately improved, its tolerance to targeted attacks has deteriorated. The presented methodology has shown its potential to be applied on different network levels or different transportation networks, in order to provide a general perspective of the system’s vulnerabilities. | |||||
BibTeX:
@article{SiozosRousoulis2021,
author = {Siozos-Rousoulis, Leonidas and Robert, Dimitri and Verbeke, Wouter},
title = {A study of the U.S. domestic air transportation network: temporal evolution of network topology and robustness from 2001 to 2016},
journal = {Journal of Transportation Security},
year = {2021},
volume = {14},
number = {1},
pages = {55–78},
url = {https://doi.org/10.1007/s12198-020-00227-x},
doi = {https://doi.org/10.1007/s12198-020-00227-x}
}
|
|||||
| Sun, L., Jin, Y., Shen, J. and You, F. | Sustainable Residential Micro-Cogeneration System Based on a Fuel Cell Using Dynamic Programming-Based Economic Day-Ahead Scheduling | 2021 | ACS Sustainable Chemistry & Engineering Vol. 9(8), pp. 3258–3266 |
article | DOI URL |
| Abstract: Fuel cells are widely deemed as a sustainable cogeneration technology that promises great decarbonization potential. However, economic operations of such sustainable energy systems are challenging because of the coupling between the heat and power generation, as well as the imbalance between the production and consumption. To this end, this paper proposes an economic day-ahead scheduling strategy for a sustainable cogeneration system, consisting of fuel cell, battery, thermal energy storage (TES), and heat pump. Based on the component models, a dynamic programming framework is formulated, in which the optimization objective is minimizing the accumulative fuel consumption and the constraints are derived from safety requirements. Optimization based on a typical 24-h load profile results in an hourly heat and power flow pattern to exhibit a highly coordinated and complementary operation scenario within the whole planning horizon. The benefits of energy storage are fully exploited and the energy-saving potential of each component is explored. It is revealed that the incorporation of TES into the sustainable energy systems brings about 3.5% overall efficiency improvement and healthier battery operations. The effects of TES capacity on the efficiency of the sustainable energy systems are also discussed. | |||||
BibTeX:
@article{Sun2021,
author = {Sun, Li and Jin, Yuhui and Shen, Jiong and You, Fengqi},
title = {Sustainable Residential Micro-Cogeneration System Based on a Fuel Cell Using Dynamic Programming-Based Economic Day-Ahead Scheduling},
journal = {ACS Sustainable Chemistry & Engineering},
year = {2021},
volume = {9},
number = {8},
pages = {3258–3266},
url = {https://doi.org/10.1021/acssuschemeng.0c08725},
doi = {https://doi.org/10.1021/acssuschemeng.0c08725}
}
|
|||||
| Sun, L. and You, F. | Machine Learning and Data-Driven Techniques for the Control of Smart Power Generation Systems: An Uncertainty Handling Perspective | 2021 | Engineering Vol. 7(9), pp. 1239–1247 |
article | DOI URL |
| Abstract: Due to growing concerns regarding climate change and environmental protection, smart power generation has become essential for the economical and safe operation of both conventional thermal power plants and sustainable energy. Traditional first-principle model-based methods are becoming insufficient when faced with the ever-growing system scale and its various uncertainties. The burgeoning era of machine learning (ML) and data-driven control (DDC) techniques promises an improved alternative to these outdated methods. This paper reviews typical applications of ML and DDC at the level of monitoring, control, optimization, and fault detection of power generation systems, with a particular focus on uncovering how these methods can function in evaluating, counteracting, or withstanding the effects of the associated uncertainties. A holistic view is provided on the control techniques of smart power generation, from the regulation level to the planning level. The benefits of ML and DDC techniques are accordingly interpreted in terms of visibility, maneuverability, flexibility, profitability, and safety (abbreviated as the “5-TYs”), respectively. Finally, an outlook on future research and applications is presented. | |||||
BibTeX:
@article{Sun2021a,
author = {Sun, Li and You, Fengqi},
title = {Machine Learning and Data-Driven Techniques for the Control of Smart Power Generation Systems: An Uncertainty Handling Perspective},
journal = {Engineering},
year = {2021},
volume = {7},
number = {9},
pages = {1239–1247},
url = {https://www.sciencedirect.com/science/article/pii/S2095809921002708},
doi = {https://doi.org/10.1016/j.eng.2021.04.020}
}
|
|||||
| Suvarna, M., Yap, K.S., Yang, W., Li, J., Ng, Y.T. and Wang, X. | Cyber–Physical Production Systems for Data-Driven, Decentralized, and Secure Manufacturing—A Perspective | 2021 | Engineering Vol. 7(9), pp. 1212–1223 |
article | DOI URL |
| Abstract: With the concepts of Industry 4.0 and smart manufacturing gaining popularity, there is a growing notion that conventional manufacturing will witness a transition toward a new paradigm, targeting innovation, automation, better response to customer needs, and intelligent systems. Within this context, this review focuses on the concept of cyber–physical production system (CPPS) and presents a holistic perspective on the role of the CPPS in three key and essential drivers of this transformation: data-driven manufacturing, decentralized manufacturing, and integrated blockchains for data security. The paper aims to connect these three aspects of smart manufacturing and proposes that through the application of data-driven modeling, CPPS will aid in transforming manufacturing to become more intuitive and automated. In turn, automated manufacturing will pave the way for the decentralization of manufacturing. Layering blockchain technologies on top of CPPS will ensure the reliability and security of data sharing and integration across decentralized systems. Each of these claims is supported by relevant case studies recently published in the literature and from the industry; a brief on existing challenges and the way forward is also provided. | |||||
BibTeX:
@article{Suvarna2021,
author = {Suvarna, Manu and Yap, Ken Shaun and Yang, Wentao and Li, Jun and Ng, Yen Ting and Wang, Xiaonan},
title = {Cyber–Physical Production Systems for Data-Driven, Decentralized, and Secure Manufacturing—A Perspective},
journal = {Engineering},
year = {2021},
volume = {7},
number = {9},
pages = {1212–1223},
url = {https://www.sciencedirect.com/science/article/pii/S2095809921002988},
doi = {https://doi.org/10.1016/j.eng.2021.04.021}
}
|
|||||
| Terbrack, H., Claus, T. and Herrmann, F. | Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme | 2021 | Sustainability Vol. 13(23) |
article | DOI |
| Abstract: Scarcity of resources, structural change during the further development of renewable energy sources, and their corresponding costs, such as increasing resource costs or penalties due to dirty production, lead industrial firms to adapt ecological actions. In this regard, research on energy utilization in production planning has received increased attention in the last years, resulting in a large number of research articles so far. With the paper at hand, we review the literature on energy-oriented production planning. The aim of this study is to derive similar core issues and related properties along energy-oriented models within hierarchical production planning. For this, we carry out a systematic literature review and analyze and synthesize 375 research articles. We classify the underlying literature with a novel two-dimensional classification scheme and identify three key topics and five frequently found characteristics, which are presented in detail throughout this article. Based on these results, we state several potentials for further research. | |||||
BibTeX:
@article{Terbrack2021,
author = {Terbrack, Hajo and Claus, Thorsten and Herrmann, Frank},
title = {Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme},
journal = {Sustainability},
year = {2021},
volume = {13},
number = {23},
doi = {https://doi.org/10.3390/su132313317}
}
|
|||||
| Thaduri, A., Garmabaki, A. and Kumar, U. | Impact of climate change on railway operation and maintenance in Sweden: A State-of-the-art review [BibTeX] |
2021 | Maintenance, Reliability and Condition Monitoring Vol. 1(2), pp. 52–70 |
article | DOI URL |
BibTeX:
@article{Thaduri2021,
author = {Thaduri, Adithya and Garmabaki, Amir and Kumar, Uday},
title = {Impact of climate change on railway operation and maintenance in Sweden: A State-of-the-art review},
journal = {Maintenance, Reliability and Condition Monitoring},
year = {2021},
volume = {1},
number = {2},
pages = {52–70},
url = {http://dx.doi.org/10.21595/mrcm.2021.22136},
doi = {https://doi.org/10.21595/mrcm.2021.22136}
}
|
|||||
| Thokar, R.A., Gupta, N., Niazi, K.R., Swarnkar, A. and Meena, N.K. | Multiobjective nested optimization framework for simultaneous integration of multiple photovoltaic and battery energy storage systems in distribution networks | 2021 | Journal of Energy Storage Vol. 35, pp. 102263 |
article | DOI URL |
| Abstract: The rapid growth of renewables in modern distribution networks results in the spilling of energy due to the limited hosting capacity of these networks, violation of system constraints, reduced network efficiency, and improper utilization of resources. Battery energy storage system (BESS), in spite of its high cost, a shorter life and complex control, offers a flexible solution for the problem. In this paper, a multiobjective nested optimization framework is developed for the simultaneous optimal allocation of multiple solar photovoltaics (SPVs) and BESSs in the distribution networks. The framework involves a two-layered structure; the outer layer provides tentative planning solutions to the inner layer that optimizes the desired objectives of network operations and then returns the functional values back to the outer layer. The purpose of the inner-layer is to satisfy the operational constraints of the networks and ensure the optimal utilization of BESS capacities, suggested by the outer layer, at the time of planning itself. A new BESS operating strategy is proposed for optimum utilization of BESS. The nested multiobjective optimization problem is handled by suggesting a new weighted sum approach in conjunction with a recently developed swarm intelligence-based algorithm, i.e. moth search optimization. Overall, the proposed deterministic model essentially ensures the high penetration of SPVs and the optimal utilization of BESSs to justify their installation. The optimization model is investigated on a benchmark 33-bus test distribution network. The application results highlight enhanced energy efficiency, peak load shaving, high renewable penetration, voltage profile improvement, and mitigation of reverse power flow while effectively absorbing the excess renewable power generation during light load hours. | |||||
BibTeX:
@article{Thokar2021,
author = {Thokar, Rayees Ahmad and Gupta, Nikhil and Niazi, K. R. and Swarnkar, Anil and Meena, Nand K.},
title = {Multiobjective nested optimization framework for simultaneous integration of multiple photovoltaic and battery energy storage systems in distribution networks},
journal = {Journal of Energy Storage},
year = {2021},
volume = {35},
pages = {102263},
url = {https://www.sciencedirect.com/science/article/pii/S2352152X2100027X},
doi = {https://doi.org/10.1016/j.est.2021.102263}
}
|
|||||
| Torraca, A.P. and Fanzeres, B. | Optimal insurance contract specification in the upstream sector of the oil and gas industry | 2021 | European Journal of Operational Research Vol. 295(2), pp. 718–732 |
article | DOI URL |
| Abstract: The upstream sector of the Oil and Gas (O&G) industry is recognized by its capital-intensive projects and complex and hazardous associated recovery and production processes, thus susceptible for large and financially damaging accidents. In this context, to avoid the risk and impact of high expenses, O&G companies usually acquire insurance contracts. In practice, although the contract format is typically pre-specified, its parameter magnitudes can be adjusted aiming at maximizing the company total wealth. Therefore, this work proposes a holistic methodology to assess the optimal parameter specification of an insurance contract in the upstream sector of the O&G industry. A non-convex stochastic optimization problem is constructed aiming at maximizing a risk-adjusted measure of the policyholder total wealth. The modeling takes into account the uncertainty on the financial loss of an accident by making use of the safety barriers and precursor information framework. The non-convex optimization problem is cast as an equivalent mixed-integer linear programming problem by combining the scenario-based representation approach with a set of binary reformulation procedures. We illustrate the applicability of the proposed methodology with a set of numerical experiments. In a nutshell, we found that the proposed parameter specification methodology resulted in greater predictability when compared to two quantile-based specification policies and an uninsured company. In fact, the second best policy presented a standard deviation 103% higher than the proposed methodology. Furthermore, the model also provided greater protection against extreme events, since the second best policy presented a Conditional Value-at-Risk 41% higher than the proposed methodology. | |||||
BibTeX:
@article{Torraca2021,
author = {Torraca, Ana Patrícia and Fanzeres, Bruno},
title = {Optimal insurance contract specification in the upstream sector of the oil and gas industry},
journal = {European Journal of Operational Research},
year = {2021},
volume = {295},
number = {2},
pages = {718–732},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721002010},
doi = {https://doi.org/10.1016/j.ejor.2021.03.011}
}
|
|||||
| Trindade, R.S., de Araújo, O.C.B. and Fampa, M. | Arc-flow approach for single batch-processing machine scheduling | 2021 | Computers & Operations Research Vol. 134, pp. 105394 |
article | DOI URL |
| Abstract: We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch-processing machine, aiming at minimizing the makespan. The extensive literature on this NP-hard problem mostly focuses on heuristics. Using an arc-flow based optimization approach, we construct a novel formulation that represents it as a problem of determining flows in graphs. The size of the formulation increases with the machine capacity and with the number of distinct sizes and processing times among the jobs, but it does not increase with the number of jobs, which makes it very effective to solve large instances to optimality, especially when multiple jobs have equal size and processing time. We compare our model to other models from the literature, showing its clear superiority on benchmark instances and proving optimality of random instances with up to 100 million jobs. | |||||
BibTeX:
@article{Trindade2021,
author = {Trindade, Renan Spencer and de Araújo, Olinto César Bassi and Fampa, Marcia},
title = {Arc-flow approach for single batch-processing machine scheduling},
journal = {Computers & Operations Research},
year = {2021},
volume = {134},
pages = {105394},
url = {https://www.sciencedirect.com/science/article/pii/S0305054821001623},
doi = {https://doi.org/10.1016/j.cor.2021.105394}
}
|
|||||
| Tsai, S.C., Yeh, Y. and Kuo, C.Y. | Efficient optimization algorithms for surgical scheduling under uncertainty | 2021 | European Journal of Operational Research Vol. 293(2), pp. 579–593 |
article | DOI URL |
| Abstract: In this paper, we develop a stochastic optimization model for a surgical scheduling problem considering a single operating room. We arrange a set of elective surgeries into appropriate time blocks, and determine their planned start time and specific sequence. Due to the complexity of the original formulation, we reformulate our model as a two-stage mixed-integer problem. We consider the planning decision in the first stage and the sequencing decision in the second stage (based on the first one). The goal of this paper is to obtain a nearly optimal schedule in reasonable computational time. The term “optimal” is defined as the lowest surgically related cost while achieving the given threshold with respect to some specific deterministic or stochastic performance measures. The optimization model involves expected and probabilistic formulations that are analytically intractable. This implies that traditional mathematical programming techniques cannot be used directly. Therefore, we propose adapted rapid-screening and stochastic-approximation algorithms to deal with the first-stage and the second-stage problems, respectively. In both algorithms, we can apply either the Laplace transform or simulation methods to either evaluate or estimate the desired performance measures. The experimental results demonstrate that the proposed algorithms are more favorable compared to existing approaches. | |||||
BibTeX:
@article{Tsai2021,
author = {Tsai, Shing Chih and Yeh, Yingchieh and Kuo, Chen Yun},
title = {Efficient optimization algorithms for surgical scheduling under uncertainty},
journal = {European Journal of Operational Research},
year = {2021},
volume = {293},
number = {2},
pages = {579–593},
url = {https://www.sciencedirect.com/science/article/pii/S0377221720310948},
doi = {https://doi.org/10.1016/j.ejor.2020.12.048}
}
|
|||||
| Tsiulin, S. and Reinau, K.H. | The Role of Port Authority in New Blockchain Scenarios for Maritime Port Management: The Case of Denmark | 2021 | Transportation Research Procedia Vol. 52, pp. 388–395 |
article | DOI URL |
| Abstract: The purpose of the paper is to determine and examine, to what extent blockchain scenarios for the shipping industry have practical explication from maritime ports’ perspective and how these are sync with ports’ long-term development strategies, particularly in Denmark. The present study involved qualitative interviews with representatives of the biggest maritime ports of Denmark, varied by location, volumes, operations and cargo type. Data saturation is achieved through several rounds of in-depth semi-structured interviews. Results showed uncertainties in the long-term investment strategy of the considered ports. While focused on land expansion and operation development, the port authorities lack inner-port coordination with related enterprises, which consequently affects overall efficiency. While the development strategy appears to be identical among the port authorities, it varies significantly within specific blockchain scenarios and port’s strategy regarding short-term port optimization. Besides, the role of port authority was debated. Authorities are willing to be more involved in supply chain operations as a consultancy rather than just a controlling party, yet are burden by the state restrictions. Unlike generally-discussed blockchain compatibility studies, the current research contributes by revealing core business uncertainties within port area development and communication. Moreover, the case could serve as a representation of small- to middle-size ports in the EU. | |||||
BibTeX:
@article{Tsiulin2021,
author = {Tsiulin, Sergey and Reinau, Kristian Hegner},
title = {The Role of Port Authority in New Blockchain Scenarios for Maritime Port Management: The Case of Denmark},
journal = {Transportation Research Procedia},
year = {2021},
volume = {52},
pages = {388–395},
url = {https://www.sciencedirect.com/science/article/pii/S2352146521000867},
doi = {https://doi.org/10.1016/j.trpro.2021.01.045}
}
|
|||||
| Vrakas, G., Chan, C. and Thai, V.V. | The effects of evolving port technology and process optimisation on operational performance: The case study of an Australian container terminal operator | 2021 | The Asian Journal of Shipping and Logistics Vol. 37(4), pp. 281–290 |
article | DOI URL |
| Abstract: Grounded on the Resource Based View (RBV) theory, this paper argues that technological advances and process optimisation through standardisation and centralisation could been used to improve various aspects of port operational performance. Using information and secondary data from the case of Patrick Terminals in Australia, the impacts of the Patrick's Brisbane AutoStrad™ container terminal and National Operations Centre (NOC) on yard design and operations, quay crane deployment, operational productivity, safety, manpower, vessel planning, customer service delivery, invoicing, and process alignment and standardisation, were examined. It was found that the deployment of advanced technology i.e. Brisbane AutoStrad™, bundled with the optimisation of business processes through standardisation and centralisation at the NOC, are valuable and costly-to-imitate tangible and intangible resources which can translate into positive operational performance in terms of better equipment and facility utilisation, higher productivity, reduced costs, and more satisfied customers. This research contributes to strengthen the RBV theory in the context of container terminals management while also provides managerial insights to port managers and policy makers not only in Australian container terminals but also those in Asia, given their growth and competitive position on the global basis. | |||||
BibTeX:
@article{Vrakas2021,
author = {Vrakas, George and Chan, Caroline and Thai, Vinh V.},
title = {The effects of evolving port technology and process optimisation on operational performance: The case study of an Australian container terminal operator},
journal = {The Asian Journal of Shipping and Logistics},
year = {2021},
volume = {37},
number = {4},
pages = {281–290},
url = {https://www.sciencedirect.com/science/article/pii/S2092521220300225},
doi = {https://doi.org/10.1016/j.ajsl.2020.04.001}
}
|
|||||
| Wang, J., Liu, J., Wang, F. and Yue, X. | Blockchain technology for port logistics capability: Exclusive or sharing | 2021 | Transportation Research Part B: Methodological Vol. 149, pp. 347–392 |
article | DOI URL |
| Abstract: Although the application of blockchain technology in maritime industry can improve the customs clearance efficiency and logistics transparency in the container cargo supply chains, it generates the unit operations cost and setup cost. In this study, a spatial model is proposed to conduct an investigation into the two heterogeneous ports when blockchain technology is applied under inter-port competition. Different utility-driven operations models are built to highlight the values of blockchain technology for port logistics capability, and to reveal the equilibria under the optimal strategies and equilibrium strategies. It is noticed that the relationship between the unit net benefit and unit operations cost brought out by blockchain technology is a key factor determining whether the blockchain technology is applicable. When the unit operations cost is lower than unit net benefit, and the setup cost is high, there is a win-win situation for two ports to apply traditional technology. It is further verified to be Pareto-optimal. In addition, three lose-lose situations are also identified, which are classic Prisoner's Dilemmas. Consequently, a horizontal collaboration mechanism “blockchain technology sharing + compensation” (BTSC) is designed to not only break these three Prisoner's Dilemmas, but also achieve the Pareto-optimum. Furthermore, we discuss some extensions to prove the robustness of our main qualitative insights. | |||||
BibTeX:
@article{Wang2021,
author = {Wang, Junjin and Liu, Jiaguo and Wang, Fan and Yue, Xiaohang},
title = {Blockchain technology for port logistics capability: Exclusive or sharing},
journal = {Transportation Research Part B: Methodological},
year = {2021},
volume = {149},
pages = {347–392},
url = {https://www.sciencedirect.com/science/article/pii/S0191261521000953},
doi = {https://doi.org/10.1016/j.trb.2021.05.010}
}
|
|||||
| Wang, K., Hu, Q., Zhou, M., Zun, Z. and Qian, X. | Multi-aspect applications and development challenges of digital twin-driven management in global smart ports | 2021 | Case Studies on Transport Policy Vol. 9(3), pp. 1298–1312 |
article | DOI URL |
| Abstract: Digital twin (DT) creates a revolutionary opportunity for the smart ports’ authorities, with the capability of high-fidelity digital representation of real-world things. DT-driven management is able to predict potential risk, it is considered to be a key integration involves transport and operation related with smart port supply chains. This paper presents DT information visualizations & outcome loop of global smart ports’ management, and core technique towards smart ports’ processes based on DT-driven management. A systematic framework of DT-based model for smart port’s management is presented, which can be categorized into physical layer, data layer, model layer, service layer and application layer. Decision-makers engage in operational management through the DT-based models and platform. To illustrate DT mechanism, multi-aspect functional applications of DT-driven management are discussed, including cargo handling and transportation, containers operation and storage, data communication and sharing, risk prediction, and environmental protection in global smart ports. Meanwhile, this paper proposes concerned challenges of DT-driven management integrated with optimized cross-platform in smart ports’ processes, to indicate there are barriers ahead to get to an ideal visual-based management system. Current challenges help decision-makers to determine where to find a proper strategy to win, in the future, DT visual applications can be extended in several directions of global port industry. This work contributes to address a comprehensive overview of DT managing capabilities together with details of necessary architecture to support effective simulations in virtual port’s space. It provides DT-driven platform will enable better management across the smart port activities from design to transport to operation and sustainment of innovative plan. | |||||
BibTeX:
@article{Wang2021a,
author = {Wang, Kan and Hu, Qianqian and Zhou, Mingjun and Zun, Zhou and Qian, Xinming},
title = {Multi-aspect applications and development challenges of digital twin-driven management in global smart ports},
journal = {Case Studies on Transport Policy},
year = {2021},
volume = {9},
number = {3},
pages = {1298–1312},
url = {https://www.sciencedirect.com/science/article/pii/S2213624X21001103},
doi = {https://doi.org/10.1016/j.cstp.2021.06.014}
}
|
|||||
| Wang, L., Demeulemeester, E., Vansteenkiste, N. and Rademakers, F.E. | Operating room planning and scheduling for outpatients and inpatients: A review and future research | 2021 | Operations Research for Health Care Vol. 31, pp. 100323 |
article | DOI URL |
| Abstract: In hospitals, surgeries are treated either on an outpatient or on an inpatient basis. Outpatients are normally routine patients that enter and leave the hospital on the same day, while inpatients who need more complex surgeries have to stay overnight. More recently, a shift from inpatient surgery to outpatient surgery is occurring due to scientific progress in anaesthesia and surgical techniques. Identifying possible similarities and differences between outpatient surgery scheduling and inpatient surgery scheduling can serve as a valuable decision-making foundation for practitioners and for operations researchers to efficiently schedule patients for surgery in the surgical department. This paper provides the first literature review on comparing outpatient surgery scheduling with inpatient surgery scheduling. The literature published between 2000 and 2020 that explicitly mentions either scheduling setting is included and it is analyzed from three dimensions, i.e., the uncertainty incorporation, the research methodology, and a scheduling performance comparison between both settings. We find that outpatient surgery can observe better results in many of the performance measures (i.e., operating room utilization, overtime, and patient cancellation rate) as opposed to inpatient surgery. This is due to the fact that inpatient surgery duration is longer and more variable and to the presence of more emergency patients, although there is a higher likelihood of no-shows for outpatients. Moreover, we identify future research directions that provide opportunities for expanding existing methodologies and especially for narrowing the gap between theory and practice. | |||||
BibTeX:
@article{Wang2021b,
author = {Wang, Lien and Demeulemeester, Erik and Vansteenkiste, Nancy and Rademakers, Frank E.},
title = {Operating room planning and scheduling for outpatients and inpatients: A review and future research},
journal = {Operations Research for Health Care},
year = {2021},
volume = {31},
pages = {100323},
url = {https://www.sciencedirect.com/science/article/pii/S2211692321000394},
doi = {https://doi.org/10.1016/j.orhc.2021.100323}
}
|
|||||
| Wang, P., Hu, Q., Xu, Y., Mei, Q. and Wang, F. | Evaluation methods of port dominance: A critical review | 2021 | Ocean & Coastal Management Vol. 215, pp. 105954 |
article | DOI URL |
| Abstract: With the continuous advancement of the global economy and international trade, the competition among ports becomes increasingly fierce. Numerous studies show that evaluation methods of port dominance can effectively quantify the appropriate dominance index and find the weak links to enhance ports’ comprehensive competitiveness. This paper summarizes the port dominance evaluation methods in the existing literature and expounds their importance based on the development of information technology in shipping activities. Moreover, the application scope, the advantages, and disadvantages of current evaluation methods are explained using qualitative, quantitative, deductive, and retrospective methods. It was found that, with the development of information technology, evaluation methods are becoming more comprehensive, targeted, specialized, refined, digitalized, and intelligentized. It was also found that since existing studies often adopt single-faceted evaluation methods and select a single factor for evaluation, they cannot effectively analyze and evaluate the real advantages of the port. In addition, the present paper discusses the prospects of ports and potential research. | |||||
BibTeX:
@article{Wang2021c,
author = {Wang, Peng and Hu, Qinyou and Xu, Yongjun and Mei, Qiang and Wang, Fei},
title = {Evaluation methods of port dominance: A critical review},
journal = {Ocean & Coastal Management},
year = {2021},
volume = {215},
pages = {105954},
url = {https://www.sciencedirect.com/science/article/pii/S0964569121004373},
doi = {https://doi.org/10.1016/j.ocecoaman.2021.105954}
}
|
|||||
| Wang, Y., Feng, B., Hua, Q.-S. and Sun, L. | Short-Term Solar Power Forecasting: A Combined Long Short-Term Memory and Gaussian Process Regression Method | 2021 | Sustainability Vol. 13(7) |
article | DOI |
| Abstract: Solar power is considered a promising power generation candidate in dealing with climate change. Because of the strong randomness, volatility, and intermittence, its safe integration into the smart grid requires accurate short-term forecasting with the required accuracy. The use of solar power should meet requirements proscribed by environmental law and safety standards applied for consumer protection. First, time-series-based solar power forecasting (SPF) model is developed with the time element and predicted weather information from the local meteorological station. Considering the data correlation, long short-term memory (LSTM) algorithm is utilized for short-term SPF. However, the point prediction provided by LSTM fails in revealing the underlying uncertainty range of the solar power output, which is generally needed in some stochastic optimization frameworks. A novel hybrid strategy combining LSTM and Gaussian process regression (GPR), namely LSTM-GPR, is proposed to obtain a highly accurate point prediction with a reliable interval estimation. The hybrid model is evaluated in comparison with other algorithms in terms of two aspects: Point prediction accuracy and interval forecasting reliability. Numerical investigations confirm the superiority of LSTM algorithm over the conventional neural networks. Furthermore, the performance of the proposed hybrid model is demonstrated to be slightly better than the individual LSTM model and significantly superior to the individual GPR model in both point prediction and interval forecasting, indicating a promising prospect for future SPF applications. | |||||
BibTeX:
@article{Wang2021d,
author = {Wang, Ying and Feng, Bo and Hua, Qing-Song and Sun, Li},
title = {Short-Term Solar Power Forecasting: A Combined Long Short-Term Memory and Gaussian Process Regression Method},
journal = {Sustainability},
year = {2021},
volume = {13},
number = {7},
doi = {https://doi.org/10.3390/su13073665}
}
|
|||||
| Wu, K., Huang, E., Wang, M. and Zheng, M. | Job scheduling of diffusion furnaces in semiconductor fabrication facilities | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: Furnaces are commonly seen in the front-end to the middle portion of the semiconductor process flow and their scheduling plays a key role in semiconductor manufacturing. Job scheduling of furnaces needs to meet the daily production targets while adhering to job due dates and process constraints. The furnace scheduling problem belongs to a special class of flexible job-shop scheduling with complicated constraints including but not limited to batch processing, reentrance, and time-windows. This problem is NP-hard. The extremely large solution space prevents any straightforward application of optimization techniques. In this paper, several properties are identified to reduce the solution space based on a dynamic programming formulation. With the help of these properties, an efficient algorithm has been developed to find a good solution to this problem. The developed method has been implemented in practical production lines. Compared with existing methods, the developed algorithm gives a higher throughput rate and improves the scheduling efficiency. | |||||
BibTeX:
@article{Wu2021,
author = {Wu, Kan and Huang, Edward and Wang, Mengchang and Zheng, Meimei},
title = {Job scheduling of diffusion furnaces in semiconductor fabrication facilities},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721008201},
doi = {https://doi.org/10.1016/j.ejor.2021.09.044}
}
|
|||||
| Xin, L. and Goldberg, D.A. | Time (in)consistency of multistage distributionally robust inventory models with moment constraints | 2021 | European Journal of Operational Research Vol. 289(3), pp. 1127–1141 |
article | DOI URL |
| Abstract: Recently, there has been a growing interest in developing inventory control policies which are robust to model misspecification. One approach is to posit that nature selects a worst-case distribution for any relevant stochastic primitives from some pre-specified family. Several communities have observed that a subtle phenomena known as time inconsistency can arise in this framework. In particular, it becomes possible that a policy which is optimal at time zero may not be optimal for the associated optimization problem in which the decision-maker recomputes her policy at each point in time, which has implications for implementability. If there exists a policy which is optimal for both formulations, we say that the policy is time consistent, and the problem is weakly time consistent. If every optimal policy is time consistent, we say that the problem is strongly time consistent. We study these phenomena in the context of managing an inventory over time, when only the mean, variance, and support are known for the demand at each stage. We provide several illustrative examples showing that here the question of time consistency can be quite subtle. We complement these observations by providing simple sufficient conditions for weak and strong time consistency. Although a similar phenomena was previously identified by Shapiro for the setting in which only the mean and support of the demand are known, here our model is rich enough to exhibit a variety of additional interesting behaviors. | |||||
BibTeX:
@article{Xin2021,
author = {Xin, Linwei and Goldberg, David A.},
title = {Time (in)consistency of multistage distributionally robust inventory models with moment constraints},
journal = {European Journal of Operational Research},
year = {2021},
volume = {289},
number = {3},
pages = {1127–1141},
url = {https://www.sciencedirect.com/science/article/pii/S0377221720306676},
doi = {https://doi.org/10.1016/j.ejor.2020.07.041}
}
|
|||||
| Xu, M., Shuai, B., Wang, X., Li, J. and Huang, W. | A two-stage optimization approach for inspection plan formulation of comprehensive inspection train: The China case | 2021 | Computers & Industrial Engineering Vol. 159, pp. 107465 |
article | DOI URL |
| Abstract: The regular and dynamic inspections of high-speed railways (HSR) are carried out by comprehensive inspection train (CIT). Generally, the network of HSR (e.g., the HSR network in China) has some obvious characteristics such as complex network structure, high traffic density and strict maintenance restrictions of CIT, which make the formulation of CIT inspection plan extremely hard. However, formulating and optimizing the CIT inspection plan is one of the key issues to ensure the safety of HSR operations and to improve the efficiency of testing equipment. In this paper, the original model is proposed for the multiple CITs inspection plan formulation problem (MCIT-IPFP) firstly, and it is proved that the problem belongs to the NP-hard class of computational complexity by reduction. By decomposing the problem into two stages, one is used to divide the HSR network evenly for each CIT, and the other one is used to generate the path, the timetable, and maintenance base assignment for each CIT under requirements of reducing the total time cost and the difficulty of solving. In order to improve the efficiency of calculation, a Constructive Heuristic Algorithm with feedback regulation based on the greedy algorithm is designed to generate the task division plan. With the purpose of quickly formulating the inspection plans with low time cost for each CIT with Euler circuit characteristics, a simulated annealing algorithm with efficient neighborhood Euler circuit generation strategy is proposed. Finally, a case study is conducted to test the efficiency of the algorithm by taking the China’s HSR network as the background. Compared with the previous manual inspection plan, the utilization rate of CITs will increase by 30%-50% when using the models and algorithms proposed in this paper. | |||||
BibTeX:
@article{Xu2021,
author = {Xu, Minhao and Shuai, Bin and Wang, Xin and Li, Jing and Huang, Wencheng},
title = {A two-stage optimization approach for inspection plan formulation of comprehensive inspection train: The China case},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {159},
pages = {107465},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221003697},
doi = {https://doi.org/10.1016/j.cie.2021.107465}
}
|
|||||
| Xu, Y., Wandelt, S. and Sun, X. | Airline integrated robust scheduling with a variable neighborhood search based heuristic | 2021 | Transportation Research Part B: Methodological Vol. 149, pp. 181–203 |
article | DOI URL |
| Abstract: This study investigates an airline integrated robust scheduling problem, subsuming three steps: schedule design, fleet assignment, and aircraft routing, while considering the effects of propagated delays. We propose a mixed integer programming model incorporating propagated delays and flight re-timing decisions; the model is extended towards a second one in terms of passenger spill/recapture effects, optional flights, and passenger miss-connections. In order to solve our models for large-scale airline instances, we propose a column generation procedure as well as a sequential variable neighborhood search (VNS) heuristic; the integration of which leads to significantly improved convergence. Based on a real airline instance, from a Chinese legacy airline, we report an extensive set of numerical experiments to validate the effectiveness and efficiency of our models and solution techniques. Our results show that the VNS-based algorithms are significantly faster than the widely applied column generation algorithm for large instances. Sensitivity analysis further illustrates the benefits of the two integrated models in terms of revenue and propagated delays. | |||||
BibTeX:
@article{Xu2021a,
author = {Xu, Yifan and Wandelt, Sebastian and Sun, Xiaoqian},
title = {Airline integrated robust scheduling with a variable neighborhood search based heuristic},
journal = {Transportation Research Part B: Methodological},
year = {2021},
volume = {149},
pages = {181–203},
url = {https://www.sciencedirect.com/science/article/pii/S0191261521000850},
doi = {https://doi.org/10.1016/j.trb.2021.05.005}
}
|
|||||
| Yamashiro, H. and Nonaka, H. | Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem | 2021 | Operations Research Perspectives Vol. 8, pp. 100196 |
article | DOI URL |
| Abstract: Traditionally, mathematical optimization methods have been applied in manufacturing industries where production scheduling is one of the most important problems and is being actively researched. Extant studies assume that processing times are known or follow a simple distribution. However, the actual processing time in a factory is often unknown and likely follows a complex distribution. Therefore, in this study, we consider estimating the processing time using a machine-learning model. Although there are studies that use machine learning for scheduling optimization itself, it should be noted that the purpose of this study is to estimate an unknown processing time. Using machine-learning models, one can estimate processing times that follow an unknown and complex distribution while further improving the schedule using the computed importance variable. Based on the above, we propose a system for estimating the processing time using machine-learning models when the processing time follows a complex distribution in actual factory data. The advantages of the proposed system are its versatility and applicability to a real-world factory where the processing times are often unknown. The proposed method was evaluated using process information with the processing time for each manufacturing sample provided by research partner companies. The Light gradient-boosted machine (LightGBM) algorithm and Ridge performed the best with MAPE and RMSE. The optimization of parallel machine scheduling using estimated processing time by our method resulted in an average reduction of approximately 30% for the makespan. On the other hands, the results of probabilistic sampling methods which are Kernel Density Estimation, Gamma distribution, and Normal Distribution have shown poorer performance than ML approaches. In addition, machine-learning models can be used to deduce variables that affect the estimation of processing times, and in this study, we demonstrated an example of feature importance computed from experimental data. In addition, machine-learning models can be used to deduce variables that affect the estimation of processing times, and in this study, we demonstrated an example of feature importance computed from experimental data. | |||||
BibTeX:
@article{Yamashiro2021,
author = {Yamashiro, Hirochika and Nonaka, Hirofumi},
title = {Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem},
journal = {Operations Research Perspectives},
year = {2021},
volume = {8},
pages = {100196},
url = {https://www.sciencedirect.com/science/article/pii/S2214716021000178},
doi = {https://doi.org/10.1016/j.orp.2021.100196}
}
|
|||||
| Yan, S., Ji, X., Fang, Y. and Sun, H. | Multiobjective multistage robust integer optimization model and algorithm for oilfield development planning | 2021 | Computers & Industrial Engineering Vol. 159, pp. 107497 |
article | DOI URL |
| Abstract: This paper discusses the long-term planning problem of oilfield development. The planning aims to deploy the workload of stimulation treatments with uncertain indicators. And the uncertainties of initial stimulation effect, annual effect error and new recoverable reserves are considered. With their uncertainty sets and the adaptability of decisions, a multiobjective multistage robust integer optimization model is constructed. In this model, the total development cost is minimized and the total new recoverable reserves is maximized. And the model makes decisions on the workload of each stimulation treatment in each year under constraints of annual oil production and workload balance. In addition, an algorithm for solving multiobjective multistage robust integer optimization model is proposed, which can obtain the finitely adaptive robust efficient solution set. Finally, a numerical example of long-term oilfield development planning is presented. The planning model with given uncertainty sets is solved, to verify the validity of the proposed model and algorithm. | |||||
BibTeX:
@article{Yan2021,
author = {Yan, Sen and Ji, Xiaoyu and Fang, Yanjun and Sun, Hongguo},
title = {Multiobjective multistage robust integer optimization model and algorithm for oilfield development planning},
journal = {Computers & Industrial Engineering},
year = {2021},
volume = {159},
pages = {107497},
url = {https://www.sciencedirect.com/science/article/pii/S0360835221004010},
doi = {https://doi.org/10.1016/j.cie.2021.107497}
}
|
|||||
| Yang, H. and Le, M. | High-Order Community Detection in the Air Transport Industry: A Comparative Analysis among 10 Major International Airlines | 2021 | Applied Sciences Vol. 11(20) |
article | DOI |
| Abstract: Community detection in a complex network is an ongoing field. While the air transport network has gradually formed as a complex system, the topological and geographical characteristics of airline networks have become crucial in understanding the network dynamics and airports’ roles. This research tackles the highly interconnected parts in weighted codeshare networks. A dataset comprising ten major international airlines is selected to conduct a comparative analysis. The result confirms that the clique percolation method can be used in conjunction with other metrics to shed light on air transport network topology, recognizing patterns of inter- and intra-community connections. Moreover, the topological detection results are interpreted and explained from a transport geographical perspective, with the physical airline network structure. As complex as it may seem, the airline network tends to be a relatively small system with only a few high-order communities, which can be characterized by geographical constraints. This research also contributes to the literature by capturing new insights regarding the topological patterns of the air transport industry. Particularly, it reveals the wide hub-shifting phenomenon and the possibility of airlines with different business models sharing an identical topology profile. | |||||
BibTeX:
@article{Yang2021,
author = {Yang, Huijuan and Le, Meilong},
title = {High-Order Community Detection in the Air Transport Industry: A Comparative Analysis among 10 Major International Airlines},
journal = {Applied Sciences},
year = {2021},
volume = {11},
number = {20},
doi = {https://doi.org/10.3390/app11209378}
}
|
|||||
| Zhang, H., Dullerud, N., Seyyed-Kalantari, L., Morris, Q., Joshi, S. and Ghassemi, M. | An empirical framework for domain generalization in clinical settings [BibTeX] |
2021 | , pp. 279–290 | misc | DOI URL |
BibTeX:
@misc{Zhang2021,
author = {Zhang, Haoran and Dullerud, Natalie and Seyyed-Kalantari, Laleh and Morris, Quaid and Joshi, Shalmali and Ghassemi, Marzyeh},
title = {An empirical framework for domain generalization in clinical settings},
publisher = {Association for Computing Machinery},
year = {2021},
pages = {279–290},
url = {https://doi.org/10.1145/3450439.3451878},
doi = {https://doi.org/10.1145/3450439.3451878}
}
|
|||||
| Zhang, X. and Liu, X. | A two-stage robust model for express service network design with surging demand | 2021 | European Journal of Operational Research | article | DOI URL |
| Abstract: In the periods following sales on online shopping carnivals, demand for express transportation is expected to precipitously surge within a short time, potentially causing express system overload and delivery delays. In this study, we address a service network design problem of a hub-and-spoke structured express transportation network during periods of surging demands. We consider a new strategy of upgrading existing spokes into temporary hubs to expand the network capacity with low costs. We propose a two-stage bi-objective robust model based on a time-space network to integrate the spoke-upgrading selection, service-scheduling, and vehicle-routing for designing an express service network that is both efficient and economic. To solve the model, we develop an enhanced column-and-constraint generation algorithm. Finally, a case study of a real express logistics company in China is demonstrated to validate the effectiveness of the proposed strategy and to offer decision support in real problems. | |||||
BibTeX:
@article{Zhang2021a,
author = {Zhang, X. and Liu, X.},
title = {A two-stage robust model for express service network design with surging demand},
journal = {European Journal of Operational Research},
year = {2021},
url = {https://www.sciencedirect.com/science/article/pii/S0377221721005476},
doi = {https://doi.org/10.1016/j.ejor.2021.06.031}
}
|
|||||
| Zhang, Y., Jiang, J., Zhang, X. and Sun, L. | A hierarchical genetic algorithm and mixed-integer linear programming-based stochastic optimization of the configuration of integrated trigeneration energy systems | 2021 | Clean Technologies and Environmental Policy Vol. 23(6), pp. 1913–1927 |
article | DOI URL |
| Abstract: Facing the growing pressure of climate change and environmental protection, integrated energy systems (IESs), which comprise different energy sources, have become promising candidates for future energy systems. However, the capacity configuration of each source remains challenging due to the various couplings, randomness of renewables and numerical optimization difficulty. In this paper, a hierarchical optimization framework is proposed to determine the component capacities of trigeneration IESs, i.e., systems involving combined cooling, heating and power (CCHP) generation. The potential variation in the demand and renewable resource availability are considered stochastic factors and captured as scenarios generated according to a probability function. In the first level, with the component capacities and scenarios defined, a mixed-integer linear programming (MILP) problem is formulated to minimize the total system cost. Then, in the second level, the Monte Carlo method is applied to calculate the expectation by feeding different scenarios into the MILP and sampling the minimal costs. Finally, as the second level returns the expected value of the system cost considering the given component capacities, a genetic algorithm is adopted in the third level to search the optimal component capacities. Compared to the conventional deterministic optimization method, the proposed stochastic optimization method reduces the annual operational cost while allowing a wider operational range. In addition, it is revealed that the inclusion of heat storage and grid connections yields notable benefits in terms of IES cost reduction. | |||||
BibTeX:
@article{Zhang2021b,
author = {Zhang, Yisong and Jiang, Jingjing and Zhang, Xian and Sun, Li},
title = {A hierarchical genetic algorithm and mixed-integer linear programming-based stochastic optimization of the configuration of integrated trigeneration energy systems},
journal = {Clean Technologies and Environmental Policy},
year = {2021},
volume = {23},
number = {6},
pages = {1913–1927},
url = {https://doi.org/10.1007/s10098-021-02088-x},
doi = {https://doi.org/10.1007/s10098-021-02088-x}
}
|
|||||
| Zhao, N. and You, F. | Toward Carbon-Neutral Electric Power Systems in the New York State: a Novel Multi-Scale Bottom-Up Optimization Framework Coupled with Machine Learning for Capacity Planning at Hourly Resolution | 2021 | ACS Sustainable Chemistry & Engineering | article | DOI URL |
| Abstract: In this work, we propose a novel multi-scale bottom-up optimization framework for the carbon-neutral transition planning of the electric power sector, which incorporates hourly time scale and electricity storage to address the reliability and energy balance issues of the future deep-decarbonized power systems. In addition to the technology and capacity information for each facility, the proposed framework also accounts for facility ages, which are usually omitted in the literature, without significantly increasing the computational demand. To reduce the computational requirement of simultaneously optimizing capacity planning and hourly systems operations over the next few decades, a reduced model is developed based on representative days, using a novel approach that integrates multiple machine learning techniques. Based on the optimal transition pathways, hourly operational simulations are conducted for every year within the planning horizon to obtain detailed optimization results. To illustrate the applicability of the proposed framework, a case study for the New York State is presented through two cases, with and without electricity storage capacity expansion. The proposed approach using principal component analysis coupled with K-means outcompetes multiple conventional approaches of using clustering techniques directly. The transition planning results show that the total generation capacity for the case with electricity capacity expansion is 39% higher than the other case, while the latter case has 200% more generation capacity from non-intermittent sources. Detailed hourly operational simulation results indicate that offshore wind, hydro, and utility solar are the primary power sources by 2040 for the case with electricity storage capacity expansion, while hydro, offshore wind, and nuclear are the main electricity sources for the other case. | |||||
BibTeX:
@article{Zhao2021,
author = {Zhao, Ning and You, Fengqi},
title = {Toward Carbon-Neutral Electric Power Systems in the New York State: a Novel Multi-Scale Bottom-Up Optimization Framework Coupled with Machine Learning for Capacity Planning at Hourly Resolution},
journal = {ACS Sustainable Chemistry & Engineering},
year = {2021},
url = {https://doi.org/10.1021/acssuschemeng.1c06612},
doi = {https://doi.org/10.1021/acssuschemeng.1c06612}
}
|
|||||
| Zohuri, B. and McDaniel, P. | Chapter 14 - Cyber resilience and future of electric power system | 2021 | Introduction to Energy Essentials, pp. 509–548 | inbook | DOI URL |
| Abstract: Cost-effectively detecting, preventing, and mitigating cyber threats is a concern for most organizations, especially those in critical infrastructure sectors. The electrical and mechanical equipment for nuclear power plants are very important to nuclear safety and dependent upon computer-based equipment, appropriate standards and practices for the development and testing of computer hardware and software shall be established and implemented throughout the service life of the system, and in particular throughout the software development cycle. Security systems do not need more tools, they just need more rules, because fighting new threats with more tools just adds complexity and more degrees of freedom; that these new tools always bring on board. It is time to rethink our approach to cybersecurity. | |||||
BibTeX:
@inbook{Zohuri2021,
author = {Zohuri, Bahman and McDaniel, Patrick},
title = {Chapter 14 - Cyber resilience and future of electric power system},
booktitle = {Introduction to Energy Essentials},
publisher = {Academic Press},
year = {2021},
pages = {509–548},
url = {https://www.sciencedirect.com/science/article/pii/B9780323901529000141},
doi = {https://doi.org/10.1016/B978-0-323-90152-9.00014-1}
}
|
|||||
| Acciaro, M., Renken, K. and Dirzka, C. | Integrated Port Cities: The Case of Hamburg | 2020 | European Port Cities in Transition: Moving Towards More Sustainable Sea Transport Hubs, pp. 287–301 | inbook | DOI URL |
| Abstract: Many cities around the world are port cities, and yet, industrialisation of port activities and changes in port operations have resulted in the separation between the city and its port is becoming more evident. Some ports have moved away from urbanised areas, while in others fences and security barriers are being erected to separate a city from the water areas. Space is contested, and tension is increasing between urban and industrial use of the waterfront areas. In some port-cities, however, the proximity of city spaces to industrial activities is unavoidable, and managing the relations between port operations and the city becomes one of the main priorities of the port managing companies (PMC). The governance structure and relation of the PMC to the municipalities near the port defines the organisational framework within which the PMC needs to operate in order to find ways to reconcile the tension between urban spaces and the port. This tension requires careful management of port stakeholders, a well-thought communication strategy and the development of specific initiatives aimed at reducing negative external effects associated with port activities. Through the analysis of the case of the port-city of Hamburg, particularly its smart-port and smart-city strategies, this chapter illustrates the complexity of successfully managing integrated port-cities. The closely-knit collaboration between the Hamburg City-State Municipal Government and its Port Authority have allowed it to overcome some of the issues that emerged in the past, but as port operations change the question is how long the conflict of resource use between a growing city and the third-largest European port can be kept at bay. | |||||
BibTeX:
@inbook{Acciaro2020,
author = {Acciaro, Michele and Renken, Katharina and Dirzka, Christopher},
title = {Integrated Port Cities: The Case of Hamburg},
booktitle = {European Port Cities in Transition: Moving Towards More Sustainable Sea Transport Hubs},
publisher = {Springer International Publishing},
year = {2020},
pages = {287–301},
url = {https://doi.org/10.1007/978-3-030-36464-9_16},
doi = {https://doi.org/10.1007/978-3-030-36464-9_16}
}
|
|||||
| Ajagekar, A., Humble, T. and You, F. | Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems | 2020 | Computers & Chemical Engineering Vol. 132, pp. 106630 |
article | DOI URL |
| Abstract: Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers. | |||||
BibTeX:
@article{Ajagekar2020,
author = {Ajagekar, Akshay and Humble, Travis and You, Fengqi},
title = {Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems},
journal = {Computers & Chemical Engineering},
year = {2020},
volume = {132},
pages = {106630},
url = {https://www.sciencedirect.com/science/article/pii/S0098135419307665},
doi = {https://doi.org/10.1016/j.compchemeng.2019.106630}
}
|
|||||
| Alamoush, A.S., Ballini, F. and Ölçer, A.I. | Ports' technical and operational measures to reduce greenhouse gas emission and improve energy efficiency: A review | 2020 | Marine Pollution Bulletin Vol. 160, pp. 111508 |
article | DOI URL |
| Abstract: This study reviews and categorises ports' technical and operational measures to reduce greenhouse gas emission and improve energy efficiency. Through a systematic review, both measures in the portside including land transport, and in the ship-port interface, were identified and structured into 7 main categories and 19 subcategories based on 214 studies. The measures' characteristics, abatement potential, best practices and key issues were clarified. The results show that there is insufficient research on ports in developing countries, as research is centred on developed countries' ports. Furthermore, it is unlikely that any single measure may lead to port decarbonisation owing to varying abatement potential, complexity, and cost. Therefore, assessments of feasibility and effectiveness to identify the best combination of measures are vital steps forward. In addition to the highlighted fertile research areas, the result of measures categorisation is considered a tool for policymakers and a basis for researchers to verify future agendas. | |||||
BibTeX:
@article{Alamoush2020,
author = {Alamoush, Anas S. and Ballini, Fabio and Ölçer, Aykut I.},
title = {Ports' technical and operational measures to reduce greenhouse gas emission and improve energy efficiency: A review},
journal = {Marine Pollution Bulletin},
year = {2020},
volume = {160},
pages = {111508},
url = {https://www.sciencedirect.com/science/article/pii/S0025326X20306263},
doi = {https://doi.org/10.1016/j.marpolbul.2020.111508}
}
|
|||||
| Antoulas, A.C., Beattie, C.A. and Gü?ercin, S. | Interpolatory Methods for Model Reduction [BibTeX] |
2020 | , pp. 232 | book | DOI URL |
BibTeX:
@book{Antoulas2020,
author = {Antoulas, A. C. and Beattie, C. A. and Gü?ercin, S.},
title = {Interpolatory Methods for Model Reduction},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {232},
note = {doi:10.1137/1.9781611976083},
url = {https://doi.org/10.1137/1.9781611976083},
doi = {https://doi.org/10.1137/1.9781611976083}
}
|
|||||
| Baena, D., Castro, J. and Frangioni, A. | Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy | 2020 | Management Science Vol. 66(7), pp. 3051–3068 |
article | DOI URL |
| Abstract: The cell-suppression problem (CSP) is a very large mixed-integer linear problem arising in statistical disclosure control. However, CSP has the typical structure that allows application of the Benders decomposition, which is known to suffer from oscillation and slow convergence, compounded with the fact that the master problem is combinatorial. To overcome this drawback, we present a stabilized Benders decomposition whose master is restricted to a neighborhood of successful candidates by local-branching constraints, which are dynamically adjusted, and even dropped, during the iterations. Our experiments with synthetic and real-world instances with up to 24,000 binary variables, 181 million (M) continuous variables, and 367M constraints show that our approach is competitive with both the current state-of-the-art code for CSP and the Benders implementation in CPLEX 12.7. In some instances, stabilized Benders provided a very good solution in less than 1 minute, whereas the other approaches found no feasible solution in 1 hour.This paper was accepted by Yinyu Ye, optimization. | |||||
BibTeX:
@article{Baena2020,
author = {Baena, Daniel and Castro, Jordi and Frangioni, Antonio},
title = {Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy},
journal = {Management Science},
year = {2020},
volume = {66},
number = {7},
pages = {3051–3068},
note = {doi: 10.1287/mnsc.2019.3341},
url = {https://doi.org/10.1287/mnsc.2019.3341},
doi = {https://doi.org/10.1287/mnsc.2019.3341}
}
|
|||||
| Bakker, H., Dunke, F. and Nickel, S. | A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice | 2020 | Omega Vol. 96, pp. 102080 |
article | DOI URL |
| Abstract: While methods for optimization under uncertainty have been studied intensely over the past decades, the explicit consideration of the interplay between uncertainty and time has gained increasing attention rather recently. Problems requiring a sequence of decisions in reaction to uncertainty realizations are of crucial relevance in real-world applications, e.g., supply chain planning, scheduling, or finance. Several methods emphasizing varying aspects of these problems have been developed, mainly triggered by a particular application. Although these methods all intend to solve a similar underlying problem, they differ strongly with respect to the uncertainty representation, the prescriptive solution information they provide and the means of performance evaluation. The result is a fragmented picture of uncertain multi-stage problems – both from a methodological and an application-oriented perspective. It fails to interconnect results from different disciplines or even comparing strengths and weaknesses of individual methods in particular applications. This review aims at integrating the different methods for solving uncertainty inflicted multi-stage optimization problems into a broader picture, thereby paving the way for more comprehensive approaches to sequential decision making under uncertainty. For this purpose, a description of the methods along with their historic development is given first. Secondly, an overview on their main areas of application is provided. We conclude that decoupling uncertainty models from solution methods and developing standardized performance measures represent key steps for organizing multi-stage optimization under uncertainty and for eliciting further potentials of yet unexplored combinations of uncertainty models and solution methods. | |||||
BibTeX:
@article{Bakker2020,
author = {Bakker, Hannah and Dunke, Fabian and Nickel, Stefan},
title = {A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice},
journal = {Omega},
year = {2020},
volume = {96},
pages = {102080},
url = {https://www.sciencedirect.com/science/article/pii/S0305048318314002},
doi = {https://doi.org/10.1016/j.omega.2019.06.006}
}
|
|||||
| Bastos, Y.B., Fleck, J.L. and Martinelli, R. | A stochastic programming approach for offshore flight scheduling | 2020 | IFAC-PapersOnLine Vol. 53(4), pp. 478–484 |
article | DOI URL |
| Abstract: In this paper, we propose a stochastic programming approach to perform optimal and robust offshore flight scheduling from a service level perspective, reducing flight delays. The two-stage stochastic programming is reduced to a deterministic equivalent linear program and, considering the combinatorial characteristic of scheduling problems, we use Sample Average Approximation to generate scenarios. A Discrete Event Simulation model is developed to compare the stochastic and deterministic approaches. Numerical results indicate that a stochastic approach to offshore flight scheduling can reduce unpredictable delays, which have a major impact on passengers, without significantly increasing aircraft idle time. In addition, the stochastic approach allows dealing with operational downtime windows with uncertainties in duration and occurrence. | |||||
BibTeX:
@article{Bastos2020,
author = {Bastos, Yan Barboza and Fleck, Julia L. and Martinelli, Rafael},
title = {A stochastic programming approach for offshore flight scheduling},
journal = {IFAC-PapersOnLine},
year = {2020},
volume = {53},
number = {4},
pages = {478–484},
url = {https://www.sciencedirect.com/science/article/pii/S2405896321001439},
doi = {https://doi.org/10.1016/j.ifacol.2021.04.068}
}
|
|||||
| Bayliss, C., De Maere, G., Atkin, J.A.D. and Paelinck, M. | Scheduling airline reserve crew using a probabilistic crew absence and recovery model [BibTeX] |
2020 | Journal of the Operational Research Society Vol. 71(4), pp. 543–565 |
article | DOI URL |
BibTeX:
@article{Bayliss2020,
author = {Bayliss, Christopher and De Maere, Geert and Atkin, Jason A. D. and Paelinck, Marc},
title = {Scheduling airline reserve crew using a probabilistic crew absence and recovery model},
journal = {Journal of the Operational Research Society},
year = {2020},
volume = {71},
number = {4},
pages = {543–565},
url = {https://doi.org/10.1080/01605682.2019.1567649},
doi = {https://doi.org/10.1080/01605682.2019.1567649}
}
|
|||||
| Betts, J.T. | Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition [BibTeX] |
2020 | , pp. 748 | book | DOI URL |
BibTeX:
@book{Betts2020,
author = {Betts, John T.},
title = {Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {748},
note = {doi:10.1137/1.9781611976199},
url = {https://doi.org/10.1137/1.9781611976199},
doi = {https://doi.org/10.1137/1.9781611976199}
}
|
|||||
| Blanquero, R., Carrizosa, E., Molero-Río, C. and Romero Morales, D. | Sparsity in optimal randomized classification trees | 2020 | European Journal of Operational Research Vol. 284(1), pp. 255–272 |
article | DOI URL |
| Abstract: Decision trees are popular Classification and Regression tools and, when small-sized, easy to interpret. Traditionally, a greedy approach has been used to build the trees, yielding a very fast training process; however, controlling sparsity (a proxy for interpretability) is challenging. In recent studies, optimal decision trees, where all decisions are optimized simultaneously, have shown a better learning performance, especially when oblique cuts are implemented. In this paper, we propose a continuous optimization approach to build sparse optimal classification trees, based on oblique cuts, with the aim of using fewer predictor variables in the cuts as well as along the whole tree. Both types of sparsity, namely local and global, are modeled by means of regularizations with polyhedral norms. The computational experience reported supports the usefulness of our methodology. In all our data sets, local and global sparsity can be improved without harming classification accuracy. Unlike greedy approaches, our ability to easily trade in some of our classification accuracy for a gain in global sparsity is shown. | |||||
BibTeX:
@article{Blanquero2020,
author = {Blanquero, Rafael and Carrizosa, Emilio and Molero-Río, Cristina and Romero Morales, Dolores},
title = {Sparsity in optimal randomized classification trees},
journal = {European Journal of Operational Research},
year = {2020},
volume = {284},
number = {1},
pages = {255–272},
url = {http://www.sciencedirect.com/science/article/pii/S0377221719309865},
doi = {https://doi.org/10.1016/j.ejor.2019.12.002}
}
|
|||||
| Blum, A., Hopcroft, J.E. and Kannan, R. | Foundations of data science | 2020 | , pp. pages cm | book | |
| Abstract: "This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data"-- | |||||
BibTeX:
@book{Blum2020,
author = {Blum, Avrim and Hopcroft, John E. and Kannan, Ravindran},
title = {Foundations of data science},
publisher = {Cambridge University Press},
year = {2020},
pages = {pages cm},
edition = {First edition.},
note = {2019038133 Avrim Blum, Toyota Technological Institute at Chicago, John Hopcroft, Cornell University, New York, Ravindran Kannan, Microsoft Research, India. Includes bibliographical references and index.}
}
|
|||||
| Bueler, E. | PETSc for Partial Differential Equations: Numerical Solutions in C and Python [BibTeX] |
2020 | , pp. 406 | book | DOI URL |
BibTeX:
@book{Bueler2020,
author = {Bueler, Ed},
title = {PETSc for Partial Differential Equations: Numerical Solutions in C and Python},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {406},
note = {doi:10.1137/1.9781611976311},
url = {https://doi.org/10.1137/1.9781611976311},
doi = {https://doi.org/10.1137/1.9781611976311}
}
|
|||||
| Cacchiani, V. and Salazar-González, J.-J. | Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier | 2020 | Omega Vol. 91, pp. 102028 |
article | DOI URL |
| Abstract: Flight retiming in airline scheduling consists in slightly modifying the scheduled departure time of some flights with the goal of providing a better service with a cheaper cost. In this research, the departure times must be selected from a small discrete set of options. The whole problem embeds flight retiming, fleet assignment, aircraft routing and crew pairing. Thus, the aim is to determine the departure times of the flights, the fleet assignment and the minimum cost aircraft and crew routes. The objective function takes into account a large cost associated with each crew member, a penalization for short or long connection times, a cost for crew members changing aircraft along their routes, and a minor penalty associated with the use of each aircraft. The constraints enforce aircraft maintenance and crew working rules. In this setting, flight retiming is allowed to potentially reduce the total costs and increase the robustness of the solution against delays by decreasing the number of aircraft changes. We propose and compare four heuristic algorithms based on a Mixed Integer Linear Programming model for the whole problem. The model contains path variables representing the crew pairings, and arc variables representing the aircraft routes. In the heuristic algorithms, column generation is applied on the path variables, and different flight retiming options are considered. The algorithms are tested on real-world instances of a regional carrier flying in the Canary Islands to evaluate their advantages and drawbacks. In particular, one of the algorithms, that uses the solution of the Linear Programming relaxation of the model to select promising options for the departure of the flights, turns out to be the most effective one. The obtained results show that costs can be significantly reduced through flight retiming while still keeping the computing times reasonably short. In addition, we perform a sensitivity analysis by including more retiming options and by using different aircraft and crew costs. Finally, we report the results on larger size instances obtained by combining real-world ones. | |||||
BibTeX:
@article{Cacchiani2020,
author = {Cacchiani, Valentina and Salazar-González, Juan-José},
title = {Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier},
journal = {Omega},
year = {2020},
volume = {91},
pages = {102028},
url = {http://www.sciencedirect.com/science/article/pii/S0305048318308661},
doi = {https://doi.org/10.1016/j.omega.2019.01.006}
}
|
|||||
| Cammin, P., Yu, J., Heilig, L. and Voß, S. | Monitoring of air emissions in maritime ports | 2020 | Transportation Research Part D: Transport and Environment Vol. 87, pp. 102479 |
article | DOI URL |
| Abstract: Maritime ports play a crucial role in the development of domestic and international trade and economies. Although near-port communities profit from economic benefits, there exist significant concerns regarding exposure to air emissions, which affect human health and climate change. To tackle this issue, a port authority can develop emission reduction plans and projects, whose performance is tracked through an air emissions inventory (EI). Despite the attention on EI methodologies in the past, little research has focused on the implementation of methodologies in information systems. Therefore, a case study is conducted in this paper to investigate the motivation for creating EIs and the obstacles in the EI-creation process from an information systems perspective. The results indicate that data confidentiality and weak information systems are major obstacles, which hinder the creation of high-quality EIs and generate additional costs. Our findings enable port stakeholders and decision makers to understand the current obstacles and facilitate the development of adequate information systems that support the creation of high-quality EIs. | |||||
BibTeX:
@article{Cammin2020,
author = {Cammin, Philip and Yu, Jingjing and Heilig, Leonard and Voß, Stefan},
title = {Monitoring of air emissions in maritime ports},
journal = {Transportation Research Part D: Transport and Environment},
year = {2020},
volume = {87},
pages = {102479},
url = {https://www.sciencedirect.com/science/article/pii/S1361920920306660},
doi = {https://doi.org/10.1016/j.trd.2020.102479}
}
|
|||||
| Castro, D.C., Walker, I. and Glocker, B. | Causality matters in medical imaging | 2020 | Nature Communications Vol. 11(1), pp. 3673 |
article | DOI URL |
| Abstract: Causal reasoning can shed new light on the major challenges in machine learning for medical imaging: scarcity of high-quality annotated data and mismatch between the development dataset and the target environment. A causal perspective on these issues allows decisions about data collection, annotation, preprocessing, and learning strategies to be made and scrutinized more transparently, while providing a detailed categorisation of potential biases and mitigation techniques. Along with worked clinical examples, we highlight the importance of establishing the causal relationship between images and their annotations, and offer step-by-step recommendations for future studies. | |||||
BibTeX:
@article{Castro2020,
author = {Castro, Daniel C. and Walker, Ian and Glocker, Ben},
title = {Causality matters in medical imaging},
journal = {Nature Communications},
year = {2020},
volume = {11},
number = {1},
pages = {3673},
url = {https://doi.org/10.1038/s41467-020-17478-w},
doi = {https://doi.org/10.1038/s41467-020-17478-w}
}
|
|||||
| Chutima, P. and Arayikanon, K. | Many-objective low-cost airline cockpit crew rostering optimisation | 2020 | Computers & Industrial Engineering Vol. 150, pp. 106844 |
article | DOI URL |
| Abstract: This research addresses the cockpit crew rostering problem in a low-cost airline. Through interviews with the aircrew planner, four objectives are considered vital for effective roster preparation; minimisation of nautical mile cost, balance workload among cockpit crews, maximisation of preferential requests from senior pilots and minimisation of the number of repeated flight patterns flown by individual pilots. Since the problem is NP-hard with many conflicting objectives that need to be optimised simultaneously, multi-objective evolutionary optimisation is an effective technique to solve this problem. As a result, the hybridisation between MOEA/D and HBMO algorithms, namely MOEA/D-HBMO, is developed. The proposed algorithm is compared to MOEA/D and HBMO. It is observed that MOEA/D-HBMO outperforms the counterparts in convergence related metrics and it could discover the best extreme points to meet every objective. | |||||
BibTeX:
@article{Chutima2020,
author = {Chutima, Parames and Arayikanon, Kanokbhorn},
title = {Many-objective low-cost airline cockpit crew rostering optimisation},
journal = {Computers & Industrial Engineering},
year = {2020},
volume = {150},
pages = {106844},
url = {http://www.sciencedirect.com/science/article/pii/S0360835220305453},
doi = {https://doi.org/10.1016/j.cie.2020.106844}
}
|
|||||
| Desaulniers, G., Lessard, F., Saddoune, M. and Soumis, F. | Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems | 2020 | SN Operations Research Forum Vol. 1(3), pp. 19 |
article | DOI URL |
| Abstract: The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew base) such that each flight is covered once and side constraints are satisfied. This problem has been widely studied but most works have tackled daily or weekly CPP instances with up to 3500 flights. Only a few papers have addressed monthly instances with up to 14,000 flights. In this paper, we propose an effective algorithm for solving very large-scale CPP instances. This algorithm combines, among others, column generation (CG) with dynamic constraint aggregation (DCA) that can efficiently exploit the CG master problem degeneracy. When embedded in a rolling-horizon (RH) procedure, DCA allows to consider wider time windows in RH and yields better solutions. Our computational results show, first, the potential gains that can be obtained by using wider time windows and, second, the very good performance of the proposed algorithm when compared with a standard CG/RH algorithm for solving an industrial monthly CPP instance with 46,588 flights. | |||||
BibTeX:
@article{Desaulniers2020,
author = {Desaulniers, Guy and Lessard, François and Saddoune, Mohammed and Soumis, François},
title = {Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems},
journal = {SN Operations Research Forum},
year = {2020},
volume = {1},
number = {3},
pages = {19},
url = {https://doi.org/10.1007/s43069-020-00016-1},
doi = {https://doi.org/10.1007/s43069-020-00016-1}
}
|
|||||
| Díaz, I. | Machine learning in the estimation of causal effects: targeted minimum loss-based estimation and double/debiased machine learning | 2020 | Biostatistics Vol. 21(2), pp. 353–358 |
article | DOI URL |
| Abstract: In recent decades, the fields of statistical and machine learning have seen a revolution in the development of data-adaptive regression methods that have optimal performance under flexible, sometimes minimal, assumptions on the true regression functions. These developments have impacted all areas of applied and theoretical statistics and have allowed data analysts to avoid the biases incurred under the pervasive practice of parametric model misspecification. In this commentary, I discuss issues around the use of data-adaptive regression in estimation of causal inference parameters. To ground ideas, I focus on two estimation approaches with roots in semi-parametric estimation theory: targeted minimum loss-based estimation (TMLE; van der Laan and Rubin, 2006) and double/debiased machine learning (DML; Chernozhukov and others, 2018). This commentary is not comprehensive, the literature on these topics is rich, and there are many subtleties and developments which I do not address. These two frameworks represent only a small fraction of an increasingly large number of methods for causal inference using machine learning. To my knowledge, they are the only methods grounded in statistical semi-parametric theory that also allow unrestricted use of data-adaptive regression techniques. | |||||
BibTeX:
@article{Diaz2020,
author = {Díaz, Iván},
title = {Machine learning in the estimation of causal effects: targeted minimum loss-based estimation and double/debiased machine learning},
journal = {Biostatistics},
year = {2020},
volume = {21},
number = {2},
pages = {353–358},
url = {https://doi.org/10.1093/biostatistics/kxz042},
doi = {https://doi.org/10.1093/biostatistics/kxz042}
}
|
|||||
| Drake, J.H., Kheiri, A., Özcan, E. and Burke, E.K. | Recent advances in selection hyper-heuristics | 2020 | European Journal of Operational Research Vol. 285(2), pp. 405–428 |
article | DOI URL |
| Abstract: Hyper-heuristics have emerged as a way to raise the level of generality of search techniques for computational search problems. This is in contrast to many approaches, which represent customised methods for a single problem domain or a narrow class of problem instances. The term hyper-heuristic was defined in the early 2000s as a heuristic to choose heuristics, but the idea of designing high-level heuristic methodologies can be traced back to the early 1960s. The current state-of-the-art in hyper-heuristic research comprises a set of methods that are broadly concerned with intelligently selecting or generating a suitable heuristic for a given situation. Hyper-heuristics can be considered as search methods that operate on lower-level heuristics or heuristic components, and can be categorised into two main classes: heuristic selection and heuristic generation. Here we will focus on the first of these two categories, selection hyper-heuristics. This paper gives a brief history of this emerging area, reviews contemporary selection hyper-heuristic literature, and discusses recent selection hyper-heuristic frameworks. In addition, the existing classification of selection hyper-heuristics is extended, in order to reflect the nature of the challenges faced in contemporary research. Unlike the survey on hyper-heuristics published in 2013, this paper focuses only on selection hyper-heuristics and presents critical discussion, current research trends and directions for future research. | |||||
BibTeX:
@article{Drake2020,
author = {Drake, John H. and Kheiri, Ahmed and Özcan, Ender and Burke, Edmund K.},
title = {Recent advances in selection hyper-heuristics},
journal = {European Journal of Operational Research},
year = {2020},
volume = {285},
number = {2},
pages = {405–428},
url = {http://www.sciencedirect.com/science/article/pii/S0377221719306526},
doi = {https://doi.org/10.1016/j.ejor.2019.07.073}
}
|
|||||
| Drake, J.H., Starkey, A., Owusu, G. and Burke, E.K. | Multiobjective evolutionary algorithms for strategic deployment of resources in operational units | 2020 | European Journal of Operational Research Vol. 282(2), pp. 729–740 |
article | DOI URL |
| Abstract: Large-scale infrastructure networks require frequent maintenance, often performed by a team of skilled engineers spread over a large area. The set of tasks allocated to an engineer can have a huge impact on overall efficiency, whether that be in terms of time taken to complete all tasks, staffing costs or environmental costs in terms of emissions. When required to efficiently allocate a set of geographically distributed tasks to a maintenance engineering workforce, one approach is to define working areas for which teams of engineers are responsible. Often a key obstacle to overcome when looking for solutions is ensuring a balance between multiple competing objectives. In this paper, we employ a number of multiobjective evolutionary algorithms to analyse a simulation model for a real-world workforce optimisation problem used by BT. We provide a detailed analysis of the class of problems to be solved, where the workforce and a set of service distribution points must be split into smaller working areas, referred to as operational units. As the choice of how many operational units to split a larger working area into is critical, some of the practical considerations that must be made when addressing such problems are highlighted. This research has allowed the planning team at BT to understand the unique complexities of the nature of the problems they face in different areas of the UK, particularly with respect to the choice of number of operational units, and has strengthened their ability to design operational units effectively. | |||||
BibTeX:
@article{Drake2020a,
author = {Drake, John H. and Starkey, Andrew and Owusu, Gilbert and Burke, Edmund K.},
title = {Multiobjective evolutionary algorithms for strategic deployment of resources in operational units},
journal = {European Journal of Operational Research},
year = {2020},
volume = {282},
number = {2},
pages = {729–740},
url = {http://www.sciencedirect.com/science/article/pii/S0377221719301134},
doi = {https://doi.org/10.1016/j.ejor.2019.02.002}
}
|
|||||
| Eckstein, S., Kupper, M. and Pohl, M. | Robust risk aggregation with neural networks | 2020 | Mathematical Finance Vol. 30(4), pp. 1229–1272 |
article | DOI URL |
| Abstract: Abstract We consider settings in which the distribution of a multivariate random variable is partly ambiguous. We assume the ambiguity lies on the level of the dependence structure, and that the marginal distributions are known. Furthermore, a current best guess for the distribution, called reference measure, is available. We work with the set of distributions that are both close to the given reference measure in a transportation distance (e.g., the Wasserstein distance), and additionally have the correct marginal structure. The goal is to find upper and lower bounds for integrals of interest with respect to distributions in this set. The described problem appears naturally in the context of risk aggregation. When aggregating different risks, the marginal distributions of these risks are known and the task is to quantify their joint effect on a given system. This is typically done by applying a meaningful risk measure to the sum of the individual risks. For this purpose, the stochastic interdependencies between the risks need to be specified. In practice, the models of this dependence structure are however subject to relatively high model ambiguity. The contribution of this paper is twofold: First, we derive a dual representation of the considered problem and prove that strong duality holds. Second, we propose a generally applicable and computationally feasible method, which relies on neural networks, in order to numerically solve the derived dual problem. The latter method is tested on a number of toy examples, before it is finally applied to perform robust risk aggregation in a real-world instance. | |||||
BibTeX:
@article{Eckstein2020,
author = {Eckstein, Stephan and Kupper, Michael and Pohl, Mathias},
title = {Robust risk aggregation with neural networks},
journal = {Mathematical Finance},
year = {2020},
volume = {30},
number = {4},
pages = {1229–1272},
note = {https://doi.org/10.1111/mafi.12280},
url = {https://doi.org/10.1111/mafi.12280},
doi = {https://doi.org/10.1111/mafi.12280}
}
|
|||||
| Farrokhifar, M., Aghdam, F.H., Alahyari, A., Monavari, A. and Safari, A. | Optimal energy management and sizing of renewable energy and battery systems in residential sectors via a stochastic MILP model | 2020 | Electric Power Systems Research Vol. 187, pp. 106483 |
article | DOI URL |
| Abstract: Energy supply through integrated renewable energy sources (RESs) and battery systems will be of higher importance for future residential sectors. Optimal energy management and sizing for the components of residential systems can enhance efficiency, self-suffiency, and meanwhile can be cost-effective by reducing investment as well as operating costs. Accordingly, this paper proposes an exhaustive optimization model for determining the capacity of RESs, namely: wind turbines and photovoltaic (PV) systems. In this study, batteries and electric vehicles (EVs) are utilized in line with other sources to capture fluctuations of RESs. To model the uncertainties of RESs, energy prices, and load demands a linearized stochastic programming framework is applied. The proposed framework involves long-term and efficient resource development alongside with short-term management and utilization of these resources for supplying the demand load. In our study, we utilize the roulette wheel mechanism (RWM) method as well as proper probability distribution functions (PDFs) to generate scenarios for all sources of uncertainties, including wind turbines, PV systems, demand, and electricity market price. The approach is verified in two different cases, including an individual home and a larger micro-grid (MG). The results of multiple numerical simulations demonstrate the effectiveness of the proposed stochastic model. | |||||
BibTeX:
@article{Farrokhifar2020,
author = {Farrokhifar, Meisam and Aghdam, Farid Hamzeh and Alahyari, Arman and Monavari, Ali and Safari, Amin},
title = {Optimal energy management and sizing of renewable energy and battery systems in residential sectors via a stochastic MILP model},
journal = {Electric Power Systems Research},
year = {2020},
volume = {187},
pages = {106483},
url = {https://www.sciencedirect.com/science/article/pii/S0378779620302868},
doi = {https://doi.org/10.1016/j.epsr.2020.106483}
}
|
|||||
| Fathabad, A.M., Cheng, J., Pan, K. and Qiu, F. | Data-Driven Planning for Renewable Distributed Generation Integration [BibTeX] |
2020 | IEEE Transactions on Power Systems Vol. 35(6), pp. 4357–4368 |
article | DOI |
BibTeX:
@article{Fathabad2020,
author = {Fathabad, A. M. and Cheng, J. and Pan, K. and Qiu, F.},
title = {Data-Driven Planning for Renewable Distributed Generation Integration},
journal = {IEEE Transactions on Power Systems},
year = {2020},
volume = {35},
number = {6},
pages = {4357–4368},
doi = {https://doi.org/10.1109/TPWRS.2020.3001235}
}
|
|||||
| Frazzon, E.M., Agostino, Í.R.S., Broda, E. and Freitag, M. | Manufacturing networks in the era of digital production and operations: A socio-cyber-physical perspective | 2020 | Annual Reviews in Control Vol. 49, pp. 288–294 |
article | DOI URL |
| Abstract: The performance of manufacturing networks relies on interactions. Digitalization supports an evidence-based understanding of partners’ idiosyncrasies and behaviours, so that proper decision-making takes place. Indeed, context uncertainty and flexible problem solving demand human involvement in cyber-physical systems. Therefore, to materialize systems efficiency along with flexibility and robustness, human aspects and limitations need to be properly considered in the planning and control of manufacturing networks. This vision paper aims to address distributed decision-making in digital and integrated manufacturing networks under a socio-cyber-physical systems perspective. Therefore, this exploratory study presents a narrative review of current research literature, followed by a research framework proposition. Manufacturing and control research communities need to embrace a convergent vision addressing (i) how manufacturing networks can be planned and controlled in the future, (ii) which are the proper decision-making methods and approaches, as well as (iii) which are the technology drivers fostering new research opportunities with practical impact. In this context, the proposed framework indicates potential research avenues and offers an agenda for future work. | |||||
BibTeX:
@article{Frazzon2020,
author = {Frazzon, Enzo Morosini and Agostino, Ícaro Romolo Sousa and Broda, Eike and Freitag, Michael},
title = {Manufacturing networks in the era of digital production and operations: A socio-cyber-physical perspective},
journal = {Annual Reviews in Control},
year = {2020},
volume = {49},
pages = {288–294},
url = {https://www.sciencedirect.com/science/article/pii/S1367578820300195},
doi = {https://doi.org/10.1016/j.arcontrol.2020.04.008}
}
|
|||||
| Gan, G., Ma, C. and Wu, J. | Data Clustering: Theory, Algorithms, and Applications, Second Edition [BibTeX] |
2020 | , pp. 431 | book | DOI URL |
BibTeX:
@book{Gan2020,
author = {Gan, Guojun and Ma, Chaoqun and Wu, Jianhong},
title = {Data Clustering: Theory, Algorithms, and Applications, Second Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {431},
note = {doi:10.1137/1.9781611976335},
url = {https://doi.org/10.1137/1.9781611976335},
doi = {https://doi.org/10.1137/1.9781611976335}
}
|
|||||
| Georgiadis, L., Iosifidis, G. and Tassiulas, L. | On the Efficiency of Sharing Economy Networks [BibTeX] |
2020 | IEEE Transactions on Network Science and Engineering Vol. 7(3), pp. 1094–1110 |
article | DOI |
BibTeX:
@article{Georgiadis2020,
author = {Georgiadis, L. and Iosifidis, G. and Tassiulas, L.},
title = {On the Efficiency of Sharing Economy Networks},
journal = {IEEE Transactions on Network Science and Engineering},
year = {2020},
volume = {7},
number = {3},
pages = {1094–1110},
doi = {https://doi.org/10.1109/TNSE.2019.2904431}
}
|
|||||
| Ghaleb, M., Zolfagharinia, H. and Taghipour, S. | Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns | 2020 | Computers & Operations Research Vol. 123, pp. 105031 |
article | DOI URL |
| Abstract: The utilization of real-time information in production scheduling decisions becomes possible with the help of new developments in Information Technology and Industrial Informatics, such as Industry 4.0. Regardless of the beliefs that the availability of such information will enhance scheduling decisions, several questions and concerns have been reported. One such question is to what extent can the availability of real-time information enhance scheduling decisions? Another concern is how can such information be utilized to advance scheduling decisions and when should it be used? Moreover, there is a general assumption that continuous rescheduling using real-time system updates is beneficial to some extent. However, this general assumption has not been extensively investigated in complex manufacturing systems, such as flexible job shops. Therefore, in this paper, our objective is to study the above-mentioned research questions by developing real-time scheduling (RTS) models for the flexible job-shop scheduling problem (FJSP) with unexpected new job arrivals and machine random breakdowns. We investigate how real-time updates on unexpected arrivals, the availability of machines (downtimes and recovery times), and the completion times of operations can be utilized to generate new schedules (i.e., rescheduling). The performance of the developed RTS models is also investigated under different settings for shop-floor events, different rescheduling strategies, rescheduling policies, and scheduling methods. Lastly, results, conclusions, and several promising research avenues are provided. | |||||
BibTeX:
@article{Ghaleb2020,
author = {Ghaleb, Mageed and Zolfagharinia, Hossein and Taghipour, Sharareh},
title = {Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns},
journal = {Computers & Operations Research},
year = {2020},
volume = {123},
pages = {105031},
url = {https://www.sciencedirect.com/science/article/pii/S0305054820301489},
doi = {https://doi.org/10.1016/j.cor.2020.105031}
}
|
|||||
| Gillis, N. | Nonnegative Matrix Factorization [BibTeX] |
2020 | , pp. 377 | book | DOI URL |
BibTeX:
@book{Gillis2020,
author = {Gillis, Nicolas},
title = {Nonnegative Matrix Factorization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {377},
note = {doi:10.1137/1.9781611976410},
url = {https://doi.org/10.1137/1.9781611976410},
doi = {https://doi.org/10.1137/1.9781611976410}
}
|
|||||
| Guo, J., Qin, Y., Du, X. and Han, Z. | Dynamic measurements and mechanisms of coastal port–city relationships based on the DCI model: Empirical evidence from China | 2020 | Cities Vol. 96, pp. 102440 |
article | DOI URL |
| Abstract: The port–city relationship is not only one of the major contradictions in the development of port cities but also an important factor that affects the sustainable development of coastal areas. Therefore, determining the port–city relationship and identifying the mode of port–city interaction are difficult yet popular topics in research on port cities. The argument is based on a reciprocal port–city relationship. This study uses the main coastal port cities in China as research objects to propose the dynamic centralisation index (DCI) of port–city relationship based on the relative concentration index and to verify its effectiveness. In accordance with the measurement and classification of port–city relationships between 2001 and 2015, we discuss the influences of port sizes and internal structural changes on the port–city relationship. In addition, we use the impulse response function to explore the mechanisms of different types of port–city relationships. The primary objectives of this study are as follows: (1) to propose a new measurement model of port–city relationship that fully reflects the relationships of port sizes and structural changes to urban development; (2) to use the DCI model to classify port–city relationships, explore the change characteristics of different types of port–city relationships and further verify the validity, sensitivity and applicability scope of the DCI model and (3) to determine the manifestation of port–city interaction and identify its dominant factors in different port cities. The strength or tendency of port–city relationships is not directly related to port or city size but is closely associated with underlying issues, such as the development stage of port or city and the relationship between port and hinterland. | |||||
BibTeX:
@article{Guo2020,
author = {Guo, Jianke and Qin, Yafeng and Du, Xiaofei and Han, Zenglin},
title = {Dynamic measurements and mechanisms of coastal port–city relationships based on the DCI model: Empirical evidence from China},
journal = {Cities},
year = {2020},
volume = {96},
pages = {102440},
url = {https://www.sciencedirect.com/science/article/pii/S0264275118317426},
doi = {https://doi.org/10.1016/j.cities.2019.102440}
}
|
|||||
| Guo, Z., Mei, G., Liu, S., Pan, L., Bian, L., Tang, H. and Wang, D. | SGDAN—A Spatio-Temporal Graph Dual-Attention Neural Network for Quantified Flight Delay Prediction | 2020 | Sensors Vol. 20(22) |
article | DOI |
| Abstract: There has been a lot of research on flight delays. But it is more useful and difficult to estimate the departure delay time especially three hours before the scheduled time of departure, from which passengers can reasonably plan their travel time and the airline and airport staff can schedule flights more reasonably. In this paper, we develop a Spatio-temporal Graph Dual-Attention Neural Network (SGDAN) to learn the departure delay time for each flight with real-time conditions at three hours before the scheduled time of departure. Specifically, it first models the air traffic network as graph sequences, what is, using a heterogeneous graph to model a flight and its adjacent flights with the same departure or arrival airport in a special time interval, and using a sequence to model the flight and its previous flights that share the same aircraft. The main contributions of this paper are using heterogeneous graph-level attention to learn the influence between the flight and its adjacent flight together with sequence-level attention to learn the influence between the flight and its previous flight in the flight sequence. With aggregating features from the learned influence from both graph-level and sequence-level attention, SGDAN can generate node embedding to estimate the departure delay time. Experiments on a real-world large-scale data set show that SGDAN produces better results than state-of-the-art models in the accurate flight delay time estimation task. | |||||
BibTeX:
@article{Guo2020a,
author = {Guo, Ziyu and Mei, Guangxu and Liu, Shijun and Pan, Li and Bian, Lei and Tang, Hongwu and Wang, Diansheng},
title = {SGDAN—A Spatio-Temporal Graph Dual-Attention Neural Network for Quantified Flight Delay Prediction},
journal = {Sensors},
year = {2020},
volume = {20},
number = {22},
doi = {https://doi.org/10.3390/s20226433}
}
|
|||||
| Hasan, M.Z. and Al-Rizzo, H. | Task scheduling in Internet of Things cloud environment using a robust particle swarm optimization | 2020 | Concurrency and Computation: Practice and Experience Vol. 32(2), pp. e5442 |
article | DOI URL |
| Abstract: Summary Internet of Things (IoT) is steadily growing in support of current and projected real-time distributed Internet applications in civilian and military applications, while Cloud Computing has the ability to meet the performance expectations of these applications. In this paper, we present the implementation of logistics management applications relying on cooperative resources with optimized performances. To dynamically incorporate smart manufacturing objects into logistics management IoT applications within a ubiquitous environment, task scheduling must be provided for resource allocation in an optimized way. Within such environment, we propose a task scheduling algorithm based on a robust Canonical Particle Swarm Optimization (CPSO) algorithm to solve the problem of resource allocation and management in both homogeneous and heterogeneous IoT Cloud Computing. Our objective is to satisfy the Makespan by performing optimal task scheduling while considering different policies of incoming tasks. Performance evaluation from simulation experiments reveals that optimizing the Makespan can be significantly improved by Longest Processing Time (LPT), Shortest Processing Time (SPT), Earliest Computation Time (ECT), Earliest Starting Time (EST), Earliest Deadline First (EDF), and Earliest Duedate (EDD) using our CPSO algorithm as compared with traditional list task scheduling algorithms. | |||||
BibTeX:
@article{Hasan2020,
author = {Hasan, Mohammed Zaki and Al-Rizzo, Hussain},
title = {Task scheduling in Internet of Things cloud environment using a robust particle swarm optimization},
journal = {Concurrency and Computation: Practice and Experience},
year = {2020},
volume = {32},
number = {2},
pages = {e5442},
note = {https://doi.org/10.1002/cpe.5442},
url = {https://doi.org/10.1002/cpe.5442},
doi = {https://doi.org/10.1002/cpe.5442}
}
|
|||||
| Higham, N.J. | Handbook of Writing for the Mathematical Sciences, Third Edition [BibTeX] |
2020 | , pp. 376 | book | DOI URL |
BibTeX:
@book{Higham2020,
author = {Higham, Nicholas J.},
title = {Handbook of Writing for the Mathematical Sciences, Third Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {376},
note = {doi:10.1137/1.9781611976106},
url = {https://doi.org/10.1137/1.9781611976106},
doi = {https://doi.org/10.1137/1.9781611976106}
}
|
|||||
| Hua, C., Chen, J., Wan, Z., Xu, L., Bai, Y., Zheng, T. and Fei, Y. | Evaluation and governance of green development practice of port: A sea port case of China | 2020 | Journal of Cleaner Production Vol. 249, pp. 119434 |
article | DOI URL |
| Abstract: Port development is an important driver for global economic growth, and also a main energy user and polluter in the world. Amid the global energy crisis and environmental degradation, the international port community has proposed the concept of green port. Zhuhai Port, an important shipping and logistics platform in southern China, is confronted with key questions of how to effectively conduct environmental pollution control and green development performance evaluation, while its size and business performance continue the rapid growth. To address this problem, this study first suggested a green port indicator system tailored-made for Zhuhai Port, and then uses the fuzzy importance-performance analysis (FIPA) method to determine the performance of Zhuhai Port in green port indicators before putting forward a governance strategy. The study shows that Zhuhai Port should focus on monitoring of energy consumption and pollutant emissions, innovation of scientific research technologies and development of green port schemes to deepen the concept of green development and improve the energy conservation and environmental protection capacity of the port. The research results can serve as a theoretical basis for formulation of Zhuhai’s green port policies and the establishment of an effective methodology system. | |||||
BibTeX:
@article{Hua2020,
author = {Hua, Chengying and Chen, Jihong and Wan, Zheng and Xu, Lang and Bai, Yun and Zheng, Tianxiao and Fei, Yijie},
title = {Evaluation and governance of green development practice of port: A sea port case of China},
journal = {Journal of Cleaner Production},
year = {2020},
volume = {249},
pages = {119434},
url = {https://www.sciencedirect.com/science/article/pii/S0959652619343045},
doi = {https://doi.org/10.1016/j.jclepro.2019.119434}
}
|
|||||
| Hughes, M., Goerigk, M. and Dokka, T. | Particle swarm metaheuristics for robust optimisation with implementation uncertainty | 2020 | Computers & Operations Research Vol. 122, pp. 104998 |
article | DOI URL |
| Abstract: We consider global non-convex optimisation problems under uncertainty. In this setting, it is not possible to implement a desired solution exactly. Instead, any other solution within some distance to the intended solution may be implemented. The aim is to find a robust solution, i.e., one where the worst possible solution nearby still performs as well as possible. Problems of this type exhibit another maximisation layer to find the worst case solution within the minimisation level of finding a robust solution, which makes them harder to solve than classic global optimisation problems. So far, only few methods have been provided that can be applied to black-box problems with implementation uncertainty. We improve upon existing techniques by introducing a novel particle swarm based framework which adapts elements of previous methods, combining them with new features in order to generate a more effective approach. In computational experiments, we find that our new method outperforms state of the art comparator heuristics in almost 80% of cases. | |||||
BibTeX:
@article{Hughes2020,
author = {Hughes, Martin and Goerigk, Marc and Dokka, Trivikram},
title = {Particle swarm metaheuristics for robust optimisation with implementation uncertainty},
journal = {Computers & Operations Research},
year = {2020},
volume = {122},
pages = {104998},
url = {https://www.sciencedirect.com/science/article/pii/S0305054820301155},
doi = {https://doi.org/10.1016/j.cor.2020.104998}
}
|
|||||
| Irannezhad, E., Prato, C.G. and Hickman, M. | An intelligent decision support system prototype for hinterland port logistics | 2020 | Decision Support Systems Vol. 130, pp. 113227 |
article | DOI URL |
| Abstract: Port logistics is characterised by a high degree of fragmentation, uncertainty and complexity. In a context with these characteristics, decision support can be of significant value. This study presents the prototype of an intelligent decision support system (DSS) that leads to horizontal and vertical cooperation among freight agents involved in port logistics. A multi-agent simulation model is presented where heterogeneous actions are enabled as a result of an adaptive reinforcement learning algorithm that is inspired by human decision-making strategies. The model combines optimisation modelling and decision theory to operate in a dynamic environment characterised by information asymmetry among agents and dynamic changes over time. A simulation demonstrates the dynamics and convergence to equilibrium of the interactions of heterogeneous agents for delivery and pick up of import/export shipments. In particular, we answer two specific research questions. What is the likely impact of an intelligent DSS in hinterland container transport as a value-added service of port community system (PCS)? How can an optimum cooperative strategy be formulated to meet the dynamic demand and supply of freight agents in hinterland container transport and achieve agility in the age of hyper-competition? By addressing these two research questions we make a specific contribution by developing an agent-based simulation model in a real-world and large-scale case study, by using a reinforcement learning model based on probability matching theory that allows simulating realistically the adaptive behaviour of agents. The results of the simulation of two weeks of container movements indicate huge savings in total transport costs and distance travelled as well as higher utilisation of trucks from the sharing of resources. Moreover, we show that it is strictly better for smaller freight agents to cooperate – a conclusion generated endogenously inside the model as a trade-off between exploration and exploitation. As a result of this prototype simulation, major freight agents will not necessarily benefit from the DSS mainly because they are already using the economies of scale. | |||||
BibTeX:
@article{Irannezhad2020,
author = {Irannezhad, Elnaz and Prato, Carlo G. and Hickman, Mark},
title = {An intelligent decision support system prototype for hinterland port logistics},
journal = {Decision Support Systems},
year = {2020},
volume = {130},
pages = {113227},
url = {https://www.sciencedirect.com/science/article/pii/S0167923619302568},
doi = {https://doi.org/10.1016/j.dss.2019.113227}
}
|
|||||
| Jagtenberg, C.J., Maclaren, O.J., Mason, A.J., Raith, A., Shen, K. and Sundvick, M. | Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019 | 2020 | Networks Vol. 76(2), pp. 273–293 |
article | DOI URL |
| Abstract: Abstract This article reports on an approach for the VeRoLog Solver Challenge 2019: the fourth solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization. The authors were awarded third place in this challenge. The routing challenge involved solving two interlinked vehicle routing problems for equipment: one for distribution (using trucks) and one for installation (using technicians). We describe our solution method, based on a matheuristics approach in which the overall problem is heuristically decomposed into components that can then be solved by formulating them as set partitioning problems. To solve these set partitioning problems we introduce a novel method we call “columnwise neighborhood search,” which allows us to explore a large neighborhood of the current solution in an exact manner. By iteratively applying mixed-integer programming methods, we obtain good quality solutions to our subproblems. We then use a simple local search “fusion” heuristic to further improve the solution to the overall problem. Besides introducing and discussing this solution method, we highlight the problem instances for which our approach was particularly successful in order to obtain general insights about our methodology. | |||||
BibTeX:
@article{Jagtenberg2020,
author = {Jagtenberg, Caroline J. and Maclaren, Oliver J. and Mason, Andrew J. and Raith, Andrea and Shen, Kevin and Sundvick, Michael},
title = {Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019},
journal = {Networks},
year = {2020},
volume = {76},
number = {2},
pages = {273–293},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21961},
doi = {https://doi.org/10.1002/net.21961}
}
|
|||||
| Jiang, W.e.i. and Siddiqui, S. | Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent | 2020 | EURO Journal on Computational Optimization Vol. 8(1), pp. 85–101 |
article | DOI URL |
| Abstract: We developed a gradient-based method to optimize the regularization hyper-parameter, C, for support vector machines in a bilevel optimization framework. On the upper level, we optimized the hyper-parameter C to minimize the prediction loss on validation data using stochastic gradient descent. On the lower level, we used dual coordinate descent to optimize the parameters of support vector machines to minimize the loss on training data. The gradient of the loss function on the upper level with respect to the hyper-parameter, C, was computed using the implicit function theorem combined with the optimality condition of the lower-level problem, i.e., the dual problem of support vector machines. We compared our method with the existing gradient-based method in the literature on several datasets. Numerical results showed that our method converges faster to the optimal solution and achieves better prediction accuracy for large-scale support vector machine problems. | |||||
BibTeX:
@article{Jiang2020,
author = {Jiang, W. e i and Siddiqui, Sauleh},
title = {Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent},
journal = {EURO Journal on Computational Optimization},
year = {2020},
volume = {8},
number = {1},
pages = {85–101},
url = {https://www.sciencedirect.com/science/article/pii/S2192440621000083},
doi = {https://doi.org/10.1007/s13675-019-00115-7}
}
|
|||||
| Kirschner, J., Bogunovic, I., Jegelka, S. and Krause, A. | Distributionally Robust Bayesian Optimization | 2020 | Vol. 108, pp. 2174––2184 |
misc | URL |
| Abstract: Robustness to distributional shift is one of the key challenges of contemporary machine learning. Attaining such robustness is the goal of distributionally robust optimization, which seeks a solution to an optimization problem that is worst-case robust under a specified distributional shift of an uncontrolled covariate. In this paper, we study such a problem when the distributional shift is measured via the maximum mean discrepancy (MMD). For the setting of zeroth-order, noisy optimization, we present a novel distributionally robust Bayesian optimization algorithm (DRBO). Our algorithm provably obtains sub-linear robust regret in various settings that differ in how the uncertain covariate is observed. We demonstrate the robust performance of our method on both synthetic and real-world benchmarks. | |||||
BibTeX:
@misc{Kirschner2020,
author = {Kirschner, Johannes and Bogunovic, Ilija and Jegelka, Stefanie and Krause, Andreas},
title = {Distributionally Robust Bayesian Optimization},
publisher = {PMLR},
year = {2020},
volume = {108},
pages = {2174––2184},
url = {https://proceedings.mlr.press/v108/kirschner20a.html}
}
|
|||||
| Koukaki, T. and Tei, A. | Innovation and maritime transport: A systematic review | 2020 | Case Studies on Transport Policy Vol. 8(3), pp. 700–710 |
article | DOI URL |
| Abstract: Innovation is often defined as the introduction of a new concept aiming at improving a certain situation, either using new solutions or a novel combination of already existing resources. In the shipping industry, innovation is a determining factor of shipping evolution and company success. Despite the important role that innovation plays for the shipping industry, academic research is quite fragmented as it usually focuses on specific cases with few attempts for generalisation. Thus, despite a growing interest from scholars, the shipping industry is still often defined as conservative and it is often not easy to highlight innovative trends and common methodologies to investigate innovation in the maritime sector. The current study applies a systematic review approach in order to discuss main trends in current innovation studies as well as for understanding if published researches are aligned with the industry plans. The research finds out that industry is often leading the research agenda while scholars are often more focused in discussing the innovation implementation phase rather than looking for novel applications or developments. | |||||
BibTeX:
@article{Koukaki2020,
author = {Koukaki, Theodora and Tei, Alessio},
title = {Innovation and maritime transport: A systematic review},
journal = {Case Studies on Transport Policy},
year = {2020},
volume = {8},
number = {3},
pages = {700–710},
url = {https://www.sciencedirect.com/science/article/pii/S2213624X18303420},
doi = {https://doi.org/10.1016/j.cstp.2020.07.009}
}
|
|||||
| Lambelho, M., Mitici, M., Pickup, S. and Marsden, A. | Assessing strategic flight schedules at an airport using machine learning-based flight delay and cancellation predictions | 2020 | Journal of Air Transport Management Vol. 82, pp. 101737 |
article | DOI URL |
| Abstract: To mitigate air traffic demand-capacity imbalances, large European airports implement strategic flight schedules, where flights are assigned arrival/departure slots several months prior to execution. We propose a generic assessment of such strategic schedules using predictions about arrival/departure flight delays and cancellations. We demonstrate our approach for strategic flight schedules in the period 2013–2018 at London Heathrow Airport. Together with the development of dedicated strategic flight schedule optimization models, our proposed approach supports an integrated strategic flight schedule assessment, where schedules are evaluated with respect to flight delays and cancellations. | |||||
BibTeX:
@article{Lambelho2020,
author = {Lambelho, Miguel and Mitici, Mihaela and Pickup, Simon and Marsden, Alan},
title = {Assessing strategic flight schedules at an airport using machine learning-based flight delay and cancellation predictions},
journal = {Journal of Air Transport Management},
year = {2020},
volume = {82},
pages = {101737},
url = {http://www.sciencedirect.com/science/article/pii/S0969699719302303},
doi = {https://doi.org/10.1016/j.jairtraman.2019.101737}
}
|
|||||
| Lange, K. | Algorithms from THE BOOK [BibTeX] |
2020 | , pp. 227 | book | DOI URL |
BibTeX:
@book{Lange2020,
author = {Lange, Kenneth},
title = {Algorithms from THE BOOK},
publisher = {Society for Industrial and Applied Mathematics},
year = {2020},
pages = {227},
note = {doi:10.1137/1.9781611976175},
url = {https://doi.org/10.1137/1.9781611976175},
doi = {https://doi.org/10.1137/1.9781611976175}
}
|
|||||
| Lee, C. and Chen, I.-Y. | A novel simulated view of harbor management dynamics | 2020 | Case Studies on Transport Policy Vol. 8(3), pp. 721–728 |
article | DOI URL |
| Abstract: Nowadays, the operational efficiency of a harbor relies on the information visibility. The information, including the movement of vessels, the availability of resources, and the conditions of the harbor, usually is uncertain and requires simulation to gain the optimized outcomes. This paper presents a novel framework and the overall efficiency model about how such a harbor management information system is designed, including the system architecture, the data schemas, the algorithms, and the proposed information dynamic views. In addition to these valuable dynamic views, the proposed simulation framework can also disclose the perspectives, such as berth service statistics, repair time history, and vessel type statistics, can be extended and used in the harbor service capacity forecasting to improve the harbor daily management. | |||||
BibTeX:
@article{Lee2020,
author = {Lee, Chih and Chen, Ing-Yi},
title = {A novel simulated view of harbor management dynamics},
journal = {Case Studies on Transport Policy},
year = {2020},
volume = {8},
number = {3},
pages = {721–728},
url = {https://www.sciencedirect.com/science/article/pii/S2213624X20300018},
doi = {https://doi.org/10.1016/j.cstp.2020.05.021}
}
|
|||||
| Legrain, A., Omer, J. and Rosat, S. | An online stochastic algorithm for a dynamic nurse scheduling problem | 2020 | European Journal of Operational Research Vol. 285(1), pp. 196–210 |
article | DOI URL |
| Abstract: In this paper, we focus on the problem studied in the second international nurse rostering competition: a personalized nurse scheduling problem under uncertainty. The schedules must be computed week by week over a planning horizon of up to eight weeks. We present the work that the authors submitted to this competition and which was awarded the second prize. At each stage, the dynamic algorithm is fed with the staffing demand and nurses preferences for the current week and computes an irrevocable schedule for all nurses without knowledge of future inputs. The challenge is to obtain a feasible and near-optimal schedule at the end of the horizon. The online stochastic algorithm described in this paper draws inspiration from the primal-dual algorithm for online optimization and the sample average approximation, and is built upon an existing static nurse scheduling software. The procedure generates a small set of candidate schedules, rank them according to their performance over a set of test scenarios, and keeps the best one. Numerical results show that this algorithm is very robust, since it has been able to produce feasible and near optimal solutions on most of the proposed instances ranging from 30 to 120 nurses over a horizon of 4 or 8 weeks. Finally, the code of our implementation is open source and available in a public repository. | |||||
BibTeX:
@article{Legrain2020,
author = {Legrain, Antoine and Omer, Jérémy and Rosat, Samuel},
title = {An online stochastic algorithm for a dynamic nurse scheduling problem},
journal = {European Journal of Operational Research},
year = {2020},
volume = {285},
number = {1},
pages = {196–210},
url = {http://www.sciencedirect.com/science/article/pii/S0377221718308038},
doi = {https://doi.org/10.1016/j.ejor.2018.09.027}
}
|
|||||
| Li, M., Liu, C., Li, K., Liao, X. and Li, K. | Multi-task allocation with an optimized quantum particle swarm method | 2020 | Applied Soft Computing Vol. 96, pp. 106603 |
article | DOI URL |
| Abstract: Multi-task allocation in multi-agent systems aims to accomplish tasks efficiently and successfully, while obtaining more rewards to enhance the entire system operation at the same time. Most existing assignment methods are based on agent coalitions, which cannot balance the profit distribution and task execution success rate or ignore the coalition stability, leading to a low execution level and assignment failures. Few coalition scheduling methods exist for multi-task allocation based on a fixed agent population. In this paper, we propose an effective stability quantum particle swarm optimization (SQPSO) algorithm which includes high rewards obtaining, benefit dividing, coalition stability insuring, and a historical task mechanism for search acceleration. Secondly, we design an efficient establishment quantum particle swarm optimization (EQPSO) algorithm for coalition scheduling, which is equipped with coalition similarity judgment to reduce the coalition formation time cost. The experiment results show that SQPSO guarantees a superior coalition for every task and earlier convergence in the whole task set allocation, and EQPSO gives the optimal scheduling order which reduces the total execution time. | |||||
BibTeX:
@article{Li2020,
author = {Li, Mincan and Liu, Chubo and Li, Kenli and Liao, Xiangke and Li, Keqin},
title = {Multi-task allocation with an optimized quantum particle swarm method},
journal = {Applied Soft Computing},
year = {2020},
volume = {96},
pages = {106603},
url = {https://www.sciencedirect.com/science/article/pii/S156849462030541X},
doi = {https://doi.org/10.1016/j.asoc.2020.106603}
}
|
|||||
| Lu, K., Mizuno, S. and Shi, J. | A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem | 2020 | Optimization Letters Vol. 14(8), pp. 2323–2333 |
article | DOI URL |
| Abstract: This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed integer programming (MIP) problem to compute an optimal solution to the original problem. Compared with the previous MIP approach by Sun, the proposed approach relaxes a strong assumption and reduces the numbers of constraints and binary variables of the MIP problem. By conducting numerical experiments, we find that the proposed approach is more accurate and faster than the previous MIP approach. The proposed MIP problem can be efficiently solved with current state-of-the-art MIP solvers when the objective function is convex or linear. | |||||
BibTeX:
@article{Lu2020,
author = {Lu, Kuan and Mizuno, Shinji and Shi, Jianming},
title = {A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem},
journal = {Optimization Letters},
year = {2020},
volume = {14},
number = {8},
pages = {2323–2333},
url = {https://doi.org/10.1007/s11590-020-01554-7},
doi = {https://doi.org/10.1007/s11590-020-01554-7}
}
|
|||||
| Lulli, G., Odoni, A. and Santos, B.F. | Introduction to the Special Section: Air Transportation Systems Planning and Operations Under Uncertainty [BibTeX] |
2020 | Transportation Science Vol. 54(4), pp. 855–857 |
article | DOI URL |
BibTeX:
@article{Lulli2020,
author = {Lulli, Guglielmo and Odoni, Amedeo and Santos, Bruno F.},
title = {Introduction to the Special Section: Air Transportation Systems Planning and Operations Under Uncertainty},
journal = {Transportation Science},
year = {2020},
volume = {54},
number = {4},
pages = {855–857},
note = {doi: 10.1287/trsc.2020.1001},
url = {https://doi.org/10.1287/trsc.2020.1001},
doi = {https://doi.org/10.1287/trsc.2020.1001}
}
|
|||||
| Martin, E., Cervantes, A., Saez, Y. and Isasi, P. | IACS-HCSP: Improved ant colony optimization for large-scale home care scheduling problems | 2020 | Expert Systems with Applications Vol. 142, pp. 112994 |
article | DOI URL |
| Abstract: The home care and scheduling problem (HCSP) consists on the design of a set of routes to be used by caregivers that provide daily assistance at specific times to patients located in a definite geographic area. In this study we propose a modified version of Ant Colony Optimization (ACO), called IACS-HCSP, to approach this task. In order to be used in this problem, ACO requires modifications in the problem representation and additional mechanisms to deal with constraints. We propose a dynamic neighborhood graph and an improved method that constructs the solution that improves its exploration capability over deterministic or greedy heuristic methods. This technique has been applied to a very large real world instance of HCSP for which results are available for comparison. IACS-HCSP is able to improve the previous results on this specific instance in terms of cost. At the same time it can be used to help decision making when there is a choice between competing objectives, because it finds a full range of feasible solutions with different equilibria between time and size of the required labor force. | |||||
BibTeX:
@article{Martin2020,
author = {Martin, Emilio and Cervantes, Alejandro and Saez, Yago and Isasi, Pedro},
title = {IACS-HCSP: Improved ant colony optimization for large-scale home care scheduling problems},
journal = {Expert Systems with Applications},
year = {2020},
volume = {142},
pages = {112994},
url = {https://www.sciencedirect.com/science/article/pii/S0957417419307110},
doi = {https://doi.org/10.1016/j.eswa.2019.112994}
}
|
|||||
| Molavi, A., Shi, J., Wu, Y. and Lim, G.J. | Enabling smart ports through the integration of microgrids: A two-stage stochastic programming approach | 2020 | Applied Energy Vol. 258, pp. 114022 |
article | DOI URL |
| Abstract: This paper explores microgrids’ application at ports and presents a systematic framework for evaluating the benefits of microgrid integration in creating sustainable value through purposeful planning. We focus on demonstrating how a set of Smart Port Index (SPI) metrics can be incorporated into the port microgrid planning process in the proposed framework to holistically improve the smartness of the port. A two-stage stochastic mixed-integer programming model is developed to explain how the use of microgrid at a port can effectively enhance the port’s performance in four key activity domains: operations, environment, energy, safety and security under operation uncertainty. The proposed model consists of an investment master problem on the first stage and a multi-objective operation planning subproblem on the second stage. Benders decomposition is implemented for solving the two-stage stochastic model, and Lexicographic Goal Programming is applied to the subproblem to deal with multiple objectives. Simulation results, compared with the minimum cost planning approach, indicate that the proposed framework is capable of guaranteeing an improvement in productivity, sustainability, and reliability of port operations. | |||||
BibTeX:
@article{Molavi2020,
author = {Molavi, Anahita and Shi, Jian and Wu, Yiwei and Lim, Gino J.},
title = {Enabling smart ports through the integration of microgrids: A two-stage stochastic programming approach},
journal = {Applied Energy},
year = {2020},
volume = {258},
pages = {114022},
url = {https://www.sciencedirect.com/science/article/pii/S030626191931709X},
doi = {https://doi.org/10.1016/j.apenergy.2019.114022}
}
|
|||||
| Moros-Daza, A., Amaya-Mier, R. and Paternina-Arboleda, C. | Port Community Systems: A structured literature review | 2020 | Transportation Research Part A: Policy and Practice Vol. 133, pp. 27–46 |
article | DOI URL |
| Abstract: Port Community Systems (PCS) are inter-organizational software platforms that connects port community actors, enabling commercial services and information exchange between the port to their customers and a variety of stakeholders. Our main motivation for this paper lies in the absence of surveys on the PCS literature, hence the purpose of this paper is to perform a structured literature review on PCS to establish promising research gaps. Such review was conducted surveying the literature about PCS from 2001 until 2019. The study introduces a detailed and current worldwide PCS inventory using a proposed evolution framework and a taxonomy, the latter built upon commonly cited factors from the IT systems development literature in the context of port communities, which are synthesized into three frames: a Business frame, an Integration frame, and a Legal frame. Findings show that literature on PCS is scarce and fragmented, oftentimes with PCS research published in non-specialized documents on the topic, with few comparative studies between countries and several countries receiving little attention. Few authors have high specialization on the topic while most authors in average contribute less than once to the body of knowledge. Additionally, it was found that industry is ahead of scientific research in terms of documenting PCS development and technical features. The results also show a lack of innovation regarding PCS research studies, which risks relegating PCS research to irrelevance. A major critique to extant PCS literature is about its inertia, as research tends to be excessively comfortable with the legacy PCS, neglecting its need to evolve and adapt to new markets (in response to the growth of emerging economies) or to extended functionalities (taking advantage of the surge of new technologies). Furthermore, it was found that the future of PCS research should aim for addressing practical needs, while fostering collaboration among practitioners and scholars. | |||||
BibTeX:
@article{MorosDaza2020,
author = {Moros-Daza, Adriana and Amaya-Mier, René and Paternina-Arboleda, Carlos},
title = {Port Community Systems: A structured literature review},
journal = {Transportation Research Part A: Policy and Practice},
year = {2020},
volume = {133},
pages = {27–46},
url = {https://www.sciencedirect.com/science/article/pii/S0965856418316872},
doi = {https://doi.org/10.1016/j.tra.2019.12.021}
}
|
|||||
| Oneto, L., Buselli, I., Lulli, A., Canepa, R., Petralli, S. and Anguita, D. | A dynamic, interpretable, and robust hybrid data analytics system for train movements in large-scale railway networks | 2020 | International Journal of Data Science and Analytics Vol. 9(1), pp. 95–111 |
article | DOI URL |
| Abstract: We investigate the problem of analysing the train movements in large-scale railway networks for the purpose of understanding and predicting their behaviour. We focus on different important aspects: the Running Time of a train between two stations, the Dwell Time of a train in a station, the Train Delay, the Penalty Costs associated to a delay, and the Train Overtaking between two trains which are in the wrong relative position on the railway network. Two main approaches exist in the literature to address these problems. One is based on the knowledge of the network and the experience of the operators. The other one is based on the analysis of the historical data about the network with advanced data analytics methods. In this paper, we will propose a hybrid approach in order to address the limitations of the current solutions. In fact, experience-based models are interpretable and robust but not really able to take into account all the factors which influence train movements resulting in low accuracy. From the other side, data-driven models are usually not easy to interpret nor robust to infrequent events and require a representative amount of data which is not always available if the phenomenon under examination changes too fast. Results on real-world data coming from the Italian railway network will show that the proposed solution outperforms both state-of-the-art experience-based and data-driven systems in terms of interpretability, robustness, ability to handle nonrecurring events and changes in the behaviour of the network, and ability to consider complex and exogenous information. | |||||
BibTeX:
@article{Oneto2020,
author = {Oneto, Luca and Buselli, Irene and Lulli, Alessandro and Canepa, Renzo and Petralli, Simone and Anguita, Davide},
title = {A dynamic, interpretable, and robust hybrid data analytics system for train movements in large-scale railway networks},
journal = {International Journal of Data Science and Analytics},
year = {2020},
volume = {9},
number = {1},
pages = {95–111},
url = {https://doi.org/10.1007/s41060-018-00171-z},
doi = {https://doi.org/10.1007/s41060-018-00171-z}
}
|
|||||
| Paprocka, I., Kempa, W.M. and Ćwikła, G. | Predictive Maintenance Scheduling with Failure Rate Described by Truncated Normal Distribution [BibTeX] |
2020 | Sensors Vol. 20(23), pp. 6787 |
article | URL |
BibTeX:
@article{Paprocka2020,
author = {Paprocka, Iwona and Kempa, Wojciech M. and Ćwikła, Grzegorz},
title = {Predictive Maintenance Scheduling with Failure Rate Described by Truncated Normal Distribution},
journal = {Sensors},
year = {2020},
volume = {20},
number = {23},
pages = {6787},
url = {https://www.mdpi.com/1424-8220/20/23/6787}
}
|
|||||
| Parmentier, A. and Meunier, F. | Aircraft routing and crew pairing: Updated algorithms at Air France | 2020 | Omega Vol. 93, pp. 102073 |
article | DOI URL |
| Abstract: Aircraft routing and crew pairing problems aim at building the sequences of flight legs operated respectively by airplanes and by crews of an airline. Given their impact on airlines operating costs, both have been extensively studied for decades. Our goal is to provide reliable and easy to maintain frameworks for both problems at Air France. We propose simple approaches to deal with Air France current setting. For routing, we introduce an exact compact IP formulation that can be solved to optimality by current MIP solvers in at most a few minutes even on Air France largest instances. Regarding crew pairing, we provide a methodology to model the column generation pricing subproblem within a new resource constrained shortest path framework recently introduced by the first author. This new framework, which can be used as a black-box, leverages on bounds to discard partial solutions and speed-up the resolution. The resulting approach enables to solve to optimality Air France largest instances. Recent literature has focused on integrating aircraft routing and crew pairing problems. As a side result, we are able to solve to near optimality large industrial instances of the integrated problem by combining the aforementioned algorithms within a simple cut generating method. | |||||
BibTeX:
@article{Parmentier2020,
author = {Parmentier, Axel and Meunier, Frédéric},
title = {Aircraft routing and crew pairing: Updated algorithms at Air France},
journal = {Omega},
year = {2020},
volume = {93},
pages = {102073},
url = {http://www.sciencedirect.com/science/article/pii/S0305048317306837},
doi = {https://doi.org/10.1016/j.omega.2019.05.009}
}
|
|||||
| Pearson, R.K. | Mining Imperfect Data: With Examples in [BibTeX] |
2020 | , pp. 490 | book | DOI URL |
BibTeX:
@book{Pearson2020,
author = {Pearson, Ronald K.},
title = {Mining Imperfect Data: With Examples in |
|||||
| de la Peña Zarzuelo, I., Freire Soeane, M.J. and López Bermúdez, B. | Industry 4.0 in the port and maritime industry: A literature review | 2020 | Journal of Industrial Information Integration Vol. 20, pp. 100173 |
article | DOI URL |
| Abstract: Ports and terminals have evolved and from the 2010s have entered into a fifth stage of evolution characterized by their digital transformation and alignment with Industry 4.0 practices. Co-operation among agents is a key element and integration not only involves Port Authorities, Terminals and Port users and related Port Services Providers but the city, port's hinterland and well beyond the Global Supply Chain. Internet of Things and sensing solutions, cybersecurity, horizontal and vertical system integration, cloud computing, 3D printing and additive manufacturing, big data and business analytics, augmented reality and simulation and modeling are the pillars of Industry 4.0. Some of those are mature enough in the port and maritime industry. However, others remain in their earliest stages in this business and thus, poorly covered by the scientific literature. The article reviews the state of the art on these new emerging technologies, summarizing how ports and terminals are deploying specific projects in the new era of smart ports and Ports 4.0. | |||||
BibTeX:
@article{PenaZarzuelo2020,
author = {de la Peña Zarzuelo, Ignacio and Freire Soeane, María Jesús and López Bermúdez, Beatriz},
title = {Industry 4.0 in the port and maritime industry: A literature review},
journal = {Journal of Industrial Information Integration},
year = {2020},
volume = {20},
pages = {100173},
url = {https://www.sciencedirect.com/science/article/pii/S2452414X20300480},
doi = {https://doi.org/10.1016/j.jii.2020.100173}
}
|
|||||
| Poullet, J. and Parmentier, A. | Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing | 2020 | Transportation Science Vol. 54(4), pp. 956–972 |
article | DOI URL |
| Abstract: Airlines must operate many jobs in airports, such as passenger check-in or runway tasks. In airlines? hubs, airlines generally choose to perform these jobs with their own agents. Shift planning aims at building the sequences of jobs operated by the airline agents and has been widely studied given its impact on operating costs. The impact of delayed flights is generally not taken into account despite the propagation of flight delays along these sequences: If a flight is late, then the agents doing the corresponding jobs are delayed, and may arrive late to their next jobs and delay the corresponding flights. Since delay costs are much higher than the costs of outsourcing jobs, if the agent who is supposed to operate a job is still working elsewhere when the job begins, then airlines tend to outsource the job to their own dedicated team or to a third party. We introduce a stochastic version of the shift-planning problem that takes into account outsourcing costs due to delay. It can be seen as a natural stochastic generalization of the vehicle-scheduling problem in which delayed jobs are outsourced. We propose a column-generation approach to solve it, whose key element is the pricing subproblem algorithm, modeled as a stochastic resource-constrained shortest-path problem. Numerical results on Air France industrial instances show the benefits of using our stochastic version of the shift-planning problem and the efficiency of the solution method. Moving to the stochastic version enables Air France to reduce total operating costs by 3.5%?4.8% on instances with more than 200 jobs, and our algorithm can solve to near optimality instances with up to 400 jobs. | |||||
BibTeX:
@article{Poullet2020,
author = {Poullet, Julie and Parmentier, Axel},
title = {Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing},
journal = {Transportation Science},
year = {2020},
volume = {54},
number = {4},
pages = {956–972},
note = {doi: 10.1287/trsc.2019.0960},
url = {https://doi.org/10.1287/trsc.2019.0960},
doi = {https://doi.org/10.1287/trsc.2019.0960}
}
|
|||||
| Pourahmadi, F., Kazempour, J., Ordoudis, C., Pinson, P. and Hosseini, S.H. | Distributionally Robust Chance-Constrained Generation Expansion Planning [BibTeX] |
2020 | IEEE Transactions on Power Systems Vol. 35(4), pp. 2888–2903 |
article | DOI |
BibTeX:
@article{Pourahmadi2020,
author = {Pourahmadi, F. and Kazempour, J. and Ordoudis, C. and Pinson, P. and Hosseini, S. H.},
title = {Distributionally Robust Chance-Constrained Generation Expansion Planning},
journal = {IEEE Transactions on Power Systems},
year = {2020},
volume = {35},
number = {4},
pages = {2888–2903},
doi = {https://doi.org/10.1109/TPWRS.2019.2958850}
}
|
|||||
| Qiu, H. and You, F. | Decentralized-distributed robust electric power scheduling for multi-microgrid systems | 2020 | Applied Energy Vol. 269, pp. 115146 |
article | DOI URL |
| Abstract: This paper proposes a novel decentralized-distributed (DD) adaptive robust optimization (ARO) method to address the efficient distributed scheduling of multi-microgrid systems involving various entities, uncertainties and accidental communication failures. To avoid an unavailable coordination center of the whole network, a DD-ARO model is firstly proposed based on the parallelizing-distributed (PD) framework, which allocates the task of tie-line power coordination in the virtual center to the neighboring stakeholders. According to the properties of nonlinear ARO, a modified analytical target cascading method is further developed to formulate the consistency constraints on shared tie-lines, thus guaranteeing the optimality and enhancing the solution quality of the DD-ARO model. Finally, an iterative solution algorithm is proposed to efficiently solve the resulting multi-level non-convex DD-ARO model. Case studies and computational results illustrate the effectiveness of the DD-ARO approach for an AC/DC hybrid multi-microgrid system under normal and faulty communications. | |||||
BibTeX:
@article{Qiu2020,
author = {Qiu, Haifeng and You, Fengqi},
title = {Decentralized-distributed robust electric power scheduling for multi-microgrid systems},
journal = {Applied Energy},
year = {2020},
volume = {269},
pages = {115146},
url = {https://www.sciencedirect.com/science/article/pii/S0306261920306589},
doi = {https://doi.org/10.1016/j.apenergy.2020.115146}
}
|
|||||
| Quesnel, F., Desaulniers, G. and Soumis, F. | A branch-and-price heuristic for the crew pairing problem with language constraints | 2020 | European Journal of Operational Research Vol. 283(3), pp. 1040–1054 |
article | DOI URL |
| Abstract: In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew pairing problem (CPP) and the crew rostering problem (CRP). While the CPP finds a set of low-cost feasible anonymous pairings, the CRP assigns these pairings to the crew members to create a valid roster. The CRP often involves language constraints, which request language qualifications among the crew members operating some flights. In this case, the pairings returned by the CPP are not necessarily compatible with the qualifications of the available crew members, resulting in a large number of violated language constraints in the CRP. In this paper, we propose a new CPP variant, called the CPP with language constraints (CPPLC), that takes into account two types of soft language constraints that help producing more suitable pairings for satisfying the CRP language constraints. To solve the CPPLC, we develop a branch-and-price heuristic that includes an efficient partial pricing strategy for handling the large number of subproblems needed to model the language constraints. We also propose an acceleration technique to compute a high-quality (usually fractional) solution at the root node of the search tree. The proposed algorithm is tested on seven real-world datasets. We show that pairings produced by the CPPLC are better-suited for the CRP, resulting in a reduction of the number of violated CRP language constraints that varies between 61% and 96%, when compared to the pairings obtained from the traditional CPP. | |||||
BibTeX:
@article{Quesnel2020,
author = {Quesnel, Frédéric and Desaulniers, Guy and Soumis, François},
title = {A branch-and-price heuristic for the crew pairing problem with language constraints},
journal = {European Journal of Operational Research},
year = {2020},
volume = {283},
number = {3},
pages = {1040–1054},
url = {http://www.sciencedirect.com/science/article/pii/S0377221719309555},
doi = {https://doi.org/10.1016/j.ejor.2019.11.043}
}
|
|||||
| Righi, M.B., Müller, F.M. and Moresco, M.R. | On a robust risk measurement approach for capital determination errors minimization | 2020 | Insurance: Mathematics and Economics Vol. 95, pp. 199–211 |
article | DOI URL |
| Abstract: We propose a robust risk measurement approach that minimizes the expectation of overestimation plus underestimation costs. We consider uncertainty by taking the supremum over a collection of probability measures, relating our approach to dual sets in the representation of coherent risk measures. We provide results that guarantee the existence of a solution and explore the properties of minimizer and minimum as risk and deviation measures, respectively. An empirical illustration is carried out to demonstrate the use of our approach in capital determination. | |||||
BibTeX:
@article{Righi2020,
author = {Righi, Marcelo Brutti and Müller, Fernanda Maria and Moresco, Marlon Ruoso},
title = {On a robust risk measurement approach for capital determination errors minimization},
journal = {Insurance: Mathematics and Economics},
year = {2020},
volume = {95},
pages = {199–211},
url = {https://www.sciencedirect.com/science/article/pii/S0167668720301396},
doi = {https://doi.org/10.1016/j.insmatheco.2020.10.007}
}
|
|||||
| Sagi, T., Lehahn, Y. and Bar, K. | Artificial intelligence for ocean science data integration: current state, gaps, and way forward | 2020 | Elementa: Science of the Anthropocene Vol. 8 |
article | DOI URL |
| Abstract: Oceanographic research is a multidisciplinary endeavor that involves the acquisition of an increasing amount of in-situ and remotely sensed data. A large and growing number of studies and data repositories are now available on-line. However, manually integrating different datasets is a tedious and grueling process leading to a rising need for automated integration tools. A key challenge in oceanographic data integration is to map between data sources that have no common schema and that were collected, processed, and analyzed using different methodologies. Concurrently, artificial agents are becoming increasingly adept at extracting knowledge from text and using domain ontologies to integrate and align data. Here, we deconstruct the process of ocean science data integration, providing a detailed description of its three phases: discover, merge, and evaluate/correct. In addition, we identify the key missing tools and underutilized information sources currently limiting the automation of the integration process. The efforts to address these limitations should focus on (i) development of artificial intelligence-based tools for assisting ocean scientists in aligning their schema with existing ontologies when organizing their measurements in datasets; (ii) extension and refinement of conceptual coverage of – and conceptual alignment between – existing ontologies, to better fit the diverse and multidisciplinary nature of ocean science; (iii) creation of ocean-science-specific entity resolution benchmarks to accelerate the development of tools utilizing ocean science terminology and nomenclature; (iv) creation of ocean-science-specific schema matching and mapping benchmarks to accelerate the development of matching and mapping tools utilizing semantics encoded in existing vocabularies and ontologies; (v) annotation of datasets, and development of tools and benchmarks for the extraction and categorization of data quality and preprocessing descriptions from scientific text; and (vi) creation of large-scale word embeddings trained upon ocean science literature to accelerate the development of information extraction and matching tools based on artificial intelligence. | |||||
BibTeX:
@article{Sagi2020,
author = {Sagi, Tomer and Lehahn, Yoav and Bar, Koby},
title = {Artificial intelligence for ocean science data integration: current state, gaps, and way forward},
journal = {Elementa: Science of the Anthropocene},
year = {2020},
volume = {8},
url = {https://doi.org/10.1525/elementa.418},
doi = {https://doi.org/10.1525/elementa.418}
}
|
|||||
| Schulte, D.O., Arnold, D., Geiger, S., Demyanov, V. and Sass, I. | Multi-objective optimization under uncertainty of geothermal reservoirs using experimental design-based proxy models | 2020 | Geothermics Vol. 86, pp. 101792 |
article | DOI URL |
| Abstract: Geothermal energy has a high potential to contribute to a more sustainable energy system if the associated economic risks can be overcome in the design process. The development planning of deep geothermal reservoirs (over 1000 m depth) relies on computer models to forecast and then optimize system design. Optimization is easy where all the objective's (e.g. NPV) optimization parameters and, most importantly, the geology are considered as known, but this is almost always not the case. Where the complex engineering design (e.g. well placement) meets significant geological uncertainty every development option should be tested using an expensive simulation against the range of geological possibilities. The impracticality of simulating so many models results in a limited exploration of geological uncertainties and development options. Consequently, the risk of improper system design cannot be properly assessed. This paper presents an approach to understand the trade-offs in maximizing heat extraction while minimizing energy usage in re-injection for a new geothermal reservoir development while considering the uncertainty from 18 different geological models. Our approach is computationally feasible because we apply multi-objective particle swarm optimization (MOPSO), to an ensemble of response surface models, built using Gaussian process regression (GPR), for each and every geological scenario. MOPSO explores the trade-off surface for the competing objectives using the mean reservoir responses (covering the geological uncertainty). Our results highlight the impact of geological uncertainty on the optimal well placement and show the need to consider geological uncertainties adequately in optimization. The work demonstrates the shortcomings of using only one geological model of a geothermal reservoir and/or a single objective in optimization. We additionally demonstrate the practicalities of using response surface models in this way for geothermal systems. We anticipate that our work raises awareness for the scope of optimization of geothermal reservoir design under geological uncertainty. | |||||
BibTeX:
@article{Schulte2020,
author = {Schulte, Daniel O. and Arnold, Dan and Geiger, Sebastian and Demyanov, Vasily and Sass, Ingo},
title = {Multi-objective optimization under uncertainty of geothermal reservoirs using experimental design-based proxy models},
journal = {Geothermics},
year = {2020},
volume = {86},
pages = {101792},
url = {https://www.sciencedirect.com/science/article/pii/S0375650519301452},
doi = {https://doi.org/10.1016/j.geothermics.2019.101792}
}
|
|||||
| Senarak, C. | Shipping-collaboration model for the new generation of container port in innovation district: A case of Eastern Economic Corridor | 2020 | The Asian Journal of Shipping and Logistics Vol. 36(2), pp. 65–77 |
article | DOI URL |
| Abstract: The current study contributed to the literature by developing a prototype of the shipping-collaboration model illustrating what container ports should do individually or in collaboration with their users as an innovation-district member. The variables contained in the model were drawn from existing literature, and were used to develop a survey regarding the expected collaboration attributes of the users of Laem Chabang Port with the terminal operators in the context of Sriracha Innovation District (SID) Project. The questionnaire was purposively distributed to the strategy managers and senior supervisors of the shipping lines and freight forwarder companies. Based on 288 responses, path analysis was adopted to develop the shipping-collaboration model. The positive impacts of shipping collaboration on the development goals of the SID project highlighted the new agenda for terminal operators, including port authority and users, as SID members to develop new collaborative strategies. Among these, the port's digitalization and adoption of environmentally-friendly technology played a notable role in improving the capacity, energy efficiency, and sustainability of the container port. | |||||
BibTeX:
@article{Senarak2020,
author = {Senarak, Chalermpong},
title = {Shipping-collaboration model for the new generation of container port in innovation district: A case of Eastern Economic Corridor},
journal = {The Asian Journal of Shipping and Logistics},
year = {2020},
volume = {36},
number = {2},
pages = {65–77},
url = {https://www.sciencedirect.com/science/article/pii/S2092521219300677},
doi = {https://doi.org/10.1016/j.ajsl.2019.11.002}
}
|
|||||
| Shi, X., Jiang, H., Li, H. and Wang, Y. | Upgrading port-originated maritime clusters: Insights from Shanghai's experience | 2020 | Transport Policy Vol. 87, pp. 19–32 |
article | DOI URL |
| Abstract: Continuous upgrading is critical to the sustainable development of port-originated maritime clusters. This study explores the developmental trends of traditional port-originated maritime clusters from two perspectives: that of a cluster's developmental objective and that of its developmental pathway. First, the case of the Shanghai maritime cluster is selected. Its development history, competitive advantages, existing problems, and critical challenges are discussed, and policies for its upgrading and sustainable development are reviewed. Subsequently, several benchmarks pertaining to the upgrading of port-originated maritime clusters are developed. The results indicate that these clusters must be upgraded to feature ecologically friendly ports, global supply-chain hubs, and maritime resource allocation centers. Such upgrading can be achieved through both incremental and radical innovation as well as the cultivation of a first-class business environment. In the upgrade process, government plays the driving role, developing explicit cluster strategies and effective policy tools, managing internal coordination based on an effective organizational structure, and cultivating the environment by providing infrastructure and soft promotion schemes. | |||||
BibTeX:
@article{Shi2020,
author = {Shi, Xin and Jiang, Haizhou and Li, Huan and Wang, Ying},
title = {Upgrading port-originated maritime clusters: Insights from Shanghai's experience},
journal = {Transport Policy},
year = {2020},
volume = {87},
pages = {19–32},
url = {https://www.sciencedirect.com/science/article/pii/S0967070X18309430},
doi = {https://doi.org/10.1016/j.tranpol.2019.11.002}
}
|
|||||
| Strömberg, A.-B., Larsson, T. and Patriksson, M. | Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods | 2020 | Numerical Nonsmooth Optimization: State of the Art Algorithms, pp. 499–547 | inbook | DOI URL |
| Abstract: This chapter presents several solution methodologies for mixed-integer linear optimization, stated as mixed-binary optimization problems, by means of Lagrangian duals, subgradient optimization, cutting-planes, and recovery of primal solutions. It covers Lagrangian duality theory for mixed-binary linear optimization, a problem framework for which ultimate success—in most cases—is hard to accomplish, since strong duality cannot be inferred. First, a simple conditional subgradient optimization method for solving the dual problem is presented. Then, we show how ergodic sequences of Lagrangian subproblem solutions can be computed and used to recover mixed-binary primal solutions. We establish that the ergodic sequences accumulate at solutions to a convexified version of the original mixed-binary optimization problem. We also present a cutting-plane approach to the Lagrangian dual, which amounts to solving the convexified problem by Dantzig–Wolfe decomposition, as well as a two-phase method that benefits from the advantages of both subgradient optimization and Dantzig–Wolfe decomposition. Finally, we describe how the Lagrangian dual approach can be used to find near optimal solutions to mixed-binary optimization problems by utilizing the ergodic sequences in a Lagrangian heuristic, to construct a core problem, as well as to guide the branching in a branch-and-bound method. The chapter is concluded with a section comprising notes, references, historical downturns, and reading tips. | |||||
BibTeX:
@inbook{Stroemberg2020,
author = {Strömberg, Ann-Brith and Larsson, Torbjörn and Patriksson, Michael},
title = {Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods},
booktitle = {Numerical Nonsmooth Optimization: State of the Art Algorithms},
publisher = {Springer International Publishing},
year = {2020},
pages = {499–547},
url = {https://doi.org/10.1007/978-3-030-34910-3_15},
doi = {https://doi.org/10.1007/978-3-030-34910-3_15}
}
|
|||||
| Subbaswamy, A. and Saria, S. | From development to deployment: dataset shift, causality, and shift-stable models in health AI | 2020 | Biostatistics Vol. 21(2), pp. 345–352 |
article | DOI URL |
| Abstract: The deployment of machine learning (ML) and statistical models is beginning to transform the practice of healthcare, with models now able to help clinicians diagnose conditions like pneumonia and skin cancer, and to predict which hospital patients are at risk of adverse events such as septic shock. A major concern, however, is that model performance is heavily tied to details particular to the dataset the model was developed on—even slight deviations from the training conditions can result in wildly different performance. For example, when researchers trained a model to diagnose pneumonia from chest X-rays using data from one health system, but evaluated on data from an external health system, they found the model performed significantly worse than it did internally (Zech and others, 2018). The model failed to generalize (i.e., predict accurately) due to the shifts between the training conditions (health system one) and the deployment/testing conditions (health system two). These shifts are very common when moving a model from the training phase to deployment and can take a variety of forms, including changes in patient demographics, disease prevalence, measurement timing, equipment, treatment patterns, and more. Beyond contributing to poor performance, failing to account for shifts can also lead to dangerous decisions in practice: the system can fail to diagnose severely ill patients or recommend harmful treatments. This problem of shifting conditions which prevent generalization is referred to as dataset shift (Quiñonero-Candela and others, 2009), and in this article, we explain what it is, why it occurs, give an overview of the types of existing solutions, and discuss open challenges that remain. | |||||
BibTeX:
@article{Subbaswamy2020,
author = {Subbaswamy, Adarsh and Saria, Suchi},
title = {From development to deployment: dataset shift, causality, and shift-stable models in health AI},
journal = {Biostatistics},
year = {2020},
volume = {21},
number = {2},
pages = {345–352},
url = {https://doi.org/10.1093/biostatistics/kxz041},
doi = {https://doi.org/10.1093/biostatistics/kxz041}
}
|
|||||
| Sun, X., Chung, S.H. and Ma, H.L. | Operational Risk in Airline Crew Scheduling: Do Features of Flight Delays Matter? | 2020 | Decision Sciences Vol. 51(6), pp. 1455–1489 |
article | DOI URL |
| Abstract: ABSTRACT Our work is motivated by the increasing demand in the aviation sector and simultaneously aggravated poor punctuality. The airlines play an important role in improving their service level and mitigate the profit risks incurred due to their poor resources planning. However, to identify and mitigate operational risks faced by the airlines is complicated, as they are coming from both internal and external factors. Due to the realistic nature, we explore the flying time characteristics, and further model the consecutive interdependent departure-arrival times. It is a key feature included in this study that has not been studied in literature. We characterize the flying time of each flight by the heteroscedastic regression model. The analytical closed-form for the recursive relationship of the expected departure and arrival times of connective flight legs is then carried out. Accordingly, we propose a novel data-driven bicriteria mathematical model in which the interdependent structures of the departure and arrival times of the consecutive flights is incorporated into the robust optimization. A column generation-based algorithm is developed to solve the proposed model. We find that, for more than 23% of the flights explored, the expected flying times are significantly influenced by its actual departure times. The real-data based computational examples identify that our proposed model sufficiently improves the reliability of the crew pairings decisions by reducing the total deviated time from the schedules with a slight increase of the total basic crew operations cost. Some managerial implications for robust crew pairing and determination of robustness level are discussed as well. | |||||
BibTeX:
@article{Sun2020,
author = {Sun, X. and Chung, S. H. and Ma, H. L.},
title = {Operational Risk in Airline Crew Scheduling: Do Features of Flight Delays Matter?},
journal = {Decision Sciences},
year = {2020},
volume = {51},
number = {6},
pages = {1455–1489},
note = {Export Date: 10 April 2020},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077864141&doi=10.1111%2fdeci.12426&partnerID=40&md5=dbb3307e4e8c67e2e70c5ccab07b34f0},
doi = {https://doi.org/10.1111/deci.12426}
}
|
|||||
| Wang, K. and Jacquillat, A. | A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations | 2020 | Operations Research Vol. 68(5), pp. 1375–1402 |
article | DOI URL |
| Abstract: Air traffic management measures comprise tactical operating procedures to minimize delay costs and strategic scheduling interventions to control overcapacity scheduling. Although interdependent, these problems have been treated in isolation. This paper proposes an integrated model of scheduling and operations in airport networks that jointly optimizes scheduling interventions and ground-holding operations across airports networks under operating uncertainty. It is formulated as a two-stage stochastic program with integer recourse. To solve it, we develop an original decomposition algorithm with provable solution quality guarantees. The algorithm relies on new optimality cuts?dual integer cuts?that leverage the reduced costs of the dual linear programming relaxation of the second-stage problem. The algorithm also incorporates neighborhood constraints, which shift from exploration to exploitation at later stages. We also use a scenario generation approach to construct representative scenarios from historical records of operations?using integer programming. Computational experiments show that our algorithm yields near-optimal solutions for the entire U.S. National Airspace System network. Ultimately, the proposed approach enhances airport demand management models through scale integration (by capturing network-wide interdependencies) and scope integration (by capturing interdependencies between scheduling and operations). | |||||
BibTeX:
@article{Wang2020,
author = {Wang, Kai and Jacquillat, Alexandre},
title = {A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations},
journal = {Operations Research},
year = {2020},
volume = {68},
number = {5},
pages = {1375–1402},
url = {https://doi.org/10.1287/opre.2020.1985},
doi = {https://doi.org/10.1287/opre.2020.1985}
}
|
|||||
| Wang, M., Yu, H., Lin, X., Jing, R., He, F. and Li, C. | Comparing stochastic programming with posteriori approach for multi-objective optimization of distributed energy systems under uncertainty | 2020 | Energy Vol. 210, pp. 118571 |
article | DOI URL |
| Abstract: Uncertainty complicates the optimization model of distributed energy systems, it is a challenge to address the fragility of optimal solutions, which calls for an effective but convenient approach to introduce uncertainties into multi-objective optimization. This study proposes and compares the priori and the posteriori modeling approaches for optimizing the design of distributed energy systems under uncertainty. The posteriori approach is developed as a Monte Carlo simulation combined with the deterministic programming model, while the priori approach is formulated as a two-stage stochastic programming model. Both approaches consider economic and environmental objectives and use the same set of uncertainty parameters based on a case study in Shanghai. The results show that, compared with the priori-approach model, the posteriori-approach model leads to an underestimation of the total annual cost, but their total annual carbon emission approximates. Besides, the Pareto frontier cliques from the posteriori approach demonstrate the distributions of system performance, whereas the priori approach can capture the uncertainties at the substantially higher computational cost. Finally, the tradeoff between model complexity and computational cost is discussed to generate more insights on the optimal design, i.e., configuration and dispatch, of distributed energy systems. | |||||
BibTeX:
@article{Wang2020a,
author = {Wang, Meng and Yu, Hang and Lin, Xiaoyu and Jing, Rui and He, Fangjun and Li, Chaoen},
title = {Comparing stochastic programming with posteriori approach for multi-objective optimization of distributed energy systems under uncertainty},
journal = {Energy},
year = {2020},
volume = {210},
pages = {118571},
url = {https://www.sciencedirect.com/science/article/pii/S0360544220316790},
doi = {https://doi.org/10.1016/j.energy.2020.118571}
}
|
|||||
| Weiszer, M., Burke, E.K. and Chen, J. | Multi-objective routing and scheduling for airport ground movement | 2020 | Transportation Research Part C: Emerging Technologies Vol. 119, pp. 102734 |
article | DOI URL |
| Abstract: Recent research on airport ground movement introduced an Active Routing framework to support multi-objective trajectory-based operations. This results in edges in the airport taxiway graph having multiple costs such as taxi time, fuel consumption and emissions. In such a graph, multiple edges exist between two nodes reflecting different trade-offs among the multiple costs. Aircraft will have to choose the most efficient edge from multiple edges in order to traverse from one node to another respecting various operational constraints. In this paper, we introduce a multi-objective routing and scheduling algorithm based on the enumerative approach that can be used to solve such a multi-objective multi-graph problem. Results using the proposed algorithm for a range of international airports are presented. Compared with other routing and scheduling algorithms, the proposed algorithm can find a representative set of optimal or near optimal solutions in a single run when the sequence of aircraft is fixed. In order to accelerate the search, heuristic functions and a preference-based approach are introduced. We analyse the performance of different approaches and discuss how the structure of the multi-graph affects computational complexity and quality of solutions. | |||||
BibTeX:
@article{Weiszer2020,
author = {Weiszer, Michal and Burke, Edmund K. and Chen, Jun},
title = {Multi-objective routing and scheduling for airport ground movement},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2020},
volume = {119},
pages = {102734},
url = {http://www.sciencedirect.com/science/article/pii/S0968090X20306483},
doi = {https://doi.org/10.1016/j.trc.2020.102734}
}
|
|||||
| Wen, X., Ma, H.-L., Chung, S.-H. and Khan, W.A. | Robust airline crew scheduling with flight flying time variability | 2020 | Transportation Research Part E: Logistics and Transportation Review Vol. 144, pp. 102132 |
article | DOI URL |
| Abstract: The crew pairing problem is one of the most important but challenging tasks for commercial airlines. However, the operation environment of the aviation industry is highly volatile with diverse uncertainties. Flight flying time variability is an important disruption that usually causes deviations of flight departure/arrival times from the schedule. Traditional crew pairing frameworks without considering flight flying time variability can generate pairings that are fragile to flight delays. However, the impact of flight flying time variability on crew pairings is under-explored. In this paper, we propose two robustness enhancement strategies based on the consideration of flight flying time variability (i.e., encouraging deviation-affected-free flights and discouraging deviation-affected flights). Besides, two robustness measurements are developed to construct two novel robust crew pairing models. One is time based while the other is number based. A customized column generation based solution algorithm is proposed. Computational experiments based on real flight schedules show that our new models can greatly enhance solution robustness (e.g., 49.1% more deviation-buffer time) at a price of an acceptable increase in operating costs (e.g., 9.7%) compared with the traditional model. Besides, extreme-delay flights can be completely avoided in the proposed models. Moreover, the solutions obtained from the time-based model show higher resistance against the disruption of flight flying time variability with a lower operating cost than the number-based model. | |||||
BibTeX:
@article{Wen2020,
author = {Wen, Xin and Ma, Hoi-Lam and Chung, Sai-Ho and Khan, Waqar Ahmed},
title = {Robust airline crew scheduling with flight flying time variability},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2020},
volume = {144},
pages = {102132},
url = {http://www.sciencedirect.com/science/article/pii/S1366554520307791},
doi = {https://doi.org/10.1016/j.tre.2020.102132}
}
|
|||||
| Wickert, T.I., Kummer Neto, A.F., Boniatti, M.M. and Buriol, L.S. | An integer programming approach for the physician rostering problem | 2020 | Annals of Operations Research | article | DOI URL |
| Abstract: This paper presents an integer programming model and a matheuristic for the physician rostering problem. Constraints related to physician’s preferences, legal restrictions, hospital requirements and workload balance are investigated. Moreover, a comparison of physician and nurse rostering is analyzed to identify common constraints present in both problems. The lack of a mathematical model that could be applied in the studied problem motivated the development of a new formulation. Data and constraints of the proposed physician rostering problem were provided by Hospital de Clínicas de Porto Alegre (HCPA), Brazil. Due to the difficulty of solving large instances, a matheuristic which combines integer programming and heuristic techniques was proposed to approach the problem. Computational experiments were conducted employing commercial and open-source solvers. Results revealed that open-source solvers are a good alternative to solve small problems, while the proposed matheuristic generated near-optimal results within acceptable computation time employing larger instances. | |||||
BibTeX:
@article{Wickert2020,
author = {Wickert, Toni I. and Kummer Neto, Alberto F. and Boniatti, Márcio M. and Buriol, Luciana S.},
title = {An integer programming approach for the physician rostering problem},
journal = {Annals of Operations Research},
year = {2020},
url = {https://doi.org/10.1007/s10479-020-03552-5},
doi = {https://doi.org/10.1007/s10479-020-03552-5}
}
|
|||||
| Yaakoubi, Y., Soumis, F. and Lacoste-Julien, S. | Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation | 2020 | EURO Journal on Transportation and Logistics Vol. 9(4), pp. 100020 |
article | DOI URL |
| Abstract: The crew pairing problem (CPP) is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of flight legs separated by connection time and rest periods that starts and ends at the same base. Because of the extensive list of complex rules and regulations, determining whether a sequence of flights constitutes a feasible pairing can be quite difficult by itself, making CPP one of the hardest of the airline planning problems. In this paper, we first propose to improve the prototype Baseline solver of Desaulniers et al. (2020)2020) by adding dynamic control strategies to obtain an efficient solver for large-scale CPPs: Commercial-GENCOL-DCA. These solvers are designed to aggregate the flights covering constraints to reduce the size of the problem. Then, we use machine learning (ML) to produce clusters of flights having a high probability of being performed consecutively by the same crew. The solver combines several advanced Operations Research techniques to assemble and modify these clusters, when necessary, to produce a good solution. We show, on monthly CPPs with up to 50 000 flights, that Commercial-GENCOL-DCA with clusters produced by ML-based heuristics outperforms Baseline fed by initial clusters that are pairings of a solution obtained by rolling horizon with GENCOL. The reduction of solution cost averages between 6.8% and 8.52%, which is mainly due to the reduction in the cost of global constraints between 69.79% and 78.11%. | |||||
BibTeX:
@article{Yaakoubi2020,
author = {Yaakoubi, Yassine and Soumis, François and Lacoste-Julien, Simon},
title = {Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation},
journal = {EURO Journal on Transportation and Logistics},
year = {2020},
volume = {9},
number = {4},
pages = {100020},
url = {http://www.sciencedirect.com/science/article/pii/S2192437620300236},
doi = {https://doi.org/10.1016/j.ejtl.2020.100020}
}
|
|||||
| Yang, H., Morton, D.P., Bandi, C. and Dvijotham, K. | Robust Optimization for Electricity Generation | 2020 | INFORMS Journal on Computing Vol. 33(1), pp. 336–351 |
article | DOI URL |
| Abstract: We consider a robust optimization problem in an electric power system under uncertain demand and availability of renewable energy resources. Solving the deterministic alternating current (AC) optimal power flow (ACOPF) problem has been considered challenging since the 1960s due to its nonconvexity. Linear approximation of the AC power flow system sees pervasive use, but does not guarantee a physically feasible system configuration. In recent years, various convex relaxation schemes for the ACOPF problem have been investigated, and under some assumptions, a physically feasible solution can be recovered. Based on these convex relaxations, we construct a robust convex optimization problem with recourse to solve for optimal controllable injections (fossil fuel, nuclear, etc.) in electric power systems under uncertainty (renewable energy generation, demand fluctuation, etc.). We propose a cutting-plane method to solve this robust optimization problem, and we establish convergence and other desirable properties. Experimental results indicate that our robust convex relaxation of the ACOPF problem can provide a tight lower bound. | |||||
BibTeX:
@article{Yang2020,
author = {Yang, Haoxiang and Morton, David P. and Bandi, Chaithanya and Dvijotham, Krishnamurthy},
title = {Robust Optimization for Electricity Generation},
journal = {INFORMS Journal on Computing},
year = {2020},
volume = {33},
number = {1},
pages = {336–351},
note = {doi: 10.1287/ijoc.2020.0956},
url = {https://doi.org/10.1287/ijoc.2020.0956},
doi = {https://doi.org/10.1287/ijoc.2020.0956}
}
|
|||||
| Zeighami, V., Saddoune, M. and Soumis, F. | Alternating Lagrangian decomposition for integrated airline crew scheduling problem | 2020 | European Journal of Operational Research Vol. 287(1), pp. 211–224 |
article | DOI URL |
| Abstract: The airline crew scheduling problem is usually solved sequentially in two main steps because of its complexity: the crew pairing followed by the crew assignment. However, finding a globally optimal solution via the sequential approach may be impossible because the decision domain of the crew assignment problem is reduced by decisions made in the pairing problem. This study considers the crew scheduling problem in a personalized context where each pilot and copilot requests a set of preferred flights and vacations each month. We propose a model that completely integrates the crew pairing and personalized assignment problems to generate personalized monthly schedules for a given set of pilots and copilots simultaneously in a single optimization step. The model keeps the pairings in the two problems as similar as possible so that the propagation of perturbations arising during the operation is reduced. We develop an integrated algorithm that combines alternating Lagrangian decomposition, column generation, and dynamic constraint aggregation. We conduct computational experiments on a set of real instances from a major US carrier. Our integrated approach produces significant cost savings and better satisfaction of crew preferences compared with the traditional sequential approach. | |||||
BibTeX:
@article{Zeighami2020,
author = {Zeighami, Vahid and Saddoune, Mohammed and Soumis, François},
title = {Alternating Lagrangian decomposition for integrated airline crew scheduling problem},
journal = {European Journal of Operational Research},
year = {2020},
volume = {287},
number = {1},
pages = {211–224},
url = {http://www.sciencedirect.com/science/article/pii/S0377221720304161},
doi = {https://doi.org/10.1016/j.ejor.2020.05.005}
}
|
|||||
| Zhou, A., Yang, M., Wang, M. and Zhang, Y. | A Linear Programming Approximation of Distributionally Robust Chance-Constrained Dispatch With Wasserstein Distance [BibTeX] |
2020 | IEEE Transactions on Power Systems Vol. 35(5), pp. 3366–3377 |
article | DOI |
BibTeX:
@article{Zhou2020,
author = {Zhou, A. and Yang, M. and Wang, M. and Zhang, Y.},
title = {A Linear Programming Approximation of Distributionally Robust Chance-Constrained Dispatch With Wasserstein Distance},
journal = {IEEE Transactions on Power Systems},
year = {2020},
volume = {35},
number = {5},
pages = {3366–3377},
doi = {https://doi.org/10.1109/TPWRS.2020.2978934}
}
|
|||||
| Zhou, B., Chen, G., Song, Q. and Dong, Z.Y. | Robust chance-constrained programming approach for the planning of fast-charging stations in electrified transportation networks | 2020 | Applied Energy Vol. 262, pp. 114480 |
article | DOI URL |
| Abstract: In this paper, a bi-level programming model is established to address the planning issues of fast-charging stations in electrified transportation networks with the consideration of uncertain charging demands. The capacitated flow refueling location model is considered in the upper level to minimize the planning cost of fast-charging stations while the traffic assignment model is utilized in the lower level to determine the spatial and temporal distribution of plug-in electric vehicle flows over entire transportation networks. Such bi-level model unveils the inherent relationship among charging demands, electrical demands and the spatial and temporal distribution of plug-in electric vehicle flows. Robust chance constraints are formulated to characterize the service abilities of fast-charging stations under distribution-free uncertain charging demands, where the ambiguity set is constructed to estimate the potential values of the uncertainties based on their moment-based information, such that the robust chance constraints can exactly be reduced to mixed integer linear constraints. By introducing new variables, the bi-level model is then reformulated into a single-level mixed integer second-order cone programming model so as to be solved via off-the-shelf solvers, which guarantee the optimality of the solution. A case study is conducted to illustrate the effectiveness of the proposed planning model, which reveals three critical factors that significantly impact the planning outcomes. | |||||
BibTeX:
@article{Zhou2020a,
author = {Zhou, Bo and Chen, Guo and Song, Qiankun and Dong, Zhao Yang},
title = {Robust chance-constrained programming approach for the planning of fast-charging stations in electrified transportation networks},
journal = {Applied Energy},
year = {2020},
volume = {262},
pages = {114480},
url = {https://www.sciencedirect.com/science/article/pii/S0306261919321683},
doi = {https://doi.org/10.1016/j.apenergy.2019.114480}
}
|
|||||
| Zhou, L., Liang, Z., Chou, C.-A. and Chaovalitwongse, W.A. | Airline planning and scheduling: Models and solution methodologies | 2020 | Frontiers of Engineering Management Vol. 7(1), pp. 1–26 |
article | DOI URL |
| Abstract: The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research. | |||||
BibTeX:
@article{Zhou2020b,
author = {Zhou, Lei and Liang, Zhe and Chou, Chun-An and Chaovalitwongse, Wanpracha Art},
title = {Airline planning and scheduling: Models and solution methodologies},
journal = {Frontiers of Engineering Management},
year = {2020},
volume = {7},
number = {1},
pages = {1–26},
url = {https://doi.org/10.1007/s42524-020-0093-5},
doi = {https://doi.org/10.1007/s42524-020-0093-5}
}
|
|||||
| Antunes, D., Vaze, V. and Antunes, A.P. | A Robust Pairing Model for Airline Crew Scheduling | 2019 | Transportation Science Vol. 53(6), pp. 1751–1771 |
article | DOI URL |
| Abstract: Delays and disruptions in airline operations annually result in billions of dollars of additional costs to airlines, passengers, and the economy. Airlines strive to mitigate these costs by creating schedules that are less likely to get disrupted or schedules that are easier to repair when there are disruptions. In this paper, we present a robust optimization model for the crew pairing problem, which generates crew schedules that are less likely to get disrupted. Our model allows adding robustness without requiring detailed knowledge of the underlying delay distributions. Moreover, our model allows us to capture in detail the delay propagation through crew connections and the complex cost structure of the pay-and-credit crew salary scheme, thus enabling us to find a good trade-off between the deterministic component of the planned costs on the one hand and the expected delay and disruption costs on the other hand. Our robust crew pairing model is based on a deterministic crew pairing model formulated as a mixed-integer linear program. The robust version that we propose retains the linearity of the constraints and objective function and thus can be handled by commercial solvers, which facilitates its implementation in practice. We propose and implement a new solution algorithm for solving our model to optimality. Several optimal solutions with varying robustness levels are compared for the network of a moderate-size airline in the United States. We test the model?s solutions in a simulation environment using real-world delay data. Our simulation results show that the robust crew pairing solutions lead to lower delays and fewer instances of operational infeasibilities, thus requiring fewer recovery actions to address them. We find that, with the inclusion of robustness, it is possible to generate crew pairing solutions that significantly reduce the delay and disruption costs with only a small increase in planned costs. | |||||
BibTeX:
@article{Antunes2019,
author = {Antunes, David and Vaze, Vikrant and Antunes, António Pais},
title = {A Robust Pairing Model for Airline Crew Scheduling},
journal = {Transportation Science},
year = {2019},
volume = {53},
number = {6},
pages = {1751–1771},
url = {https://doi.org/10.1287/trsc.2019.0897},
doi = {https://doi.org/10.1287/trsc.2019.0897}
}
|
|||||
| Assadi, S. and Singla, S. | Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders [BibTeX] |
2019 | CoRR Vol. abs/1911.02716 |
article | URL |
BibTeX:
@article{Assadi2019,
author = {Assadi, Sepehr and Singla, Sahil},
title = {Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders},
journal = {CoRR},
year = {2019},
volume = {abs/1911.02716},
url = {http://arxiv.org/abs/1911.02716}
}
|
|||||
| Azad, N. and Hassini, E. | Recovery strategies from major supply disruptions in single and multiple sourcing networks | 2019 | European Journal of Operational Research Vol. 275(2), pp. 481–501 |
article | DOI URL |
| Abstract: The increase in supply network disruptions has shown that many companies have been caught by surprise and were not able to quickly, if at all, recover from these disruptions. In this paper we propose models for optimal recovery from major unpredictable disruptions in a supply network. We consider a supply network that is comprised of customers and production facilities where disruption may occur at any of the facilities and can cause partial failure or complete shutdown of the supply facilities. The novelty of our model is that it incorporates dynamic pricing as a lever to manage demand during such disruptions. In addition to pricing we also incorporate recovery strategies that are based on inventory, transshipment and outsourcing. We allow for the recovery duration and the disrupted capacity to be uncertain and use pricing to reflect temporary impacts of disruption on demand. Demand is price sensitive and accounts for uncertainty in the customers’ willingness to pay during the recovery period. We investigate the cases of multi-sourcing and single-sourcing. The multi-sourcing model is a convex programming model which is easy to solve using commercial solvers. An accelerated Benders decomposition method with valid inequalities is proposed and tested for solving the more complex single-sourcing model. Using a US case study we find that a dynamic pricing recovery strategy can improve profits during recovery from major supply disruptions. Furthermore, we find that a dynamic pricing recovery strategy is more efficient in single-sourcing networks than multi-sourcing networks. | |||||
BibTeX:
@article{Azad2019,
author = {Azad, Nader and Hassini, Elkafi},
title = {Recovery strategies from major supply disruptions in single and multiple sourcing networks},
journal = {European Journal of Operational Research},
year = {2019},
volume = {275},
number = {2},
pages = {481–501},
url = {https://www.sciencedirect.com/science/article/pii/S0377221718309858},
doi = {https://doi.org/10.1016/j.ejor.2018.11.044}
}
|
|||||
| Barnett, R.A., Ziegler, M.R., Byleen, K.E. and Stocker, C.J. | College mathematics for business, economics, life sciences, and social sciences [BibTeX] |
2019 | , pp. 1 volume (various pages) | book | |
BibTeX:
@book{Barnett2019,
author = {Barnett, Raymond A. and Ziegler, Michael R. and Byleen, Karl E. and Stocker, Christopher J.},
title = {College mathematics for business, economics, life sciences, and social sciences},
publisher = {Pearson},
year = {2019},
pages = {1 volume (various pages)},
edition = {Fourteenth edition /},
note = {2017037295 Raymond A. Barnett, Merritt College, Michael R. Ziegler, Marquette University, Karl E. Byleen, Marquette University, Christopher J. Stocker, Marquette University. illustrations (some color) ; 29 cm Includes indexes.}
}
|
|||||
| Behnezhad, S., Hajiaghayi, M. and Harris, D.G. | Exponentially Faster Massively Parallel Maximal Matching [BibTeX] |
2019 | CoRR Vol. abs/1901.03744 |
article | URL |
BibTeX:
@article{Behnezhad2019,
author = {Behnezhad, Soheil and Hajiaghayi, MohammadTaghi and Harris, David G.},
title = {Exponentially Faster Massively Parallel Maximal Matching},
journal = {CoRR},
year = {2019},
volume = {abs/1901.03744},
url = {http://arxiv.org/abs/1901.03744}
}
|
|||||
| Bhatia, M., Sood, S.K. and Kaur, S. | Quantum-based predictive fog scheduler for IoT applications | 2019 | Computers in Industry Vol. 111, pp. 51–67 |
article | DOI URL |
| Abstract: Load scheduling across distributed fog computing nodes has been a major challenge to meet the increased demand of real-time data analysis, and time-sensitive decision-making. This study presents a Quantum Computing-inspired (QCi) optimized load scheduling technique in fog computing environments for real-time IoT applications. In addition to this, QCi-Neural Network Model is used as a predictive model to determine the optimal computational node for enabling real-time service delivery. For validation, simulations were performed using 3, 5, 7, and 10 fog nodes at different instances to schedule nearly 600 heterogeneous tasks to obtain the respective results. Results were compared with other state-of-the-art scheduling models like Min–Max, Minimum Completion time, and Round Robin. Better results were registered for the proposed technique in terms of minimum average task completion time (28.15 s for 10 nodes) and average energy consumption (3.48 J for 10 nodes). Moreover, higher rates of statistical parameters like sensitivity (88.66%), specificity (91.28%), precision (92.25%), and coverage (95.66%) were acquired depicting enhanced overall performance. | |||||
BibTeX:
@article{Bhatia2019,
author = {Bhatia, Munish and Sood, Sandeep K. and Kaur, Simranpreet},
title = {Quantum-based predictive fog scheduler for IoT applications},
journal = {Computers in Industry},
year = {2019},
volume = {111},
pages = {51–67},
url = {https://www.sciencedirect.com/science/article/pii/S016636151930140X},
doi = {https://doi.org/10.1016/j.compind.2019.06.002}
}
|
|||||
| Bjerkan, K.Y. and Seter, H. | Reviewing tools and technologies for sustainable ports: Does research enable decision making in ports? | 2019 | Transportation Research Part D: Transport and Environment Vol. 72, pp. 243–260 |
article | DOI URL |
| Abstract: Ports are experiencing increased pressure to reduce negative impacts on climate and environment, and their roles and functions in transport systems and economy make them a key factor in promoting sustainability. There is substantial research on strategies and measures for mitigating emissions and pollution. This paper reviews literature on tools and technologies for sustainable ports and presents a typology based on 70 publications published in peer-reviewed journals. The paper outlines 26 tools and technologies, across four main categories (i) port management and plans, (ii) power and fuels, (iii) sea activities and (iv) land activities. The paper further discusses to what extent existing research supports port decision makers in their effort towards sustainability. We suggest that the literature gives an insufficient foundation for decision making in ports. The main reason is that few papers are based on empirical findings. We therefore suggest several avenues for addressing port sustainability in future research to enable port decision makers to select and prioritize tools or technologies: increased use of empirical data, port engagement, and understanding actors and processes in port decision making. | |||||
BibTeX:
@article{Bjerkan2019,
author = {Bjerkan, Kristin Ystmark and Seter, Hanne},
title = {Reviewing tools and technologies for sustainable ports: Does research enable decision making in ports?},
journal = {Transportation Research Part D: Transport and Environment},
year = {2019},
volume = {72},
pages = {243–260},
url = {https://www.sciencedirect.com/science/article/pii/S1361920919300549},
doi = {https://doi.org/10.1016/j.trd.2019.05.003}
}
|
|||||
| Ceschia, S., Dang, N., De Causmaecker, P., Haspeslagh, S. and Schaerf, A. | The Second International Nurse Rostering Competition | 2019 | Annals of Operations Research Vol. 274(1), pp. 171–186 |
article | DOI URL |
| Abstract: This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) final results of the competition. We discuss also the competition environment, which is an infrastructure including problem and instance definitions, testbeds, validation/simulation tools and rules. The hardness of the competition instances has been evaluated through the behaviour of our own solvers, and confirmed by the solvers of the participants. Finally, we discuss general issues about both nurse rostering problems and optimisation competitions in general. | |||||
BibTeX:
@article{Ceschia2019,
author = {Ceschia, Sara and Dang, Nguyen and De Causmaecker, Patrick and Haspeslagh, Stefaan and Schaerf, Andrea},
title = {The Second International Nurse Rostering Competition},
journal = {Annals of Operations Research},
year = {2019},
volume = {274},
number = {1},
pages = {171–186},
url = {https://doi.org/10.1007/s10479-018-2816-0},
doi = {https://doi.org/10.1007/s10479-018-2816-0}
}
|
|||||
| Dalmau Codina, R.i. | Improving the predictability of take-off times with Machine Learning : a case study for the Maastricht upper area control centre area of responsibility [BibTeX] |
2019 | misc | URL | |
BibTeX:
@misc{DalmauCodina2019,
author = {Dalmau Codina, RamonMés informació},
title = {Improving the predictability of take-off times with Machine Learning : a case study for the Maastricht upper area control centre area of responsibility},
year = {2019},
url = {https://upcommons.upc.edu/handle/2117/181173}
}
|
|||||
| Delgado, F., Trincado, R. and Pagnoncelli, B.K. | A multistage stochastic programming model for the network air cargo allocation under capacity uncertainty | 2019 | Transportation Research Part E: Logistics and Transportation Review Vol. 131, pp. 292–307 |
article | DOI URL |
| Abstract: We propose a multistage stochastic programming model to optimally allocate cargo to the passengers network in order to maximize profit, taking into account incomes, costs and penalties for not delivering cargo that was previously accepted. Flights have a discrete number of possible capacity outcomes, with known probabilities, and uncertainty is represented by a scenario tree. The resulting problem is a large-scale linear program, and we use decomposition techniques to solve it, leveraging on the problem structure in order to be able to find good quality solutions. Our numerical experiments are based on a real network of a major commercial airline. | |||||
BibTeX:
@article{Delgado2019,
author = {Delgado, Felipe and Trincado, Ricardo and Pagnoncelli, Bernardo K.},
title = {A multistage stochastic programming model for the network air cargo allocation under capacity uncertainty},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2019},
volume = {131},
pages = {292–307},
url = {https://www.sciencedirect.com/science/article/pii/S1366554519304363},
doi = {https://doi.org/10.1016/j.tre.2019.09.011}
}
|
|||||
| Diehlmann, F., Zimmer, T., Glöser-Chahoud, S., Wiens, M. and Schultmann, F. | Techno-economic assessment of utilization pathways for rice straw: A simulation-optimization approach | 2019 | Journal of Cleaner Production Vol. 230, pp. 1329–1343 |
article | DOI URL |
| Abstract: Countries all over the world try to promote the use of biomass in order to reach environmental goals. However, existing technologies and products contain many uncertainties that make the assessment of economically and environmentally sustainable utilization pathways very challenging. One country with an extremely high biomass potential is Thailand, where the strong agricultural sector produces large amounts of agricultural residues, such as rice straw. Therefore, the objective of the article is to analyze different utilization pathways for rice straw potentials in central Thailand. Four different technologies (combustion, gasification, pyrolysis, and pelletizing) are assessed, and economically favorable applications are investigated. Two types of uncertainties are included within a hybrid simulation-optimization approach. First, uncertainties for technological and economic factors of each component of the supply chain are included in a Monte Carlo simulation. Second, uncertain framework conditions such as political goals, demand for bioenergy, or fuel prices are included as scenarios in the stochastic optimization model, which at the same time processes the results of the Monte Carlo simulation. This approach allows for the evaluation of the percentage of the rice straw potential in central Thailand that could be utilized from an economic perspective. However, the results indicate that only 46–65 percent of the rice straw could be processed in a profitable way. Considering the analyzed technologies, the production of pyrolysis oil was identified to be the economically best utilization path for rice straw, which is in line with Thailand's target of 0.5 million liters of pyrolysis oil to be used in 2036 per day. | |||||
BibTeX:
@article{Diehlmann2019,
author = {Diehlmann, Florian and Zimmer, Tobias and Glöser-Chahoud, Simon and Wiens, Marcus and Schultmann, Frank},
title = {Techno-economic assessment of utilization pathways for rice straw: A simulation-optimization approach},
journal = {Journal of Cleaner Production},
year = {2019},
volume = {230},
pages = {1329–1343},
url = {https://www.sciencedirect.com/science/article/pii/S0959652619314702},
doi = {https://doi.org/10.1016/j.jclepro.2019.04.369}
}
|
|||||
| Erichson, N.B., Mathelin, L., Kutz, J.N. and Brunton, S.L. | Randomized Dynamic Mode Decomposition [BibTeX] |
2019 | SIAM Journal on Applied Dynamical Systems Vol. 18(4), pp. 1867–1891 |
article | DOI URL |
BibTeX:
@article{Erichson2019,
author = {Erichson, N. Benjamin and Mathelin, Lionel and Kutz, J. Nathan and Brunton, Steven L.},
title = {Randomized Dynamic Mode Decomposition},
journal = {SIAM Journal on Applied Dynamical Systems},
year = {2019},
volume = {18},
number = {4},
pages = {1867–1891},
note = {doi: 10.1137/18M1215013},
url = {https://doi.org/10.1137/18M1215013},
doi = {https://doi.org/10.1137/18M1215013}
}
|
|||||
| Ermis, G. and Akkan, C. | Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure | 2019 | Annals of Operations Research Vol. 275(1), pp. 101–121 |
article | DOI URL |
| Abstract: We develop search algorithms based on local search, and a matheuristic that solves a set of mixed integer programming models to improve the robustness of a set of solutions for an academic timetabling problem. The matheuristic uses the solution pool feature of CPLEX while solving two related MIP models iteratively. The solutions form a network (Akkan et al. in Eur J Oper Res 249(2):560–576, 2016. doi:10.1016/j.ejor.2015.08.047), in which edges are defined by the Hamming distance between pairs of solutions. This network is used to calculate a robustness measure, where disruption of a solution is assumed to occur when the time slot to which a team had been assigned is no longer feasible for that team and the heuristic response to this disruption is choosing one of the neighbors of the disrupted solution. Considering the objective function of the timetabling problem and this robustness measure results in a bi-criteria optimization problem where the goal is to improve the Pareto front by enlarging the network. We compare the performance of the heuristics on a set of random instances and seven semesters’ actual data. These results show that some of the proposed local search algorithms and the matheuristic find high quality approximate Pareto fronts. Besides being one of the few timetabling algorithms in the literature addressing robustness, a key contribution of this research is the demonstration of the effectiveness of the matheuristic approach. By using this matheuristic approach, for any discrete optimization model that can be solved optimally or near-optimally in an acceptable time, researchers can develop a robustness improvement algorithm. | |||||
BibTeX:
@article{Ermis2019,
author = {Ermis, Gülcin and Akkan, Can},
title = {Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure},
journal = {Annals of Operations Research},
year = {2019},
volume = {275},
number = {1},
pages = {101–121},
url = {https://doi.org/10.1007/s10479-017-2646-5},
doi = {https://doi.org/10.1007/s10479-017-2646-5}
}
|
|||||
| Gill, P.E., Murray, W. and Wright, M.H. | Practical Optimization [BibTeX] |
2019 | , pp. 421 | book | DOI URL |
BibTeX:
@book{Gill2019,
author = {Gill, Philip E. and Murray, Walter and Wright, Margaret H.},
title = {Practical Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {421},
note = {doi:10.1137/1.9781611975604},
url = {https://doi.org/10.1137/1.9781611975604},
doi = {https://doi.org/10.1137/1.9781611975604}
}
|
|||||
| Giraldo, J.S., Castrillon, J.A., López, J.C., Rider, M.J. and Castro, C.A. | Microgrids Energy Management Using Robust Convex Programming [BibTeX] |
2019 | IEEE Transactions on Smart Grid Vol. 10(4), pp. 4520–4530 |
article | DOI |
BibTeX:
@article{Giraldo2019,
author = {Giraldo, J. S. and Castrillon, J. A. and López, J. C. and Rider, M. J. and Castro, C. A.},
title = {Microgrids Energy Management Using Robust Convex Programming},
journal = {IEEE Transactions on Smart Grid},
year = {2019},
volume = {10},
number = {4},
pages = {4520–4530},
doi = {https://doi.org/10.1109/TSG.2018.2863049}
}
|
|||||
| Guo, W., Toader, B., Feier, R., Mosquera, G., Ying, F., Oh, S.-W., Price-Williams, M. and Krupp, A. | Global air transport complex network: multi-scale analysis | 2019 | SN Applied Sciences Vol. 1(7), pp. 680 |
article | DOI URL |
| Abstract: Almost half of the world’s population is carried by airlines each year, and understanding this mode of transport is important from economic and scientific perspectives. In recent years, the increasing availability of data has led to complex network and agent interaction models which attempt to gain better understanding of the air transport network and develop forecasts. In this case study paper, we review existing research on two key approaches, namely: (1) a top-down multi-scale network science approach, and (2) a bottom-up entropy-maximization interaction network approach. Using simple socioeconomic indicators, we were able to construct a very accurate interaction model that can predict traffic volume, and the model can forward estimate the impact of population growth or fuel cost. Using network science approaches, we were able to identify community structures and relate them to economic outputs. We also saw how hubs evolved over time to become more influential. Looking into the future, using random graph theory, it seems that reduced flight cost will lead to increased hub influence. The disseminated knowledge in this case study paper will provide both academics and industry practitioners with steps forward to co-explore the interesting research landscape. | |||||
BibTeX:
@article{Guo2019,
author = {Guo, Weisi and Toader, Bogdan and Feier, Roxana and Mosquera, Guillem and Ying, Fabian and Oh, Se-Wook and Price-Williams, Matthew and Krupp, Armin},
title = {Global air transport complex network: multi-scale analysis},
journal = {SN Applied Sciences},
year = {2019},
volume = {1},
number = {7},
pages = {680},
url = {https://doi.org/10.1007/s42452-019-0702-2},
doi = {https://doi.org/10.1007/s42452-019-0702-2}
}
|
|||||
| Home-Ortiz, J.M., Melgar-Dominguez, O.D., Pourakbari-Kasmaei, M. and Mantovani, J.R.S. | A stochastic mixed-integer convex programming model for long-term distribution system expansion planning considering greenhouse gas emission mitigation | 2019 | International Journal of Electrical Power & Energy Systems Vol. 108, pp. 86–95 |
article | DOI URL |
| Abstract: This paper proposes a multistage convex distribution system planning model to find the best reinforcement plan over a specified horizon. This strategy determines planning actions such as reinforcement of existing substations, conductor replacement of overloaded feeders, and siting and sizing of renewable and dispatchable distributed generation units. Besides, the proposed approach aims at mitigating the greenhouse gas emissions of electric power distribution systems via a monetary form. Inherently, this problem is a non-convex optimization model that can be an obstacle to finding the optimal global solution. To remedy this issue, convex envelopes are used to recast the original problem into a mixed integer conic programming (MICP) model. The MICP model guarantees convergence to optimal global solution by using existing commercial solvers. Moreover, to address the prediction errors in wind output power and electricity demands, a two-stage stochastic MICP model is developed. To validate the proposed model, detail analysis is carried out over various case studies of a 34-node distribution system under different conditions, while to show its potential and effectiveness a 135-node system with two substations is used. Numerical results confirm the effectiveness of the proposed planning scheme in obtaining an economic investment plan at the presence of several planning alternatives and to promote an environmentally committed electric power distribution network. | |||||
BibTeX:
@article{HomeOrtiz2019,
author = {Home-Ortiz, Juan M. and Melgar-Dominguez, Ozy D. and Pourakbari-Kasmaei, Mahdi and Mantovani, José Roberto Sanches},
title = {A stochastic mixed-integer convex programming model for long-term distribution system expansion planning considering greenhouse gas emission mitigation},
journal = {International Journal of Electrical Power & Energy Systems},
year = {2019},
volume = {108},
pages = {86–95},
url = {https://www.sciencedirect.com/science/article/pii/S0142061518313784},
doi = {https://doi.org/10.1016/j.ijepes.2018.12.042}
}
|
|||||
| Iris, Ç. and Lam, J.S.L. | A review of energy efficiency in ports: Operational strategies, technologies and energy management systems | 2019 | Renewable and Sustainable Energy Reviews Vol. 112, pp. 170–182 |
article | DOI URL |
| Abstract: Many ports and terminals endeavor to enhance energy efficiency as energy prices have increased through years and climate change mitigation is a key target for the port industry. Stricter environmental regulations are adopted by authorities to limit pollutants and GHG emissions arising from energy consumption. Increasingly, port operational strategies and energy usage patterns are under scrutiny. To ingrain sustainability and environmental protection of ports, the use of innovative technology appears as a critical conduit in achieving a transition from a carbon-intensive port industry (dependent on fossil fuels) to a low-carbon port model by harnessing renewable energy, alternative fuels (e.g. LNG, hydrogen, biofuel), smarter power distribution systems, energy consumption measurement systems. In this context, this paper conducts a systematic literature review to analyze operational strategies (e.g. peak shaving, operations optimization), technology usage (e.g. electrification of equipment, cold-ironing, energy storage systems), renewable energy, alternative fuels and energy management systems (e.g. smart grid with renewable energy) for improving the energy efficiency and environmental performance of ports and terminals. Research gaps and future research directions are identified. Analysis shows that there is a great potential for ports to achieve further energy efficiency and researchers have many impactful research opportunities. | |||||
BibTeX:
@article{Iris2019,
author = {Iris, Çağatay and Lam, Jasmine Siu Lee},
title = {A review of energy efficiency in ports: Operational strategies, technologies and energy management systems},
journal = {Renewable and Sustainable Energy Reviews},
year = {2019},
volume = {112},
pages = {170–182},
url = {https://www.sciencedirect.com/science/article/pii/S1364032119302904},
doi = {https://doi.org/10.1016/j.rser.2019.04.069}
}
|
|||||
| Köppe, M. and Wang, J. | Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations | 2019 | Discrete Applied Mathematics | article | DOI URL |
| Abstract: Within the framework of the superadditive duality theory of integer programming, we study two types of dual-feasible functions of a single real variable (Alves et al., 2016). We introduce software that automates testing piecewise linear functions for maximality and extremality, enabling a computer-based search. We build a connection to cut-generating functions in the Gomory–Johnson and related models, complete the characterization of maximal functions, and prove analogues of the Gomory–Johnson 2-slope theorem and the Basu–Hildebrand–Molinaro approximation theorem. | |||||
BibTeX:
@article{Koeppe2019,
author = {Köppe, Matthias and Wang, Jiawei},
title = {Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations},
journal = {Discrete Applied Mathematics},
year = {2019},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X19305347},
doi = {https://doi.org/10.1016/j.dam.2019.11.021}
}
|
|||||
| Kumar, M., Sharma, S.C., Goel, A. and Singh, S.P. | A comprehensive survey for scheduling techniques in cloud computing | 2019 | Journal of Network and Computer Applications Vol. 143, pp. 1–33 |
article | DOI URL |
| Abstract: Resource scheduling becomes the prominent issue in cloud computing due to rapid growth of on demand request and heterogeneous nature of cloud resources. Cloud provides dynamism, uncertainty and elasticity based services to users in pay-as-you-go fashion over the internet. In recent decade, increase in requests (diverse and complex applications) for cloud services is raising the workload in cloud environment. Inefficient scheduling techniques face the challenges of resources being over utilized and underutilized (imbalanced) which leads to either degradation in service performance (in case of over utilized) or wastage of cloud resources (in case of underutilized). The basic idea behind the scheduling is to distribute tasks (diverse and complex nature) among the cloud resources in such a manner that scheduling algorithm avoids the problem of imbalance. Scheduling algorithm should also optimize the key performance indicator parameters like response time, makespan time, reliability, availability, energy consumption, cost, resource utilization etc. To fulfill the above-mentioned objective, many state of art scheduling algorithms have been proposed based upon heuristic, meta-heuristic and hybrid, reported in the literature. This paper provides the systematic review as well as classification of proposed scheduling techniques along with their advantages and limitations. We hope that our systematic and comprehensive survey work as a stepping stone for new researchers in the field of cloud computing and will be helpful for further development of scheduling technique. | |||||
BibTeX:
@article{Kumar2019,
author = {Kumar, Mohit and Sharma, S. C. and Goel, Anubhav and Singh, S. P.},
title = {A comprehensive survey for scheduling techniques in cloud computing},
journal = {Journal of Network and Computer Applications},
year = {2019},
volume = {143},
pages = {1–33},
url = {https://www.sciencedirect.com/science/article/pii/S1084804519302036},
doi = {https://doi.org/10.1016/j.jnca.2019.06.006}
}
|
|||||
| Legrain, A., Omer, J. and Rosat, S. | A rotation-based branch-and-price approach for the nurse scheduling problem | 2019 | Mathematical Programming Computation | article | DOI URL |
| Abstract: In this paper, we describe an algorithm for the personalized nurse scheduling problem. We focus on the deterministic counterpart of the specific problem that has been described in the second international nurse rostering competition. One specificity of this version is that most constraints are soft, meaning that they can be violated at the price of a penalty. We model the problem as an integer program (IP) that we solve using a branch-and-price procedure. This model is, to the best of our knowledge, comparable to no other from the literature, since each column of the IP corresponds to a rotation, i.e., a sequence of consecutive worked days for a nurse. In contrast, classical models involve individual nurse schedules over the complete horizon. We tackle instances involving up to 120 nurses and 4 shifts over an 8-weeks horizon by embedding the branch-and-price in a large-neighborhood-search framework. Initial solutions of the large-neighborhood search are found by a rolling-horizon algorithm well-suited to the rotation model. | |||||
BibTeX:
@article{Legrain2019,
author = {Legrain, Antoine and Omer, Jérémy and Rosat, Samuel},
title = {A rotation-based branch-and-price approach for the nurse scheduling problem},
journal = {Mathematical Programming Computation},
year = {2019},
url = {https://doi.org/10.1007/s12532-019-00172-4},
doi = {https://doi.org/10.1007/s12532-019-00172-4}
}
|
|||||
| Liu, M., Liang, B., Zheng, F. and Chu, F. | Stochastic Airline Fleet Assignment With Risk Aversion [BibTeX] |
2019 | IEEE Transactions on Intelligent Transportation Systems Vol. 20(8), pp. 3081–3090 |
article | DOI |
BibTeX:
@article{Liu2019,
author = {Liu, M. and Liang, B. and Zheng, F. and Chu, F.},
title = {Stochastic Airline Fleet Assignment With Risk Aversion},
journal = {IEEE Transactions on Intelligent Transportation Systems},
year = {2019},
volume = {20},
number = {8},
pages = {3081–3090},
doi = {https://doi.org/10.1109/TITS.2018.2871969}
}
|
|||||
| Lovász, L. | Graphs and geometry [BibTeX] |
2019 | , pp. x, 444 pages | book | |
BibTeX:
@book{Lovasz2019,
author = {Lovász, László},
title = {Graphs and geometry},
publisher = {American Mathematical Society},
year = {2019},
pages = {x, 444 pages},
note = {2019011532 Laszlo Lovasz. illustrations ; 27 cm Includes bibliographical references (pages 421-436) and indexes.}
}
|
|||||
| Martinsson, P.-G. | Fast Direct Solvers for Elliptic PDEs [BibTeX] |
2019 | , pp. 331 | book | DOI URL |
BibTeX:
@book{Martinsson2019,
author = {Martinsson, Per-Gunnar},
title = {Fast Direct Solvers for Elliptic PDEs},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {331},
note = {doi:10.1137/1.9781611976045},
url = {https://doi.org/10.1137/1.9781611976045},
doi = {https://doi.org/10.1137/1.9781611976045}
}
|
|||||
| Merchan, A.L., Léonard, A., Limbourg, S. and Mostert, M. | Life cycle externalities versus external costs: The case of inland freight transport in Belgium | 2019 | Transportation Research Part D: Transport and Environment Vol. 67, pp. 576–595 |
article | DOI URL |
| Abstract: This paper proposes a case study on Belgium in which externalities and external costs of inland freight transport modes in Belgium are compared for the year 2012. The well-known Life Cycle Assessment methodology is used to identify the updated specific Belgian externalities related to three categories of negative impacts: climate change, photochemical ozone formation and particulate matter formation. The obtained values of externalities are then compared to the related external cost values. The objective is to determine if these two tools can be used interchangeably. We find that road transport has the maximum impact for every environmental impact indicator, with rail freight transport presenting the minimum one. We identify that each category of negative impact on the environment does not represent the same percentage of global externalities and external costs. In the analysis of the environmental impact per mode, it is observed that, when external costs are considered instead of externalities, the impact of road transport is slightly increased compared to both impacts of rail and inland waterways. Using externalities and average external costs interchangeably for estimating the impact of specific transport categories on the environment may thus lead to different results and different related policies. | |||||
BibTeX:
@article{Merchan2019,
author = {Merchan, Angel L. and Léonard, Angélique and Limbourg, Sabine and Mostert, Martine},
title = {Life cycle externalities versus external costs: The case of inland freight transport in Belgium},
journal = {Transportation Research Part D: Transport and Environment},
year = {2019},
volume = {67},
pages = {576–595},
url = {https://www.sciencedirect.com/science/article/pii/S136192091830734X},
doi = {https://doi.org/10.1016/j.trd.2019.01.017}
}
|
|||||
| Paprocka, I. | Evaluation of the Effects of a Machine Failure on the Robustness of a Job Shop System—Proactive Approaches [BibTeX] |
2019 | Sustainability Vol. 11(1), pp. 65 |
article | URL |
BibTeX:
@article{Paprocka2019,
author = {Paprocka, Iwona},
title = {Evaluation of the Effects of a Machine Failure on the Robustness of a Job Shop System—Proactive Approaches},
journal = {Sustainability},
year = {2019},
volume = {11},
number = {1},
pages = {65},
url = {https://www.mdpi.com/2071-1050/11/1/65}
}
|
|||||
| Peng, P., Poon, J.P.H., Yang, Y., Lu, F. and Cheng, S. | Global oil traffic network and diffusion of influence among ports using real time data | 2019 | Energy Vol. 172, pp. 333–342 |
article | DOI URL |
| Abstract: This paper seeks to shed light on how ports spread their influence through propagatory activation of other ports in the global oil traffic network from 2009 to 2016. Using a modified linear threshold model, the paper does not attempt to identify a few fixed ports that served as “seeds” for propagation and influence maximization. Instead it identifies active seed port hubs via their diffusion patterns and the number of ports in the networks that become influenced as a result. The computations show that diffusion is highly uneven but Rotterdam, Antwerp and Singapore emerged as the three most influential seed ports particularly in 2013 and 2016. Whereas over half of the ports in the networks were able to influence just one other port, Rotterdam and Antwerp influenced ports in the entire network. Singapore's spread of influence is smaller but its activation rate is more rapid because the port-city's influence tends to be much more regionally confined. Rotterdam's propagation occurs in fewer stages than Antwerp's suggesting that information and innovation spread more readily from the former city-port. Taken together, the analysis points to the above three city-ports as the most effective hubs for dissemination of information in the oil, including tanker, industry. | |||||
BibTeX:
@article{Peng2019,
author = {Peng, Peng and Poon, Jessie P. H. and Yang, Yu and Lu, Feng and Cheng, Shifen},
title = {Global oil traffic network and diffusion of influence among ports using real time data},
journal = {Energy},
year = {2019},
volume = {172},
pages = {333–342},
url = {https://www.sciencedirect.com/science/article/pii/S0360544219301264},
doi = {https://doi.org/10.1016/j.energy.2019.01.118}
}
|
|||||
| Powell, W.B. | A unified framework for stochastic optimization | 2019 | European Journal of Operational Research Vol. 275(3), pp. 795–821 |
article | DOI URL |
| Abstract: Stochastic optimization is an umbrella term that includes over a dozen fragmented communities, using a patchwork of sometimes overlapping notational systems with algorithmic strategies that are suited to specific classes of problems. This paper reviews the canonical models of these communities, and proposes a universal modeling framework that encompasses all of these competing approaches. At the heart is an objective function that optimizes over policies that is standard in some approaches, but foreign to others. We then identify four meta-classes of policies that encompasses all of the approaches that we have identified in the research literature or industry practice. In the process, we observe that any adaptive learning algorithm, whether it is derivative-based or derivative-free, is a form of policy that can be tuned to optimize either the cumulative reward (similar to multi-armed bandit problems) or final reward (as is used in ranking and selection or stochastic search). We argue that the principles of bandit problems, long a niche community, should become a core dimension of mainstream stochastic optimization. | |||||
BibTeX:
@article{Powell2019,
author = {Powell, Warren B.},
title = {A unified framework for stochastic optimization},
journal = {European Journal of Operational Research},
year = {2019},
volume = {275},
number = {3},
pages = {795–821},
url = {https://www.sciencedirect.com/science/article/pii/S0377221718306192},
doi = {https://doi.org/10.1016/j.ejor.2018.07.014}
}
|
|||||
| Rodrigues, L., Samadi, B. and Moarref, M. | Piecewise Affine Control: Continuous Time, Sampled Data, and Networked Systems [BibTeX] |
2019 | , pp. 242 | book | DOI URL |
BibTeX:
@book{Rodrigues2019,
author = {Rodrigues, Luis and Samadi, Behzad and Moarref, Miad},
title = {Piecewise Affine Control: Continuous Time, Sampled Data, and Networked Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {242},
note = {doi:10.1137/1.9781611975901},
url = {https://doi.org/10.1137/1.9781611975901},
doi = {https://doi.org/10.1137/1.9781611975901}
}
|
|||||
| Rodríguez-Sanz, Á., Comendador, F.G., Valdés, R.A., Pérez-Castán, J., Montes, R.B. and Serrano, S.C. | Assessment of airport arrival congestion and delay: Prediction and reliability | 2019 | Transportation Research Part C: Emerging Technologies Vol. 98, pp. 255–283 |
article | DOI URL |
| Abstract: Air traffic networks are highly dependent on airport arrival processes, which are common triggers for capacity constraints and delay propagation. Arrival Manager tools aim to improve arrival flows at airports. To do so they need reliable, accurate assessments of potential congestion and delay issues. This paper sets out a methodology for predicting and evaluating the operational state of the airport arrival system. This methodology is structured in two steps: the prediction stage and the reliability stage. The prediction model is based on a Bayesian Network approach, which reflects the stochastic and time-varying nature of airport operations. It also provides insights into the interdependencies between factors contributing to airport performance. The reliability model uses a Multi-State System structure, as the airport arrival system has a large number of performance levels. It is developed via a Markov process technique. By combining these prediction and reliability models we can assess the characteristics of the airport arrival system: stationary state, availability, performance and degradation. The methodology is applied to a case study at a busy European airport, using real data from peak traffic months. Results for the scenarios analyzed show that the factors that have a greatest impact on delay and congestion are the level of saturation at arrival processes, the time frame of the day (which determines the arrival declared capacity) and the meteorological conditions. Moreover, arrival states of congestion reduce the airport’s ability to maintain optimal performance rates. The model represents an evolution from the traditional corrective and binary vision of performance analysis towards a predictive and multi-state approach. The results can be applied to derive operational strategies and draw conclusions regarding arrival performance and management. | |||||
BibTeX:
@article{RodriguezSanz2019,
author = {Rodríguez-Sanz, Álvaro and Comendador, Fernando Gómez and Valdés, Rosa Arnaldo and Pérez-Castán, Javier and Montes, Rocío Barragán and Serrano, Sergio Cámara},
title = {Assessment of airport arrival congestion and delay: Prediction and reliability},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2019},
volume = {98},
pages = {255–283},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X18302493},
doi = {https://doi.org/10.1016/j.trc.2018.11.015}
}
|
|||||
| Roughgarden, T. | Beyond worst-case analysis [BibTeX] |
2019 | Commun. ACM Vol. 62(3), pp. 88–96 |
article | DOI URL |
BibTeX:
@article{Roughgarden2019,
author = {Roughgarden, Tim},
title = {Beyond worst-case analysis},
journal = {Commun. ACM},
year = {2019},
volume = {62},
number = {3},
pages = {88–96},
url = {https://doi.org/10.1145/3232535},
doi = {https://doi.org/10.1145/3232535}
}
|
|||||
| Soltan, S., Loh, A. and Zussman, G. | A Learning-Based Method for Generating Synthetic Power Grids [BibTeX] |
2019 | IEEE Systems Journal Vol. 13(1), pp. 625–634 |
article | DOI |
BibTeX:
@article{Soltan2019,
author = {Soltan, S. and Loh, A. and Zussman, G.},
title = {A Learning-Based Method for Generating Synthetic Power Grids},
journal = {IEEE Systems Journal},
year = {2019},
volume = {13},
number = {1},
pages = {625–634},
doi = {https://doi.org/10.1109/JSYST.2018.2825785}
}
|
|||||
| Stein, C. and Zhong, M. | Scheduling When You Do Not Know the Number of Machines [BibTeX] |
2019 | ACM Trans. Algorithms Vol. 16(1), pp. Article 9 |
article | DOI URL |
BibTeX:
@article{Stein2019,
author = {Stein, Clifford and Zhong, Mingxian},
title = {Scheduling When You Do Not Know the Number of Machines},
journal = {ACM Trans. Algorithms},
year = {2019},
volume = {16},
number = {1},
pages = {Article 9},
url = {https://doi.org/10.1145/3340320},
doi = {https://doi.org/10.1145/3340320}
}
|
|||||
| Sutton, B. | Numerical Analysis: Theory and Experiments [BibTeX] |
2019 | , pp. 448 | book | DOI URL |
BibTeX:
@book{Sutton2019,
author = {Sutton, Brian},
title = {Numerical Analysis: Theory and Experiments},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {448},
note = {doi:10.1137/1.9781611975703},
url = {https://doi.org/10.1137/1.9781611975703},
doi = {https://doi.org/10.1137/1.9781611975703}
}
|
|||||
| Tahir, A., Desaulniers, G. and El Hallaoui, I. | Integral column generation for the set partitioning problem [BibTeX] |
2019 | EURO Journal on Transportation and Logistics Vol. 8(5), pp. 713–744 |
article | DOI URL |
BibTeX:
@article{Tahir2019,
author = {Tahir, A. and Desaulniers, G. and El Hallaoui, I.},
title = {Integral column generation for the set partitioning problem},
journal = {EURO Journal on Transportation and Logistics},
year = {2019},
volume = {8},
number = {5},
pages = {713–744},
note = {Export Date: 10 April 2020},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85068194011&doi=10.1007%2fs13676-019-00145-6&partnerID=40&md5=10be029394451563320a96451234d9d8},
doi = {https://doi.org/10.1007/s13676-019-00145-6}
}
|
|||||
| Trefethen, L.N. | Approximation Theory and Approximation Practice, Extended Edition [BibTeX] |
2019 | , pp. 364 | book | DOI URL |
BibTeX:
@book{Trefethen2019,
author = {Trefethen, Lloyd N.},
title = {Approximation Theory and Approximation Practice, Extended Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {364},
note = {doi:10.1137/1.9781611975949},
url = {https://doi.org/10.1137/1.9781611975949},
doi = {https://doi.org/10.1137/1.9781611975949}
}
|
|||||
| Umezu, Y. and Takeuchi, I. | Selective inference via marginal screening for high dimensional classification | 2019 | Japanese Journal of Statistics and Data Science Vol. 2(2), pp. 559–589 |
article | DOI URL |
| Abstract: Post-selection inference is a statistical technique for determining salient variables after model or variable selection. Recently, selective inference, a kind of post-selection inference framework, has garnered the attention in the statistics and machine learning communities. By conditioning on a specific variable selection procedure, selective inference can properly control for so-called selective type I error, which is a type I error conditional on a variable selection procedure, without imposing excessive additional computational costs. While selective inference can provide a valid hypothesis testing procedure, the main focus has hitherto been on Gaussian linear regression models. In this paper, we develop a selective inference framework for binary classification problem. We consider a logistic regression model after variable selection based on marginal screening, and derive the high dimensional statistical behavior of the post-selection estimator. This enables us to asymptotically control for selective type I error for the purposes of hypothesis testing after variable selection. We conduct several simulation studies to confirm the statistical power of the test, and compare our proposed method with data splitting and other methods. | |||||
BibTeX:
@article{Umezu2019,
author = {Umezu, Yuta and Takeuchi, Ichiro},
title = {Selective inference via marginal screening for high dimensional classification},
journal = {Japanese Journal of Statistics and Data Science},
year = {2019},
volume = {2},
number = {2},
pages = {559–589},
url = {https://doi.org/10.1007/s42081-019-00058-8},
doi = {https://doi.org/10.1007/s42081-019-00058-8}
}
|
|||||
| Vanelslander, T., Sys, C., Lam, J.S.L., Ferrari, C., Roumboutsos, A., Acciaro, M., Macário, R. and Giuliano, G. | A serving innovation typology: mapping port-related innovations | 2019 | Transport Reviews Vol. 39(5), pp. 611–629 |
article | DOI URL |
| Abstract: ABSTRACT The port sector is often perceived to be lagging behind in terms of innovative initiatives. It is unclear whether this is the result of a more limited engagement of the scientific community, or poor external marketing from port operators or whether the limited number of port-related scientific studies is not representative of the real volume of innovation in the sector. In order to offer deeper insight into the connections between the academic (port) innovation literature and actual innovation practices in the port sector, firstly, the literature is reviewed over the 2011–2018 period. Secondly, the paper proposes a typology, which supports the management of the innovation process and upon which future research could be based. Last, the analysis of 75 port-related innovation initiatives provides an application of the proposed typology. The findings from the study of innovation in the port-related sectors show that multi-dimensional innovation encompassing technological, managerial, organisational and cultural aspects is prevailing in this industry. So far only a handful of innovation cases are the result of co-operation, generally with other firms upstream or downstream in the maritime supply chain. Ultimately, it emerges, however, that collaborative innovation or co-innovation is the way forward for future maritime- and port-related innovation. | |||||
BibTeX:
@article{Vanelslander2019,
author = {Vanelslander, Thierry and Sys, Christa and Lam, Jasmine Siu Lee and Ferrari, Claudio and Roumboutsos, Athena and Acciaro, Michele and Macário, Rosario and Giuliano, Genevieve},
title = {A serving innovation typology: mapping port-related innovations},
journal = {Transport Reviews},
year = {2019},
volume = {39},
number = {5},
pages = {611–629},
url = {https://www.sciencedirect.com/science/article/pii/S0144164722001441},
doi = {https://doi.org/10.1080/01441647.2019.1587794}
}
|
|||||
| Vidyasagar, M. | An Introduction to Compressed Sensing [BibTeX] |
2019 | , pp. 353 | book | DOI URL |
BibTeX:
@book{Vidyasagar2019,
author = {Vidyasagar, M.},
title = {An Introduction to Compressed Sensing},
publisher = {Society for Industrial and Applied Mathematics},
year = {2019},
pages = {353},
note = {doi:10.1137/1.9781611976120},
url = {https://doi.org/10.1137/1.9781611976120},
doi = {https://doi.org/10.1137/1.9781611976120}
}
|
|||||
| Wu, C.-L. and Law, K. | Modelling the delay propagation effects of multiple resource connections in an airline network using a Bayesian network model | 2019 | Transportation Research Part E: Logistics and Transportation Review Vol. 122, pp. 62–77 |
article | DOI URL |
| Abstract: We developed an airline network delay propagation model using a Bayesian Network in a delay-tree framework, accounting for multiple connecting sources of an airline including aircraft, crew connections, and passenger connections. A case study was conducted to examine the heterogeneous delay propagation effects in a flight network. Results showed that the model was able to identify weak links in a flight network based on past operational data. Two new delay multiplier metrics were developed and test results showed that the Expected Delay Multiplier could better account for historical flight delay profiles by inferring posterior probability distributions based on new observations. | |||||
BibTeX:
@article{Wu2019,
author = {Wu, Cheng-Lung and Law, Kristie},
title = {Modelling the delay propagation effects of multiple resource connections in an airline network using a Bayesian network model},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2019},
volume = {122},
pages = {62–77},
url = {https://www.sciencedirect.com/science/article/pii/S1366554517309857},
doi = {https://doi.org/10.1016/j.tre.2018.11.004}
}
|
|||||
| Xu, Y. | Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation | 2019 | Optimization in Large Scale Problems: Industry 4.0 and Society 5.0 Applications, pp. 269–292 | inbook | DOI URL |
| Abstract: Column Generation is a very powerful class of combinatorial optimization algorithms that has been used successfully to solve a variety of large scale optimization problems. Its application has helped many companies in various industries increase revenue and reduce costs significantly, particularly in transportation, energy, manufacturing, and telecommunication companies. In this chapter, we will first discuss the motivations for column generation, then we will provide an intuitive but rigorous treatment of the mechanisms of column generation – how it works, why it works. We will then give descriptions on the branch and price algorithm and several examples of column generation’s successful applications in one of the world’s largest airlines. We will discuss monthly airline crew schedule optimization for bidlines, crew pairing optimization, and integrated modeling of fleet and routing in the optimization of aircraft scheduling. Part of the focus is on business requirements and priorities in these areas and how the column generation models are built to effectively meet these challenges. Some airline industry domain-specific details are provided to allow the readers to better appreciate the scheduling problems’ complexities that made the master-subproblem approach in column generation essential. We will also discuss the significant run-time speedups for these large scale scheduling problems due to various practical model enhancements, as well as progress in the large scale optimization space made possible by technologies such as parallel processing, big data, and better chips. At last, we will briefly discuss several example variants of column generation and their applications in various industries. We will also review recent applications of optimization techniques to machine learning as well as the future potentials of large scale optimization in this field. This chapter can be used as a primer on the fundamentals of column generation techniques since it clearly addresses essential theoretical concepts that are sometimes elusive to researchers and graduate students who are new to this area. The chapter should also be helpful to practitioners who would like to gain insights into how to build effective column generation models to solve real world large scale optimization problems. | |||||
BibTeX:
@inbook{Xu2019,
author = {Xu, Yanqi},
title = {Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation},
booktitle = {Optimization in Large Scale Problems: Industry 4.0 and Society 5.0 Applications},
publisher = {Springer International Publishing},
year = {2019},
pages = {269–292},
url = {https://doi.org/10.1007/978-3-030-28565-4_23},
doi = {https://doi.org/10.1007/978-3-030-28565-4_23}
}
|
|||||
| Yang, Y. and Wu, W. | A Distributionally Robust Optimization Model for Real-Time Power Dispatch in Distribution Networks [BibTeX] |
2019 | IEEE Transactions on Smart Grid Vol. 10(4), pp. 3743–3752 |
article | DOI |
BibTeX:
@article{Yang2019,
author = {Yang, Y. and Wu, W.},
title = {A Distributionally Robust Optimization Model for Real-Time Power Dispatch in Distribution Networks},
journal = {IEEE Transactions on Smart Grid},
year = {2019},
volume = {10},
number = {4},
pages = {3743–3752},
doi = {https://doi.org/10.1109/TSG.2018.2834564}
}
|
|||||
| Zhang, J., Ding, G., Zou, Y., Qin, S. and Fu, J. | Review of job shop scheduling research and its new perspectives under Industry 4.0 | 2019 | Journal of Intelligent Manufacturing Vol. 30(4), pp. 1809–1830 |
article | DOI URL |
| Abstract: Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to transferring traditional scheduling into smart distributed scheduling (SDS), we aim to answer two questions: (1) what traditional scheduling methods and techniques can be combined and reused in SDS and (2) what are new methods and techniques required for SDS. In this paper, we first review existing researches from over 120 papers and answer the first question and then we explore a future research direction in SDS and discuss the new techniques for developing future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0. | |||||
BibTeX:
@article{Zhang2019,
author = {Zhang, Jian and Ding, Guofu and Zou, Yisheng and Qin, Shengfeng and Fu, Jianlin},
title = {Review of job shop scheduling research and its new perspectives under Industry 4.0},
journal = {Journal of Intelligent Manufacturing},
year = {2019},
volume = {30},
number = {4},
pages = {1809–1830},
url = {https://doi.org/10.1007/s10845-017-1350-2},
doi = {https://doi.org/10.1007/s10845-017-1350-2}
}
|
|||||
| Aurentz, J.L., Mach, T., Robol, L., Vandebril, R. and Watkins, D.S. | Core-Chasing Algorithms for the Eigenvalue Problem [BibTeX] |
2018 | , pp. 155 | book | DOI URL |
BibTeX:
@book{Aurentz2018,
author = {Aurentz, Jared L. and Mach, Thomas and Robol, Leonardo and Vandebril, Raf and Watkins, David S.},
title = {Core-Chasing Algorithms for the Eigenvalue Problem},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {155},
note = {doi:10.1137/1.9781611975345},
url = {https://doi.org/10.1137/1.9781611975345},
doi = {https://doi.org/10.1137/1.9781611975345}
}
|
|||||
| Bogunovic, I., Scarlett, J., Jegelka, S. and Cevher, V. | Adversarially robust optimization with Gaussian processes [BibTeX] |
2018 | , pp. 5765–5775 | misc | |
BibTeX:
@misc{Bogunovic2018,
author = {Bogunovic, Ilija and Scarlett, Jonathan and Jegelka, Stefanie and Cevher, Volkan},
title = {Adversarially robust optimization with Gaussian processes},
publisher = {Curran Associates Inc.},
year = {2018},
pages = {5765–5775}
}
|
|||||
| Boyd, S.P. and Vandenberghe, L. | Introduction to applied linear algebra : vectors, matrices, and least squares [BibTeX] |
2018 | , pp. xii, 463 pages | book | |
BibTeX:
@book{Boyd2018,
author = {Boyd, Stephen P. and Vandenberghe, Lieven},
title = {Introduction to applied linear algebra : vectors, matrices, and least squares},
publisher = {Cambridge University Press},
year = {2018},
pages = {xii, 463 pages},
note = {GBB889917 £35.99 No price Stephen Boyd, Lieven Vandenberghe. illustrations (some colour) ; 26 cm Includes index. Also issued online. Formerly CIP.}
}
|
|||||
| Caines, P.E. | Linear Stochastic Systems [BibTeX] |
2018 | , pp. 893 | book | DOI URL |
BibTeX:
@book{Caines2018,
author = {Caines, Peter E.},
title = {Linear Stochastic Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {893},
note = {doi:10.1137/1.9781611974713},
url = {https://doi.org/10.1137/1.9781611974713},
doi = {https://doi.org/10.1137/1.9781611974713}
}
|
|||||
| Campi, M.C. and Garatti, S. | Introduction to the Scenario Approach [BibTeX] |
2018 | , pp. 122 | book | DOI URL |
BibTeX:
@book{Campi2018,
author = {Campi, Marco C. and Garatti, Simone},
title = {Introduction to the Scenario Approach},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {122},
note = {doi:10.1137/1.9781611975444},
url = {https://doi.org/10.1137/1.9781611975444},
doi = {https://doi.org/10.1137/1.9781611975444}
}
|
|||||
| Carrasco, R.A., Iyengar, G. and Stein, C. | Resource cost aware scheduling | 2018 | European Journal of Operational Research Vol. 269(2), pp. 621–632 |
article | DOI URL |
| Abstract: We are interested in the scheduling problem where there are several different resources that determine the speed at which a job runs and we pay depending on the amount of each resource that we use. This work is an extension of the resource dependent job processing time problem and the energy aware scheduling problems. We develop a new constant factor approximation algorithm for resource cost aware scheduling problems: the objective is to minimize the sum of the total cost of resources and the total weighted completion time in the one machine non-preemptive setting, allowing for arbitrary precedence constraints and release dates. Our algorithm handles general job-dependent resource cost functions. We also analyze the practical performance of our algorithms, showing that it is significantly superior to the theoretical bounds and in fact it is very close to optimal. The analysis is done using simulations and real instances, which are left publicly available for future benchmarks. We also present additional heuristic improvements and we study their performance in other settings. | |||||
BibTeX:
@article{Carrasco2018,
author = {Carrasco, Rodrigo A. and Iyengar, Garud and Stein, Cliff},
title = {Resource cost aware scheduling},
journal = {European Journal of Operational Research},
year = {2018},
volume = {269},
number = {2},
pages = {621–632},
url = {https://www.sciencedirect.com/science/article/pii/S0377221718302091},
doi = {https://doi.org/10.1016/j.ejor.2018.02.059}
}
|
|||||
| Caunhye, A.M. and Cardin, M.-A. | Towards more resilient integrated power grid capacity expansion: A robust optimization approach with operational flexibility | 2018 | Energy Economics Vol. 72, pp. 20–34 |
article | DOI URL |
| Abstract: This paper proposes a multi-period two-stage adaptive robust optimization model for long term power grid capacity expansion in an environmentally conscious way under generator output uncertainties due to natural variations and generator disruptions. In the first stage, the model plans generator addition and transmission line setup prior to, and robust to, uncertainty realization. In the second stage, it plans power generation and dispatch after, and flexible to, uncertainty realization. The model exploits the idea of strategic robustness and operational flexibility as a way to improve performance in the face of uncertainty. The robust optimization framework uses deterministic uncertainty sets, with parameters that permit control over the level of conservatism of the solution. Because the resulting two-stage model is semi-infinite and, therefore, intractable, it is reformulated as an affinely adjustable counterpart. The reformulation uses affine decision rules on second-stage variables and converts, after constraint processing, the semi-infinite model into a finite single-stage mixed integer programming model. The resulting model is tested on the IEEE 30-bus system and value gains are shown by comparing the performance of the model with a deterministic model and a stochastic programming model with varying risk aversions. | |||||
BibTeX:
@article{Caunhye2018,
author = {Caunhye, Aakil M. and Cardin, Michel-Alexandre},
title = {Towards more resilient integrated power grid capacity expansion: A robust optimization approach with operational flexibility},
journal = {Energy Economics},
year = {2018},
volume = {72},
pages = {20–34},
url = {https://www.sciencedirect.com/science/article/pii/S0140988318300951},
doi = {https://doi.org/10.1016/j.eneco.2018.03.014}
}
|
|||||
| Cheng, J., Li-Yang Chen, R., Najm, H.N., Pinar, A., Safta, C. and Watson, J.-P. | Distributionally Robust Optimization with Principal Component Analysis [BibTeX] |
2018 | SIAM Journal on Optimization Vol. 28(2), pp. 1817–1841 |
article | DOI URL |
BibTeX:
@article{Cheng2018,
author = {Cheng, Jianqiang and Li-Yang Chen, Richard and Najm, Habib N. and Pinar, Ali and Safta, Cosmin and Watson, Jean-Paul},
title = {Distributionally Robust Optimization with Principal Component Analysis},
journal = {SIAM Journal on Optimization},
year = {2018},
volume = {28},
number = {2},
pages = {1817–1841},
note = {doi: 10.1137/16M1075910},
url = {https://doi.org/10.1137/16M1075910},
doi = {https://doi.org/10.1137/16M1075910}
}
|
|||||
| Choi, J., Lee, C. and Park, S. | Dantzig–Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network | 2018 | Annals of Operations Research Vol. 264(1), pp. 57–87 |
article | DOI URL |
| Abstract: In this article, we investigate the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network with a single hub. The problem is deciding both the transportation routes and the number and types of vehicles to be deployed to minimize the sum of costs to transport all quantities in a hybrid hub-and-spoke network which allows direct transportation between spokes. Daily changes in quantities are reflected with a finite number of scenarios. Regularly scheduled vehicles and temporarily scheduled vehicles are considered to meet the demand variation. We propose a Dantzig–Wolfe decomposition approach which yields a strong LP relaxation bound by introducing a set of feasible direct route patterns. We develop an algorithm which incorporates a column generation procedure at the root node and repeats iteratively a variable fixing and column generation procedure at the non-root nodes until an integral solution is found. Finally, we present computational results using the well-known CAB data sets and real-life data from the Korea Post. The results show that our algorithm can find near optimal solutions very efficiently. | |||||
BibTeX:
@article{Choi2018,
author = {Choi, Jiyoung and Lee, Chungmok and Park, Sungsoo},
title = {Dantzig–Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network},
journal = {Annals of Operations Research},
year = {2018},
volume = {264},
number = {1},
pages = {57–87},
url = {https://doi.org/10.1007/s10479-017-2730-x},
doi = {https://doi.org/10.1007/s10479-017-2730-x}
}
|
|||||
| Deveci, M. and Demirel, N.Ç. | A survey of the literature on airline crew scheduling | 2018 | Engineering Applications of Artificial Intelligence Vol. 74, pp. 54–69 |
article | DOI URL |
| Abstract: As the airline industry is ever expanding, companies are increasing their fleet sizes to obtain greater market shares. Moreover, as the airlines seek more growth, the complexity and size of the airline crew scheduling problem, which is one of the major planning problems in the industry, is also increasing. For this reason, companies dedicate resources to solve this problem, and lease software at great expense from external sources. Rigorous mathematical models and algorithms are used in solving these problems. This paper presents a survey of airline crew scheduling problems, and their proposed solutions from the literature. As a conclusion, prospective studies will be proposed and discussed with the aim of developing better solutions for airline crew scheduling problems in the future. | |||||
BibTeX:
@article{Deveci2018,
author = {Deveci, Muhammet and Demirel, Nihan Çetin},
title = {A survey of the literature on airline crew scheduling},
journal = {Engineering Applications of Artificial Intelligence},
year = {2018},
volume = {74},
pages = {54–69},
url = {http://www.sciencedirect.com/science/article/pii/S0952197618301234},
doi = {https://doi.org/10.1016/j.engappai.2018.05.008}
}
|
|||||
| Gander, M.J. and Kwok, F. | Numerical Analysis of Partial Differential Equations Using Maple and MATLAB [BibTeX] |
2018 | , pp. 159 | book | DOI URL |
BibTeX:
@book{Gander2018,
author = {Gander, Martin J. and Kwok, Felix},
title = {Numerical Analysis of Partial Differential Equations Using Maple and MATLAB},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {159},
note = {doi:10.1137/1.9781611975314},
url = {https://doi.org/10.1137/1.9781611975314},
doi = {https://doi.org/10.1137/1.9781611975314}
}
|
|||||
| García, J.I., Altimiras, F., Peña, A., Astorga, G. and Peredo, O. | A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems [BibTeX] |
2018 | Complexity Vol. 2018, pp. 8395193:1–8395193:15 |
article | |
BibTeX:
@article{Garcia2018,
author = {García, José Ignacio and Altimiras, Francisco and Peña, Alvaro and Astorga, Gino and Peredo, Oscar},
title = {A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems},
journal = {Complexity},
year = {2018},
volume = {2018},
pages = {8395193:1–8395193:15}
}
|
|||||
| Heath, M.T. | Scientific Computing [BibTeX] |
2018 | , pp. 587 | book | DOI URL |
BibTeX:
@book{Heath2018,
author = {Heath, Michael T.},
title = {Scientific Computing},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {587},
note = {doi:10.1137/1.9781611975581},
url = {https://doi.org/10.1137/1.9781611975581},
doi = {https://doi.org/10.1137/1.9781611975581}
}
|
|||||
| Immorlica, N., Sankararaman, K.A., Schapire, R.E. and Slivkins, A. | Adversarial Bandits with Knapsacks [BibTeX] |
2018 | CoRR Vol. abs/1811.11881 |
article | URL |
BibTeX:
@article{Immorlica2018,
author = {Immorlica, Nicole and Sankararaman, Karthik Abinav and Schapire, Robert E. and Slivkins, Aleksandrs},
title = {Adversarial Bandits with Knapsacks},
journal = {CoRR},
year = {2018},
volume = {abs/1811.11881},
url = {http://arxiv.org/abs/1811.11881}
}
|
|||||
| Jacques Garcia, V., Falavigna Braghirolli, L., Henrique Barriquello, C. and Pinheiro Bernardon, D. | A computational intelligence approach to improve the efficiency of repair services in the smart grid context | 2018 | Computers & Electrical Engineering Vol. 70, pp. 37–52 |
article | DOI URL |
| Abstract: In a smart grid context, self-healing is the capability of the system to perform fault location, fault isolation and service restoration in a fully automated process. Self-healing reduces the outage duration and can help improve the efficiency of the crews that must be dispatched in an emergency situation to repair the system and return it to its normal state. This work proposes an iterated local search algorithm to solve the Service Dispatch Problem (SDP) for assignment, scheduling and dispatching of those working crews to attend to emergency and regular orders. The main contribution involves simultaneously considering the working hour constraints related to the crews and the minimization of latency for both regular (off-line version) and emergency orders (on-line version). The computational results obtained from a test set of ten actual data instances of the problem highlight the effectiveness of the proposed algorithm when addressing the SDP. | |||||
BibTeX:
@article{JacquesGarcia2018,
author = {Jacques Garcia, Vinícius and Falavigna Braghirolli, Lynceo and Henrique Barriquello, Carlos and Pinheiro Bernardon, Daniel},
title = {A computational intelligence approach to improve the efficiency of repair services in the smart grid context},
journal = {Computers & Electrical Engineering},
year = {2018},
volume = {70},
pages = {37–52},
url = {https://www.sciencedirect.com/science/article/pii/S0045790617332019},
doi = {https://doi.org/10.1016/j.compeleceng.2018.05.016}
}
|
|||||
| Konar, D., Sharma, K., Sarogi, V. and Bhattacharyya, S. | A Multi-Objective Quantum-Inspired Genetic Algorithm (Mo-QIGA) for Real-Time Tasks Scheduling in Multiprocessor Environment | 2018 | Procedia Computer Science Vol. 131, pp. 591–599 |
article | DOI URL |
| Abstract: This paper aims at providing a multi-objective real-time scheduling algorithm suitable for scheduling of real-time tasks in multiprocessor system with multi-objective criteria. In this proposed Mo-QIGA, scheduling of multi-objective realtime tasks have been targeted for minimizing completion time and total tardiness of each real-time task simultaneously. The exploration of quantum computation in the suggested Mo-QIGA mimics the principles and basic concepts of quantum mechanics. Variable length chromosomes are used in Mo-QIGA and in order to exhibit full Hilbert hyperspace, qubits representation is preferred. In addition, Quantum rotation gate is employed to update the schedules and it obviates classical genetic operators. In order to obtain Pareto-optimal solutions, a random key distribution has been adopted to convert the qubits particles to valid schedule solutions. Moreover, permutation based trimming technique has been introduced for population diversification which leads to good quality schedules. The experiments have been carried out using number of processors varying with real-time tasks priority and processing time. It has been found that the suggested multi-objective quantum inspired genetic algorithm outperforms its classical counterpart in terms of scheduling accuracy and time in multi-objective sense. | |||||
BibTeX:
@article{Konar2018,
author = {Konar, Debanjan and Sharma, Kalpana and Sarogi, Varun and Bhattacharyya, Siddhartha},
title = {A Multi-Objective Quantum-Inspired Genetic Algorithm (Mo-QIGA) for Real-Time Tasks Scheduling in Multiprocessor Environment},
journal = {Procedia Computer Science},
year = {2018},
volume = {131},
pages = {591–599},
url = {https://www.sciencedirect.com/science/article/pii/S1877050918306811},
doi = {https://doi.org/10.1016/j.procs.2018.04.301}
}
|
|||||
| Kumar, A., Costa, A.M., Fackrell, M. and Taylor, P.G. | A sequential stochastic mixed integer programming model for tactical master surgery scheduling | 2018 | European Journal of Operational Research Vol. 270(2), pp. 734–746 |
article | DOI URL |
| Abstract: In this paper, we develop a stochastic mixed integer programming model to optimise the tactical master surgery schedule (MSS) in order to achieve a better patient flow under downstream capacity constraints. We optimise the process over several scheduling periods and we use various sequences of randomly generated patients’ length of stay scenario realisations to model the uncertainty in the process. This model has the particularity that the scenarios are chronologically sequential, not parallel. We use a very simple approach to enhance the non-anticipative feature of the model, and we empirically demonstrate that our approach is useful in achieving the desired objective. We use simulation to show that the most frequently optimal schedule is the best schedule for implementation. Furthermore, we analyse the effect of varying the penalty factor, an input parameter that decides the trade-off between the number of cancellations and occupancy level, on the patient flow process. Finally, we develop a robust MSS to maximise the utilisation level while keeping the number of cancellations within acceptable limits. | |||||
BibTeX:
@article{Kumar2018,
author = {Kumar, Ashwani and Costa, Alysson M. and Fackrell, Mark and Taylor, Peter G.},
title = {A sequential stochastic mixed integer programming model for tactical master surgery scheduling},
journal = {European Journal of Operational Research},
year = {2018},
volume = {270},
number = {2},
pages = {734–746},
url = {https://www.sciencedirect.com/science/article/pii/S0377221718303102},
doi = {https://doi.org/10.1016/j.ejor.2018.04.007}
}
|
|||||
| Leusin, M.E., Frazzon, E.M., Uriona Maldonado, M., Kück, M. and Freitag, M. | Solving the Job-Shop Scheduling Problem in the Industry 4.0 Era | 2018 | Technologies Vol. 6(4) |
article | DOI |
| Abstract: Technological developments along with the emergence of Industry 4.0 allow for new approaches to solve industrial problems, such as the Job-shop Scheduling Problem (JSP). In this sense, embedding Multi-Agent Systems (MAS) into Cyber-Physical Systems (CPS) is a highly promising approach to handle complex and dynamic JSPs. This paper proposes a data exchange framework in order to deal with the JSP considering the state-of-the-art technology regarding MAS, CPS and industrial standards. The proposed framework has self-configuring features to deal with disturbances in the production line. This is possible through the development of an intelligent system based on the use of agents and the Internet of Things (IoT) to achieve real-time data exchange and decision making in the job-shop. The performance of the proposed framework is tested in a simulation study based on a real industrial case. The results substantiate gains in flexibility, scalability and efficiency through the data exchange between factory layers. Finally, the paper presents insights regarding industrial applications in the Industry 4.0 era in general and in particular with regard to the framework implementation in the analyzed industrial case. | |||||
BibTeX:
@article{Leusin2018,
author = {Leusin, Matheus E. and Frazzon, Enzo M. and Uriona Maldonado, Mauricio and Kück, Mirko and Freitag, Michael},
title = {Solving the Job-Shop Scheduling Problem in the Industry 4.0 Era},
journal = {Technologies},
year = {2018},
volume = {6},
number = {4},
doi = {https://doi.org/10.3390/technologies6040107}
}
|
|||||
| Marla, L., Vaze, V. and Barnhart, C. | Robust optimization: Lessons learned from aircraft routing | 2018 | Computers & Operations Research Vol. 98, pp. 165–184 |
article | DOI URL |
| Abstract: Building robust airline scheduling models involves constructing schedules and routes with reduced levels of flight delays as well as fewer passenger and crew disruptions. In this paper, we study different classes of models to achieve robust airline scheduling solutions, with a focus on the aircraft routing problem. In particular, we compare one domain-specific approach and two general paradigms of robust models, namely, (i) an extreme-value based or robust optimization-based approach, and (ii) a chance-constrained or stochastic optimization-based approach. Our modeling and solution approach demonstrates the creation of data-driven uncertainty sets for aircraft routing using domain-specific knowledge and develops a completely data-driven simulation-based validation and testing approach. We first demonstrate that additional modeling, capturing domain knowledge, is required to adapt these general robust modeling paradigms to the aircraft routing problem, in order to meaningfully add robustness features specific to aircraft routing. However, we show that these models in their naive forms, still face issues of tractability and solution quality for the large-scale networks which are representative of real-world airline scheduling problems. Therefore, we develop and present advanced models that address these shortcomings. Our advanced models can be applied to aircraft routing in multiple ways, through varied descriptions of the uncertainty sets; and moreover, are generally applicable to linear and binary integer programming problems. Through our detailed computational results, we compare the performance of solutions arising from these different robust modeling paradigms and discuss the underlying reasons for their performance differences from a data-driven perspective. | |||||
BibTeX:
@article{Marla2018,
author = {Marla, Lavanya and Vaze, Vikrant and Barnhart, Cynthia},
title = {Robust optimization: Lessons learned from aircraft routing},
journal = {Computers & Operations Research},
year = {2018},
volume = {98},
pages = {165–184},
url = {http://www.sciencedirect.com/science/article/pii/S0305054818301023},
doi = {https://doi.org/10.1016/j.cor.2018.04.011}
}
|
|||||
| Mieth, R. and Dvorkin, Y. | Data-Driven Distributionally Robust Optimal Power Flow for Distribution Systems [BibTeX] |
2018 | IEEE Control Systems Letters Vol. 2(3), pp. 363–368 |
article | DOI |
BibTeX:
@article{Mieth2018,
author = {Mieth, R. and Dvorkin, Y.},
title = {Data-Driven Distributionally Robust Optimal Power Flow for Distribution Systems},
journal = {IEEE Control Systems Letters},
year = {2018},
volume = {2},
number = {3},
pages = {363–368},
doi = {https://doi.org/10.1109/LCSYS.2018.2836870}
}
|
|||||
| Monios, J., Bergqvist, R. and Woxenius, J. | Port-centric cities: The role of freight distribution in defining the port-city relationship | 2018 | Journal of Transport Geography Vol. 66, pp. 53–64 |
article | DOI URL |
| Abstract: The goal of this paper is to explore the intersection between two streams of literature: port cities and port-centric logistics. While many ports have moved out of city locations, partly facilitated by intermodal corridors, some ports remain in city locations, many retaining a large share of distribution activity in or near the port. This paper will consider distribution challenges arising from the port-city dynamic in relation to the port-inland distribution axis, in particular the role of port and city planners and decision makers in managing this process. The case analysis is based on the Port of Gothenburg, the largest port in Scandinavia. Findings suggest that the majority of influencing factors are marginally in favour of siting distribution facilities inland rather than near the port, yet city planning and national sentiment continue to incentivise development near the port. There are two conclusions for the port-centric city. First, it needs to coordinate its logistics from a regional perspective, determine what activities belong near the port and not compete with inland locations for what is better located there. Second, port-centric logistics needs to be better aligned with an urban freight transport and city logistics perspective. | |||||
BibTeX:
@article{Monios2018,
author = {Monios, Jason and Bergqvist, Rickard and Woxenius, Johan},
title = {Port-centric cities: The role of freight distribution in defining the port-city relationship},
journal = {Journal of Transport Geography},
year = {2018},
volume = {66},
pages = {53–64},
url = {https://www.sciencedirect.com/science/article/pii/S0966692317302259},
doi = {https://doi.org/10.1016/j.jtrangeo.2017.11.012}
}
|
|||||
| Neel, S., Roth, A. and Wu, Z.S. | How to Use Heuristics for Differential Privacy [BibTeX] |
2018 | CoRR Vol. abs/1811.07765 |
article | URL |
BibTeX:
@article{Neel2018,
author = {Neel, Seth and Roth, Aaron and Wu, Zhiwei Steven},
title = {How to Use Heuristics for Differential Privacy},
journal = {CoRR},
year = {2018},
volume = {abs/1811.07765},
url = {http://arxiv.org/abs/1811.07765}
}
|
|||||
| Ning, C. and You, F. | Adaptive robust optimization with minimax regret criterion: Multiobjective optimization framework and computational algorithm for planning and scheduling under uncertainty | 2018 | Computers & Chemical Engineering Vol. 108, pp. 425–447 |
article | DOI URL |
| Abstract: Regret is defined as the deviation of objective value from the perfect information solution, and serves as an important evaluation metric for decision-making under uncertainty. This paper proposes a novel framework that effectively incorporates the minimax regret criterion into two-stage adaptive robust optimization (ARO). In addition to the conventional robustness criterion, this ARO framework also simultaneously optimizes the worst-case regret to push the performance of the resulting solution towards the utopia one under perfect information. By using a data-driven uncertainty set, we formulate a multiobjective ARO problem that generates a set of Pareto-optimal solutions to reveal the systematic trade-offs between the conventional robustness and minimax regret criteria. The resulting multi-level mixed-integer programming problem cannot be solved directly by any off-the-shelf optimization solvers, so we further propose tailored column-and-constraint generation algorithms to address the computational challenge. Two applications on process network planning and batch process scheduling are presented to demonstrate the applicability of the proposed framework and the efficiency of the proposed solution algorithms. | |||||
BibTeX:
@article{Ning2018,
author = {Ning, Chao and You, Fengqi},
title = {Adaptive robust optimization with minimax regret criterion: Multiobjective optimization framework and computational algorithm for planning and scheduling under uncertainty},
journal = {Computers & Chemical Engineering},
year = {2018},
volume = {108},
pages = {425–447},
url = {https://www.sciencedirect.com/science/article/pii/S0098135417303459},
doi = {https://doi.org/10.1016/j.compchemeng.2017.09.026}
}
|
|||||
| Rahman, I. and Mohamad-Saleh, J. | Hybrid bio-Inspired computational intelligence techniques for solving power system optimization problems: A comprehensive survey | 2018 | Applied Soft Computing Vol. 69, pp. 72–130 |
article | DOI URL |
| Abstract: Optimization problems of modern day power system are very challenging to resolve because of its design complexity, wide geographical dispersion and influence from many unpredictable factors. For that reason, it is essential to apply most effective optimization techniques by taking full benefits of simplified formulation and execution of a particular problem. This study presents a summary of significant hybrid bio-inspired computational intelligence (CI) techniques utilized for power system optimization. Authors have reviewed an extensive range of hybrid CI techniques and examined the motivations behind their improvements. Various applications of hybrid bio-inspired CI algorithms have been highlighted in this paper. In addition, few drawbacks regarding the hybrid CI algorithms are explained. Current trends in CI techniques from the past researches have also been discussed in the domain of power system optimization. Lastly, some future research directions are suggested for further advancement of hybrid techniques. | |||||
BibTeX:
@article{Rahman2018,
author = {Rahman, Imran and Mohamad-Saleh, Junita},
title = {Hybrid bio-Inspired computational intelligence techniques for solving power system optimization problems: A comprehensive survey},
journal = {Applied Soft Computing},
year = {2018},
volume = {69},
pages = {72–130},
url = {https://www.sciencedirect.com/science/article/pii/S1568494618302424},
doi = {https://doi.org/10.1016/j.asoc.2018.04.051}
}
|
|||||
| Rhodes-Leader, L., Worthington, D.J., Nelson, B.L. and Onggo, B.S. | Multi-fidelity simulation optimisation for airline disruption management [BibTeX] |
2018 | , pp. 2179–2190 | misc | |
BibTeX:
@misc{RhodesLeader2018,
author = {Rhodes-Leader, Luke and Worthington, David J. and Nelson, Barry L. and Onggo, Bhakti Stephan},
title = {Multi-fidelity simulation optimisation for airline disruption management},
publisher = {IEEE Press},
year = {2018},
pages = {2179–2190}
}
|
|||||
| Rohrer, J.M. | Thinking Clearly About Correlations and Causation: Graphical Causal Models for Observational Data [BibTeX] |
2018 | Advances in Methods and Practices in Psychological Science Vol. 1(1), pp. 27–42 |
article | DOI URL |
BibTeX:
@article{Rohrer2018,
author = {Rohrer, J. M.},
title = {Thinking Clearly About Correlations and Causation: Graphical Causal Models for Observational Data},
journal = {Advances in Methods and Practices in Psychological Science},
year = {2018},
volume = {1},
number = {1},
pages = {27–42},
note = {Export Date: 07 July 2022; Cited By: 235},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85106888596&doi=10.1177%2f2515245917745629&partnerID=40&md5=d546f035b37e4196a2d685b14c241f05},
doi = {https://doi.org/10.1177/2515245917745629}
}
|
|||||
| Scheithauer, G. | Introduction to Cutting and Packing Optimization : Problems, Modeling Approaches, Solution Methods | 2018 | , pp. 1 online resource (XXIV, 410 pages 127 illustrations) | misc | DOI |
| Abstract: This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks. | |||||
BibTeX:
@misc{Scheithauer2018,
author = {Scheithauer, Guntram},
title = {Introduction to Cutting and Packing Optimization : Problems, Modeling Approaches, Solution Methods},
publisher = {Springer International Publishing : Imprint: Springer,},
year = {2018},
pages = {1 online resource (XXIV, 410 pages 127 illustrations)},
note = {2019743878 by Guntram Scheithauer. Modeling -- Knapsack Problems -- One-Dimensional Bin Packing -- One-Dimensional Cutting Stock -- Orthogonal Packing Feasibility, Two-Dimensional Knapsack Problems -- Optimal Guillotine Cutting -- Packing Rectangles into a Strip -- Two-Dimensional Bin Packing -- Quality Restrictions -- Pallet Loading -- Container Loading -- Packing of Polygonal Pieces -- Circle and Sphere Packing. Description based on publisher-supplied MARC data. International Series in Operations Research & Management Science, 263},
doi = {https://doi.org/10.1007/978-3-319-64403-5}
}
|
|||||
| Spiewak, R., Soltan, S., Forman, Y., Buldyrev, S.V. and Zussman, G.I.L. | A study of cascading failures in real and synthetic power grid topologies | 2018 | Network Science Vol. 6(4), pp. 448–468 |
article | DOI URL |
| Abstract: Using the direct current power flow model, we study cascading failures and their spatial and temporal properties in the U.S. Western Interconnection (USWI) power grid. We show that yield (the fraction of demand satisfied after the cascade) has a bimodal distribution typical of a first-order transition. The single line failure leads either to an insignificant power loss or to a cascade which causes a major blackout with yield less than 0.8. The former occurs with high probability if line tolerance α (the ratio of the maximal load a line can carry to its initial load) is greater than 2, while a major blackout occurs with high probability in a broad range of 1 < α < 2. We also show that major blackouts begin with a latent period (with duration proportional to α) during which few lines overload and yield remains high. The existence of the latent period suggests that intervention during early stages of a cascade can significantly reduce the risk of a major blackout. Finally, we introduce the preferential Degree And Distance Attachment model to generate random networks with similar degree, resistance, and flow distributions to the USWI. Moreover, we show that the Degree And Distance Attachment model behaves similarly to the USWI against failures. | |||||
BibTeX:
@article{Spiewak2018,
author = {Spiewak, Russell and Soltan, Saleh and Forman, Yakir and Buldyrev, Sergey V. and Zussman, G. I. L.},
title = {A study of cascading failures in real and synthetic power grid topologies},
journal = {Network Science},
year = {2018},
volume = {6},
number = {4},
pages = {448–468},
url = {https://www.cambridge.org/core/article/study-of-cascading-failures-in-real-and-synthetic-power-grid-topologies/06E2828CFE3965656BFF977B50D03E3D},
doi = {https://doi.org/10.1017/nws.2018.14}
}
|
|||||
| Wan, F.Y.M. | Mathematical Models and Their Analysis [BibTeX] |
2018 | , pp. 414 | book | DOI URL |
BibTeX:
@book{Wan2018,
author = {Wan, Frederic Y. M.},
title = {Mathematical Models and Their Analysis},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {414},
note = {doi:10.1137/1.9781611975277},
url = {https://doi.org/10.1137/1.9781611975277},
doi = {https://doi.org/10.1137/1.9781611975277}
}
|
|||||
| Xu, Y., Alfonsetti, E., Weeraddana, P.C. and Fischione, C. | A Semidistributed Approach for the Feasible Min-Max Fair Agent-Assignment Problem With Privacy Guarantees [BibTeX] |
2018 | IEEE Transactions on Control of Network Systems Vol. 5(1), pp. 333–344 |
article | DOI |
BibTeX:
@article{Xu2018,
author = {Xu, Y. and Alfonsetti, E. and Weeraddana, P. C. and Fischione, C.},
title = {A Semidistributed Approach for the Feasible Min-Max Fair Agent-Assignment Problem With Privacy Guarantees},
journal = {IEEE Transactions on Control of Network Systems},
year = {2018},
volume = {5},
number = {1},
pages = {333–344},
doi = {https://doi.org/10.1109/TCNS.2016.2609151}
}
|
|||||
| Zimmermann, P., Casamayou, A., Cohen, N., Connan, G., Dumont, T., Fousse, L., Maltey, F., Meulien, M., Mezzarobba, M., Pernet, C., Thiéry, N.M., Bray, E., Cremona, J., Forets, M., Ghitza, A. and Thomas, H. | Computational Mathematics with SageMath [BibTeX] |
2018 | , pp. 459 | book | DOI URL |
BibTeX:
@book{Zimmermann2018,
author = {Zimmermann, Paul and Casamayou, Alexandre and Cohen, Nathann and Connan, Guillaume and Dumont, Thierry and Fousse, Laurent and Maltey, François and Meulien, Matthias and Mezzarobba, Marc and Pernet, Clément and Thiéry, Nicolas M. and Bray, Erik and Cremona, John and Forets, Marcelo and Ghitza, Alexandru and Thomas, Hugh},
title = {Computational Mathematics with SageMath},
publisher = {Society for Industrial and Applied Mathematics},
year = {2018},
pages = {459},
note = {doi:10.1137/1.9781611975468},
url = {https://doi.org/10.1137/1.9781611975468},
doi = {https://doi.org/10.1137/1.9781611975468}
}
|
|||||
| Zolghadri, A. and Combastel, C. | An anticipatory warning/advisory system for crew-aided flight status management | 2018 | IFAC-PapersOnLine Vol. 51(24), pp. 608–613 |
article | DOI URL |
| Abstract: The aim of this paper is to sketch a model-based crew aided-decision system for anticipatory operational flight issues management. The system, termed Virtual co-Pilot (VcP), is intended to anticipate off-normal flight conditions and to support aircrew for better planning of upcoming flight phases and recovery from critical flight regimes. The core element is based on a distributed set observer and predictor which provides reachable regions for which safe operations of the aircraft can be guaranteed, and their projection over a specified time window which includes optimization of the prediction horizon. Based on available control authorities the system should also provide guidance and control options for remaining in a safe flight maneuvering envelope. The system will not interfere with the Flight Control System, and the human pilots will keep the overall responsibility. | |||||
BibTeX:
@article{Zolghadri2018,
author = {Zolghadri, A. and Combastel, C.},
title = {An anticipatory warning/advisory system for crew-aided flight status management},
journal = {IFAC-PapersOnLine},
year = {2018},
volume = {51},
number = {24},
pages = {608–613},
url = {https://www.sciencedirect.com/science/article/pii/S2405896318323504},
doi = {https://doi.org/10.1016/j.ifacol.2018.09.638}
}
|
|||||
| Ahmed, S. | Chapter 29: Stochastic Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 379–391 | inbook | DOI URL |
BibTeX:
@inbook{Ahmed2017,
author = {Ahmed, Shabbir},
title = {Chapter 29: Stochastic Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {379–391},
note = {doi:10.1137/1.9781611974683.ch29},
url = {https://doi.org/10.1137/1.9781611974683.ch29},
doi = {https://doi.org/10.1137/1.9781611974683.ch2910.1137/1.9781611974683.ch29}
}
|
|||||
| Balas, E. and Fischetti, M. | Chapter 5: Integer (Linear) Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 49–63 | inbook | DOI URL |
BibTeX:
@inbook{Balas2017,
author = {Balas, Egon and Fischetti, Matteo},
title = {Chapter 5: Integer (Linear) Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {49–63},
note = {doi:10.1137/1.9781611974683.ch5},
url = {https://doi.org/10.1137/1.9781611974683.ch5},
doi = {https://doi.org/10.1137/1.9781611974683.ch510.1137/1.9781611974683.ch5}
}
|
|||||
| Bayliss, C., De Maere, G., Atkin, J.A.D. and Paelinck, M. | A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty | 2017 | Annals of Operations Research Vol. 252(2), pp. 335–363 |
article | DOI URL |
| Abstract: The environment in which airlines operate is uncertain for many reasons, for example due to the effects of weather, traffic or crew unavailability (due to delay or sickness). This work focuses on airline reserve crew scheduling under crew absence uncertainty and delay for an airline operating a single hub and spoke network. Reserve crew can be used to cover absent crew or delayed connecting crew. A fixed number of reserve crew are available for scheduling and each requires a daily standby duty start time. This work proposes a mixed integer programming approach to scheduling the airline’s reserve crew. A simulation of the airline’s operations with stochastic journey time and crew absence inputs (without reserve crew) is used to generate input disruption scenarios for the mixed integer programming simulation scenario model (MIPSSM) formulation. Each disruption scenario corresponds to a record of all of the disruptions that may occur on the day of operation which are solvable by using reserve crew. A set of disruption scenarios form the input of the MIPSSM formulation, which has the objective of finding the reserve crew schedule that minimises the overall level of disruption over the set of input scenarios. Additionally, modifications of the MIPSSM are explored, a heuristic solution approach and a reserve use policy derived from the MIPSSM are introduced. A heuristic based on the proposed MIPSSM outperforms a range of alternative approaches. The heuristic solution approach suggests that including the right disruption scenarios is as important as the quantity of disruption scenarios that are added to the MIPSSM. An investigation into what makes a good set of scenarios is also presented. | |||||
BibTeX:
@article{Bayliss2017,
author = {Bayliss, Christopher and De Maere, Geert and Atkin, Jason A. D. and Paelinck, Marc},
title = {A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty},
journal = {Annals of Operations Research},
year = {2017},
volume = {252},
number = {2},
pages = {335–363},
url = {https://doi.org/10.1007/s10479-016-2174-8},
doi = {https://doi.org/10.1007/s10479-016-2174-8}
}
|
|||||
| Beck, A. | First-Order Methods in Optimization [BibTeX] |
2017 | , pp. 477 | book | DOI URL |
BibTeX:
@book{Beck2017,
author = {Beck, Amir},
title = {First-Order Methods in Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {477},
note = {doi:10.1137/1.9781611974997},
url = {https://doi.org/10.1137/1.9781611974997},
doi = {https://doi.org/10.1137/1.9781611974997}
}
|
|||||
| Borzì, A., Ciaramella, G. and Sprengel, M. | Formulation and Numerical Solution of Quantum Control Problems [BibTeX] |
2017 | , pp. 397 | book | DOI URL |
BibTeX:
@book{Borzi2017,
author = {Borzì, A. and Ciaramella, G. and Sprengel, M.},
title = {Formulation and Numerical Solution of Quantum Control Problems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {397},
note = {doi:10.1137/1.9781611974843},
url = {https://doi.org/10.1137/1.9781611974843},
doi = {https://doi.org/10.1137/1.9781611974843}
}
|
|||||
| Butenko, S. and Pardalos, P.M. | Chapter 13: Deterministic Global Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 163–173 | inbook | DOI URL |
BibTeX:
@inbook{Butenko2017,
author = {Butenko, Sergiy and Pardalos, Panos M.},
title = {Chapter 13: Deterministic Global Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {163–173},
note = {doi:10.1137/1.9781611974683.ch13},
url = {https://doi.org/10.1137/1.9781611974683.ch13},
doi = {https://doi.org/10.1137/1.9781611974683.ch1310.1137/1.9781611974683.ch13}
}
|
|||||
| Cadarso, L. and de Celis, R. | Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty | 2017 | Transportation Research Part C: Emerging Technologies Vol. 81, pp. 227–245 |
article | DOI URL |
| Abstract: The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied. | |||||
BibTeX:
@article{Cadarso2017,
author = {Cadarso, Luis and de Celis, Raúl},
title = {Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2017},
volume = {81},
pages = {227–245},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X17301560},
doi = {https://doi.org/10.1016/j.trc.2017.06.003}
}
|
|||||
| Cafieri, S. | Chapter 22: Mixed-Integer Nonlinear Optimization in Air Traffic Management: Aircraft Conflict Avoidance [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 293–301 | inbook | DOI URL |
BibTeX:
@inbook{Cafieri2017,
author = {Cafieri, Sonia},
title = {Chapter 22: Mixed-Integer Nonlinear Optimization in Air Traffic Management: Aircraft Conflict Avoidance},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {293–301},
note = {doi:10.1137/1.9781611974683.ch22},
url = {https://doi.org/10.1137/1.9781611974683.ch22},
doi = {https://doi.org/10.1137/1.9781611974683.ch2210.1137/1.9781611974683.ch22}
}
|
|||||
| Chan, T.C.Y. and Mar, P.A. | Chapter 25: Robust Optimization Methods [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 333–344 | inbook | DOI URL |
BibTeX:
@inbook{Chan2017,
author = {Chan, Timothy C. Y. and Mar, Philip Allen},
title = {Chapter 25: Robust Optimization Methods},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {333–344},
note = {doi:10.1137/1.9781611974683.ch25},
url = {https://doi.org/10.1137/1.9781611974683.ch25},
doi = {https://doi.org/10.1137/1.9781611974683.ch2510.1137/1.9781611974683.ch25}
}
|
|||||
| Chen, C. and Chou, J. | Multiobjective Optimization of Airline Crew Roster Recovery Problems Under Disruption Conditions | 2017 | IEEE Transactions on Systems, Man, and Cybernetics: Systems Vol. 47(1), pp. 133–144 |
article | DOI |
| Abstract: This paper proposes an evolutionary approach for optimizing crew roster recovery (CRR) problems, in which rosters for multiday flight duties are reassigned after disruptions, under a set of constraints involving practical management issues, safety regulations, and preallocated activities. In the proposed approach, CRR problems are first formulated as combinational optimization problems containing multiple objectives and constraints, and a variant of the nondominated sorting genetic algorithm II method is used to explore Pareto solutions. To analyze the effectiveness of the proposed approach, a real-world rostering problem was studied. For the test instance, experimental results showed the advantages of the proposed approach compared with previous work in the literature. By simulating disruption events on the real-world rostering plan, we studied two recovery scenarios containing sufficient and insufficient available crews in the experiments. In particular, a constraint-loosening mechanism that conditionally replaced preallocated tasks with flight duties was proposed in a resource-shortage case to explore the Pareto solutions. The experimental results show that the proposed approach attains a favorable solution quality and can generate multiple recovery plans for decision makers. | |||||
BibTeX:
@article{Chen2017,
author = {Chen, C. and Chou, J.},
title = {Multiobjective Optimization of Airline Crew Roster Recovery Problems Under Disruption Conditions},
journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
year = {2017},
volume = {47},
number = {1},
pages = {133–144},
doi = {https://doi.org/10.1109/TSMC.2016.2560130}
}
|
|||||
| Custódio, A.L., Scheinberg, K. and Vicente, L.N. | Chapter 37: Methodologies and Software for Derivative-Free Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 495–506 | inbook | DOI URL |
BibTeX:
@inbook{Custodio2017,
author = {Custódio, Ana Luísa and Scheinberg, Katya and Vicente, Luis Nunes},
title = {Chapter 37: Methodologies and Software for Derivative-Free Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {495–506},
note = {doi:10.1137/1.9781611974683.ch37},
url = {https://doi.org/10.1137/1.9781611974683.ch37},
doi = {https://doi.org/10.1137/1.9781611974683.ch3710.1137/1.9781611974683.ch37}
}
|
|||||
| Feng, Z.-k., Niu, W.-j. and Cheng, C.-t. | Multi-objective quantum-behaved particle swarm optimization for economic environmental hydrothermal energy system scheduling | 2017 | Energy Vol. 131, pp. 165–178 |
article | DOI URL |
| Abstract: With increasing attention paid to energy and environment in recent years, the hydrothermal scheduling considering economic and environmental objectives is becoming one of the most important optimization problems in power system. With two competing objectives and a set of operation constraints, the economic environmental hydrothermal scheduling problem is classified as a typical multi-objective nonlinear constrained optimization problem. Thus, in order to efficiently resolve this problem, the multi-objective quantum-behaved particle swarm optimization (MOQPSO) is presented in this paper. In MOQPSO, the elite archive set is adopted to conserve Pareto optimal solutions and provide multiple evolutionary directions for individuals, while the neighborhood searching and chaotic mutation strategies are used to enhance the search capability and diversity of population. Furthermore, a novel constraint handling method is designed to adjust the constraint violation of hydro and thermal plants, respectively. In order to verify its effectiveness, the MOQPSO is applied to a classical hydrothermal system with four hydropower plants and three thermal plants. The simulations show that the proposed method has competitive performance compared with several traditional methods. | |||||
BibTeX:
@article{Feng2017,
author = {Feng, Zhong-kai and Niu, Wen-jing and Cheng, Chun-tian},
title = {Multi-objective quantum-behaved particle swarm optimization for economic environmental hydrothermal energy system scheduling},
journal = {Energy},
year = {2017},
volume = {131},
pages = {165–178},
url = {https://www.sciencedirect.com/science/article/pii/S0360544217307582},
doi = {https://doi.org/10.1016/j.energy.2017.05.013}
}
|
|||||
| Gao, X., Dang, Y., Chen, G., Gu, J. and Wang, Y. | Topology and survivability analysis for flight flow networks: case studies of three China airline companies [BibTeX] |
2017 | , pp. Article 47 | book | DOI URL |
BibTeX:
@book{Gao2017,
author = {Gao, Xiaofeng and Dang, Yaru and Chen, Guihai and Gu, Jian and Wang, Yongjian},
title = {Topology and survivability analysis for flight flow networks: case studies of three China airline companies},
publisher = {Association for Computing Machinery},
year = {2017},
pages = {Article 47},
url = {https://doi.org/10.1145/3022227.3022273},
doi = {https://doi.org/10.1145/3022227.3022273}
}
|
|||||
| Hanke, M. | A Taste of Inverse Problems [BibTeX] |
2017 | , pp. 148 | book | DOI URL |
BibTeX:
@book{Hanke2017,
author = {Hanke, Martin},
title = {A Taste of Inverse Problems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {148},
note = {doi:10.1137/1.9781611974942},
url = {https://doi.org/10.1137/1.9781611974942},
doi = {https://doi.org/10.1137/1.9781611974942}
}
|
|||||
| Kasirzadeh, A., Saddoune, M. and Soumis, F. | Airline crew scheduling: models, algorithms, and data sets [BibTeX] |
2017 | EURO J. Transportation and Logistics Vol. 6(2), pp. 111–137 |
article | DOI URL |
BibTeX:
@article{Kasirzadeh2017,
author = {Kasirzadeh, Atoosa and Saddoune, Mohammed and Soumis, François},
title = {Airline crew scheduling: models, algorithms, and data sets},
journal = {EURO J. Transportation and Logistics},
year = {2017},
volume = {6},
number = {2},
pages = {111–137},
url = {https://doi.org/10.1007/s13676-015-0080-x
|
|||||
| K?l?nç, M.R. and Sahinidis, N.V. | Chapter 21: State of the Art in Mixed-Integer Nonlinear Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 273–292 | inbook | DOI URL |
BibTeX:
@inbook{Klnc2017,
author = {K?l?nç, Mustafa R. and Sahinidis, Nikolaos V.},
title = {Chapter 21: State of the Art in Mixed-Integer Nonlinear Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {273–292},
note = {doi:10.1137/1.9781611974683.ch21},
url = {https://doi.org/10.1137/1.9781611974683.ch21},
doi = {https://doi.org/10.1137/1.9781611974683.ch2110.1137/1.9781611974683.ch21}
}
|
|||||
| Kozanidis, G. | Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions | 2017 | Journal of Air Transport Management Vol. 59, pp. 143–154 |
article | DOI URL |
| Abstract: We develop an integer programming model and an exact solution methodology for assigning aircrew members to training sessions which they need to attend in order to fulfill the requirements for renewal of their flight capability. The aim is to find the optimal assignment that minimizes the number of unassigned trainees, while also satisfying a variety of seniority, preference, capacity and language compatibility restrictions. The proposed methodology partitions the aircrew members into distinct groups based on their seniority, making the optimal assignment decisions pertaining to each of these groups sequentially. We present extensive computational results demonstrating that the proposed methodology enables the solution of realistic size problems in moderate computational times. | |||||
BibTeX:
@article{Kozanidis2017,
author = {Kozanidis, George},
title = {Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions},
journal = {Journal of Air Transport Management},
year = {2017},
volume = {59},
pages = {143–154},
url = {http://www.sciencedirect.com/science/article/pii/S0969699716301697},
doi = {https://doi.org/10.1016/j.jairtraman.2016.11.012}
}
|
|||||
| Lee, E.K. | Chapter 8: Applications of Discrete Optimization in Medicine and Healthcare [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 93–103 | inbook | DOI URL |
BibTeX:
@inbook{Lee2017,
author = {Lee, Eva K.},
title = {Chapter 8: Applications of Discrete Optimization in Medicine and Healthcare},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {93–103},
note = {doi:10.1137/1.9781611974683.ch8},
url = {https://doi.org/10.1137/1.9781611974683.ch8},
doi = {https://doi.org/10.1137/1.9781611974683.ch810.1137/1.9781611974683.ch8}
}
|
|||||
| Lejeune, M. | Chapter 32: Stochastic Optimization Investment Models with Portfolio and Marginal Risk Constraints [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 427–435 | inbook | DOI URL |
BibTeX:
@inbook{Lejeune2017,
author = {Lejeune, Miguel},
title = {Chapter 32: Stochastic Optimization Investment Models with Portfolio and Marginal Risk Constraints},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {427–435},
note = {doi:10.1137/1.9781611974683.ch32},
url = {https://doi.org/10.1137/1.9781611974683.ch32},
doi = {https://doi.org/10.1137/1.9781611974683.ch3210.1137/1.9781611974683.ch32}
}
|
|||||
| Liu, X., Küçükyavuz, S. and Noyan, N. | Robust multicriteria risk-averse stochastic programming models | 2017 | Annals of Operations Research Vol. 259(1), pp. 259–294 |
article | DOI URL |
| Abstract: In this paper, we study risk-averse models for multicriteria optimization problems under uncertainty. We use a weighted sum-based scalarization and take a robust approach by considering a set of scalarization vectors to address the ambiguity and inconsistency in the relative weights of each criterion. We model the risk aversion of the decision makers via the concept of multivariate conditional value-at-risk (CVaR). First, we introduce a model that optimizes the worst-case multivariate CVaR and show that its optimal solution lies on a particular type of stochastic efficient frontier. To solve this model, we develop a finitely convergent delayed cut generation algorithm for finite probability spaces. We also show that the proposed model can be reformulated as a compact linear program under certain assumptions. In addition, for the cut generation problem, which is in general a mixed-integer program, we give a stronger formulation than the existing ones for the equiprobable case. Next, we observe that similar polyhedral enhancements are also useful for a related class of multivariate CVaR-constrained optimization problems that has attracted attention recently. In our computational study, we use a budget allocation application to benchmark our proposed maximin type risk-averse model against its risk-neutral counterpart and a related multivariate CVaR-constrained model. Finally, we illustrate the effectiveness of the proposed solution methods for both classes of models. | |||||
BibTeX:
@article{Liu2017,
author = {Liu, Xiao and Küçükyavuz, Simge and Noyan, Nilay},
title = {Robust multicriteria risk-averse stochastic programming models},
journal = {Annals of Operations Research},
year = {2017},
volume = {259},
number = {1},
pages = {259–294},
url = {https://doi.org/10.1007/s10479-017-2526-z},
doi = {https://doi.org/10.1007/s10479-017-2526-z}
}
|
|||||
| Marašević, J., Stein, C. and Zussman, G. | Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis | 2017 | Algorithmica Vol. 78(2), pp. 521–557 |
article | DOI URL |
| Abstract: This paper considers max-min fair rate allocation and routing in energy harvesting networks where fairness is required among both the nodes and the time slots. Unlike most previous work on fairness, we focus on multihop topologies and consider different routing methods. We assume a predictable energy profile and focus on the design of efficient and optimal algorithms that can serve as benchmarks for distributed and approximate algorithms. We first develop an algorithm that obtains a max-min fair rate assignment for any routing that is specified at the input. We then turn to the problem of determining a “good” routing. For time-invariable unsplittable routing, we develop an algorithm that finds routes that maximize the minimum rate assigned to any node in any slot. For fractional routing, we derive a combinatorial algorithm for the time-invariable case with constant rates. We show that the time-variable case is at least as hard as the 2-commodity feasible flow problem and design an FPTAS to combat the high running time. Finally, we show that finding an unsplittable routing or a routing tree that provides lexicographically maximum rate assignment (i.e., the best in the max-min fairness terms) is NP-hard, even for a time horizon of a single slot. Our analysis provides insights into the problem structure and can be applied to other related fairness problems. | |||||
BibTeX:
@article{Marasevic2017,
author = {Marašević, Jelena and Stein, Clifford and Zussman, Gil},
title = {Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis},
journal = {Algorithmica},
year = {2017},
volume = {78},
number = {2},
pages = {521–557},
url = {https://doi.org/10.1007/s00453-016-0171-6},
doi = {https://doi.org/10.1007/s00453-016-0171-6}
}
|
|||||
| Meersman, H. and Nazemzadeh, M. | The contribution of transport infrastructure to economic activity: The case of Belgium | 2017 | Case Studies on Transport Policy Vol. 5(2), pp. 316–324 |
article | DOI URL |
| Abstract: The role of the expansion of transport infrastructure in stimulating economic growth in developed countries is not straightforward. This can lead to debates concerning public investments in transport infrastructure especially when public funds are scarce and the demand for investments is high in social sectors such as education, health and social care. However, it is hard to generalise the potential growth impact of transport infrastructure as it can differ over regions and will be affected by the presence or absence of other drivers of economic growth. As a case the situation in Belgium is considered. It is a small, open economy which is highly integrated into the world economy and facing a considerable growth in passenger, but especially in freight transport. Its geographical position and the presence or proximity of important ports and airports in combination with a dense road and rail network makes it one of the gateways of Europe. The transport and logistics sector generates considerable employment and added value. However, the dense population, the concentration of public administration in Brussels and the large amount of transit freight flows result in a large pressure on the existing transportation infrastructure which becomes more and more congested. The large traffic flows generate negative external effects for people, planet and profit. Opponents of further expansion of especially ports, airports, and roads often focus on the negative external effects on people and the planet as they call into question the positive effects on profit and economic growth. Based on aggregate growth modelling and a causality test, some error-correction models are estimated using annual data for Belgium. They reveal that for Belgium GDP per capita is not only positively impacted by traditional indicators such as the openness of the Belgian economy, the rate of investment as a whole, and technological change, but also by the length of the motorways, the rail network and the investments in port infrastructure. As a consequence the evaluation of new transport infrastructure projects should take into account this contribution to economic growth. | |||||
BibTeX:
@article{Meersman2017,
author = {Meersman, Hilde and Nazemzadeh, Marzieh},
title = {The contribution of transport infrastructure to economic activity: The case of Belgium},
journal = {Case Studies on Transport Policy},
year = {2017},
volume = {5},
number = {2},
pages = {316–324},
url = {https://www.sciencedirect.com/science/article/pii/S2213624X17300871},
doi = {https://doi.org/10.1016/j.cstp.2017.03.009}
}
|
|||||
| Mokhtari, H. and Hasani, A. | An energy-efficient multi-objective optimization for flexible job-shop scheduling problem | 2017 | Computers & Chemical Engineering Vol. 104, pp. 339–352 |
article | DOI URL |
| Abstract: In recent years there has been increased concern on energy efficiency of industries. Since the scheduling problems in the shop floors are directly related to the energy consumption, an appropriate way to improve energy efficiency in industrial plants is to develop effective scheduling strategies. Hence, the aim of this paper is to design an energy-efficient scheduling in a shop floor industrial environment, i.e., flexible job-shop scheduling problem (FJSP). To this end, a multi-objective optimization model is developed with three objective functions: (i) minimizing total completion time, (ii) maximizing the total availability of the system, and (iii) minimizing total energy cost of both production and maintenance operations in the FJSP. To cope with this multi-objective optimization problem, an enhanced evolutionary algorithm incorporated with the global criterion, as a multi-objective handling technique, is proposed and then performance evaluation is performed based on an extensive numerical analysis. | |||||
BibTeX:
@article{Mokhtari2017,
author = {Mokhtari, Hadi and Hasani, Aliakbar},
title = {An energy-efficient multi-objective optimization for flexible job-shop scheduling problem},
journal = {Computers & Chemical Engineering},
year = {2017},
volume = {104},
pages = {339–352},
url = {https://www.sciencedirect.com/science/article/pii/S009813541730203X},
doi = {https://doi.org/10.1016/j.compchemeng.2017.05.004}
}
|
|||||
| Mori, R. | Development of a Pushback Time Assignment Algorithm Considering Uncertainty | 2017 | Journal of Air Transportation Vol. 25(2), pp. 51–60 |
article | DOI URL |
| Abstract: Pushback time assignment is a promising method to reduce the fuel burn of departure aircraft on the ground at congested airports. Departure aircraft can wait at the gate with engines off instead of waiting in a departure queue. However, airport operations include considerable uncertainty, which can result in unexpected situations such as takeoff time delays. This paper proposes a new algorithm to assign the pushback time considering uncertainty. To avoid takeoff delay by uncertainty, useful information sources are identified and the optimal pushback time is calculated based on the obtained information. The problem is formulated as a combinatorial optimization problem, and a tabu search technique is applied to solve it. The simulation results show that the proposed algorithm reduces takeoff delay caused by uncertainty by 60?80%, while maintaining taxi-out time savings. | |||||
BibTeX:
@article{Mori2017,
author = {Mori, Ryota},
title = {Development of a Pushback Time Assignment Algorithm Considering Uncertainty},
journal = {Journal of Air Transportation},
year = {2017},
volume = {25},
number = {2},
pages = {51–60},
url = {https://doi.org/10.2514/1.D0069},
doi = {https://doi.org/10.2514/1.D0069}
}
|
|||||
| Ng, K.K.H., Lee, C.K.M., Chan, F.T.S. and Qin, Y. | Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach | 2017 | Transportation Research Part E: Logistics and Transportation Review Vol. 106, pp. 115–136 |
article | DOI URL |
| Abstract: This study considers the aircraft sequencing and scheduling problem under the uncertainty of arrival and departure delays for multiple heterogeneous mixed-mode parallel runways. To enhance runway resilience, runway operations should remain robust to mitigate the effects of delay propagation. The main objective of this research was to identify an optimal schedule by evaluating the robustness of feasible solutions under its respective worst-case scenario. A novel artificial bee colony algorithm was developed and verified by experimental results. The proposed efficient artificial bee colony algorithm can obtain close-to-optimal results with less computational effort in regard to a one-hour flight traffic planning horizon. | |||||
BibTeX:
@article{Ng2017,
author = {Ng, K. K. H. and Lee, C. K. M. and Chan, Felix T. S. and Qin, Yichen},
title = {Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2017},
volume = {106},
pages = {115–136},
url = {http://www.sciencedirect.com/science/article/pii/S1366554517301771},
doi = {https://doi.org/10.1016/j.tre.2017.08.006}
}
|
|||||
| Ning, C. and You, F. | A data-driven multistage adaptive robust optimization framework for planning and scheduling under uncertainty | 2017 | AIChE Journal Vol. 63(10), pp. 4343–4369 |
article | DOI URL |
| Abstract: A novel data-driven approach for optimization under uncertainty based on multistage adaptive robust optimization (ARO) and nonparametric kernel density M-estimation is proposed. Different from conventional robust optimization methods, the proposed framework incorporates distributional information to avoid over-conservatism. Robust kernel density estimation with Hampel loss function is employed to extract probability distributions from uncertainty data via a kernelized iteratively reweighted least squares algorithm. A data-driven uncertainty set is proposed, where bounds of uncertain parameters are defined by quantile functions, to organically integrate the multistage ARO framework with uncertainty data. Based on this uncertainty set, we further develop an exact robust counterpart in its general form for solving the resulting data-driven multistage ARO problem. To illustrate the applicability of the proposed framework, two typical applications in process operations are presented: The first one is on strategic planning of process networks, and the other one on short-term scheduling of multipurpose batch processes. The proposed approach returns 23.9% higher net present value and 31.5% more profits than the conventional robust optimization method in planning and scheduling applications, respectively. ? 2017 American Institute of Chemical Engineers AIChE J, 63: 4343?4369, 2017 | |||||
BibTeX:
@article{Ning2017,
author = {Ning, Chao and You, Fengqi},
title = {A data-driven multistage adaptive robust optimization framework for planning and scheduling under uncertainty},
journal = {AIChE Journal},
year = {2017},
volume = {63},
number = {10},
pages = {4343–4369},
note = {https://doi.org/10.1002/aic.15792},
url = {https://doi.org/10.1002/aic.15792},
doi = {https://doi.org/10.1002/aic.15792}
}
|
|||||
| Özener, O.Ö., Örmeci Matoğlu, M., Erdoğan, G., Haouari, M. and Sözer, H. | Solving a large-scale integrated fleet assignment and crew pairing problem | 2017 | Annals of Operations Research Vol. 253(1), pp. 477–500 |
article | DOI URL |
| Abstract: Airline schedule planning problems are typically decomposed into smaller problems, which are solved in a sequential manner, due to the complexity of the overall problems. This results in suboptimal solutions as well as feasibility issues in the consecutive phases. In this study, we address the integrated fleet assignment and crew pairing problem (IFACPP) of a European Airline. The specific network and cost structures allow us to develop novel approaches to this integrated problem. We propose an optimization-driven algorithm that can efficiently handle large scale instances of the IFACPP. We perform a computational study on real-world monthly flight schedules to test the performance of our solution method. Based on the results on instances with up to 27,500 flight legs, we show that our algorithm provides solutions with significant cost savings over the sequential approach. | |||||
BibTeX:
@article{Oezener2017,
author = {Özener, Okan Örsan and Örmeci Matoğlu, Melda and Erdoğan, Güneş and Haouari, Mohamed and Sözer, Hasan},
title = {Solving a large-scale integrated fleet assignment and crew pairing problem},
journal = {Annals of Operations Research},
year = {2017},
volume = {253},
number = {1},
pages = {477–500},
url = {https://doi.org/10.1007/s10479-016-2319-9},
doi = {https://doi.org/10.1007/s10479-016-2319-9}
}
|
|||||
| Paprocka, I. and Skołud, B. | A hybrid multi-objective immune algorithm for predictive and reactive scheduling | 2017 | Journal of Scheduling Vol. 20(2), pp. 165–182 |
article | DOI URL |
| Abstract: The high productivity of a production process has a major impact on the reduction of the production cost and on a quick response to changing demands. Information about a failure-free machine operation time obtained in advance allows the users to plan preventive maintenance in order to keep the machine in a good operational condition. The introduction of maintenance work into a schedule reduces the frequency of unpredicted breaks caused by machine failures. It also results in higher productivity and in-time production. The foregoing of this constitutes the main idea of the predictive scheduling method proposed in the paper. Rescheduling of disrupted operations, with a minimal impact on the stability and robustness of a schedule, is the main idea of the reactive scheduling method proposed. The first objective of the paper is to present a hybrid multi-objective immune algorithm (H-MOIA) aided by heuristics: a minimal impact of disrupted operation on the schedule (MIDOS) for predictive scheduling and a minimal impact of rescheduled operation on the schedule (MIROS) for reactive scheduling. The second objective is to compare the H-MOIA with various methods for predictive and reactive scheduling. The H-MOIA + MIDOS is compared to two algorithms, identified in reference publications: (1) an algorithm based on priority rules: the least flexible job first (LFJ) and the longest processing time (LPT) (2) an Average Slack Method. The H-MOIA + MIROS is compared to: (1) an algorithm based on priority rules: the LFJ and LPT and (2) Shifted Gap-Reduction. This paper presents the research results and computer simulations. | |||||
BibTeX:
@article{Paprocka2017,
author = {Paprocka, Iwona and Skołud, Bożena},
title = {A hybrid multi-objective immune algorithm for predictive and reactive scheduling},
journal = {Journal of Scheduling},
year = {2017},
volume = {20},
number = {2},
pages = {165–182},
url = {https://doi.org/10.1007/s10951-016-0494-9},
doi = {https://doi.org/10.1007/s10951-016-0494-9}
}
|
|||||
| Rahmaniani, R., Crainic, T.G., Gendreau, M. and Rei, W. | The Benders decomposition algorithm: A literature review | 2017 | European Journal of Operational Research Vol. 259(3), pp. 801–817 |
article | DOI URL |
| Abstract: The Benders decomposition algorithm has been successfully applied to a wide range of difficult optimization problems. This paper presents a state-of-the-art survey of this algorithm, emphasizing its use in combinatorial optimization. We discuss the classical algorithm, the impact of the problem formulation on its convergence, and the relationship to other decomposition methods. We introduce a taxonomy of algorithmic enhancements and acceleration strategies based on the main components of the algorithm. The taxonomy provides the framework to synthesize the literature, and to identify shortcomings, trends and potential research directions. We also discuss the use of the Benders Decomposition to develop efficient (meta-)heuristics, describe the limitations of the classical algorithm, and present extensions enabling its application to a broader range of problems. | |||||
BibTeX:
@article{Rahmaniani2017,
author = {Rahmaniani, Ragheb and Crainic, Teodor Gabriel and Gendreau, Michel and Rei, Walter},
title = {The Benders decomposition algorithm: A literature review},
journal = {European Journal of Operational Research},
year = {2017},
volume = {259},
number = {3},
pages = {801–817},
url = {https://www.sciencedirect.com/science/article/pii/S0377221716310244},
doi = {https://doi.org/10.1016/j.ejor.2016.12.005}
}
|
|||||
| Shapiro, A. | Distributionally Robust Stochastic Programming [BibTeX] |
2017 | SIAM Journal on Optimization Vol. 27(4), pp. 2258–2275 |
article | DOI URL |
BibTeX:
@article{Shapiro2017,
author = {Shapiro, Alexander},
title = {Distributionally Robust Stochastic Programming},
journal = {SIAM Journal on Optimization},
year = {2017},
volume = {27},
number = {4},
pages = {2258–2275},
url = {https://doi.org/10.1137/16M1058297},
doi = {https://doi.org/10.1137/16M1058297}
}
|
|||||
| Sidi, A. | Vector Extrapolation Methods with Applications [BibTeX] |
2017 | , pp. 421 | book | DOI URL |
BibTeX:
@book{Sidi2017,
author = {Sidi, Avram},
title = {Vector Extrapolation Methods with Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {421},
note = {doi:10.1137/1.9781611974966},
url = {https://doi.org/10.1137/1.9781611974966},
doi = {https://doi.org/10.1137/1.9781611974966}
}
|
|||||
| Sinha, A. and Anastasopoulos, A. | Incentive Mechanisms for Fairness Among Strategic Agents [BibTeX] |
2017 | IEEE Journal on Selected Areas in Communications Vol. 35(2), pp. 288–301 |
article | DOI |
BibTeX:
@article{Sinha2017,
author = {Sinha, A. and Anastasopoulos, A.},
title = {Incentive Mechanisms for Fairness Among Strategic Agents},
journal = {IEEE Journal on Selected Areas in Communications},
year = {2017},
volume = {35},
number = {2},
pages = {288–301},
doi = {https://doi.org/10.1109/JSAC.2017.2659061}
}
|
|||||
| Snyder, L.V. | Chapter 33: Inventory and Supply Chain Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 439–455 | inbook | DOI URL |
BibTeX:
@inbook{Snyder2017,
author = {Snyder, Lawrence V.},
title = {Chapter 33: Inventory and Supply Chain Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {439–455},
note = {doi:10.1137/1.9781611974683.ch33},
url = {https://doi.org/10.1137/1.9781611974683.ch33},
doi = {https://doi.org/10.1137/1.9781611974683.ch3310.1137/1.9781611974683.ch33}
}
|
|||||
| Terlaky, T. | Chapter 1: Algorithms for Linear and Quadratic Optimization [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 3–11 | inbook | DOI URL |
BibTeX:
@inbook{Terlaky2017,
author = {Terlaky, Tamás},
title = {Chapter 1: Algorithms for Linear and Quadratic Optimization},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {3–11},
note = {doi:10.1137/1.9781611974683.ch1},
url = {https://doi.org/10.1137/1.9781611974683.ch1},
doi = {https://doi.org/10.1137/1.9781611974683.ch110.1137/1.9781611974683.ch1}
}
|
|||||
| Terlaky, T., Anjos, M.F. and Ahmed, S. | Advances and Trends in Optimization with Engineering Applications [BibTeX] |
2017 | , pp. 678 | book | DOI URL |
BibTeX:
@book{Terlaky2017a,
author = {Terlaky, Tamás and Anjos, Miguel F. and Ahmed, Shabbir},
title = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {678},
note = {doi:10.1137/1.9781611974683},
url = {https://doi.org/10.1137/1.9781611974683},
doi = {https://doi.org/10.1137/1.9781611974683}
}
|
|||||
| Thomas, L., Crook, J. and Edelman, D. | Credit Scoring and Its Applications, Second Edition [BibTeX] |
2017 | , pp. 380 | book | DOI URL |
BibTeX:
@book{Thomas2017,
author = {Thomas, Lyn and Crook, Jonathan and Edelman, David},
title = {Credit Scoring and Its Applications, Second Edition},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {380},
note = {doi:10.1137/1.9781611974560},
url = {https://doi.org/10.1137/1.9781611974560},
doi = {https://doi.org/10.1137/1.9781611974560}
}
|
|||||
| Wächter, A. | Chapter 17: Nonlinear Optimization Algorithms [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 221–235 | inbook | DOI URL |
BibTeX:
@inbook{Waechter2017,
author = {Wächter, Andreas},
title = {Chapter 17: Nonlinear Optimization Algorithms},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {221–235},
note = {doi:10.1137/1.9781611974683.ch17},
url = {https://doi.org/10.1137/1.9781611974683.ch17},
doi = {https://doi.org/10.1137/1.9781611974683.ch1710.1137/1.9781611974683.ch17}
}
|
|||||
| Yang, D., Wang, K.Y., Xu, H. and Zhang, Z. | Path to a multilayered transshipment port system: How the Yangtze River bulk port system has evolved | 2017 | Journal of Transport Geography Vol. 64, pp. 54–64 |
article | DOI URL |
| Abstract: China's steel output has maintained rapid growth over the past twenty years. Due to this, a large number of iron ore ports/terminals have been built along the Yangtze River, and the Yangtze River bulk port system has experienced a unique development in its structure. This paper aims to understand the evolution of this bulk port system.11In this paper, bulk cargo mainly refers to iron ore bulk cargo. along the Yangtze River. To achieve this objective, first the development phases of the Yangtze River bulk port system are reviewed, taking the theoretical (container) port evolution model as a benchmark. Then several hypotheses addressing certain features of bulk port system development are proposed, followed by using panel data analysis to test these hypotheses. Based on this discussion and analysis, the major driving forces that are reshaping bulk port development along the Yangtze River are then summarized. It is found that evolution of the Yangtze River bulk port system in general follows the port development models in previous literature. However, the trend toward regionalization and an offshore hub have not appeared. Besides this, iron ore transshipment is moving outward both for sea ports and river ports, and few iron ore transshipment gateway hubs are occurring. Furthermore, the transshipment function of a bulk port plays a significant role in port traffic changes, but this role is affecting sea ports differently to river ports. The container throughput of transshipment sea ports has a significant negative effect on bulk traffic, whereas that of transshipment river ports has a positive effect. Geographical conditions, institutional factors and national policy, industry agglomeration, changes in market supply and demand, and technology updates are major factors driving changes to the port system structure. These factors are observed to function either individually or collectively at different development stages. | |||||
BibTeX:
@article{Yang2017,
author = {Yang, Dong and Wang, Kelly Yujie and Xu, Hua and Zhang, Zhehui},
title = {Path to a multilayered transshipment port system: How the Yangtze River bulk port system has evolved},
journal = {Journal of Transport Geography},
year = {2017},
volume = {64},
pages = {54–64},
url = {https://www.sciencedirect.com/science/article/pii/S0966692316307414},
doi = {https://doi.org/10.1016/j.jtrangeo.2017.08.011}
}
|
|||||
| Yang, L., Liu, S., Tsoka, S. and Papageorgiou, L.G. | A regression tree approach using mathematical programming | 2017 | Expert Systems with Applications Vol. 78, pp. 347–357 |
article | DOI URL |
| Abstract: Regression analysis is a machine learning approach that aims to accurately predict the value of continuous output variables from certain independent input variables, via automatic estimation of their latent relationship from data. Tree-based regression models are popular in literature due to their flexibility to model higher order non-linearity and great interpretability. Conventionally, regression tree models are trained in a two-stage procedure, i.e. recursive binary partitioning is employed to produce a tree structure, followed by a pruning process of removing insignificant leaves, with the possibility of assigning multivariate functions to terminal leaves to improve generalisation. This work introduces a novel methodology of node partitioning which, in a single optimisation model, simultaneously performs the two tasks of identifying the break-point of a binary split and assignment of multivariate functions to either leaf, thus leading to an efficient regression tree model. Using six real world benchmark problems, we demonstrate that the proposed method consistently outperforms a number of state-of-the-art regression tree models and methods based on other techniques, with an average improvement of 7–60% on the mean absolute errors (MAE) of the predictions. | |||||
BibTeX:
@article{Yang2017a,
author = {Yang, Lingjian and Liu, Songsong and Tsoka, Sophia and Papageorgiou, Lazaros G.},
title = {A regression tree approach using mathematical programming},
journal = {Expert Systems with Applications},
year = {2017},
volume = {78},
pages = {347–357},
url = {http://www.sciencedirect.com/science/article/pii/S0957417417300957},
doi = {https://doi.org/10.1016/j.eswa.2017.02.013}
}
|
|||||
| Zhao, H. | Chapter 35: Supply Chain Optimization in Healthcare [BibTeX] |
2017 | Advances and Trends in Optimization with Engineering Applications, pp. 469–478 | inbook | DOI URL |
BibTeX:
@inbook{Zhao2017,
author = {Zhao, Hui},
title = {Chapter 35: Supply Chain Optimization in Healthcare},
booktitle = {Advances and Trends in Optimization with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2017},
pages = {469–478},
note = {doi:10.1137/1.9781611974683.ch35},
url = {https://doi.org/10.1137/1.9781611974683.ch35},
doi = {https://doi.org/10.1137/1.9781611974683.ch3510.1137/1.9781611974683.ch35}
}
|
|||||
| Agustín, A., Gruler, A., Armas, J.d. and Juan, A.A. | Optimizing Airline Crew Scheduling Using Biased Randomization: A Case Study [BibTeX] |
2016 | , pp. 331–340 | misc | DOI URL |
BibTeX:
@misc{Agustin2016,
author = {Agustín, Alba and Gruler, Aljoscha and Armas, Jésica de and Juan, Angel A.},
title = {Optimizing Airline Crew Scheduling Using Biased Randomization: A Case Study},
year = {2016},
pages = {331–340},
url = {https://doi.org/10.1007/978-3-319-44636-3_31
|
|||||
| Alon, N. and Spencer, J.H. | The probabilistic method [BibTeX] |
2016 | , pp. xiv, 375 pages | book | |
BibTeX:
@book{Alon2016,
author = {Alon, Noga and Spencer, Joel H.},
title = {The probabilistic method},
publisher = {Wiley},
year = {2016},
pages = {xiv, 375 pages},
edition = {Fourth edition.},
note = {2015021599 Noga Alon, Joel H. Spencer. illustrations ; 24 cm Includes bibliographical references (pages 355-365) and indexes.}
}
|
|||||
| Alves, C., Clautiaux, F., Valério de Carvalho, J. and Rietz, J. | Dual-Feasible Functions for Integer Programming and Combinatorial Optimization : Basics, Extensions and Applications | 2016 | , pp. 1 online resource (XI, 159 pages 38 illustrations) | misc | DOI |
| Abstract: This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in the literature, the book addresses how to extend these tools to other non-standard formulations that may be applied to a broad set of applications. Examples are provided to illustrate the underlying concepts and to pave the way for future contributions. | |||||
BibTeX:
@misc{Alves2016,
author = {Alves, Cláudio and Clautiaux, Francois and Valério de Carvalho, José and Rietz, Jürgen},
title = {Dual-Feasible Functions for Integer Programming and Combinatorial Optimization : Basics, Extensions and Applications},
publisher = {Springer International Publishing : Imprint: Springer,},
year = {2016},
pages = {1 online resource (XI, 159 pages 38 illustrations)},
note = {2019739687 by Cláudio Alves, Francois Clautiaux, José Valério de Carvalho, Jürgen Rietz. Linear and Integer Programming -- Classical Dual-feasible Functions -- General Dual-feasible Functions -- Applications for Cutting and Packing Problems -- Other Applications in General Integer Programming. Description based on publisher-supplied MARC data. EURO Advanced Tutorials on Operational Research,},
doi = {https://doi.org/10.1007/978-3-319-27604-5}
}
|
|||||
| Aoun, O., Sarhani, M. and El Afia, A. | Investigation of hidden markov model for the tuning of metaheuristics in airline scheduling problems | 2016 | IFAC-PapersOnLine Vol. 49(3), pp. 347–352 |
article | DOI URL |
| Abstract: Abstract: The tuning approach consists in finding the most suitable configuration of an algorithm for solving a given problem. Machine learning methods are usually used to automate this process. They may enable to construct robust autonomous artifacts whose behavior becomes increasingly expert. This paper focuses on the restriction of this general problem to the field of air planning and more specifically the crew scheduling problem. Metaheuristics are widely used to solve this problem. Our approach consists of using hidden markov model to find the best configuration of the algorithm based on the estimation of the most likely state. The experiment consists of finding the best parameter values of the particle swarm optimization algorithm for the crew scheduling problem. Our approach has shown that it can be a promising solution for automatic optimization of airline scheduling problems. | |||||
BibTeX:
@article{Aoun2016,
author = {Aoun, Oussama and Sarhani, Malek and El Afia, Abdellatif},
title = {Investigation of hidden markov model for the tuning of metaheuristics in airline scheduling problems},
journal = {IFAC-PapersOnLine},
year = {2016},
volume = {49},
number = {3},
pages = {347–352},
url = {https://www.sciencedirect.com/science/article/pii/S2405896316302543},
doi = {https://doi.org/10.1016/j.ifacol.2016.07.058}
}
|
|||||
| Asch, M., Bocquet, M. and Nodet, M. | Data Assimilation [BibTeX] |
2016 | , pp. 310 | book | DOI URL |
BibTeX:
@book{Asch2016,
author = {Asch, Mark and Bocquet, Marc and Nodet, Maëlle},
title = {Data Assimilation},
publisher = {Society for Industrial and Applied Mathematics},
year = {2016},
pages = {310},
note = {doi:10.1137/1.9781611974546},
url = {https://doi.org/10.1137/1.9781611974546},
doi = {https://doi.org/10.1137/1.9781611974546}
}
|
|||||
| Bae, H. and Moon, I. | Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles | 2016 | Applied Mathematical Modelling Vol. 40(13), pp. 6536–6549 |
article | DOI URL |
| Abstract: We extend the multi-depot vehicle routing problem with time windows (MDVRPTW), a practical and challenging problem in logistics and supply chain management, to a study of service vehicles used for delivery and installation of electronics. This study shows that MDVRPTW results can be used to minimize fixed costs of the depots and the delivery and installation vehicles as well as expenses related to travel distances and labor. Along with a mixed integer programming model, we develop a heuristic and a genetic algorithm to identify a near-optimal solution. Computational results demonstrate that the proposed algorithms can efficiently be used to solve relatively large problems. | |||||
BibTeX:
@article{Bae2016,
author = {Bae, Heechul and Moon, Ilkyeong},
title = {Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles},
journal = {Applied Mathematical Modelling},
year = {2016},
volume = {40},
number = {13},
pages = {6536–6549},
url = {https://www.sciencedirect.com/science/article/pii/S0307904X16300555},
doi = {https://doi.org/10.1016/j.apm.2016.01.059}
}
|
|||||
| Bauso, D. | Game Theory with Engineering Applications [BibTeX] |
2016 | , pp. 298 | book | DOI URL |
BibTeX:
@book{Bauso2016,
author = {Bauso, Dario},
title = {Game Theory with Engineering Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2016},
pages = {298},
note = {doi:10.1137/1.9781611974287},
url = {https://doi.org/10.1137/1.9781611974287},
doi = {https://doi.org/10.1137/1.9781611974287}
}
|
|||||
| Davarzani, H., Fahimnia, B., Bell, M. and Sarkis, J. | Greening ports and maritime logistics: A review | 2016 | Transportation Research Part D: Transport and Environment Vol. 48, pp. 473–487 |
article | DOI URL |
| Abstract: This paper aims to examine the past and present research on ‘green ports and maritime logistics’ in order to identify established research streams and fertile research areas with potential for future investigations. Using rigorous bibliometric and network analysis tools, the paper completes a systemic mapping of the existing literature and identifies the key investigators, collaboration patterns, research clusters and interrelationships, and the “seminal research areas” that have provided the field with the foundational knowledge, concepts, theories, tools, and techniques. Major articles within each seminal research area are also identified. This will allow new researchers to quickly build understanding in a particular sub-field by reading these major articles. The findings obtained from the evolution of seminal research areas over time are important from both research and practice perspectives and can help the field grow in many dimensions. | |||||
BibTeX:
@article{Davarzani2016,
author = {Davarzani, Hoda and Fahimnia, Behnam and Bell, Michael and Sarkis, Joseph},
title = {Greening ports and maritime logistics: A review},
journal = {Transportation Research Part D: Transport and Environment},
year = {2016},
volume = {48},
pages = {473–487},
url = {https://www.sciencedirect.com/science/article/pii/S1361920915000991},
doi = {https://doi.org/10.1016/j.trd.2015.07.007}
}
|
|||||
| Henggeler Antunes, C., Alves, M.J. and Climaco, J. | Multiobjective Linear and Integer Programming | 2016 | , pp. 1 online resource (VIII, 209 pages 137 illustrations, 76 illustrations in color | misc | DOI |
| Abstract: This book opens the door to multiobjective optimization for students in fields such as engineering, management, economics and applied mathematics. It offers a comprehensive introduction to multiobjective optimization, with a primary emphasis on multiobjective linear programming and multiobjective integer/mixed integer programming. A didactic book, it is mainly intended for undergraduate and graduate students, but can also be useful for researchers and practitioners. Further, it is accompanied by an interactive software package - developed by the authors for Windows platforms - which can be used for teaching and decision-making support purposes in multiobjective linear programming problems. Thus, besides the textbook's coverage of the essential concepts, theory and methods, complemented with illustrative examples and exercises, the computational tool enables students to experiment and enhance their technical skills, as well as to capture the essential characteristics of real-world problems. | |||||
BibTeX:
@misc{HenggelerAntunes2016,
author = {Henggeler Antunes, Carlos and Alves, Maria Joao and Climaco, Joao},
title = {Multiobjective Linear and Integer Programming},
publisher = {Springer International Publishing : Imprint: Springer,},
year = {2016},
pages = {1 online resource (VIII, 209 pages 137 illustrations, 76 illustrations in color},
note = {2019768400 by Carlos Henggeler Antunes, Maria Joao Alves, Joao Climaco. Introduction -- Problem formulation and definitions -- Surrogate scalar functions and scalarization techniques -- Interactive methods in multiobjective linear programming -- A guided tour of the iMOLPe -- Multiobjective integer and mixed-integer linear programming. Description based on publisher-supplied MARC data. EURO Advanced Tutorials on Operational Research,},
doi = {https://doi.org/10.1007/978-3-319-28746-1}
}
|
|||||
| Homaie-Shandizi, A.-H., Nia, V.P., Gamache, M. and Agard, B. | Flight deck crew reserve: From data to forecasting | 2016 | Engineering Applications of Artificial Intelligence Vol. 50, pp. 106–114 |
article | DOI URL |
| Abstract: Airline companies are subject to a considerable amount of disruption during operation. It is vital for many industries to predict the source of disruption in different levels of management, in order to reduce the recovery cost. One of the most important and costly sources of disruption in the airline industry is the number of reserve pilots. We devise a supervised learning method, based on decision trees, to predict total monthly pilot reserve hours. The proposed method uses characteristics of the monthly schedule as factors and an iterative algorithm to make a prediction. The model is tested on real data and a substantial improvement is observed in the results compared to the current state of the practice in the domain in which a seasonal linear trend decomposition is employed. | |||||
BibTeX:
@article{HomaieShandizi2016,
author = {Homaie-Shandizi, Amir-Hosein and Nia, Vahid Partovi and Gamache, Michel and Agard, Bruno},
title = {Flight deck crew reserve: From data to forecasting},
journal = {Engineering Applications of Artificial Intelligence},
year = {2016},
volume = {50},
pages = {106–114},
url = {http://www.sciencedirect.com/science/article/pii/S0952197616000324},
doi = {https://doi.org/10.1016/j.engappai.2016.01.028}
}
|
|||||
| Huang, E., Mital, P., Goetschalckx, M. and Wu, K. | Optimal assignment of airport baggage unloading zones to outgoing flights | 2016 | Transportation Research Part E: Logistics and Transportation Review Vol. 94, pp. 110–122 |
article | DOI URL |
| Abstract: The outbound airport baggage handling system (BHS) consists of a set of unloading zones (chutes) which are assigned to outgoing flights. Airport baggage operations have inherent uncertainties such as flight delays and varying number of bags. In this paper, the chute assignment problem is modeled as a Stochastic Vector Assignment Problem (SVAP) and multiple extensions are presented to incorporate the various design needs of the airport. A real airport outbound BHS is presented. This case study also guided the optimization models’ design process. The performance of the optimization models is compared with the methods used in practice and literature. | |||||
BibTeX:
@article{Huang2016,
author = {Huang, Edward and Mital, Pratik and Goetschalckx, Marc and Wu, Kan},
title = {Optimal assignment of airport baggage unloading zones to outgoing flights},
journal = {Transportation Research Part E: Logistics and Transportation Review},
year = {2016},
volume = {94},
pages = {110–122},
url = {https://www.sciencedirect.com/science/article/pii/S1366554515302039},
doi = {https://doi.org/10.1016/j.tre.2016.07.012}
}
|
|||||
| Iijima, Y. and Nishi, T. | Column generation heuristics to airline crew scheduling problem for fair working time [BibTeX] |
2016 | , pp. 3217–3222 | misc | DOI URL |
BibTeX:
@misc{Iijima2016,
author = {Iijima, Yu and Nishi, Tatsushi},
title = {Column generation heuristics to airline crew scheduling problem for fair working time},
year = {2016},
pages = {3217–3222},
url = {https://doi.org/10.1109/SMC.2016.7844729
|
|||||
| Ionescu, L., Gwiggner, C. and Kliewer, N. | Data Analysis of Delays in Airline Networks | 2016 | Business & Information Systems Engineering Vol. 58(2), pp. 119–133 |
article | DOI URL |
| Abstract: Cost-optimized airline resource schedules often imply a lack of delay tolerance in case of unforeseen disruptions, e.g. late check-ins, technical defects or airport and airspace congestion. Therefore, the consideration of timeliness and robustness has become an important topic in robust resource scheduling and a wide range of sophisticated scheduling approaches has been developed in recent years. However, these approaches depend on assumptions made concerning delay occurrences. A better understanding of delay mechanisms may lead to a better trade-off between cost-efficiency and robustness and is therefore the purpose of this paper. We provide a data-driven detection of decision rules for daytime delay trends, depending on spatio-temporal attributes. The focus is on interpretable rules whose prediction accuracy is compared to random forests as a non-parametric, automated modeling approach. The obtained results give an insight into both the nature of primary delay occurrence and the methodical potential of delay prediction in the context of robust resource scheduling. | |||||
BibTeX:
@article{Ionescu2016,
author = {Ionescu, Lucian and Gwiggner, Claus and Kliewer, Natalia},
title = {Data Analysis of Delays in Airline Networks},
journal = {Business & Information Systems Engineering},
year = {2016},
volume = {58},
number = {2},
pages = {119–133},
url = {https://doi.org/10.1007/s12599-015-0391-3},
doi = {https://doi.org/10.1007/s12599-015-0391-3}
}
|
|||||
| Lanczos, C. and Boyd, J. | Discourse on Fourier Series [BibTeX] |
2016 | , pp. 271 | book | DOI URL |
BibTeX:
@book{Lanczos2016,
author = {Lanczos, Cornelius and Boyd, John},
title = {Discourse on Fourier Series},
publisher = {Society for Industrial and Applied Mathematics},
year = {2016},
pages = {271},
note = {doi:10.1137/1.9781611974522},
url = {https://doi.org/10.1137/1.9781611974522},
doi = {https://doi.org/10.1137/1.9781611974522}
}
|
|||||
| Li, J. and Liu, Y. | Approximation Algorithms for Stochastic Combinatorial Optimization Problems | 2016 | Journal of the Operations Research Society of China Vol. 4(1), pp. 1–47 |
article | DOI URL |
| Abstract: Stochastic optimization has established itself as a major method to handle uncertainty in various optimization problems by modeling the uncertainty by a probability distribution over possible realizations. Traditionally, the main focus in stochastic optimization has been various stochastic mathematical programming (such as linear programming, convex programming). In recent years, there has been a surge of interest in stochastic combinatorial optimization problems from the theoretical computer science community. In this article, we survey some of the recent results on various stochastic versions of classical combinatorial optimization problems. Since most problems in this domain are NP-hard (or #P-hard, or even PSPACE-hard), we focus on the results which provide polynomial time approximation algorithms with provable approximation guarantees. Our discussions are centered around a few representative problems, such as stochastic knapsack, stochastic matching, multi-armed bandit etc. We use these examples to introduce several popular stochastic models, such as the fixed-set model, 2-stage stochastic optimization model, stochastic adaptive probing model etc, as well as some useful techniques for designing approximation algorithms for stochastic combinatorial optimization problems, including the linear programming relaxation approach, boosted sampling, content resolution schemes, Poisson approximation etc. We also provide some open research questions along the way. Our purpose is to provide readers a quick glimpse to the models, problems, and techniques in this area, and hopefully inspire new contributions . | |||||
BibTeX:
@article{Li2016,
author = {Li, Jian and Liu, Yu},
title = {Approximation Algorithms for Stochastic Combinatorial Optimization Problems},
journal = {Journal of the Operations Research Society of China},
year = {2016},
volume = {4},
number = {1},
pages = {1–47},
url = {https://doi.org/10.1007/s40305-015-0116-9},
doi = {https://doi.org/10.1007/s40305-015-0116-9}
}
|
|||||
| Liu, K. and Meng, X.-L. | There Is Individualized Treatment. Why Not Individualized Inference? | 2016 | Annual Review of Statistics and Its Application Vol. 3(1), pp. 79–111 |
article | DOI URL |
| Abstract: Doctors use statistics to advance medical knowledge; we use a medical analogy to build statistical inference ?from scratch? and to highlight an improvement. A doctor, perhaps implicitly, predicts a treatment's effectiveness for an individual patient based on its performance in a clinical trial; the trial patients serve as controls for that particular patient. The same logic underpins statistical inference: To identify the best statistical procedure to use for a problem, we simulate a set of control problems and evaluate candidate procedures on the controls. Recent interest in personalized/individualized medicine stems from the recognition that some clinical trial patients are better controls for a particular patient than others. Therefore, an individual patient's treatment decisions should depend only on a subset of relevant patients. Individualized statistical inference implements this idea for control problems (rather than for patients). Its potential for improving data analysis matches that of personalized medicine for improving health care. The central issue?for both individualized medicine and individualized inference?is how to make the right relevance-robustness trade-off: If we exercise too much judgment in determining which controls are relevant, our inferences will not be robust. How much is too much? We argue that the unknown answer is the Holy Grail of statistical inference. | |||||
BibTeX:
@article{Liu2016,
author = {Liu, Keli and Meng, Xiao-Li},
title = {There Is Individualized Treatment. Why Not Individualized Inference?},
journal = {Annual Review of Statistics and Its Application},
year = {2016},
volume = {3},
number = {1},
pages = {79–111},
url = {https://doi.org/10.1146/annurev-statistics-010814-020310},
doi = {https://doi.org/10.1146/annurev-statistics-010814-020310}
}
|
|||||
| Lubin, M., Dvorkin, Y. and Backhaus, S. | A Robust Approach to Chance Constrained Optimal Power Flow With Renewable Generation [BibTeX] |
2016 | IEEE Transactions on Power Systems Vol. 31(5), pp. 3840–3849 |
article | DOI |
BibTeX:
@article{Lubin2016,
author = {Lubin, M. and Dvorkin, Y. and Backhaus, S.},
title = {A Robust Approach to Chance Constrained Optimal Power Flow With Renewable Generation},
journal = {IEEE Transactions on Power Systems},
year = {2016},
volume = {31},
number = {5},
pages = {3840–3849},
doi = {https://doi.org/10.1109/TPWRS.2015.2499753}
}
|
|||||
| Todd, M.J. | Minimum-Volume Ellipsoids [BibTeX] |
2016 | , pp. 156 | book | DOI URL |
BibTeX:
@book{Todd2016,
author = {Todd, Michael J.},
title = {Minimum-Volume Ellipsoids},
publisher = {Society for Industrial and Applied Mathematics},
year = {2016},
pages = {156},
note = {doi:10.1137/1.9781611974386},
url = {https://doi.org/10.1137/1.9781611974386},
doi = {https://doi.org/10.1137/1.9781611974386}
}
|
|||||
| Zhang, Y. and Yağan, O. | Optimizing the robustness of electrical power systems against cascading failures | 2016 | Scientific Reports Vol. 6(1), pp. 27625 |
article | DOI URL |
| Abstract: Electrical power systems are one of the most important infrastructures that support our society. However, their vulnerabilities have raised great concern recently due to several large-scale blackouts around the world. In this paper, we investigate the robustness of power systems against cascading failures initiated by a random attack. This is done under a simple yet useful model based on global and equal redistribution of load upon failures. We provide a comprehensive understanding of system robustness under this model by (i) deriving an expression for the final system size as a function of the size of initial attacks; (ii) deriving the critical attack size after which system breaks down completely; (iii) showing that complete system breakdown takes place through a first-order (i.e., discontinuous) transition in terms of the attack size; and (iv) establishing the optimal load-capacity distribution that maximizes robustness. In particular, we show that robustness is maximized when the difference between the capacity and initial load is the same for all lines; i.e., when all lines have the same redundant space regardless of their initial load. This is in contrast with the intuitive and commonly used setting where capacity of a line is a fixed factor of its initial load. | |||||
BibTeX:
@article{Zhang2016,
author = {Zhang, Yingrui and Yağan, Osman},
title = {Optimizing the robustness of electrical power systems against cascading failures},
journal = {Scientific Reports},
year = {2016},
volume = {6},
number = {1},
pages = {27625},
url = {https://doi.org/10.1038/srep27625},
doi = {https://doi.org/10.1038/srep27625}
}
|
|||||
| Beier, E., Venkatachalam, S., Corolli, L. and Ntaimo, L. | Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure | 2015 | Computers & Operations Research Vol. 59, pp. 94–103 |
article | DOI URL |
| Abstract: Solving stochastic integer programs (SIPs) is generally difficult. This paper considers a comparative study of stage- and scenario-wise Fenchel decomposition (FD) for two-stage SIPs with special structure. The standard FD approach is based on stage-wise or Benders’ decomposition. This work derives a scenario FD method based on decomposing the SIP problem by scenario and performs a computational study of the two approaches. In particular, two algorithms are studied, stage-wise FD (ST-FD) and scenario-wise FD (SC-FD) algorithms. The algorithms use FD cuts generated based on the scenario subproblem under each decomposition setting to iteratively recover (partially) the convex hull of integer points in the neighborhood of the optimal solution. The L-shaped method is used to solve the LP relaxation of the SIP problem in the ST-FD algorithm, while the progressive hedging algorithm (PHA) is used in the SC-FD algorithm. Computational results on knapsack test instances demonstrate the viability of both approaches towards solving large instances in reasonable amount of time and outperforming a direct solver in most cases. Overall, the ST-FD algorithm provides the best performance in our experiments. | |||||
BibTeX:
@article{Beier2015,
author = {Beier, Eric and Venkatachalam, Saravanan and Corolli, Luca and Ntaimo, Lewis},
title = {Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure},
journal = {Computers & Operations Research},
year = {2015},
volume = {59},
pages = {94–103},
url = {https://www.sciencedirect.com/science/article/pii/S0305054815000040},
doi = {https://doi.org/10.1016/j.cor.2014.12.011}
}
|
|||||
| Brockett, R.W. | Finite Dimensional Linear Systems [BibTeX] |
2015 | , pp. 257 | book | DOI URL |
BibTeX:
@book{Brockett2015,
author = {Brockett, Roger W.},
title = {Finite Dimensional Linear Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2015},
pages = {257},
note = {doi:10.1137/1.9781611973884},
url = {https://doi.org/10.1137/1.9781611973884},
doi = {https://doi.org/10.1137/1.9781611973884}
}
|
|||||
| Chu, Y., You, F., Wassick, J.M. and Agarwal, A. | Integrated planning and scheduling under production uncertainties: Bi-level model formulation and hybrid solution method | 2015 | Computers & Chemical Engineering Vol. 72, pp. 255–272 |
article | DOI URL |
| Abstract: We propose a novel method for integrating planning and scheduling problems under production uncertainties. The integrated problem is formulated into a bi-level program. The planning problem is solved in the upper level, while the scheduling problems in the planning periods are solved under uncertainties in the lower level. The planning and scheduling problems are linked via service level constraints. To solve the integrated problem, a hybrid method is developed, which iterates between a mixed-integer linear programming solver for the planning problem and an agent-based reactive scheduling method. If the service level constraints are not met, a cutting plane constraint is generated by the agent-based scheduling method and appended to the planning problem which is solved to determine new production quantities. The hybrid method returns an optimality gap for validating the solution quality. The proposed method is demonstrated by two complicated problems which are solved efficiently with small gaps less than 1%. | |||||
BibTeX:
@article{Chu2015,
author = {Chu, Yunfei and You, Fengqi and Wassick, John M. and Agarwal, Anshul},
title = {Integrated planning and scheduling under production uncertainties: Bi-level model formulation and hybrid solution method},
journal = {Computers & Chemical Engineering},
year = {2015},
volume = {72},
pages = {255–272},
url = {https://www.sciencedirect.com/science/article/pii/S0098135414000556},
doi = {https://doi.org/10.1016/j.compchemeng.2014.02.023}
}
|
|||||
| Erdoğan, G., Haouari, M., Matoglu, M.Ö. and Özener, O.Ö. | Solving a large-scale crew pairing problem | 2015 | Journal of the Operational Research Society Vol. 66(10), pp. 1742–1754 |
article | DOI URL |
| Abstract: Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on the CPP of North American airlines, which widely differs from that of most European airline companies in terms of the objective function, the flight structure, and the planning horizon. In this study, we develop an optimization-driven heuristic algorithm that can efficiently handle large-scale instances of the CPP that must be solved on a monthly basis. We perform computational experiments using flight schedules of an European airline company to test the performance of the solution method. Our computational results demonstrate that our algorithm is able to provide high-quality solutions to monthly instances with up to 27 000 flight legs. | |||||
BibTeX:
@article{Erdogan2015,
author = {Erdoğan, Güneş and Haouari, Mohamed and Matoglu, Melda Örmeci and Özener, Okan Örsan},
title = {Solving a large-scale crew pairing problem},
journal = {Journal of the Operational Research Society},
year = {2015},
volume = {66},
number = {10},
pages = {1742–1754},
url = {https://doi.org/10.1057/jors.2015.2},
doi = {https://doi.org/10.1057/jors.2015.2}
}
|
|||||
| Groves, W. and Gini, M. | On Optimizing Airline Ticket Purchase Timing [BibTeX] |
2015 | Vol. 7, pp. Article 3 |
book | DOI URL |
BibTeX:
@book{Groves2015,
author = {Groves, William and Gini, Maria},
title = {On Optimizing Airline Ticket Purchase Timing},
publisher = {Association for Computing Machinery},
year = {2015},
volume = {7},
pages = {Article 3},
url = {https://doi.org/10.1145/2733384},
doi = {https://doi.org/10.1145/2733384}
}
|
|||||
| Jütte, S. and Thonemann, U.W. | A graph partitioning strategy for solving large-scale crew scheduling problems [BibTeX] |
2015 | OR Spectrum Vol. 37(1), pp. 137–170 |
article | DOI URL |
BibTeX:
@article{Juette2015,
author = {Jütte, Silke and Thonemann, Ulrich W.},
title = {A graph partitioning strategy for solving large-scale crew scheduling problems},
journal = {OR Spectrum},
year = {2015},
volume = {37},
number = {1},
pages = {137–170},
url = {https://doi.org/10.1007/s00291-014-0381-8
|
|||||
| Kumar, P.R. and Varaiya, P. | Stochastic Systems [BibTeX] |
2015 | , pp. 367 | book | DOI URL |
BibTeX:
@book{Kumar2015,
author = {Kumar, P. R. and Varaiya, Pravin},
title = {Stochastic Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2015},
pages = {367},
note = {doi:10.1137/1.9781611974263},
url = {https://doi.org/10.1137/1.9781611974263},
doi = {https://doi.org/10.1137/1.9781611974263}
}
|
|||||
| Li, Z., Wu, W., Zhang, B. and Wang, B. | Robust Look-Ahead Power Dispatch With Adjustable Conservativeness Accommodating Significant Wind Power Integration [BibTeX] |
2015 | IEEE Transactions on Sustainable Energy Vol. 6(3), pp. 781–790 |
article | DOI |
BibTeX:
@article{Li2015,
author = {Li, Z. and Wu, W. and Zhang, B. and Wang, B.},
title = {Robust Look-Ahead Power Dispatch With Adjustable Conservativeness Accommodating Significant Wind Power Integration},
journal = {IEEE Transactions on Sustainable Energy},
year = {2015},
volume = {6},
number = {3},
pages = {781–790},
doi = {https://doi.org/10.1109/TSTE.2015.2413778}
}
|
|||||
| Lu, D. and Gzara, F. | The robust crew pairing problem: model and solution methodology | 2015 | Journal of Global Optimization Vol. 62(1), pp. 29–54 |
article | DOI URL |
| Abstract: We present a new robust formulation for the crew pairing problem where flight and connection times are random and vary within an interval. The model protects against infeasibility with a specified level of uncertainty and minimizes crew cost in the worst case. The resulting robust terms in the objective function and in the resource constraints are nonlinear. We apply Lagrangian relaxation to separate the nonlinear terms in the subproblem leading to a new robust formulation of the shortest path problem with resource constraints. We show that the nonlinear subproblem can be solved as a series of linear auxiliary problems. The proposed solution methodology was successful to solve industry instances in very competitive times and led to more robust crew pairing solutions as shown by simulation experiments. | |||||
BibTeX:
@article{Lu2015,
author = {Lu, Da and Gzara, Fatma},
title = {The robust crew pairing problem: model and solution methodology},
journal = {Journal of Global Optimization},
year = {2015},
volume = {62},
number = {1},
pages = {29–54},
url = {https://doi.org/10.1007/s10898-014-0222-y},
doi = {https://doi.org/10.1007/s10898-014-0222-y}
}
|
|||||
| ngel , C. and Gilbert, L. | Arc Routing [BibTeX] |
2015 | book | DOI URL | |
BibTeX:
@book{ngel2015,
author = {ngel, Corberán and Gilbert, Laporte},
title = {Arc Routing},
publisher = {Society for Industrial and Applied Mathematics},
year = {2015},
note = {doi:10.1137/1.9781611973679},
url = {https://doi.org/10.1137/1.9781611973679},
doi = {https://doi.org/10.1137/1.9781611973679}
}
|
|||||
| Porumbel, D. and Goncalves, G. | Using dual feasible functions to construct fast lower bounds for routing and location problems | 2015 | Discrete Applied Mathematics Vol. 196, pp. 83–99 |
article | DOI URL |
| Abstract: In cutting and packing problems, Dual Feasible Functions (DFFs) represent a well established tool for deriving high quality lower bounds in very short times. A well-known DFF lower bounding approach consists of using DFFs to rapidly generate feasible values for the dual variables of a Column Generation (CG) program (i.e., of an extended formulation commonly associated to CG). This paper presents a method for extending this approach to problems such as Capacitated p-Median, Distance Constrained General Routing and related variants (e.g., Capacitated Arc-Routing). In contrast to classical DFF bounds for cutting and packing, our extended DFF bounds deal with non-equal column costs, i.e., the column costs (primal objective function coefficients) have a more complex structure depending on some sums of distances. The general idea is to use a (reformulated) classical CG model in which a feasible dual solution is expressed as a linear combination of both DFF and non-DFF terms. In fact, one of the proposed approaches (the mixed CG-DFF bound for Capacitatedp-Median in Section 2.2) still requires optimizing a restricted CG program, but with fewer variables and easier pricing sub-problems. The most refined bound version is the “DFF warm-started CG” from Section 2.2.2: it takes dual constraints generated while solving the above restricted CG program are re-uses them to warm-start a full CG phase. In the best cases, this can yield a speed-up between 2 and 3 relative to the pure CG. We present numerical experiments on Capacitated p-Median, Capacitated Arc-Routing (with fixed costs) and Distance Constrained Arc Routing; the comparisons with the CG bound concern both the quality and the running time. | |||||
BibTeX:
@article{Porumbel2015,
author = {Porumbel, Daniel and Goncalves, Gilles},
title = {Using dual feasible functions to construct fast lower bounds for routing and location problems},
journal = {Discrete Applied Mathematics},
year = {2015},
volume = {196},
pages = {83–99},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X14002194},
doi = {https://doi.org/10.1016/j.dam.2014.05.017}
}
|
|||||
| Rietz, J., Alves, C., Valério de Carvalho, J. and Clautiaux, F. | Constructing general dual-feasible functions | 2015 | Operations Research Letters Vol. 43(4), pp. 427–431 |
article | DOI URL |
| Abstract: Dual-feasible functions have proved to be very effective for generating fast lower bounds and valid inequalities for integer linear programs with knapsack constraints. However, a significant limitation is that they are defined only for positive arguments. Extending the concept of dual-feasible function to the general domain and range R is not straightforward. In this paper, we propose the first construction principles to obtain general functions with domain and range R, and we show that they lead to non-dominated maximal functions. | |||||
BibTeX:
@article{Rietz2015,
author = {Rietz, Jürgen and Alves, Cláudio and Valério de Carvalho, José and Clautiaux, François},
title = {Constructing general dual-feasible functions},
journal = {Operations Research Letters},
year = {2015},
volume = {43},
number = {4},
pages = {427–431},
url = {https://www.sciencedirect.com/science/article/pii/S0167637715000759},
doi = {https://doi.org/10.1016/j.orl.2015.06.002}
}
|
|||||
| Sasaki, D. and Nishi, T. | Combinatorial auction algorithm with price-adjustment mechanism for airline crew scheduling problems [BibTeX] |
2015 | , pp. 1183–1187 | misc | DOI URL |
BibTeX:
@misc{Sasaki2015,
author = {Sasaki, Daiki and Nishi, Tatsushi},
title = {Combinatorial auction algorithm with price-adjustment mechanism for airline crew scheduling problems},
year = {2015},
pages = {1183–1187},
url = {https://doi.org/10.1109/IEEM.2015.7385834
|
|||||
| Beck, A. | Introduction to Nonlinear Optimization [BibTeX] |
2014 | , pp. 286 | book | DOI URL |
BibTeX:
@book{Beck2014,
author = {Beck, Amir},
title = {Introduction to Nonlinear Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2014},
pages = {286},
note = {doi:10.1137/1.9781611973655},
url = {https://doi.org/10.1137/1.9781611973655},
doi = {https://doi.org/10.1137/1.9781611973655}
}
|
|||||
| Bienstock, D., Chertkov, M. and Harnett, S. | Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty [BibTeX] |
2014 | SIAM Review Vol. 56(3), pp. 461–495 |
article | DOI URL |
BibTeX:
@article{Bienstock2014,
author = {Bienstock, Daniel and Chertkov, Michael and Harnett, Sean},
title = {Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty},
journal = {SIAM Review},
year = {2014},
volume = {56},
number = {3},
pages = {461–495},
note = {doi: 10.1137/130910312},
url = {https://doi.org/10.1137/130910312},
doi = {https://doi.org/10.1137/130910312}
}
|
|||||
| Birgin, E.G. and Martínez, J.M. | Practical Augmented Lagrangian Methods for Constrained Optimization [BibTeX] |
2014 | , pp. 222 | book | DOI URL |
BibTeX:
@book{Birgin2014,
author = {Birgin, E. G. and Martínez, J. M.},
title = {Practical Augmented Lagrangian Methods for Constrained Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2014},
pages = {222},
note = {doi:10.1137/1.9781611973365},
url = {https://doi.org/10.1137/1.9781611973365},
doi = {https://doi.org/10.1137/1.9781611973365}
}
|
|||||
| Castro, A.J.M. | A new approach for disruption management in airline operations control [BibTeX] |
2014 | , pp. pages cm | book | URL |
BibTeX:
@book{Castro2014,
author = {Castro, Antonio J. M.},
title = {A new approach for disruption management in airline operations control},
publisher = {Springer},
year = {2014},
pages = {pages cm},
edition = {1st edition.},
note = {2014939040 Antonio J. M. Castro.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy1410/2014939040-d.html
|
|||||
| Castro, A.J.M., Oliveira, E. and Rocha, A.P. | A New Approach for Disruption Management in Airline Operations Control | 2014 | , pp. 1 online resource (XXIV, 244 pages 39 illustrations, 7 illustrations in color | misc | DOI |
| Abstract: Most of the research efforts dealing with airline scheduling have been done on off-line plan optimization. However, nowadays, with the increasingly complex and huge traffic at airports, the real challenge is how to react to unexpected events that may cause plan-disruptions, leading to flight delays. Moreover these disruptive events usually affect at least three different dimensions of the situation: the aircraft assigned to the flight, the crew assignment and, often forgotten, the passengers' journey and satisfaction. This book includes answers to this challenge and proposes the use of the Multi-agent System paradigm to rapidly compose a multi-faceted solution to the disruptive event taking into consideration possible preferences of those three key aspects of the problem. Negotiation protocols taking place between agents that are experts in solving the different problem dimensions, combination of different utility functions and, not less important, the inclusion of the human in the automatic decision-making loop make MASDIMA, the system described in this book, well suited for real-life plan-disruption management applications. | |||||
BibTeX:
@misc{Castro2014a,
author = {Castro, António J. M. and Oliveira, Eugénio and Rocha, Ana Paula},
title = {A New Approach for Disruption Management in Airline Operations Control},
publisher = {Springer Berlin Heidelberg : Imprint: Springer,},
year = {2014},
pages = {1 online resource (XXIV, 244 pages 39 illustrations, 7 illustrations in color},
note = {2019767052 by António J. M. Castro, Ana Paula Rocha, Eugénio Oliveira. Background Information -- A New Approach for Disruption Management -- Conclusions -- Appendixes. Description based on publisher-supplied MARC data. Studies in Computational Intelligence, 562},
doi = {https://doi.org/10.1007/978-3-662-43373-7}
}
|
|||||
| Daniele, V. and Paolo, T. | Vehicle Routing [BibTeX] |
2014 | book | DOI URL | |
BibTeX:
@book{Daniele2014,
author = {Daniele, Vigo and Paolo, Toth},
title = {Vehicle Routing},
publisher = {Society for Industrial and Applied Mathematics},
year = {2014},
note = {doi:10.1137/1.9781611973594},
url = {https://doi.org/10.1137/1.9781611973594},
doi = {https://doi.org/10.1137/1.9781611973594}
}
|
|||||
| Olshanskii, M.A. and Tyrtyshnikov, E.E. | Iterative Methods for Linear Systems [BibTeX] |
2014 | , pp. 257 | book | DOI URL |
BibTeX:
@book{Olshanskii2014,
author = {Olshanskii, Maxim A. and Tyrtyshnikov, Eugene E.},
title = {Iterative Methods for Linear Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2014},
pages = {257},
note = {doi:10.1137/1.9781611973464},
url = {https://doi.org/10.1137/1.9781611973464},
doi = {https://doi.org/10.1137/1.9781611973464}
}
|
|||||
| Romeijnders, W., Stougie, L. and van der Vlerk, M.H. | Approximation in two-stage stochastic integer programming | 2014 | Surveys in Operations Research and Management Science Vol. 19(1), pp. 17–33 |
article | DOI URL |
| Abstract: Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value. However, efficiency in the complexity theoretical sense is usually not taken into account. Quality statements mostly remain restricted to convergence to an optimal solution without accompanying implications on the running time of the algorithms for attaining more and more accurate solutions. However, over the last thirty years also some studies on performance analysis of approximation algorithms for stochastic programming have appeared. In this direction we find both probabilistic analysis and worst-case analysis. Recently the complexity of stochastic programming problems has been addressed, indeed confirming that these problems are harder than most deterministic combinatorial optimization problems. Polynomial-time approximation algorithms and their performance guarantees for stochastic linear and integer programming problems have received increasing research attention only very recently. Approximation in the traditional stochastic programming sense will not be discussed in this chapter. The reader interested in this issue is referred to surveys on stochastic programming, like the Handbook on Stochastic Programming by Ruszczyński and Shapiro (2003) or the textbooks by Birge and Louveaux (1997), Kall and Wallace (1994), Prékopa (1995), and Shapiro et al. (2009). We concentrate on the studies of approximation algorithms in relation to computational complexity theory. With this survey we intend to give a flavor of the type of results existing in the literature on approximation algorithms in two-stage stochastic integer programming rather than a complete overview of the literature on the subject. We do so by exhibiting a representative selection of results, which we present in full detail. While presenting them we do not refer to the literature; these references, together with pointers to other relevant work in this field of research, are given in an extensive notes section at the end of the survey. | |||||
BibTeX:
@article{Romeijnders2014,
author = {Romeijnders, Ward and Stougie, Leen and van der Vlerk, Maarten H.},
title = {Approximation in two-stage stochastic integer programming},
journal = {Surveys in Operations Research and Management Science},
year = {2014},
volume = {19},
number = {1},
pages = {17–33},
url = {https://www.sciencedirect.com/science/article/pii/S1876735414000026},
doi = {https://doi.org/10.1016/j.sorms.2014.04.001}
}
|
|||||
| Rostamian, R. | Programming Projects in C for Students of Engineering, Science, and Mathematics [BibTeX] |
2014 | , pp. 389 | book | DOI URL |
BibTeX:
@book{Rostamian2014,
author = {Rostamian, Rouben},
title = {Programming Projects in C for Students of Engineering, Science, and Mathematics},
publisher = {Society for Industrial and Applied Mathematics},
year = {2014},
pages = {389},
note = {doi:10.1137/1.9781611973501},
url = {https://doi.org/10.1137/1.9781611973501},
doi = {https://doi.org/10.1137/1.9781611973501}
}
|
|||||
| Salazar-González, J.-J. | Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier | 2014 | Omega Vol. 43, pp. 71–82 |
article | DOI URL |
| Abstract: This paper presents the results of a research project funded by a regional carrier operating inter-island services within the Canary Islands (Spain) in addition to services to Morocco and Portugal. It operates between 100 and 150 flights a day using three airline operators. The main scope of the project was to solve fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems on real-world data. The special characteristics of the carrier, flying between 7 am and 11 pm every day, have motivated us to design models and algorithms that are different than the ones addressed in the literature, typically built for large airline companies. This paper shows a solution approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem covering the flights of a single day. This is a new combinatorial problem that can be considered as a 2-depot vehicle routing problem with driver changes, where the vehicles represent aircrafts and the drivers represent crews. Adapting approaches from the vehicle routing literature, this paper describes a heuristic algorithm based on an integer programming model. In a similar way, this paper also addresses the rostering problem. This problem can be decomposed in smaller problems taking into account operators, bases and crew groups. These problems admit a compact formulation through mixed integer linear programming models which can be tracked by modern general-purpose solvers. This paper illustrates the success of our solution approaches on real-world instances. The airline carrier is currently using these approaches. | |||||
BibTeX:
@article{SalazarGonzalez2014,
author = {Salazar-González, Juan-José},
title = {Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier},
journal = {Omega},
year = {2014},
volume = {43},
pages = {71–82},
url = {http://www.sciencedirect.com/science/article/pii/S0305048313000674},
doi = {https://doi.org/10.1016/j.omega.2013.06.006}
}
|
|||||
| Shalev-Shwartz, S. and Ben-David, S. | Understanding machine learning : from theory to algorithms | 2014 | , pp. xvi, 397 pages | book | URL |
| Abstract: "Machine learning is one of the fastest growing areas of computer science, with far-reaching applications. The aim of this textbook is to introduce machine learning, and the algorithmic paradigms it offers, in a principled way. The book provides an extensive theoretical account of the fundamental ideas underlying machine learning and the mathematical derivations that transform these principles into practical algorithms. Following a presentation of the basics of the field, the book covers a wide array of central topics that have not been addressed by previous textbooks. These include a discussion of the computational complexity of learning and the concepts of convexity and stability; important algorithmic paradigms including stochastic gradient descent, neural networks, and structured output learning; and emerging theoretical concepts such as the PAC-Bayes approach and compression-based bounds. Designed for an advanced undergraduate or beginning graduate course, the text makes the fundamentals and algorithms of machine learning accessible to students and non-expert readers in statistics, computer science, mathematics, and engineering"-- | |||||
BibTeX:
@book{ShalevShwartz2014,
author = {Shalev-Shwartz, Shai and Ben-David, Shai},
title = {Understanding machine learning : from theory to algorithms},
publisher = {Cambridge University Press},
year = {2014},
pages = {xvi, 397 pages},
note = {2014001779 Shai Shalev-Shwartz, The Hebrew University, Jerusalem, Shai Ben-David, University of Waterloo, Canada. illustrations ; 26 cm Includes bibliographical references (pages 385-393) and index. Machine generated contents note: 1. Introduction; Part I. Foundations: 2. A gentle start; 3. A formal learning model; 4. Learning via uniform convergence; 5. The bias-complexity tradeoff; 6. The VC-dimension; 7. Non-uniform learnability; 8. The runtime of learning; Part II. From Theory to Algorithms: 9. Linear predictors; 10. Boosting; 11. Model selection and validation; 12. Convex learning problems; 13. Regularization and stability; 14. Stochastic gradient descent; 15. Support vector machines; 16. Kernel methods; 17. Multiclass, ranking, and complex prediction problems; 18. Decision trees; 19. Nearest neighbor; 20. Neural networks; Part III. Additional Learning Models: 21. Online learning; 22. Clustering; 23. Dimensionality reduction; 24. Generative models; 25. Feature selection and generation; Part IV. Advanced Theory: 26. Rademacher complexities; 27. Covering numbers; 28. Proof of the fundamental theorem of learning theory; 29. Multiclass learnability; 30. Compression bounds; 31. PAC-Bayes; Appendix A. Technical lemmas; Appendix B. Measure concentration; Appendix C. Linear algebra.},
url = {Cover image http://assets.cambridge.org/97811070/57135/cover/9781107057135.jpg}
}
|
|||||
| Soltan, S., Mazauric, D. and Zussman, G. | Cascading failures in power grids: analysis and algorithms [BibTeX] |
2014 | , pp. 195–206 | misc | DOI URL |
BibTeX:
@misc{Soltan2014,
author = {Soltan, Saleh and Mazauric, Dorian and Zussman, Gil},
title = {Cascading failures in power grids: analysis and algorithms},
publisher = {Association for Computing Machinery},
year = {2014},
pages = {195–206},
url = {https://doi.org/10.1145/2602044.2602066},
doi = {https://doi.org/10.1145/2602044.2602066}
}
|
|||||
| Sousa, J.C., Jorge, H.M. and Neves, L.P. | Short-term load forecasting based on support vector regression and load profiling | 2014 | International Journal of Energy Research Vol. 38(3), pp. 350–362 |
article | DOI URL |
| Abstract: SUMMARY The article proposes a methodology to forecast the electric load for the 24?h of the following day based on support vector regression. The study considers 24 distinct models, one for each predicted hour, where each individual model is treated independently. Its objective is to find the optimal combination of support vector machine parameters that could generalize low forecasting errors, using simulated annealing as a metaheuristic. The adopted methodology is compared to concurrent methods based on neural networks when applied to a simulated load diagram (to illustrate a distribution feeder supplying a sample of 740 consumers). The results have proven its effectiveness with mean absolute percentage errors being less than 5% for testing samples. The study also focuses on evaluating the potential benefits of adopting load profiling information as input in support vector regression, giving a consistent proof of its importance. Copyright ? 2013 John Wiley & Sons, Ltd. | |||||
BibTeX:
@article{Sousa2014,
author = {Sousa, João C. and Jorge, Humberto M. and Neves, Luís P.},
title = {Short-term load forecasting based on support vector regression and load profiling},
journal = {International Journal of Energy Research},
year = {2014},
volume = {38},
number = {3},
pages = {350–362},
note = {https://doi.org/10.1002/er.3048},
url = {https://doi.org/10.1002/er.3048},
doi = {https://doi.org/10.1002/er.3048}
}
|
|||||
| Arduino, G., Aronietis, R., Crozet, Y., Frouws, K., Ferrari, C., Guihéry, L., Kapros, S., Kourounioti, I., Laroche, F., Lambrou, M., Lloyd, M., Polydoropoulou, A., Roumboutsos, A., Van de Voorde, E. and Vanelslander, T. | How to turn an innovative concept into a success? An application to seaport-related innovation | 2013 | Research in Transportation Economics Vol. 42(1), pp. 97–107 |
article | DOI URL |
| Abstract: The main objective of this paper is ‘to assess the conditions, including policy support, under which innovative concepts have a high chance of getting adopted and being successful’. The work will start from the state-of-the-art with the following goals targeted. Firstly, to identify the paths that new innovative concepts usually follow, what key determinants are, which actors are involved, and what policy has been doing and can do. As part of this, a typology of variables is established, which will be the basis for the identification of successful adoption paths. Illustrations are provided of the performance of different innovative concepts in the seaport sector. A further goal is to propose policy recommendations, identify best practices, barriers to implementation and transferability of innovative concepts and processes. Finally, the research establishes developments needed in assessment methods and a methodological framework if innovative concepts are introduced. | |||||
BibTeX:
@article{Arduino2013,
author = {Arduino, Giulia and Aronietis, Raimonds and Crozet, Yves and Frouws, Koos and Ferrari, Claudio and Guihéry, Laurent and Kapros, Seraphim and Kourounioti, Ioanna and Laroche, Florent and Lambrou, Maria and Lloyd, Michael and Polydoropoulou, Amalia and Roumboutsos, Athena and Van de Voorde, Eddy and Vanelslander, Thierry},
title = {How to turn an innovative concept into a success? An application to seaport-related innovation},
journal = {Research in Transportation Economics},
year = {2013},
volume = {42},
number = {1},
pages = {97–107},
url = {https://www.sciencedirect.com/science/article/pii/S0739885912001631},
doi = {https://doi.org/10.1016/j.retrec.2012.11.002}
}
|
|||||
| Avrachenkov, K.E., Filar, J.A. and Howlett, P.G. | Analytic Perturbation Theory and Its Applications [BibTeX] |
2013 | , pp. 375 | book | DOI URL |
BibTeX:
@book{Avrachenkov2013,
author = {Avrachenkov, Konstantin E. and Filar, Jerzy A. and Howlett, Phil G.},
title = {Analytic Perturbation Theory and Its Applications},
publisher = {Society for Industrial and Applied Mathematics},
year = {2013},
pages = {375},
note = {doi:10.1137/1.9781611973143},
url = {https://doi.org/10.1137/1.9781611973143},
doi = {https://doi.org/10.1137/1.9781611973143}
}
|
|||||
| Bekiaris-Liberis, N. and Krstic, M. | Nonlinear Control Under Nonconstant Delays [BibTeX] |
2013 | , pp. 293 | book | DOI URL |
BibTeX:
@book{BekiarisLiberis2013,
author = {Bekiaris-Liberis, Nikolaos and Krstic, Miroslav},
title = {Nonlinear Control Under Nonconstant Delays},
publisher = {Society for Industrial and Applied Mathematics},
year = {2013},
pages = {293},
note = {doi:10.1137/1.9781611972856},
url = {https://doi.org/10.1137/1.9781611972856},
doi = {https://doi.org/10.1137/1.9781611972856}
}
|
|||||
| Chen, C., Liu, T. and Chou, J. | Integrated Short-Haul Airline Crew Scheduling Using Multiobjective Optimization Genetic Algorithms | 2013 | IEEE Transactions on Systems, Man, and Cybernetics: Systems Vol. 43(5), pp. 1077–1090 |
article | DOI |
| Abstract: This paper proposes an evolutionary alternative to conventional two-phase planning methods for solving the integrated crew scheduling (ICS) problem. The approach models and formulates the ICS problem as a combinational optimization problem with multiple constraints and objectives. An integrated evolutionary framework is proposed for simultaneously considering crew pairing and crew rostering subproblems. To improve the efficiency of the Pareto set explorer, the solution methodology applies a novel variant of the nondominated sorting genetic algorithm II (NSGA-II), one of the most popular multiobjective optimization evolutionary algorithms. The proposed variant features problem-dependent constraint handling and a bounded front policy to reserve diverse individuals. The proposed approach is verified and validated in a case study of a real-world short-haul airline crew scheduling problem. The experimental results obtained by the proposed integrated approach are then compared with a real-world airline plan generated by the conventional sequential method. An aircraft schedule recovery problem is also studied to compare solution performance between the conventional NSGA-II method and the proposed NSGA-II variant. The comparison results confirm that the proposed variant obtains solutions that are superior in two aspects: First, the proposed NSGA-II variant obtains better convergence in the studied problems compared with the original version; second, the results explored by the variant enable decision makers to select from multiple crew schedules, which are superior to the real-world airline crew plan while considering the same objectives and constraints. | |||||
BibTeX:
@article{Chen2013,
author = {Chen, C. and Liu, T. and Chou, J.},
title = {Integrated Short-Haul Airline Crew Scheduling Using Multiobjective Optimization Genetic Algorithms},
journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
year = {2013},
volume = {43},
number = {5},
pages = {1077–1090},
doi = {https://doi.org/10.1109/TSMC.2012.2234943}
}
|
|||||
| Chiraphadhanakul, V. and Barnhart, C. | Robust flight schedules through slack re-allocation | 2013 | EURO Journal on Transportation and Logistics Vol. 2(4), pp. 277–306 |
article | DOI URL |
| Abstract: A myriad of uncontrollable factors in airline operations makes delays and disruptions unavoidable. To limit complexity, most conventional scheduling models, however, ignore the occurrence of unplanned events during operations. This leads to schedules that are vulnerable to delays and disruptions. In this work, we propose a flight schedule adjustment model that strategically re-allocates existing schedule slack to achieve a more robust schedule. Using data from an international carrier, we evaluate the resulting schedules using various performance metrics, including delay propagation and passenger delays. The results show that minor schedule adjustments to the original schedule can significantly improve overall schedule performance. In addition to the modeling contribution, we provide managerial insights obtained through extensive computational experiments. Unlike earlier works on slack re-allocation that focus primarily on demonstrating the effectiveness of the methods, our paper is, to our knowledge, the first one that also addresses a fundamental question pertaining to how airline characteristics and operations influence the strategy for robust scheduling. | |||||
BibTeX:
@article{Chiraphadhanakul2013,
author = {Chiraphadhanakul, Virot and Barnhart, Cynthia},
title = {Robust flight schedules through slack re-allocation},
journal = {EURO Journal on Transportation and Logistics},
year = {2013},
volume = {2},
number = {4},
pages = {277–306},
url = {https://doi.org/10.1007/s13676-013-0028-y},
doi = {https://doi.org/10.1007/s13676-013-0028-y}
}
|
|||||
| Fu, M. | Encyclopedia of operations research and management science [BibTeX] |
2013 | , pp. pages cm | book | URL |
BibTeX:
@book{Fu2013,
author = {Fu, Michael},
title = {Encyclopedia of operations research and management science},
publisher = {Springer Berlin Heidelberg},
year = {2013},
pages = {pages cm},
edition = {3rd edition.},
note = {2013949762 Michael Fu.},
url = {Contributor biographical information http://www.loc.gov/catdir/enhancements/fy1318/2013949762-b.html
|
|||||
| Set-partitioning Problem [BibTeX] |
2013 | Encyclopedia of Operations Research and Management Science, pp. 1393–1393 | inbook | DOI URL | |
BibTeX:
@inbook{Gass2013,,
title = {Set-partitioning Problem},
booktitle = {Encyclopedia of Operations Research and Management Science},
publisher = {Springer US},
year = {2013},
pages = {1393–1393},
url = {https://doi.org/10.1007/978-1-4419-1153-7_200756},
doi = {https://doi.org/10.1007/978-1-4419-1153-7_200756}
}
|
|||||
| Höllig, K. and Hörner, J. | Approximation and Modeling with B-Splines [BibTeX] |
2013 | , pp. 227 | book | DOI URL |
BibTeX:
@book{Hoellig2013,
author = {Höllig, Klaus and Hörner, Jörg},
title = {Approximation and Modeling with B-Splines},
publisher = {Society for Industrial and Applied Mathematics},
year = {2013},
pages = {227},
note = {doi:10.1137/1.9781611972955},
url = {https://doi.org/10.1137/1.9781611972955},
doi = {https://doi.org/10.1137/1.9781611972955}
}
|
|||||
| Kuchment, P. | The Radon Transform and Medical Imaging [BibTeX] |
2013 | , pp. 238 | book | DOI URL |
BibTeX:
@book{Kuchment2013,
author = {Kuchment, Peter},
title = {The Radon Transform and Medical Imaging},
publisher = {Society for Industrial and Applied Mathematics},
year = {2013},
pages = {238},
note = {doi:10.1137/1.9781611973297},
url = {https://doi.org/10.1137/1.9781611973297},
doi = {https://doi.org/10.1137/1.9781611973297}
}
|
|||||
| Locatelli, M. and Schoen, F. | Global Optimization [BibTeX] |
2013 | , pp. 439 | book | DOI URL |
BibTeX:
@book{Locatelli2013,
author = {Locatelli, Marco and Schoen, Fabio},
title = {Global Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2013},
pages = {439},
note = {doi:10.1137/1.9781611972672},
url = {https://doi.org/10.1137/1.9781611972672},
doi = {https://doi.org/10.1137/1.9781611972672}
}
|
|||||
| Mazauric, D., Soltan, S. and Zussman, G. | Computational analysis of cascading failures in power networks [BibTeX] |
2013 | SIGMETRICS Perform. Eval. Rev. Vol. 41(1), pp. 337–338 |
article | DOI URL |
BibTeX:
@article{Mazauric2013,
author = {Mazauric, Dorian and Soltan, Saleh and Zussman, Gil},
title = {Computational analysis of cascading failures in power networks},
journal = {SIGMETRICS Perform. Eval. Rev.},
year = {2013},
volume = {41},
number = {1},
pages = {337–338},
url = {https://doi.org/10.1145/2494232.2465752},
doi = {https://doi.org/10.1145/2494232.2465752}
}
|
|||||
| Mazauric, D., Soltan, S. and Zussman, G. | Computational analysis of cascading failures in power networks [BibTeX] |
2013 | , pp. 337–338 | misc | DOI URL |
BibTeX:
@misc{Mazauric2013a,
author = {Mazauric, Dorian and Soltan, Saleh and Zussman, Gil},
title = {Computational analysis of cascading failures in power networks},
publisher = {Association for Computing Machinery},
year = {2013},
pages = {337–338},
url = {https://doi.org/10.1145/2465529.2465752},
doi = {https://doi.org/10.1145/2465529.2465752}
}
|
|||||
| Montreuil, B., Meller, R.D. and Ballot, E. | Physical Internet Foundations | 2013 | Service Orientation in Holonic and Multi Agent Manufacturing and Robotics, pp. 151–166 | inbook | DOI URL |
| Abstract: This paper provides insights into the foundations of the Physical Internet that has been introduced as a solution to the Global Logistics Sustainability Grand Challenge [1-2]. The Challenge sets as its goal to improve, by an order of magnitude, the economic, environmental and social efficiency and sustainability of the way physical objects are moved, stored, realized, supplied and used across the world. The paper introduces a formal definition of the Physical Internet as an open global logistics system founded on physical, digital and operational interconnectivity through encapsulation, interfaces and protocols. It is a perpetually evolving system driven by technological, infrastructural and business innovation. In line with the proposed definition, this chapter explains and provides insights into eight foundations of the Physical Internet: a means for logistics efficiency and sustainability, universal interconnectivity, encapsulation, standard smart interfaces, standard coordination protocols, logistics web enabler, an open global logistics system, and driven by innovation. | |||||
BibTeX:
@inbook{Montreuil2013,
author = {Montreuil, Benoit and Meller, Russell D. and Ballot, Eric},
title = {Physical Internet Foundations},
booktitle = {Service Orientation in Holonic and Multi Agent Manufacturing and Robotics},
publisher = {Springer Berlin Heidelberg},
year = {2013},
pages = {151–166},
url = {https://doi.org/10.1007/978-3-642-35852-4_10},
doi = {https://doi.org/10.1007/978-3-642-35852-4_10}
}
|
|||||
| REISI, N.M. and Moslehi, G. | Cockpit crew pairing problem in airline scheduling: Shortest path with resources constraints approach [BibTeX] |
2013 | article | ||
BibTeX:
@article{REISI2013,
author = {REISI, NAFCHI MOHAMMAD and Moslehi, Ghasem},
title = {Cockpit crew pairing problem in airline scheduling: Shortest path with resources constraints approach},
year = {2013}
}
|
|||||
| Saddoune, M., Desaulniers, G. and Soumis, F. | Aircrew pairings with possible repetitions of the same flight number | 2013 | Computers & Operations Research Vol. 40(3), pp. 805–814 |
article | DOI URL |
| Abstract: A crew pairing is a sequence of flights, connections and rests that starts and ends at a crew base and is assigned to a single crew. The crew pairing problem consists of determining a minimum cost set of feasible crew pairings such that each flight is covered exactly once and side constraints are satisfied. Traditionally, this problem has been solved in the industry by a heuristic three-phase approach that solves sequentially a daily, a weekly, and a monthly problem. This approach prohibits or strongly penalizes the repetition of the same flight number in a pairing. In this paper, we highlight two weaknesses of the three-phase approach and propose alternative solution approaches that exploit flight number repetitions in pairings. First, when the flight schedule is irregular, we show that better quality solutions can be obtained in less computational time if the first two phases are skipped and the monthly problem is solved directly using a rolling horizon approach based on column generation. Second, for completely regular flight schedules, we show that better quality solutions can be derived by skipping the daily problem phase and solving the weekly problem directly. | |||||
BibTeX:
@article{Saddoune2013,
author = {Saddoune, Mohammed and Desaulniers, Guy and Soumis, François},
title = {Aircrew pairings with possible repetitions of the same flight number},
journal = {Computers & Operations Research},
year = {2013},
volume = {40},
number = {3},
pages = {805–814},
url = {http://www.sciencedirect.com/science/article/pii/S030505481000273X},
doi = {https://doi.org/10.1016/j.cor.2010.11.003}
}
|
|||||
| Wu, Y., Luo, J., Zhang, D. and Dong, M. | An integrated programming model for storage management and vehicle scheduling at container terminals | 2013 | Research in Transportation Economics Vol. 42(1), pp. 13–27 |
article | DOI URL |
| Abstract: In this paper, we study the optimization of yard operations, which are critical for the terminal efficiency. A linear mixed integer programming (MIP) model is proposed for scheduling different types of equipment and planning the storage strategy in an integrated way. We also investigate a nonlinear mixed integer programming (NLMIP) model to reduce the number of constraints and the computational time. A set of numerical results are carried out for the comparison between the linear model and the nonlinear model. Finally, we propose a genetic algorithm for the MIP model to illustrate how large scale problems can be solved and to show the effect of different factors on the performances of the optimization model. | |||||
BibTeX:
@article{Wu2013,
author = {Wu, Yue and Luo, Jiabin and Zhang, Dali and Dong, Ming},
title = {An integrated programming model for storage management and vehicle scheduling at container terminals},
journal = {Research in Transportation Economics},
year = {2013},
volume = {42},
number = {1},
pages = {13–27},
url = {https://www.sciencedirect.com/science/article/pii/S0739885912001710},
doi = {https://doi.org/10.1016/j.retrec.2012.11.010}
}
|
|||||
| Bernstein, A., Bienstock, D., Hay, D., Uzunoglu, M. and Zussman, G. | Sensitivity analysis of the power grid vulnerability to large-scale cascading failures [BibTeX] |
2012 | SIGMETRICS Perform. Eval. Rev. Vol. 40(3), pp. 33–37 |
article | DOI URL |
BibTeX:
@article{Bernstein2012,
author = {Bernstein, Andrey and Bienstock, Daniel and Hay, David and Uzunoglu, Meric and Zussman, Gil},
title = {Sensitivity analysis of the power grid vulnerability to large-scale cascading failures},
journal = {SIGMETRICS Perform. Eval. Rev.},
year = {2012},
volume = {40},
number = {3},
pages = {33–37},
url = {https://doi.org/10.1145/2425248.2425256},
doi = {https://doi.org/10.1145/2425248.2425256}
}
|
|||||
| Burkard, R., Dell'Amico, M. and Martello, S. | Assignment Problems [BibTeX] |
2012 | , pp. 403 | book | DOI URL |
BibTeX:
@book{Burkard2012,
author = {Burkard, Rainer and Dell'Amico, Mauro and Martello, Silvano},
title = {Assignment Problems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
pages = {403},
note = {doi:10.1137/1.9781611972238},
url = {https://doi.org/10.1137/1.9781611972238},
doi = {https://doi.org/10.1137/1.9781611972238}
}
|
|||||
| Chatelin, F. | Eigenvalues of Matrices [BibTeX] |
2012 | , pp. 417 | book | DOI URL |
BibTeX:
@book{Chatelin2012,
author = {Chatelin, Françoise},
title = {Eigenvalues of Matrices},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
pages = {417},
note = {doi:10.1137/1.9781611972467},
url = {https://doi.org/10.1137/1.9781611972467},
doi = {https://doi.org/10.1137/1.9781611972467}
}
|
|||||
| De Loera, J.A., Hemmecke, R. and Köppe, M. | Algebraic and Geometric Ideas in the Theory of Discrete Optimization [BibTeX] |
2012 | , pp. 320 | book | DOI URL |
BibTeX:
@book{DeLoera2012,
author = {De Loera, Jesús A. and Hemmecke, Raymond and Köppe, Matthias},
title = {Algebraic and Geometric Ideas in the Theory of Discrete Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
pages = {320},
note = {doi:10.1137/1.9781611972443},
url = {https://doi.org/10.1137/1.9781611972443},
doi = {https://doi.org/10.1137/1.9781611972443}
}
|
|||||
| Dunbar, M., Froyland, G. and Wu, C.-L. | Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework | 2012 | Transportation Science Vol. 46(2), pp. 204–216 |
article | DOI URL |
| Abstract: For reasons of tractability, the airline scheduling problem has traditionally been sequentially decomposed into various stages (e.g., schedule generation, fleet assignment, aircraft routing, and crew pairing), with the decisions from one stage imposed upon the decision making process in subsequent stages. Although this approach greatly simplifies the solution process, it unfortunately fails to capture the many dependencies between the various stages, most notably between those of aircraft routing and crew pairing, and how these dependencies affect the propagation of delays through the flight network. Because delays are commonly transferred between late running aircraft and crew, it is important that aircraft routing and crew pairing decisions are made together. The propagated delay may then be accurately estimated to minimize the overall propagated delay for the network and produce a robust solution for both aircraft and crew. In this paper we introduce a new approach to accurately calculate and minimize the cost of propagated delay in a framework that integrates aircraft routing and crew pairing. | |||||
BibTeX:
@article{Dunbar2012,
author = {Dunbar, Michelle and Froyland, Gary and Wu, Cheng-Lung},
title = {Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework},
journal = {Transportation Science},
year = {2012},
volume = {46},
number = {2},
pages = {204–216},
url = {https://doi.org/10.1287/trsc.1110.0395},
doi = {https://doi.org/10.1287/trsc.1110.0395}
}
|
|||||
| George, A., Rajakumar, B.R. and Binu, D. | Genetic algorithm based airlines booking terminal open/close decision system [BibTeX] |
2012 | , pp. 174–179 | book | DOI URL |
BibTeX:
@book{George2012,
author = {George, Aloysius and Rajakumar, B. R. and Binu, D.},
title = {Genetic algorithm based airlines booking terminal open/close decision system},
publisher = {Association for Computing Machinery},
year = {2012},
pages = {174–179},
url = {https://doi.org/10.1145/2345396.2345426},
doi = {https://doi.org/10.1145/2345396.2345426}
}
|
|||||
| Grigoriy, B., Pablo, A.P. and Rekha, R.T. | Semidefinite Optimization and Convex Algebraic Geometry [BibTeX] |
2012 | book | DOI URL | |
BibTeX:
@book{Grigoriy2012,
author = {Grigoriy, Blekherman and Pablo, A. Parrilo and Rekha, R. Thomas},
title = {Semidefinite Optimization and Convex Algebraic Geometry},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
note = {doi:10.1137/1.9781611972290},
url = {https://doi.org/10.1137/1.9781611972290},
doi = {https://doi.org/10.1137/1.9781611972290}
}
|
|||||
| Hannan, E.J. and Deistler, M. | The Statistical Theory of Linear Systems [BibTeX] |
2012 | , pp. 418 | book | DOI URL |
BibTeX:
@book{Hannan2012,
author = {Hannan, E. J. and Deistler, Manfred},
title = {The Statistical Theory of Linear Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
pages = {418},
note = {doi:10.1137/1.9781611972191},
url = {https://doi.org/10.1137/1.9781611972191},
doi = {https://doi.org/10.1137/1.9781611972191}
}
|
|||||
| Leith, D.J., Cao, Q. and Subramanian, V.G. | Max-Min Fairness in 802.11 Mesh Networks [BibTeX] |
2012 | IEEE/ACM Transactions on Networking Vol. 20(3), pp. 756–769 |
article | DOI |
BibTeX:
@article{Leith2012,
author = {Leith, D. J. and Cao, Q. and Subramanian, V. G.},
title = {Max-Min Fairness in 802.11 Mesh Networks},
journal = {IEEE/ACM Transactions on Networking},
year = {2012},
volume = {20},
number = {3},
pages = {756–769},
doi = {https://doi.org/10.1109/TNET.2011.2165850}
}
|
|||||
| Pinedo, M. | Scheduling : theory, algorithms, and systems [BibTeX] |
2012 | , pp. xx, 673 p. | book | URL |
BibTeX:
@book{Pinedo2012,
author = {Pinedo, Michael},
title = {Scheduling : theory, algorithms, and systems},
publisher = {Springer},
year = {2012},
pages = {xx, 673 p.},
edition = {4th},
note = {2011945105 Michael L. Pinedo. ill. ; 25 cm. Includes bibliographical references (p. 623-659) and indexes.},
url = {Contributor biographical information http://www.loc.gov/catdir/enhancements/fy1318/2011945105-b.html
|
|||||
| Yamamoto, Y. | From Vector Spaces to Function Spaces [BibTeX] |
2012 | , pp. 272 | book | DOI URL |
BibTeX:
@book{Yamamoto2012,
author = {Yamamoto, Yutaka},
title = {From Vector Spaces to Function Spaces},
publisher = {Society for Industrial and Applied Mathematics},
year = {2012},
pages = {272},
note = {doi:10.1137/9781611972313},
url = {https://doi.org/10.1137/9781611972313},
doi = {https://doi.org/10.1137/9781611972313}
}
|
|||||
| Arndt, J. | Set partitions | 2011 | Matters Computational: Ideas, Algorithms, Source Code, pp. 354–369 | inbook | DOI URL |
| Abstract: For a set of n elements, say Sn := f1;2...,n, a set partition is a set P = s1; s2,...sk of nonempty subsets si of Sn whose intersection is empty and whose union equals Sn. | |||||
BibTeX:
@inbook{Arndt2011,
author = {Arndt, Jörg},
title = {Set partitions},
booktitle = {Matters Computational: Ideas, Algorithms, Source Code},
publisher = {Springer Berlin Heidelberg},
year = {2011},
pages = {354–369},
url = {https://doi.org/10.1007/978-3-642-14764-7_17},
doi = {https://doi.org/10.1007/978-3-642-14764-7_17}
}
|
|||||
| Bertsimas, D., Brown, D.B. and Caramanis, C. | Theory and Applications of Robust Optimization [BibTeX] |
2011 | SIAM Review Vol. 53(3), pp. 464–501 |
article | DOI URL |
BibTeX:
@article{Bertsimas2011,
author = {Bertsimas, Dimitris and Brown, David B. and Caramanis, Constantine},
title = {Theory and Applications of Robust Optimization},
journal = {SIAM Review},
year = {2011},
volume = {53},
number = {3},
pages = {464–501},
url = {https://doi.org/10.1137/080734510},
doi = {https://doi.org/10.1137/080734510}
}
|
|||||
| Castro, A.J.M. and Oliveira, E. | A New Concept for Disruption Management in Airline Operations Control | 2011 | Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering Vol. 225(3), pp. 269–290 |
article | DOI URL |
| Abstract: The Airline Operations Control Centre (AOCC) of an airline company is the organization responsible for monitoring and solving operational problems. It includes teams of human experts specialized in solving problems related with aircrafts, crewmembers, and passengers, in a process called disruption management or operations recovery. In this article, the authors propose a new concept for disruption management in this domain. The organization of the AOCC is represented by a multi-agent system (MAS), where roles that correspond to the most frequent tasks that could benefit from a cooperative approach, are performed by intelligent agents. The human experts, represented by agents that are able to interact with them, are part of this AOCC-MAS supervising the system and taking the final decision from the solutions proposed by the AOCC-MAS. The authors show the architecture of this AOCC-MAS, including the main costs involved and details about how the system takes decisions. They tested the concept, using several real airline crew-related problems and using four methods: human experts (traditional way), the AOCC-MAS with and without using quality-costs, and the integrated approach presented in this article. The results are presented and discussed. | |||||
BibTeX:
@article{Castro2011,
author = {Castro, A J M and Oliveira, E},
title = {A New Concept for Disruption Management in Airline Operations Control},
journal = {Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering},
year = {2011},
volume = {225},
number = {3},
pages = {269–290},
url = {https://journals.sagepub.com/doi/abs/10.1243/09544100JAERO864},
doi = {https://doi.org/10.1243/09544100jaero864}
}
|
|||||
| Chen, Q., Lim, A. and Zhu, W. | A greedy heuristic for airline crew rostering: unique challenges in a large airline in China [BibTeX] |
2011 | , pp. 237–245 | misc | |
BibTeX:
@misc{Chen2011,
author = {Chen, Qiao and Lim, Andrew and Zhu, Wenbin},
title = {A greedy heuristic for airline crew rostering: unique challenges in a large airline in China},
publisher = {Springer-Verlag},
year = {2011},
pages = {237–245}
}
|
|||||
| Ionescu, L. and Kliewer, N. | Increasing Flexibility of Airline Crew Schedules | 2011 | Procedia - Social and Behavioral Sciences Vol. 20, pp. 1019–1028 |
article | DOI URL |
| Abstract: Airline transportation frequently has to deal with disruptions, like technical breakdowns or bad weather conditions. Resulting delays often lead to additional delays, due to interdependencies between different resources such as aircraft or crews. In the following schedules may become infeasible during the day of operations. This forces the operations control to recover those schedules by mostly expensive actions. Regarding this difficulty robust scheduling deals with the construction of schedules that are less affected by disruptions, e.g. by increasing delay tolerance or providing possibilities for low-cost recovery actions. Robustness consists of two aspects, stability and flexibility. Stability describes the degree of the ability of a schedule to remain feasible and cost efficient under different operational environments without major modifications. In contrast, flexibility is the ability of a schedule to be adapted to changing environments in operations at low costs. However, increasing robustness accompanies with an increase of the planning costs. Thus a main goal of robust scheduling is its efficiency. In this context a method is efficient, if it obtains a high increase of robustness for a low increase of costs. In this paper we present a stochastic optimization model with respect to swapping opportunities of crews. We propose a run-time saving solution approach to integrate flexibility indicators into a column generation framework with a constraint generation extension. In order to realistically evaluate the robustness of the schedules we use a scenario based simulation model with enabled recovery actions for a realistic evaluation. The results show that the approach allows us to generate crew schedules with higher flexibility degrees at low increase of the planned costs in comparison with cost-efficient schedules. | |||||
BibTeX:
@article{Ionescu2011,
author = {Ionescu, Lucian and Kliewer, Natalia},
title = {Increasing Flexibility of Airline Crew Schedules},
journal = {Procedia - Social and Behavioral Sciences},
year = {2011},
volume = {20},
pages = {1019–1028},
url = {https://www.sciencedirect.com/science/article/pii/S1877042811014911},
doi = {https://doi.org/10.1016/j.sbspro.2011.08.111}
}
|
|||||
| Jeremy, K. and John, G. | Graph Algorithms in the Language of Linear Algebra [BibTeX] |
2011 | book | DOI URL | |
BibTeX:
@book{Jeremy2011,
author = {Jeremy, Kepner and John, Gilbert},
title = {Graph Algorithms in the Language of Linear Algebra},
publisher = {Society for Industrial and Applied Mathematics},
year = {2011},
note = {doi:10.1137/1.9780898719918},
url = {https://doi.org/10.1137/1.9780898719918},
doi = {https://doi.org/10.1137/1.9780898719918}
}
|
|||||
| Puchinger, J., Stuckey, P.J., Wallace, M.G. and Brand, S. | Dantzig-Wolfe decomposition and branch-and-price solving in G12 | 2011 | Constraints Vol. 16(1), pp. 77–99 |
article | DOI URL |
| Abstract: The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-price solving. Dantzig-Wolfe decomposition is automatically performed using the additional information given by the model annotations. The models obtained can then be solved using column generation and branch-and-price. G12 supports the selection of specialised subproblem solvers, the aggregation of identical subproblems to reduce symmetries, automatic disaggregation when required by branch-and-bound, the use of specialised subproblem constraint-branching rules, and different master problem solvers including a hybrid solver based on the volume algorithm. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing. | |||||
BibTeX:
@article{Puchinger2011,
author = {Puchinger, Jakob and Stuckey, Peter J. and Wallace, Mark G. and Brand, Sebastian},
title = {Dantzig-Wolfe decomposition and branch-and-price solving in G12},
journal = {Constraints},
year = {2011},
volume = {16},
number = {1},
pages = {77–99},
url = {https://doi.org/10.1007/s10601-009-9085-0},
doi = {https://doi.org/10.1007/s10601-009-9085-0}
}
|
|||||
| Sohoni, M., Lee, Y.-C. and Klabjan, D. | Robust Airline Scheduling Under Block-Time Uncertainty | 2011 | Transportation Science Vol. 45(4), pp. 451–464 |
article | DOI URL |
| Abstract: Airline schedule development continues to remain one of the most challenging planning activities for any airline. An airline schedule comprises a list of flights and specifies the origin, destination, scheduled departure, and arrival time of each flight in the airline's network. A critical component of the schedule development activity is the choice of flight block-times, which depend on several factors. Many airlines decide schedule block-times based on fixed percentiles of block-time distributions built from historical data, however, such techniques have not resulted in significantly improved on-time performance (OTP) of the schedule during operations. Thus, from a passenger's perspective, the service-level guarantee of an airline's network continues to be low. We first define two service-level metrics for an airline schedule. The first one is similar to the OTP measure of the U.S. Department of Transportation and we define it as the flight service level. The second metric, called the network service level, is geared toward completion of passenger itineraries. We then develop a stochastic integer programming formulation that optimally perturbs a given schedule to maximize expected profit, while ensuring the two service levels. We also develop a variant of this model that maximizes service levels, while achieving desired network profitability. To solve these models, we develop an efficient algorithm that guarantees optimality. Through extensive computational experiments, using real-world data, we demonstrate that our models and algorithms are efficient and achieve the desired trade-off between service level and profitability. | |||||
BibTeX:
@article{Sohoni2011,
author = {Sohoni, Milind and Lee, Yu-Ching and Klabjan, Diego},
title = {Robust Airline Scheduling Under Block-Time Uncertainty},
journal = {Transportation Science},
year = {2011},
volume = {45},
number = {4},
pages = {451–464},
url = {https://doi.org/10.1287/trsc.1100.0361},
doi = {https://doi.org/10.1287/trsc.1100.0361}
}
|
|||||
| Tam, B., Ehrgott, M., Ryan, D. and Zakeri, G. | A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling | 2011 | OR Spectrum Vol. 33(1), pp. 49–75 |
article | DOI URL |
| Abstract: A prominent problem in airline crew scheduling is the pairings or Tour-of-Duty planning problem. The objective is to determine a set of pairings (or Tours-of-Duty) for a crew group to minimise the planned cost of operating a schedule of flights. However, due to unforeseen events the performance in operation can differ considerably from planning, sometimes causing significant additional recovery costs. In recent years there has been a growing interest in robust crew scheduling. Here, the aim is to find solutions that are “cheap” in terms of planned cost as well as being robust, meaning that they are less likely to be disrupted in case of delays. Taking the stochastic nature of delays into account, Yen and Birge (Transp Sci 40:3–14, 2006) formulate the problem as a two-stage stochastic integer programme and develop an algorithm to solve this problem. Based on the contradictory nature of the goals, Ehrgott and Ryan (J Multi-Criteria Decis Anal 11:139–150, 2002) formulate a bi-objective set partitioning model and employ elastic constraint scalarisation to enable the solution by set partitioning algorithms commercially used in crew scheduling software. In this study, we compare the two solution approaches. We improve the algorithm of Yen and Birge (Transp Sci 40:3–14, 2006) and implement both methods with a commercial crew scheduling software. The results of both methods are compared with respect to characteristics of robust solutions, such as the number of aircraft changes for crew. We also conduct experiments to simulate the performance of the obtained solutions. All experiments are performed using actual schedule data from Air New Zealand. | |||||
BibTeX:
@article{Tam2011,
author = {Tam, Bassy and Ehrgott, Matthias and Ryan, David and Zakeri, Golbon},
title = {A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling},
journal = {OR Spectrum},
year = {2011},
volume = {33},
number = {1},
pages = {49–75},
url = {https://doi.org/10.1007/s00291-009-0164-9},
doi = {https://doi.org/10.1007/s00291-009-0164-9}
}
|
|||||
| Vanderbeck, F. | Branching in branch-and-price: a generic scheme | 2011 | Mathematical Programming Vol. 130(2), pp. 249–294 |
article | DOI URL |
| Abstract: Developing a branching scheme that is compatible with the column generation procedure can be challenging. Application specific and generic schemes have been proposed in the literature, but they have their drawbacks. One generic scheme is to implement standard branching in the space of the compact formulation to which the Dantzig-Wolfe reformulation was applied. However, in the presence of multiple identical subsystems, the mapping to the original variable space typically induces symmetries. An alternative, in an application specific context, can be to expand the compact formulation to offer a wider choice of branching variables. Other existing generic schemes for use in branch-and-price imply modifications to the pricing problem. This is a concern because the pricing oracle on which the method relies might become obsolete beyond the root node. This paper presents a generic branching scheme in which the pricing oracle of the root node remains of use after branching (assuming that the pricing oracle can handle bounds on the subproblem variables). The scheme does not require the use of an extended formulation of the original problem. It proceeds by recursively partitioning the subproblem solution set. Branching constraints are enforced in the pricing problem instead of being dualized via Lagrangian relaxation, and the pricing problem is solved by a limited number of calls to the pricing oracle. This generic scheme builds on previously proposed approaches and unifies them. We illustrate its use on the cutting stock and bin packing problems. This is the first branch-and-price algorithm capable of solving such problems to integrality without modifying the subproblem or expanding its variable space. | |||||
BibTeX:
@article{Vanderbeck2011,
author = {Vanderbeck, François},
title = {Branching in branch-and-price: a generic scheme},
journal = {Mathematical Programming},
year = {2011},
volume = {130},
number = {2},
pages = {249–294},
url = {https://doi.org/10.1007/s10107-009-0334-1},
doi = {https://doi.org/10.1007/s10107-009-0334-1}
}
|
|||||
| Williamson, D.P. and Shmoys, D.B. | The design of approximation algorithms | 2011 | , pp. xi, 504 p. | book | URL |
| Abstract: "Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"-- | |||||
BibTeX:
@book{Williamson2011,
author = {Williamson, David P. and Shmoys, David Bernard},
title = {The design of approximation algorithms},
publisher = {Cambridge University Press},
year = {2011},
pages = {xi, 504 p.},
note = {2011001945 David P. Williamson, David B. Shmoys. ill. ; 26 cm. Includes bibliographical references and indexes.},
url = {Cover image http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg}
}
|
|||||
| Adler, R.J. | The Geometry of Random Fields [BibTeX] |
2010 | , pp. 295 | book | DOI URL |
BibTeX:
@book{Adler2010,
author = {Adler, Robert J.},
title = {The Geometry of Random Fields},
publisher = {Society for Industrial and Applied Mathematics},
year = {2010},
pages = {295},
note = {doi:10.1137/1.9780898718980},
url = {https://doi.org/10.1137/1.9780898718980},
doi = {https://doi.org/10.1137/1.9780898718980}
}
|
|||||
| Biegler, L.T. | Nonlinear Programming [BibTeX] |
2010 | , pp. 410 | book | DOI URL |
BibTeX:
@book{Biegler2010,
author = {Biegler, Lorenz T.},
title = {Nonlinear Programming},
publisher = {Society for Industrial and Applied Mathematics},
year = {2010},
pages = {410},
note = {doi:10.1137/1.9780898719383},
url = {https://doi.org/10.1137/1.9780898719383},
doi = {https://doi.org/10.1137/1.9780898719383}
}
|
|||||
| Burke, E.K., De Causmaecker, P., De Maere, G., Mulder, J., Paelinck, M. and Vanden Berghe, G. | A multi-objective approach for robust airline scheduling | 2010 | Computers & Operations Research Vol. 37(5), pp. 822–832 |
article | DOI URL |
| Abstract: We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives is obtained by simultaneous flight retiming and aircraft rerouting, subject to a fixed fleet assignment. Approximations of the Pareto optimal front are obtained by applying a multi-meme memetic algorithm. We investigate biased meme selection to encourage exploration of the boundaries of the search space and compare it with random meme selection. An external population of high quality solutions is maintained using the adaptive grid archiving algorithm. The presented approach is applied to investigate simultaneous improvement of reliability and flexibility in real world schedules from KLM Royal Dutch Airlines. Experimental results show that the approach enables us to obtain schedules with significant improvements for the considered objectives. A large scale simulation study was undertaken to quantify the influence of the robustness objectives on the operational performance of the schedules. Rigorous sensitivity analysis of the results shows that the influence of the schedule reliability is dominant and that increased schedule flexibility could improve the operational performance. | |||||
BibTeX:
@article{Burke2010,
author = {Burke, Edmund K. and De Causmaecker, Patrick and De Maere, Geert and Mulder, Jeroen and Paelinck, Marc and Vanden Berghe, Greet},
title = {A multi-objective approach for robust airline scheduling},
journal = {Computers & Operations Research},
year = {2010},
volume = {37},
number = {5},
pages = {822–832},
url = {http://www.sciencedirect.com/science/article/pii/S0305054809000896},
doi = {https://doi.org/10.1016/j.cor.2009.03.026}
}
|
|||||
| Easley, D. and Kleinberg, J. | Networks, crowds, and markets : reasoning about a highly connected world | 2010 | , pp. xv, 727 p. | book | |
| Abstract: "Over the past decade there has been a growing public fascination with the complex connectedness of modern society. This connectedness is found in many incarnations: in the rapid growth of the Internet, in the ease with which global communication takes place, and in the ability of news and information as well as epidemics and financial crises to spread with surprising speed and intensity. These are phenomena that involve networks, incentives, and the aggregate behavior of groups of people; they are based on the links that connect us and the ways in which our decisions can have subtle consequences for others. This introductory undergraduate textbook takes an interdisciplinary look at economics, sociology, computing and information science, and applied mathematics to understand networks and behavior. It describes the emerging field of study that is growing at the interface of these areas, addressing fundamental questions about how the social, economic, and technological worlds are connected"--Provided by publisher. | |||||
BibTeX:
@book{Easley2010,
author = {Easley, David and Kleinberg, Jon},
title = {Networks, crowds, and markets : reasoning about a highly connected world},
publisher = {Cambridge University Press},
year = {2010},
pages = {xv, 727 p.},
note = {2009050314 David Easley, Jon Kleinberg. ill., map ; 27 cm. Includes bibliographical references and index. Machine generated contents note: 1. Overview; Part I. Graph Theory and Social Networks: 2. Graphs; 3. Strong and weak ties; 4. Networks in their surrounding contexts; 5. Positive and negative relationships; Part II. Game Theory: 6. Games; 7. Evolutionary game theory; 8. Modeling network traffic using game theory; 9. Auctions; Part III. Markets and Strategic Interaction in Networks: 10. Matching markets; 11. Network models of markets with intermediaries; 12. Bargaining and power in networks; Part IV. Information Networks and the World Wide Web: 13. The structure of the Web; 14. Link analysis and Web search; 15. Sponsored search markets; Part V. Network Dynamics: Population Models: 16. Information cascades; 17. Network effects; 18. Power laws and rich-get-richer phenomena; Part VI. Network Dynamics: Structural Models: 19. Cascading behavior in networks; 20. The small-world phenomenon; 21. Epidemics; Part VII. Institutions and Aggregate Behavior: 22. Markets and information; 23. Voting; 24. Property.}
}
|
|||||
| Elattar, E.E., Goulermas, J. and Wu, Q.H. | Electric Load Forecasting Based on Locally Weighted Support Vector Regression [BibTeX] |
2010 | IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) Vol. 40(4), pp. 438–447 |
article | DOI |
BibTeX:
@article{Elattar2010,
author = {Elattar, E. E. and Goulermas, J. and Wu, Q. H.},
title = {Electric Load Forecasting Based on Locally Weighted Support Vector Regression},
journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
year = {2010},
volume = {40},
number = {4},
pages = {438–447},
doi = {https://doi.org/10.1109/TSMCC.2010.2040176}
}
|
|||||
| Kleinberg, J., Tardos, E., Manor, M. and ha-petuḥah., U. | Pituaḥ algoritmim [BibTeX] |
2010 | , pp. 506 p. | book | |
BibTeX:
@book{Kleinberg2010,
author = {Kleinberg, Jon and Tardos, Éva and Manor, Mendel and Universiṭah ha-petuḥah.},
title = {Pituaḥ algoritmim},
publisher = {ha-Universiṭah ha-petuḥah},
year = {2010},
pages = {506 p.},
note = {2011483345 Algorithm design. Hebrew G'on Ḳlainberg, Eṿah Ṭardosh ; tirgum, Tamar Almog ; ʻarikhah madaʻit, Manor Mendel. ill. ; 24 cm. "20417"--Spine. Includes bibliographical references (p.485-494) and index.}
}
|
|||||
| Liu, T.-K., Chen, C.-H. and Chou, J.-H. | Optimization of short-haul aircraft schedule recovery problems using a hybrid multiobjective genetic algorithm | 2010 | Expert Systems with Applications Vol. 37(3), pp. 2307–2315 |
article | DOI URL |
| Abstract: A hybrid multiobjective genetic algorithm is presented in this paper to find an efficient solution for the daily short-haul aircraft schedule recovery problems which usually happen due to some disturbance events and require a time-sensitive solution to meet various hard constraints and soft objectives. The proposed algorithm employs an adaptive evaluated vector (AEV) to guide the solution search and uses the method of inequality-based multiobjective genetic algorithm to provide the multiobjective solution. A simulated disturbance experiment, temporal airport closure, is made and shown that the hybrid method can provide a very efficient short-haul schedule recovery solution under various performance indices. | |||||
BibTeX:
@article{Liu2010,
author = {Liu, Tung-Kuan and Chen, Chiu-Hung and Chou, Jyh-Horng},
title = {Optimization of short-haul aircraft schedule recovery problems using a hybrid multiobjective genetic algorithm},
journal = {Expert Systems with Applications},
year = {2010},
volume = {37},
number = {3},
pages = {2307–2315},
url = {http://www.sciencedirect.com/science/article/pii/S0957417409007106},
doi = {https://doi.org/10.1016/j.eswa.2009.07.068}
}
|
|||||
| Speyer, J.L. and Jacobson, D.H. | Primer on Optimal Control Theory [BibTeX] |
2010 | , pp. 316 | book | DOI URL |
BibTeX:
@book{Speyer2010,
author = {Speyer, Jason L. and Jacobson, David H.},
title = {Primer on Optimal Control Theory},
publisher = {Society for Industrial and Applied Mathematics},
year = {2010},
pages = {316},
note = {doi:10.1137/1.9780898718560},
url = {https://doi.org/10.1137/1.9780898718560},
doi = {https://doi.org/10.1137/1.9780898718560}
}
|
|||||
| Sun, C. and Lu, S. | Short-term combined economic emission hydrothermal scheduling using improved quantum-behaved particle swarm optimization | 2010 | Expert Systems with Applications Vol. 37(6), pp. 4232–4241 |
article | DOI URL |
| Abstract: This paper presents an improved quantum-behaved particle swarm optimization (IQPSO) for short-term combined economic emission hydrothermal scheduling, which is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing emission cost. In this paper, quantum-behaved particle swarm optimization is improved employing heuristic strategies in order to handle the equality constraints especially water dynamic balance constraints and active power balance constraints. A feasibility-based selection technique is also devised to handle the reservoir storage volumes constraints. To show feasibility and effectiveness of the proposed method, different case studies, such as economic load scheduling (ELS), economic emission scheduling (EES) and combined economic emission scheduling (CEES) in hydrothermal scheduling, are carried out and the test results are compared with those of other methods reported in the literature. It is also very important to note that the proposed method is capable of yielding higher-quality solutions while strictly satisfying all constraints of the test system. | |||||
BibTeX:
@article{Sun2010,
author = {Sun, Chengfu and Lu, Songfeng},
title = {Short-term combined economic emission hydrothermal scheduling using improved quantum-behaved particle swarm optimization},
journal = {Expert Systems with Applications},
year = {2010},
volume = {37},
number = {6},
pages = {4232–4241},
url = {https://www.sciencedirect.com/science/article/pii/S0957417409010215},
doi = {https://doi.org/10.1016/j.eswa.2009.11.079}
}
|
|||||
| Vanderbeck, F. and Wolsey, L.A. | Reformulation and Decomposition of Integer Programs | 2010 | 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, pp. 431–502 | inbook | DOI URL |
| Abstract: We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation and branch-and-price algorithms. This is followed by an examination of Benders’ type algorithms based on projection. Finally we discuss extended formulations involving additional variables that are based on problem structure. These can often be used to provide strengthened a priori formulations. Reformulations obtained by adding cutting planes in the original variables are not treated here. | |||||
BibTeX:
@inbook{Vanderbeck2010,
author = {Vanderbeck, François and Wolsey, Laurence A.},
title = {Reformulation and Decomposition of Integer Programs},
booktitle = {50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art},
publisher = {Springer Berlin Heidelberg},
year = {2010},
pages = {431–502},
url = {https://doi.org/10.1007/978-3-540-68279-0_13},
doi = {https://doi.org/10.1007/978-3-540-68279-0_13}
}
|
|||||
| Weide, O., Ryan, D. and Ehrgott, M. | An iterative approach to robust and integrated aircraft routing and crew scheduling | 2010 | Computers & Operations Research Vol. 37(5), pp. 833–844 |
article | DOI URL |
| Abstract: In airline scheduling a variety of planning and operational decision problems have to be solved. We consider the problems aircraft routing and crew pairing: aircraft and crew must be allocated to flights in a schedule in a minimal cost way. Although these problems are not independent, they are usually formulated as independent mathematical optimisation models and solved sequentially. This approach might lead to a suboptimal allocation of aircraft and crew, since a solution of one of the problems may restrict the set of feasible solutions of the problem solved later. Also, when minimal cost solutions are used in operations, a short delay of one flight can cause very severe disruptions of the schedule later in the day. We generate solutions that incur small costs and are also robust to typical stochastic variability in airline operations. We solve the two original problems iteratively. Starting from a minimal cost solution, we produce a series of solutions which are increasingly robust. Using data from domestic airline schedules we evaluate the benefits of the approach as well as the trade-off between cost and robustness. We extend our approach considering the aircraft routing problem together with two crew pairing problems, one for technical crew and one for flight attendants. | |||||
BibTeX:
@article{Weide2010,
author = {Weide, Oliver and Ryan, David and Ehrgott, Matthias},
title = {An iterative approach to robust and integrated aircraft routing and crew scheduling},
journal = {Computers & Operations Research},
year = {2010},
volume = {37},
number = {5},
pages = {833–844},
url = {https://www.sciencedirect.com/science/article/pii/S0305054809000963},
doi = {https://doi.org/10.1016/j.cor.2009.03.024}
}
|
|||||
| Encyclopedia of Optimization, Second Edition [BibTeX] |
2009 | book | |||
BibTeX:
@book{2009,,
title = {Encyclopedia of Optimization, Second Edition},
publisher = {Springer},
year = {2009}
}
|
|||||
| Ben-Tal, A., El Ghaoui, L. and Nemirovskiĭ, A.S. | Robust optimization | 2009 | , pp. xxii, 542 p. | book | |
| Abstract: Robust optimization is a fairly new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. The authors are the principal developers of robust optimization. | |||||
BibTeX:
@book{BenTal2009,
author = {Ben-Tal, A. and El Ghaoui, Laurent and Nemirovskiĭ, A. S.},
title = {Robust optimization},
publisher = {Princeton University Press},
year = {2009},
pages = {xxii, 542 p.},
note = {2009013229 GBA969209 Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski. ill. ; 27 cm. Includes bibliographical references and index. Pt. I. Robust Linear Optimization -- Ch. 1. Uncertain Linear Optimization Problems and their Robust Counterparts -- Ch. 2. Robust Counterpart Approximations of Scalar Chance Constraints -- Ch. 3. Globalized Robust Counterparts of Uncertain LO Problems -- Ch. 4. More on Safe Tractable Approximations of Scalar Chance Constraints -- Pt. II. Robust Conic Optimization -- Ch. 5. Uncertain Conic Optimization: The Concepts -- Ch. 6. Uncertain Conic Quadratic Problems with Tractable RCs -- Ch. 7. Approximating RCs of Uncertain Conic Quadratic Problems -- Ch. 8. Uncertain Semidefinite Problems with Tractable RCs -- Ch. 9. Approximating RCs of Uncertain Semidefinite Problems -- Ch. 10. Approximating Chance Constrained CQIs and LMIs -- Ch. 11. Globalized Robust Counterparts of Uncertain Conic Problems -- Ch. 12. Robust Classification and Estimation -- Pt. III. Robust Multi-Stage Optimization -- Ch. 13. Robust Markov Decision Processes -- Ch. 14. Robust Adjustable Multistage Optimization -- Pt. IV. Selected Applications -- Ch. 15. Selected Applications -- App. A. Notation and Prerequisites -- App. B. Some Auxiliary Proofs -- App. C. Solutions to Selected Exercises -- Index. Princeton series in applied mathematics.}
}
|
|||||
| Bianchi, L., Dorigo, M., Gambardella, L.M. and Gutjahr, W.J. | A survey on metaheuristics for stochastic combinatorial optimization | 2009 | Natural Computing Vol. 8(2), pp. 239–287 |
article | DOI URL |
| Abstract: Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex optimization problems, and they are a growing research area since a few decades. In recent years, metaheuristics are emerging as successful alternatives to more classical approaches also for solving optimization problems that include in their mathematical formulation uncertain, stochastic, and dynamic information. In this paper metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and others are introduced, and their applications to the class of Stochastic Combinatorial Optimization Problems (SCOPs) is thoroughly reviewed. Issues common to all metaheuristics, open problems, and possible directions of research are proposed and discussed. In this survey, the reader familiar to metaheuristics finds also pointers to classical algorithmic approaches to optimization under uncertainty, and useful informations to start working on this problem domain, while the reader new to metaheuristics should find a good tutorial in those metaheuristics that are currently being applied to optimization under uncertainty, and motivations for interest in this field. | |||||
BibTeX:
@article{Bianchi2009,
author = {Bianchi, Leonora and Dorigo, Marco and Gambardella, Luca Maria and Gutjahr, Walter J.},
title = {A survey on metaheuristics for stochastic combinatorial optimization},
journal = {Natural Computing},
year = {2009},
volume = {8},
number = {2},
pages = {239–287},
url = {https://doi.org/10.1007/s11047-008-9098-4},
doi = {https://doi.org/10.1007/s11047-008-9098-4}
}
|
|||||
| Conn, A.R., Scheinberg, K. and Vicente, L.N. | Introduction to Derivative-Free Optimization [BibTeX] |
2009 | , pp. 276 | book | DOI URL |
BibTeX:
@book{Conn2009,
author = {Conn, Andrew R. and Scheinberg, Katya and Vicente, Luis N.},
title = {Introduction to Derivative-Free Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2009},
pages = {276},
note = {doi:10.1137/1.9780898718768},
url = {https://doi.org/10.1137/1.9780898718768},
doi = {https://doi.org/10.1137/1.9780898718768}
}
|
|||||
| Floudas, C.A., Pardalos, P.M. and service) , S.(O. | Encyclopedia of Optimization [BibTeX] |
2009 | , pp. 1 online resource. | misc | URL |
BibTeX:
@misc{Floudas2009,
author = {Floudas, Christodoulos A. and Pardalos, Panos M. and SpringerLink (Online service)},
title = {Encyclopedia of Optimization},
publisher = {Springer-Verlag,},
year = {2009},
pages = {1 online resource.},
note = {/ edited by Christodoulos A. Floudas, Panos M. Pardalos. Access is available to the Yale community. Springer eBooks. Yale Internet Resource None Online Resource},
url = {http://dx.doi.org/10.1007/978-0-387-74759-0}
}
|
|||||
| Gao, C., Johnson, E. and Smith, B. | Integrated Airline Fleet and Crew Robust Planning | 2009 | Transportation Science Vol. 43(1), pp. 2–16 |
article | DOI URL |
| Abstract: The airline fleet assignment problem involves assigning aircraft to flights to maximize profit. Different fleet assignment solutions cause dramatically different performance in subsequent crew-planning and operational processes. We have developed an integrated fleet and crew robust planning method to provide fleet assignment solutions that are both friendly to crew planning and robust to real-time operations. The three challenges of this work are (1) to understand the influence of fleet assignment on crew scheduling; (2) to address crew scheduling in a tractable way in the integrated model; and (3) to achieve robustness. We address these challenges by developing a new approach that integrates crew connections within the fleet assignment model and imposes station purity by limiting the number of fleet types and crew bases allowed to serve each airport. Computational results demonstrate that the proposed approach can reduce crew-planning cost, improve robustness, and solve industrial-size problems with good computational efficiency. | |||||
BibTeX:
@article{Gao2009,
author = {Gao, Chunhua and Johnson, Ellis and Smith, Barry},
title = {Integrated Airline Fleet and Crew Robust Planning},
journal = {Transportation Science},
year = {2009},
volume = {43},
number = {1},
pages = {2–16},
url = {https://pubsonline.informs.org/doi/abs/10.1287/trsc.1080.0257},
doi = {https://doi.org/10.1287/trsc.1080.0257}
}
|
|||||
| Groshe, T. | Computational intelligence in integrated airline scheduling [BibTeX] |
2009 | , pp. xx, 250 p. | book | |
BibTeX:
@book{Groshe2009,
author = {Groshe, Tobias},
title = {Computational intelligence in integrated airline scheduling},
publisher = {Springer},
year = {2009},
pages = {xx, 250 p.},
note = {2008941002 Tobias Grosche. ill. ; 24 cm. Includes bibliographical references (p. [231]-247).}
}
|
|||||
| Gu, J., Gu, X. and Gu, M. | A novel parallel quantum genetic algorithm for stochastic job shop scheduling | 2009 | Journal of Mathematical Analysis and Applications Vol. 355(1), pp. 63–81 |
article | DOI URL |
| Abstract: In this paper, a Novel Parallel Quantum Genetic Algorithm (NPQGA) is proposed for the stochastic Job Shop Scheduling Problem with the objective of minimizing the expected value of makespan, where the processing times are subjected to independent normal distributions. Based on the parallel evolutionary idea and some concepts of quantum theory, we simulate a model of parallel quantum computation. In this frame, there are some demes (sub-populations) and some universes (groups of populations), which are structured in super star-shaped topologies. A new migration scheme based on penetration theory is developed to control migration rate and direction adaptively between demes, and a novel quantum crossover strategy is devised among universes. The quantum evolution is executed in every deme by applying some improvement operators (the coding mechanism aiming at job shop, the new quantum rotation angle and the catastrophe operator). Experiment results show NPQGA's effectiveness and applicability. | |||||
BibTeX:
@article{Gu2009,
author = {Gu, Jinwei and Gu, Xingsheng and Gu, Manzhan},
title = {A novel parallel quantum genetic algorithm for stochastic job shop scheduling},
journal = {Journal of Mathematical Analysis and Applications},
year = {2009},
volume = {355},
number = {1},
pages = {63–81},
url = {https://www.sciencedirect.com/science/article/pii/S0022247X0900016X},
doi = {https://doi.org/10.1016/j.jmaa.2008.12.065}
}
|
|||||
| Hoffman, K. and Padberg, M. | Set covering, packing and partitioning problemsSet Covering, Packing and Partitioning Problems | 2009 | Encyclopedia of Optimization, pp. 3482–3486 | inbook | DOI URL |
| Abstract: Keywords | |||||
BibTeX:
@inbook{Hoffman2009,
author = {Hoffman, Karla and Padberg, Manfred},
title = {Set covering, packing and partitioning problemsSet Covering, Packing and Partitioning Problems},
booktitle = {Encyclopedia of Optimization},
publisher = {Springer US},
year = {2009},
pages = {3482–3486},
url = {https://doi.org/10.1007/978-0-387-74759-0_599},
doi = {https://doi.org/10.1007/978-0-387-74759-0_599}
}
|
|||||
| Shorack, G.R. and Wellner, J.A. | Empirical Processes with Applications to Statistics [BibTeX] |
2009 | , pp. 991 | book | DOI URL |
BibTeX:
@book{Shorack2009,
author = {Shorack, Galen R. and Wellner, Jon A.},
title = {Empirical Processes with Applications to Statistics},
publisher = {Society for Industrial and Applied Mathematics},
year = {2009},
pages = {991},
note = {doi:10.1137/1.9780898719017},
url = {https://doi.org/10.1137/1.9780898719017},
doi = {https://doi.org/10.1137/1.9780898719017}
}
|
|||||
| Souai, N. and Teghem, J. | Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem | 2009 | European Journal of Operational Research Vol. 199(3), pp. 674–683 |
article | DOI URL |
| Abstract: Airline crew scheduling problem is a complex and difficult problem faced by all airline companies. To tackle this problem, it was often decomposed into two subproblems solved successively. First, the airline crew-pairing problem, which consists on finding a set of trips – called pairings – i.e. sequences of flights, starting and ending at a crew base, that cover all the flights planned for a given period of time. Secondly, the airline crew rostering problem, which consists on assigning the pairings found by solving the first subproblem, to the named airline crew members. For both problems, several rules and regulations must be respected and costs minimized. It is sure that this decomposition provides a convenient tool to handle the numerous and complex restrictions, but it lacks, however, of a global treatment of the problem. For this purpose, in this study we took the challenge of proposing a new way to solve both subproblems simultaneously. The proposed approach is based on a hybrid genetic algorithm. In fact, three heuristics are developed here to tackle the restriction rules within the GA’s process. | |||||
BibTeX:
@article{Souai2009,
author = {Souai, Nadia and Teghem, Jacques},
title = {Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem},
journal = {European Journal of Operational Research},
year = {2009},
volume = {199},
number = {3},
pages = {674–683},
url = {https://www.sciencedirect.com/science/article/pii/S0377221708003652},
doi = {https://doi.org/10.1016/j.ejor.2007.10.065}
}
|
|||||
| Goldreich, O. | Computational complexity : a conceptual perspective [BibTeX] |
2008 | , pp. xxiv, 606 p. | book | URL |
BibTeX:
@book{Goldreich2008,
author = {Goldreich, Oded},
title = {Computational complexity : a conceptual perspective},
publisher = {Cambridge University Press},
year = {2008},
pages = {xxiv, 606 p.},
note = {2008006750 GBA859156 Oded Goldreich. ill. ; 27 cm. Includes bibliographical references (p. 589-599) and index.},
url = {Contributor biographical information http://www.loc.gov/catdir/enhancements/fy0811/2008006750-b.html
|
|||||
| Lapp, M., AhmadBeygi, S., Cohn, A. and Tsimhoni, O. | A recursion-based approach to simulating airline schedule robustness [BibTeX] |
2008 | , pp. 2661–2667 | misc | |
BibTeX:
@misc{Lapp2008,
author = {Lapp, Marcial and AhmadBeygi, Shervin and Cohn, Amy and Tsimhoni, Omer},
title = {A recursion-based approach to simulating airline schedule robustness},
publisher = {Winter Simulation Conference},
year = {2008},
pages = {2661–2667}
}
|
|||||
| Nisan, N. | Algorithmic game theory [BibTeX] |
2007 | , pp. xxi, 754 p. | book | URL |
BibTeX:
@book{Nisan2007,
author = {Nisan, Noam},
title = {Algorithmic game theory},
publisher = {Cambridge University Press},
year = {2007},
pages = {xxi, 754 p.},
note = {2007014231 edited by Noam Nisan ... [et al.]. ill. ; 27 cm. Includes bibliographical references and index.},
url = {Table of contents only http://www.loc.gov/catdir/toc/ecip0715/2007014231.html
|
|||||
| Nisan, N. | Algorithmic game theory | 2007 | , pp. 1 online resource (xxi, 754 pages) | misc | |
| Abstract: In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application. | |||||
BibTeX:
@misc{Nisan2007a,
author = {Nisan, Noam},
title = {Algorithmic game theory},
publisher = {Cambridge University Press,},
year = {2007},
pages = {1 online resource (xxi, 754 pages)},
note = {edited by Noam Nisan [and others]. digital, PDF file(s). Includes bibliographical references and index. Title from publisher's bibliographic system (viewed on 05 Oct 2015). Basic solution concepts and computational issues / Éva Tardos, Vijay V. Vazirani -- The complexity of finding nash equilibria / Christos H. Papadimitriou -- Equilibrium computation for two-player games in strategic and extensive form / Bernhard von Stengel -- Learning, regret minimization, equilibria / Avrim Blum, Yishay Mansour -- Combinatorial algorithms for market equilibria / Vijay V. Vazirani -- Computation of market equilibria by convex programming / Bruno Codenotti, Kasturi Varadarajan -- Graphical games / Michael Kearns -- Cryptography and game theory / Yevgeniy Dodis, Tal Rabin -- Introduction to mechanism design (for computer scientists) / Noam Nisan -- Mechanism design without money / James Schummer, Rakesh V. Vohra -- Combinatorial auctions / Liad Blumrosen, Noam Nisan -- Computationally efficient approximation mechanisms / Ron Lavi -- Profit maximization in mechanism design / Jason D. Hartline, Anna R. Karlin -- Distributed algorithmic mechanism design / Joan Feigenbaum, Michael Schapira, Scott Shenker -- Cost sharing / Kamal Jain, Mohammad Mahdian -- Online mechanisms / David C. Parkes -- Introduction to the inefficiency of equilibria / Tim Roughgarden, Éva Tardos -- Routing games / Tim Roughgarden -- Network formation games and the potential function method / Éva Tardos, Tom Wexler -- Selfish load balancing / Berthold Vöcking -- The price of anarchy and the design of the scalable resource allocation mechanisms / Ramesh Johari -- Incentives and pricing in communications networks / Asuman Ozdaglar, R. Srikant -- Incentives in peer-to-peer systems / Moshe Babaioff, John Chuang, Michal Feldman -- Cascading behavior in networks: algorithmic and economic issues / Jon Kleinberg -- Incentives and information security / Ross Anderson [and others] -- Computational aspects of prediction markets / David M. Pennock, Rahul Sami -- Manipulation-resistant reputation systems / Eric Friedman, Paul Resnick, Rahul Sami -- Sponsored search auctions / Sébastien Lahaie [and others] -- Computational evolutionary game theory / Siddharth Suri.}
}
|
|||||
| Radunovic, B. and Boudec, J.Y.L. | A Unified Framework for Max-Min and Min-Max Fairness With Applications [BibTeX] |
2007 | IEEE/ACM Transactions on Networking Vol. 15(5), pp. 1073–1083 |
article | DOI |
BibTeX:
@article{Radunovic2007,
author = {Radunovic, B. and Boudec, J. Y. Le},
title = {A Unified Framework for Max-Min and Min-Max Fairness With Applications},
journal = {IEEE/ACM Transactions on Networking},
year = {2007},
volume = {15},
number = {5},
pages = {1073–1083},
doi = {https://doi.org/10.1109/TNET.2007.896231}
}
|
|||||
| Kleinberg, J. and Tardos, E. | Algorithm design [BibTeX] |
2006 | , pp. xxiii, 838 p. | book | URL |
BibTeX:
@book{Kleinberg2006,
author = {Kleinberg, Jon and Tardos, Éva},
title = {Algorithm design},
publisher = {Pearson/Addison-Wesley},
year = {2006},
pages = {xxiii, 838 p.},
note = {2005000401 Jon Kleinberg, Éva Tardos. ill. ; 24 cm. Includes bibliographical references (p. [805]-814) and index. Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever.},
url = {Table of contents http://www.loc.gov/catdir/toc/ecip056/2005000401.html}
}
|
|||||
| Shebalov, S. and Klabjan, D. | Robust Airline Crew Pairing: Move-up Crews | 2006 | Transportation Science Vol. 40(3), pp. 300–312 |
article | DOI URL |
| Abstract: Due to irregular operations, the crew cost at the end of a month is typically substantially higher than the crew cost projected in planning. We assume that the fleeting and the aircraft routing decisions have already been made. We present a model and a solution methodology that produces robust crew schedules in planning. Besides the objective of minimizing the crew cost, we introduce the objective of maximizing the number of move-up crews, i.e., the crews that can potentially be swapped in operations. To solve the resulting large-scale integer program, we use a combination of delayed column generation and Lagrangian relaxation. The restricted master problem is solved by means of Lagrangian relaxation and the ?duals? of the restricted master problem, which are used in delayed column generation, and correspond to the Lagrangian multipliers. We report computational experiments that demonstrate the benefits of using the robust crew schedule instead of the traditional one. We evaluate various crew schedules by generating random disruptions and then running a crew recovery module. We compare solutions with respect to the direct crew cost and indirect costs such as uncovered legs, reserved crews, and deadheading. The main conclusion is that robustness leads to reduced operational crew cost; however, in planning the trade-off between the inflated direct crew cost and robustness needs to be exploited judicially. | |||||
BibTeX:
@article{Shebalov2006,
author = {Shebalov, Sergey and Klabjan, Diego},
title = {Robust Airline Crew Pairing: Move-up Crews},
journal = {Transportation Science},
year = {2006},
volume = {40},
number = {3},
pages = {300–312},
url = {https://pubsonline.informs.org/doi/abs/10.1287/trsc.1050.0131},
doi = {https://doi.org/10.1287/trsc.1050.0131}
}
|
|||||
| Vanderbeck, F. and Savelsbergh, M.W.P. | A generic view of Dantzig–Wolfe decomposition in mixed integer programming | 2006 | Operations Research Letters Vol. 34(3), pp. 296–306 |
article | DOI URL |
| Abstract: The Dantzig–Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques. | |||||
BibTeX:
@article{Vanderbeck2006,
author = {Vanderbeck, François and Savelsbergh, Martin W. P.},
title = {A generic view of Dantzig–Wolfe decomposition in mixed integer programming},
journal = {Operations Research Letters},
year = {2006},
volume = {34},
number = {3},
pages = {296–306},
url = {http://www.sciencedirect.com/science/article/pii/S0167637705000659},
doi = {https://doi.org/10.1016/j.orl.2005.05.009}
}
|
|||||
| Gopalakrishnan, B. and Johnson, E.L. | Airline Crew Scheduling: State-of-the-Art | 2005 | Annals of Operations Research Vol. 140(1), pp. 305–337 |
article | DOI URL |
| Abstract: The airline industry is faced with some of the largest scheduling problems of any industry. The crew scheduling problem involves the optimal allocation of crews to flights. Over the last two decades the magnitude and complexity of crew scheduling problems have grown enormously and airlines are relying more on automated mathematical procedures as a practical necessity. In this paper we survey different approaches studied and discuss the state-of-the-art in solution methodology for the airline crew scheduling problem. We conclude with a discussion about promising areas for further work to make it possible to get very good solutions for the crew scheduling problem. | |||||
BibTeX:
@article{Gopalakrishnan2005,
author = {Gopalakrishnan, Balaji and Johnson, Ellis L.},
title = {Airline Crew Scheduling: State-of-the-Art},
journal = {Annals of Operations Research},
year = {2005},
volume = {140},
number = {1},
pages = {305–337},
url = {https://doi.org/10.1007/s10479-005-3975-3},
doi = {https://doi.org/10.1007/s10479-005-3975-3}
}
|
|||||
| Vanderbeck, F. | Implementing Mixed Integer Column Generation | 2005 | Column Generation, pp. 331–358 | inbook | DOI URL |
| Abstract: We review the main issues that arise when implementing a column generation approach to solve a mixed integer program: setting-up the Dantzig-Wolfe reformulation, adapting standard MIP techniques to the context of column generation (branching, preprocessing, primal heuristics), and dealing with issues specific to column generation (initialization, stabilization, column management strategies). The description of the different features is done in generic terms to emphasize their applicability across problems. More hand-on experiences are reported in the literature in application specific context, f.i., see Desaulniers et al. (2001) for vehicle routing and crew scheduling applications. This paper summarizes recent work in the field, in particular that of Vanderbeck (2002, 2003). | |||||
BibTeX:
@inbook{Vanderbeck2005,
author = {Vanderbeck, François},
title = {Implementing Mixed Integer Column Generation},
booktitle = {Column Generation},
publisher = {Springer US},
year = {2005},
pages = {331–358},
url = {https://doi.org/10.1007/0-387-25486-2_12},
doi = {https://doi.org/10.1007/0-387-25486-2_12}
}
|
|||||
| Boyd, S.P. and Vandenberghe, L. | Convex optimization [BibTeX] |
2004 | , pp. xiii, 716 p. | book | URL |
BibTeX:
@book{Boyd2004,
author = {Boyd, Stephen P. and Vandenberghe, Lieven},
title = {Convex optimization},
publisher = {Cambridge University Press},
year = {2004},
pages = {xiii, 716 p.},
note = {2003063284 Stephen Boyd, Lieven Vandenberghe. ill. ; 26 cm. Includes bibliographical references and index.},
url = {http://www.loc.gov/catdir/description/cam041/2003063284.html
|
|||||
| Ehrgott, M. and Gandibleux, X. | Approximative solution methods for multiobjective combinatorial optimization | 2004 | Top Vol. 12(1), pp. 1–63 |
article | DOI URL |
| Abstract: In this paper we present a review of approximative solution methods, that is, heuristics and metaheuristics designed for the solution of multiobjective combinatorial optimization problems (MOCO). First, we discuss questions related to approximation in this context, such as performance ratios, bounds, and quality measures. We give some examples of heuristics proposed for the solution of MOCO problems. The main part of the paper covers metaheuristics and more precisely non-evolutionary methods. The pioneering methods and their derivatives are described in a unified way. We provide an algorithmic presentation of each of the methods together with examples of applications, extensions, and a bibliographic note. Finally, we outline trends in this area. | |||||
BibTeX:
@article{Ehrgott2004,
author = {Ehrgott, Matthias and Gandibleux, Xavier},
title = {Approximative solution methods for multiobjective combinatorial optimization},
journal = {Top},
year = {2004},
volume = {12},
number = {1},
pages = {1–63},
url = {https://doi.org/10.1007/BF02578918},
doi = {https://doi.org/10.1007/BF02578918}
}
|
|||||
| Kellerer, H., Pferschy, U. and Pisinger, D. | Knapsack problems [BibTeX] |
2004 | , pp. xx, 546 p. | book | URL |
BibTeX:
@book{Kellerer2004,
author = {Kellerer, Hans and Pferschy, Ulrich and Pisinger, David},
title = {Knapsack problems},
publisher = {Springer},
year = {2004},
pages = {xx, 546 p.},
note = {Hans Kellerer, Ulrich Pferschy, David Pisinger. Includes bibliographical references and index.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy0817/2004299674-d.html
|
|||||
| Martin, G. | The Sharpest Cut [BibTeX] |
2004 | book | DOI URL | |
BibTeX:
@book{Martin2004,
author = {Martin, Grötschel},
title = {The Sharpest Cut},
publisher = {Society for Industrial and Applied Mathematics},
year = {2004},
note = {doi:10.1137/1.9780898718805},
url = {https://doi.org/10.1137/1.9780898718805},
doi = {https://doi.org/10.1137/1.9780898718805}
}
|
|||||
| Barnhart, C., Cohn, A.M., Johnson, E.L., Klabjan, D., Nemhauser, G.L. and Vance, P.H. | Airline Crew Scheduling [BibTeX] |
2003 | Handbook of Transportation Science, pp. 517–560 | inbook | DOI URL |
BibTeX:
@inbook{Barnhart2003,
author = {Barnhart, Cynthia and Cohn, Amy M. and Johnson, Ellis L. and Klabjan, Diego and Nemhauser, George L. and Vance, Pamela H.},
title = {Airline Crew Scheduling},
booktitle = {Handbook of Transportation Science},
publisher = {Springer US},
year = {2003},
pages = {517–560},
url = {https://doi.org/10.1007/0-306-48058-1_14},
doi = {https://doi.org/10.1007/0-306-48058-1_14}
}
|
|||||
| Bellman, R. | Dynamic programming [BibTeX] |
2003 | , pp. xxv, 340 p. | book | URL |
BibTeX:
@book{Bellman2003,
author = {Bellman, Richard},
title = {Dynamic programming},
publisher = {Dover Publications},
year = {2003},
pages = {xxv, 340 p.},
edition = {Dover},
note = {2002072879 Richard Bellman. ill. ; 22 cm. Originally published: Princeton, N.J. : Princeton University Press, 1957. Includes bibliographical references and indexes.},
url = {Publisher description http://www.loc.gov/catdir/description/dover032/2002072879.html
|
|||||
| Louveaux, F.V. and Schultz, R. | Stochastic Integer Programming | 2003 | Vol. 10Handbooks in Operations Research and Management Science, pp. 213–266 |
inbook | DOI URL |
| Abstract: When introducing integer variables into traditional linear stochastic programs structural properties and algorithmic approaches have to be rethought from the very beginning. Employing basics from parametric integer programming and probability theory we analyze the structure of stochastic integer programs. In the algorithmic part of the paper we review solution techniques from integer programming and discuss their impact on the specialized structures met in stochastic programming. | |||||
BibTeX:
@inbook{Louveaux2003,
author = {Louveaux, François V. and Schultz, Rüdiger},
title = {Stochastic Integer Programming},
booktitle = {Handbooks in Operations Research and Management Science},
publisher = {Elsevier},
year = {2003},
volume = {10},
pages = {213–266},
url = {https://www.sciencedirect.com/science/article/pii/S0927050703100047},
doi = {https://doi.org/10.1016/S0927-0507(03)10004-7}
}
|
|||||
| Saad, Y. | Iterative Methods for Sparse Linear Systems [BibTeX] |
2003 | , pp. 537 | book | DOI URL |
BibTeX:
@book{Saad2003,
author = {Saad, Yousef},
title = {Iterative Methods for Sparse Linear Systems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2003},
pages = {537},
note = {doi:10.1137/1.9780898718003},
url = {https://doi.org/10.1137/1.9780898718003},
doi = {https://doi.org/10.1137/1.9780898718003}
}
|
|||||
| Schrijver, A. | Combinatorial optimization : polyhedra and efficiency [BibTeX] |
2003 | book | URL | |
BibTeX:
@book{Schrijver2003,
author = {Schrijver, A.},
title = {Combinatorial optimization : polyhedra and efficiency},
publisher = {Springer},
year = {2003},
note = {2002036693 Alexander Schrijver. ill. ; 24 cm. Includes bibliographical references (p. [1463]-1766) and indexes. v. A. Paths, flows, matchings -- v. B. Matroids, trees, stable sets -- v. C. Disjoint paths, hypergraphs.},
url = {Contributor biographical information http://www.loc.gov/catdir/enhancements/fy0813/2002036693-b.html
|
|||||
| Jansen, K., Leonardi, S. and Vazirani, V.V. | Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings [BibTeX] |
2002 | , pp. viii, 269 p. | book | URL |
BibTeX:
@book{Jansen2002,
author = {Jansen, Klaus and Leonardi, S. and Vazirani, Vijay V.},
title = {Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings},
publisher = {Springer},
year = {2002},
pages = {viii, 269 p.},
note = {2002030517 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (5th : 2002 : Rome, Italy) Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.). ill. ; 24 cm. Includes bibliographical references and index.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy0817/2002030517-d.html}
}
|
|||||
| Kleywegt, A.J., Shapiro, A. and Homem-de-Mello, T. | The Sample Average Approximation Method for Stochastic Discrete Optimization [BibTeX] |
2002 | SIAM Journal on Optimization Vol. 12(2), pp. 479–502 |
article | DOI URL |
BibTeX:
@article{Kleywegt2002,
author = {Kleywegt, Anton J. and Shapiro, Alexander and Homem-de-Mello, Tito},
title = {The Sample Average Approximation Method for Stochastic Discrete Optimization},
journal = {SIAM Journal on Optimization},
year = {2002},
volume = {12},
number = {2},
pages = {479–502},
url = {https://doi.org/10.1137/S1052623499363220},
doi = {https://doi.org/10.1137/S1052623499363220}
}
|
|||||
| Brillinger, D.R. | Time Series [BibTeX] |
2001 | , pp. 556 | book | DOI URL |
BibTeX:
@book{Brillinger2001,
author = {Brillinger, David R.},
title = {Time Series},
publisher = {Society for Industrial and Applied Mathematics},
year = {2001},
pages = {556},
note = {doi:10.1137/1.9780898719246},
url = {https://doi.org/10.1137/1.9780898719246},
doi = {https://doi.org/10.1137/1.9780898719246}
}
|
|||||
| Hutchison, D.W. and Hill, S.D. | Airline and airport applications: simulation optimization of airline delay with constraints [BibTeX] |
2001 | , pp. 1017–1022 | misc | |
BibTeX:
@misc{Hutchison2001,
author = {Hutchison, David W. and Hill, Stacy D.},
title = {Airline and airport applications: simulation optimization of airline delay with constraints},
publisher = {IEEE Computer Society},
year = {2001},
pages = {1017–1022}
}
|
|||||
| Jaffard, S., Meyer, Y. and Ryan, R.D. | Wavelets [BibTeX] |
2001 | , pp. 257 | book | DOI URL |
BibTeX:
@book{Jaffard2001,
author = {Jaffard, Stéphane and Meyer, Yves and Ryan, Robert D.},
title = {Wavelets},
publisher = {Society for Industrial and Applied Mathematics},
year = {2001},
pages = {257},
note = {doi:10.1137/1.9780898718119},
url = {https://doi.org/10.1137/1.9780898718119},
doi = {https://doi.org/10.1137/1.9780898718119}
}
|
|||||
| Renegar, J. | A Mathematical View of Interior-Point Methods in Convex Optimization [BibTeX] |
2001 | , pp. 122 | book | DOI URL |
BibTeX:
@book{Renegar2001,
author = {Renegar, James},
title = {A Mathematical View of Interior-Point Methods in Convex Optimization},
publisher = {Society for Industrial and Applied Mathematics},
year = {2001},
pages = {122},
note = {doi:10.1137/1.9780898718812},
url = {https://doi.org/10.1137/1.9780898718812},
doi = {https://doi.org/10.1137/1.9780898718812}
}
|
|||||
| Vazirani, V.V. | Approximation algorithms [BibTeX] |
2001 | , pp. xix, 378 p. | book | URL |
BibTeX:
@book{Vazirani2001,
author = {Vazirani, Vijay V.},
title = {Approximation algorithms},
publisher = {Springer},
year = {2001},
pages = {xix, 378 p.},
note = {2001042005 Vijay V. Vazirani. ill. ; 25 cm. Includes bibliographical references (p. [355]-370) and index.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy0816/2001042005-d.html
|
|||||
| Ageeva, Y. | Approaches to incorporating robustness into airline scheduling [BibTeX] |
2000 | phdthesis | ||
BibTeX:
@phdthesis{Ageeva2000,
author = {Ageeva, Yana},
title = {Approaches to incorporating robustness into airline scheduling},
year = {2000}
}
|
|||||
| Vanderbeck, F. | On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm | 2000 | Operations Research Vol. 48(1), pp. 111–128 |
article | DOI URL |
| Abstract: Dantzig-Wolfe decomposition as applied to an integer program is a specific form of problem reformulation that aims at providing a tighter linear programming relaxation bound. The reformulation gives rise to an integer master problem, whose typically large number of variables is dealt with implicitly by using an integer programming column generation procedure, also known as branch-and-price algorithm. There is a large class of integer programs that are well suited for this solution technique. In this paper, we propose to base the Dantzig-Wolfe decomposition of an integer program on the discretization of the integer polyhedron associated with a subsystem of constraints (as opposed to its convexification). This allows us to formulate the integrality restriction directly on the master variables and sets a theoretical framework for dealing with specific issues such as branching or the introduction of cutting planes in the master. We discuss specific branching schemes and their effect on the structure of the column generation subproblem. We give theoretical bounds on the complexity of the separation process and the extent of the modifications to the column generation subproblem. Our computational tests on the cutting stock problem and a generalisation—the cutting strip problem—show that, in practice, all fractional solutions can be eliminated using branching rules that preserve the tractability of the subproblem, but there is a trade-off between branching efficiency and subproblem tractability. | |||||
BibTeX:
@article{Vanderbeck2000,
author = {Vanderbeck, François},
title = {On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm},
journal = {Operations Research},
year = {2000},
volume = {48},
number = {1},
pages = {111–128},
url = {https://pubsonline.informs.org/doi/abs/10.1287/opre.48.1.111.12453},
doi = {https://doi.org/10.1287/opre.48.1.111.12453}
}
|
|||||
| Yunes, T.H., Moura, A.V. and Souza, C.C.d. | Solving very large crew scheduling problems to optimality [BibTeX] |
2000 | , pp. 446–451 | book | DOI URL |
BibTeX:
@book{Yunes2000,
author = {Yunes, Tallys H. and Moura, Arnaldo V. and Souza, Cid C. de},
title = {Solving very large crew scheduling problems to optimality},
publisher = {Association for Computing Machinery},
year = {2000},
pages = {446–451},
url = {https://doi.org/10.1145/335603.335901},
doi = {https://doi.org/10.1145/335603.335901}
}
|
|||||
| Zakeri, G., Philpott, A.B. and Ryan, D.M. | Inexact Cuts in Benders Decomposition [BibTeX] |
2000 | SIAM Journal on Optimization Vol. 10(3), pp. 643–657 |
article | DOI URL |
BibTeX:
@article{Zakeri2000,
author = {Zakeri, Golbon and Philpott, Andrew B. and Ryan, David M.},
title = {Inexact Cuts in Benders Decomposition},
journal = {SIAM Journal on Optimization},
year = {2000},
volume = {10},
number = {3},
pages = {643–657},
note = {doi: 10.1137/S1052623497318700},
url = {https://doi.org/10.1137/S1052623497318700},
doi = {https://doi.org/10.1137/S1052623497318700}
}
|
|||||
| Anderson, E., Bai, Z., Bischof, C., Blackford, L.S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A. and Sorensen, D. | LAPACK Users' Guide [BibTeX] |
1999 | , pp. 424 | book | DOI URL |
BibTeX:
@book{Anderson1999,
author = {Anderson, E. and Bai, Z. and Bischof, C. and Blackford, L. S. and Demmel, J. and Dongarra, J. and Du Croz, J. and Greenbaum, A. and Hammarling, S. and McKenney, A. and Sorensen, D.},
title = {LAPACK Users' Guide},
publisher = {Society for Industrial and Applied Mathematics},
year = {1999},
pages = {424},
note = {doi:10.1137/1.9780898719604},
url = {https://doi.org/10.1137/1.9780898719604},
doi = {https://doi.org/10.1137/1.9780898719604}
}
|
|||||
| Ausiello, G. | Complexity and approximation : combinatorial optimization problems and their approximability properties [BibTeX] |
1999 | , pp. xix, 524 p. | book | URL |
BibTeX:
@book{Ausiello1999,
author = {Ausiello, G.},
title = {Complexity and approximation : combinatorial optimization problems and their approximability properties},
publisher = {Springer},
year = {1999},
pages = {xix, 524 p.},
note = {99040936 G. Ausiello ... [et al.]. ill. ; 25 cm. Includes bibliographical references and index.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy0816/99040936-d.html}
}
|
|||||
| Kreher, D.L. and Stinson, D.R. | Combinatorial algorithms : generation, enumeration, and search [BibTeX] |
1999 | , pp. 329 p. | book | URL |
BibTeX:
@book{Kreher1999,
author = {Kreher, Donald L. and Stinson, Douglas R.},
title = {Combinatorial algorithms : generation, enumeration, and search},
publisher = {CRC Press},
year = {1999},
pages = {329 p.},
note = {98041243 Donald L. Kreher, Douglas R. Stinson. ill. ; 25 cm. Includes bibliographical references (p. 311-317) and indexes.},
url = {Publisher description http://www.loc.gov/catdir/enhancements/fy0742/98041243-d.html}
}
|
|||||
| Sen, S. and Higle, J.L. | An Introductory Tutorial on Stochastic Linear Programming Models | 1999 | INFORMS Journal on Applied Analytics Vol. 29(2), pp. 33–61 |
article | DOI URL |
| Abstract: Linear programming is a fundamental planning tool. It is often difficult to precisely estimate or forecast certain critical data elements of the linear program. In such cases, it is necessary to address the impact of uncertainty during the planning process. We discuss a variety of LP-based models that can be used for planning under uncertainty. In all cases, we begin with a deterministic LP model and show how it can be adapted to include the impact of uncertainty. We present models that range from simple recourse policies to more general two-stage and multistage SLP formulations. We also include a discussion of probabilistic constraints. We illustrate the various models using examples taken from the literature. The examples involve models developed for airline yield management, telecommunications, flood control, and production planning. | |||||
BibTeX:
@article{Sen1999,
author = {Sen, Suvrajeet and Higle, Julia L.},
title = {An Introductory Tutorial on Stochastic Linear Programming Models},
journal = {INFORMS Journal on Applied Analytics},
year = {1999},
volume = {29},
number = {2},
pages = {33–61},
note = {doi: 10.1287/inte.29.2.33},
url = {https://pubsonline.informs.org/doi/abs/10.1287/inte.29.2.33},
doi = {https://doi.org/10.1287/inte.29.2.33}
}
|
|||||
| Anbil, R., Forrest, J. and Pulleyblank, W. | Column generation and the airline crew pairing problem [BibTeX] |
1998 | Documenta Mathematica, pp. 677–686 | article | |
BibTeX:
@article{Anbil1998,
author = {Anbil, R. and Forrest, J. and Pulleyblank, W.},
title = {Column generation and the airline crew pairing problem},
journal = {Documenta Mathematica},
year = {1998},
pages = {677–686}
}
|
|||||
| Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P. and Vance, P.H. | Branch-and-Price: Column Generation for Solving Huge Integer Programs | 1998 | Operations Research Vol. 46(3), pp. 316–329 |
article | DOI URL |
| Abstract: We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. We then discuss computational issues and implementation of column generation, branch-and-bound algorithms, including special branching rules and efficient ways to solve the LP relaxation. We also discuss the relationship with Lagrangian duality. | |||||
BibTeX:
@article{Barnhart1998,
author = {Barnhart, Cynthia and Johnson, Ellis L. and Nemhauser, George L. and Savelsbergh, Martin W. P. and Vance, Pamela H.},
title = {Branch-and-Price: Column Generation for Solving Huge Integer Programs},
journal = {Operations Research},
year = {1998},
volume = {46},
number = {3},
pages = {316–329},
url = {https://pubsonline.informs.org/doi/abs/10.1287/opre.46.3.316},
doi = {https://doi.org/10.1287/opre.46.3.316}
}
|
|||||
| Papadimitriou, C.H. and Steiglitz, K. | Combinatorial optimization : algorithms and complexity [BibTeX] |
1998 | , pp. xvi, 496 p. | book | URL |
BibTeX:
@book{Papadimitriou1998,
author = {Papadimitriou, Christos H. and Steiglitz, Kenneth},
title = {Combinatorial optimization : algorithms and complexity},
publisher = {Dover Publications},
year = {1998},
pages = {xvi, 496 p.},
note = {98021476 Christos H. Papadimitriou, Kenneth Steiglitz. ill. ; 22 cm. Originally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref. Includes bibliographical references and index.},
url = {Publisher description http://www.loc.gov/catdir/description/dover032/98021476.html}
}
|
|||||
| Vemuganti, R.R. | Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey | 1998 | Handbook of Combinatorial Optimization: Volume1–3, pp. 573–746 | inbook | DOI URL |
| Abstract: Set covering, set packing and set partitioning models are a special class of linear integer programs. These models and their variants have been used to formulate a variety of practical problems in such areas as capital budgeting, crew scheduling, cutting stock, facilities location, graphs and networks, manufacturing, personnel scheduling, vehicle routing and timetable scheduling among others. Based on the special structure of these models, efficient computational techniques have been developed to solve large size problems making it possible to solve many real world applications. This paper is a survey of the applications of the set covering, set packing, set partitioning models and their variants, including generalizations. | |||||
BibTeX:
@inbook{Vemuganti1998,
author = {Vemuganti, R. R.},
title = {Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey},
booktitle = {Handbook of Combinatorial Optimization: Volume1–3},
publisher = {Springer US},
year = {1998},
pages = {573–746},
url = {https://doi.org/10.1007/978-1-4613-0303-9_9},
doi = {https://doi.org/10.1007/978-1-4613-0303-9_9}
}
|
|||||
| Augustsson, L. | Partial evaluation in aircraft crew planning [BibTeX] |
1997 | , pp. 127–136 | misc | DOI URL |
BibTeX:
@misc{Augustsson1997,
author = {Augustsson, Lennart},
title = {Partial evaluation in aircraft crew planning},
publisher = {Association for Computing Machinery},
year = {1997},
pages = {127–136},
url = {https://doi.org/10.1145/258993.259012},
doi = {https://doi.org/10.1145/258993.259012}
}
|
|||||
| Demmel, J.W. | Applied Numerical Linear Algebra [BibTeX] |
1997 | , pp. 427 | book | DOI URL |
BibTeX:
@book{Demmel1997,
author = {Demmel, James W.},
title = {Applied Numerical Linear Algebra},
publisher = {Society for Industrial and Applied Mathematics},
year = {1997},
pages = {427},
note = {doi:10.1137/1.9781611971446},
url = {https://doi.org/10.1137/1.9781611971446},
doi = {https://doi.org/10.1137/1.9781611971446}
}
|
|||||
| Levine, D. | Application of a hybrid genetic algorithm to airline crew scheduling | 1996 | Computers & Operations Research Vol. 23(6), pp. 547–558 |
article | DOI URL |
| Abstract: This paper discusses the development and application of a hybrid genetic algorithm to airline crew scheduling problems. The hybrid algorithm consists of a steady-state genetic algorithm and a local search heuristic. The hybrid algorithm was tested on a set of 40 real-world problems. It found the optimal solution for half the problems, and good solutions for 9 others. The results were compared to those obtained with branch-and-cut and branch-and-bound algorithms. The branch-and-cut algorithm was significantly more successful than the hybrid algorithm, and the branch-and-bound algorithm slightly better. | |||||
BibTeX:
@article{Levine1996,
author = {Levine, David},
title = {Application of a hybrid genetic algorithm to airline crew scheduling},
journal = {Computers & Operations Research},
year = {1996},
volume = {23},
number = {6},
pages = {547–558},
url = {https://www.sciencedirect.com/science/article/pii/0305054895000607},
doi = {https://doi.org/10.1016/0305-0548(95)00060-7}
}
|
|||||
| Schneider, J. and Wise, T.H. | 15. Airline Crew Scheduling: Supercomputers and Algorithms [BibTeX] |
1996 | Applications on Advanced Architecture Computers, pp. 165–176 | inbook | DOI URL |
BibTeX:
@inbook{Schneider1996,
author = {Schneider, Jeremey and Wise, Theresa Hull},
title = {15. Airline Crew Scheduling: Supercomputers and Algorithms},
booktitle = {Applications on Advanced Architecture Computers},
publisher = {Society for Industrial and Applied Mathematics},
year = {1996},
pages = {165–176},
note = {doi:10.1137/1.9780898719659.ch15},
url = {https://doi.org/10.1137/1.9780898719659.ch15},
doi = {https://doi.org/10.1137/1.9780898719659.ch1510.1137/1.9780898719659.ch15}
}
|
|||||
| Motwani, R. and Raghavan, P. | Randomized algorithms [BibTeX] |
1995 | , pp. xiv, 476 p. | book | URL |
BibTeX:
@book{Motwani1995,
author = {Motwani, Rajeev and Raghavan, Prabhakar},
title = {Randomized algorithms},
publisher = {Cambridge University Press},
year = {1995},
pages = {xiv, 476 p.},
note = {94044271 Rajeev Motwani, Prabhakar Raghavan. ill. ; 26 cm. Includes bibliographical references (p. 447-466) and index.},
url = {Table of contents http://www.loc.gov/catdir/toc/cam023/94044271.html
|
|||||
| Mangasarian, O.L. | Nonlinear Programming [BibTeX] |
1994 | , pp. 236 | book | DOI URL |
BibTeX:
@book{Mangasarian1994,
author = {Mangasarian, Olvi L.},
title = {Nonlinear Programming},
publisher = {Society for Industrial and Applied Mathematics},
year = {1994},
pages = {236},
note = {doi:10.1137/1.9781611971255},
url = {https://doi.org/10.1137/1.9781611971255},
doi = {https://doi.org/10.1137/1.9781611971255}
}
|
|||||
| Lovász, L. and Plummer, M.D. | Matching theory [BibTeX] |
1986 | , pp. xxxiii, 544 p. | book | |
BibTeX:
@book{Lovasz1986,
author = {Lovász, László and Plummer, M. D.},
title = {Matching theory},
publisher = {North-Holland : Elsevier Science Publishers B.V. ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.},
year = {1986},
pages = {xxxiii, 544 p.},
note = {87117473 by L. Lovász and M.D. Plummer. ill. ; 24 cm. Bibliography: p. [483]-526. Includes indexes.}
}
|
|||||
| Schrijver, A. | Theory of linear and integer programming [BibTeX] |
1986 | , pp. xi, 471 p. | book | |
BibTeX:
@book{Schrijver1986,
author = {Schrijver, Alexander},
title = {Theory of linear and integer programming},
publisher = {Wiley},
year = {1986},
pages = {xi, 471 p.},
note = {85012314 Alexander Schrijver. ill. ; 25 cm. Series statement from p. [1] of cover; old series title appears on series t.p.: Wiley-Interscience series in discrete mathematics. "A Wiley-Interscience publication." Bibliography: p. 381-450. Includes indexes.}
}
|
|||||
| Balas, E. and Ho, A. | Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study | 1980 | Combinatorial Optimization, pp. 37–60 | inbook | DOI URL |
| Abstract: We report on the implementation and computational testing of several versions of a set covering algorithm, based on the family of cutting planes from conditional bounds discussed in the companion paper [2]. The algorithm uses a set of heuristics to find prime covers, another set of heuristics to find feasible solutions to the dual linear program which are needed to generate cuts, and subgradient optimization to find lower bounds. It also uses implicit enumeration with some new branching rules. Each of the ingredients was implemented and tested in several versions. The variant of the algorithm that emerged as best was run on 55 randomly generated test problems (20 of them from the literature), with up to 200 constraints and 2000 variables. The results show the algorithm to be more reliable and efficient than earlier procedures on large, sparse set covering problems. | |||||
BibTeX:
@inbook{Balas1980,
author = {Balas, Egon and Ho, Andrew},
title = {Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study},
booktitle = {Combinatorial Optimization},
publisher = {Springer Berlin Heidelberg},
year = {1980},
pages = {37–60},
url = {https://doi.org/10.1007/BFb0120886},
doi = {https://doi.org/10.1007/BFb0120886}
}
|
|||||
| Balas, E. and Padberg, M.W. | Set Partitioning: A survey [BibTeX] |
1976 | SIAM Review Vol. 18(4), pp. 710–760 |
article | DOI URL |
BibTeX:
@article{Balas1976,
author = {Balas, Egon and Padberg, Manfred W.},
title = {Set Partitioning: A survey},
journal = {SIAM Review},
year = {1976},
volume = {18},
number = {4},
pages = {710–760},
url = {https://epubs.siam.org/doi/abs/10.1137/1018115},
doi = {https://doi.org/10.1137/1018115}
}
|
|||||
| Balas, E. and Padberg, M. | On the Set-Covering Problem: II. An Algorithm for Set Partitioning | 1975 | Operations Research Vol. 23(1), pp. 74–90 |
article | DOI URL |
| Abstract: In an earlier paper [Opns. Res. 20 1153–1161 (1972)] we proved that any feasible integer solution to the linear program associated with the equality-constrained set-covering problem can be obtained from any other feasible integer solution by a sequence of less than m pivots (where m is the number of equations), such that each solution generated in the sequence is integer. However, degeneracy makes it difficult to find a sequence of pivots leading to an integer optimum. In this paper we give a constructive characterization of adjacency relations between integer vertices of the feasible set that enables us to generate edges (all, if necessary) connecting a given integer vertex to adjacent integer vertices. This helps overcome the difficulties caused by degeneracy and leads to a class of algorithms, of which we discuss two. | |||||
BibTeX:
@article{Balas1975,
author = {Balas, Egon and Padberg, Manfred},
title = {On the Set-Covering Problem: II. An Algorithm for Set Partitioning},
journal = {Operations Research},
year = {1975},
volume = {23},
number = {1},
pages = {74–90},
url = {https://pubsonline.informs.org/doi/abs/10.1287/opre.23.1.74},
doi = {https://doi.org/10.1287/opre.23.1.74}
}
|
|||||
| Breu, R. and Burdet, C.-A. | Branch and bound experiments in zero-one programming | 1974 | Approaches to Integer Programming, pp. 1–50 | inbook | DOI URL |
| Abstract: This paper investigates, both from a theoretical and practical point of view, the ability of a general branch and bound approach to solve pure zero-one programming problems. Large scale experiments show that our algorithm is able to compete successfully with special purpose implicit enumeration codes. | |||||
BibTeX:
@inbook{Breu1974,
author = {Breu, Raymond and Burdet, Claude-Alain},
title = {Branch and bound experiments in zero-one programming},
booktitle = {Approaches to Integer Programming},
publisher = {Springer Berlin Heidelberg},
year = {1974},
pages = {1–50},
url = {https://doi.org/10.1007/BFb0120687},
doi = {https://doi.org/10.1007/BFb0120687}
}
|
|||||
| Geoffrion, A.M. | Lagrangean relaxation for integer programming | 1974 | Approaches to Integer Programming, pp. 82–114 | inbook | DOI URL |
| Abstract: Taking a set of “complicating” constraints of a general mixed integer program up into the objective function in a Lagrangean fashion (with fixed multipliers) yields a “Lagrangean relaxation” of the original program. This paper gives a systematic development of this simple bounding construct as a means of exploiting special problem structure. A general theory is developed and special emphasis is given to the application of Lagrangean relaxation in the context of LP-based branch-and-bound. | |||||
BibTeX:
@inbook{Geoffrion1974,
author = {Geoffrion, A. M.},
title = {Lagrangean relaxation for integer programming},
booktitle = {Approaches to Integer Programming},
publisher = {Springer Berlin Heidelberg},
year = {1974},
pages = {82–114},
url = {https://doi.org/10.1007/BFb0120690},
doi = {https://doi.org/10.1007/BFb0120690}
}
|
|||||
| Garfinkel, R.S. and Nemhauser, G.L. | The Set-Partitioning Problem: Set Covering with Equality Constraints | 1969 | Operations Research Vol. 17(5), pp. 848–856 |
article | DOI URL |
| Abstract: This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly generated problems. The fact that many problems can be solved more rapidly than the corresponding linear programs demonstrates the efficiency of the algorithm; for example, a randomly generated problem with 1,400 variables and 100 constraints was solved in 15 minutes. | |||||
BibTeX:
@article{Garfinkel1969,
author = {Garfinkel, R. S. and Nemhauser, G. L.},
title = {The Set-Partitioning Problem: Set Covering with Equality Constraints},
journal = {Operations Research},
year = {1969},
volume = {17},
number = {5},
pages = {848–856},
url = {https://pubsonline.informs.org/doi/abs/10.1287/opre.17.5.848},
doi = {https://doi.org/10.1287/opre.17.5.848}
}
|
|||||
| Bellman, R. and Dreyfus, S.E. | Applied dynamic programming [BibTeX] |
1962 | , pp. 363 p. | book | |
BibTeX:
@book{Bellman1962,
author = {Bellman, Richard and Dreyfus, Stuart E.},
title = {Applied dynamic programming},
publisher = {Princeton University Press},
year = {1962},
pages = {363 p.},
note = {61014262 by Richard E. Bellman and Stuart E. Dreyfus. illus. 25 cm. Includes bibliography.}
}
|
|||||
| Agustín, A., Gruler, A., de Armas, J. and Juan, A.A. | Optimizing Airline Crew Scheduling Using Biased Randomization: A Case Study | Advances in Artificial Intelligence, pp. 331–340 | inproceedings | ||
| Abstract: Various complex decision making problems are related to airline planning. In the competitive airline industry, efficient crew scheduling is hereby of major practical importance. This paper presents a metaheuristic approach based on biased randomization to tackle the challenging Crew Pairing Problem (CPP). The objective of the CPP is the establishment of flight pairings allowing for cost minimizing crew-flight assignments. Experiments are done using a real-life case with different constraints. The results show that our easy-to-use and fast algorithm reduces overall crew flying times and the necessary number of accompanying crews compared to the pairings currently applied by the company. | |||||
BibTeX:
@inproceedings{Agustin,
author = {Agustín, Alba and Gruler, Aljoscha and de Armas, Jesica and Juan, Angel A.},
title = {Optimizing Airline Crew Scheduling Using Biased Randomization: A Case Study},
booktitle = {Advances in Artificial Intelligence},
publisher = {Springer International Publishing},
pages = {331–340}
}
|
|||||
| Arrigo, A., Kazempour, J., Grève, Z.D., Toubeau, J.F. and Vallée, F. | Enhanced Wasserstein Distributionally Robust OPF With Dependence Structure and Support Information [BibTeX] |
2021 IEEE Madrid PowerTech, pp. 1–6 | inproceedings | DOI | |
BibTeX:
@inproceedings{Arrigo,
author = {Arrigo, A. and Kazempour, J. and Grève, Z. De and Toubeau, J. F. and Vallée, F.},
title = {Enhanced Wasserstein Distributionally Robust OPF With Dependence Structure and Support Information},
booktitle = {2021 IEEE Madrid PowerTech},
pages = {1–6},
doi = {https://doi.org/10.1109/PowerTech46648.2021.9494771}
}
|
|||||
| Bansal, N. and Pruhs, K. | The Geometry of Scheduling [BibTeX] |
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 407–414 | inproceedings | DOI | |
BibTeX:
@inproceedings{Bansal,
author = {Bansal, N. and Pruhs, K.},
title = {The Geometry of Scheduling},
booktitle = {2010 IEEE 51st Annual Symposium on Foundations of Computer Science},
pages = {407–414},
doi = {https://doi.org/10.1109/FOCS.2010.46}
}
|
|||||
| Barnhart, C. | Airline Scheduling: Accomplishments, Opportunities and Challenges | Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 1–1 | inproceedings | ||
| Abstract: Airline scheduling is characterized by numerous complexities, including a network of flights, different aircraft types, limited numbers of gates, air traffic control restrictions, environmental regulations, strict safety requirements, a myriad of crew work rules and complicated payment structures, and competitive, dynamic environments in which passenger demands are uncertain and pricing strategies are complex. This, layered with the airline industry’s endemic issues of low profitability, contentious labor issues, and outdated and inadequate infrastructure, poses daunting challenges that have intrigued operations researchers for at least a half-century, and have provided a fertile ground for the development and application of models and algorithms. In this talk, we first briefly summarize the optimization-based accomplishments in this area, highlighting the significant successes and impacts. While impressive, the problem is far from solved today. The focus of this talk, then, is on the many remaining opportunities and challenges, namely: | |||||
BibTeX:
@inproceedings{Barnhart,
author = {Barnhart, Cynthia},
title = {Airline Scheduling: Accomplishments, Opportunities and Challenges},
booktitle = {Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems},
publisher = {Springer Berlin Heidelberg},
pages = {1–1}
}
|
|||||
| Bernstein, A., Bienstock, D., Hay, D., Uzunoglu, M. and Zussman, G. | Power grid vulnerability to geographically correlated failures — Analysis and control implications [BibTeX] |
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, pp. 2634–2642 | inproceedings | DOI | |
BibTeX:
@inproceedings{Bernstein,
author = {Bernstein, A. and Bienstock, D. and Hay, D. and Uzunoglu, M. and Zussman, G.},
title = {Power grid vulnerability to geographically correlated failures — Analysis and control implications},
booktitle = {IEEE INFOCOM 2014 - IEEE Conference on Computer Communications},
pages = {2634–2642},
doi = {https://doi.org/10.1109/INFOCOM.2014.6848211}
}
|
|||||
| Carrizosa, E., Molero-Rıo, C. and Morales, D.R. | Mathematical optimization in classification and regression trees [BibTeX] |
article | |||
BibTeX:
@article{Carrizosa,
author = {Carrizosa, Emilio and Molero-Rıo, Cristina and Morales, Dolores Romero},
title = {Mathematical optimization in classification and regression trees}
}
|
|||||
| Castro, A.J.M. and Rocha, A.P. | Managing Disruptions with a Multi-Agent System for Airline Operations Control | Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection, pp. 307–310 | inproceedings | ||
| Abstract: Airline companies face a difficult task in controlling their daily operations, in particular managing irregular operations that result from unexpected disruptions affecting scheduled plans. This demo presents MASDIMA, a Multi-Agent System that manages disruptions in airline operational plans producing intelligent solutions, in the sense that its outcomes are the result of autonomous and collaborative decision making. MASDIMA is able to learn both implicitly, from interactions that happen between their internal agents, and explicitly, from interaction with users. | |||||
BibTeX:
@inproceedings{Castro,
author = {Castro, António J. M. and Rocha, Ana Paula},
title = {Managing Disruptions with a Multi-Agent System for Airline Operations Control},
booktitle = {Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection},
publisher = {Springer International Publishing},
pages = {307–310}
}
|
|||||
| Castro, A.n.J.M.a., Rocha, A.P.a. and Oliveira, E.n.a. | A new approach for disruption management in airline operations control [BibTeX] |
book | URL | ||
BibTeX:
@book{Castroa,
author = {Castro, Anto nio J. M. author and Rocha, Ana Paula author and Oliveira, Euge nio author},
title = {A new approach for disruption management in airline operations control},
note = {GBB483291 bnb Anto0302nio J.M. Castro, Ana Paula Rocha, Eugénio Oliveira. Studies in computational intelligence, 1860-949X ; volume 562 Includes bibliographical references. Also published electronically.},
url = {1850-9999 http://www.springer.com/gb/ BLDSS}
}
|
|||||
| Dück, V., Kliewer, N. and Suhl, L. | Stability of Airline Schedules | Operations Research Proceedings 2008, pp. 265–270 | inproceedings | ||
| Abstract: Stability describes the ability of a plan to remain feasible and to give acceptable results under different variations of the operating environment without any modifications of the plan. In this paper we explore the effect of crews changing aircrafts on the stability of airline schedules using a simulation model for delay propagation, considering the interdependence between aircraft rotations and crew pairings. | |||||
BibTeX:
@inproceedings{Dueck,
author = {Dück, Viktor and Kliewer, Natalia and Suhl, Leena},
title = {Stability of Airline Schedules},
booktitle = {Operations Research Proceedings 2008},
publisher = {Springer Berlin Heidelberg},
pages = {265–270}
}
|
|||||
| Gamrath, G. and Lübbecke, M.E. | Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs | Experimental Algorithms, pp. 239–252 | inproceedings | ||
| Abstract: We report on experiments with turning the branch-price-and-cut frameworkSCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our code performs a Dantzig-Wolfe decomposition according to the user’s specification, and solves the resulting re-formulation via branch-and-price. We take care of the column generation subproblems which are solved as MIPs themselves, branch and cut on the original variables (when this is appropriate), aggregate identical subproblems, etc. The charm of building on a well-maintained framework lies in avoiding to re-implement state-of-the-art MIP solving features like pseudo-cost branching, preprocessing, domain propagation, primal heuristics, cutting plane separation etc. | |||||
BibTeX:
@inproceedings{Gamrath,
author = {Gamrath, Gerald and Lübbecke, Marco E.},
title = {Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs},
booktitle = {Experimental Algorithms},
publisher = {Springer Berlin Heidelberg},
pages = {239–252}
}
|
|||||
| Guo, L., Liang, C., Zocca, A., Low, S.H. and Wierman, A. | Less is More: Real-time Failure Localization in Power Systems [BibTeX] |
2019 IEEE 58th Conference on Decision and Control (CDC), pp. 3871–3877 | inproceedings | DOI | |
BibTeX:
@inproceedings{Guo,
author = {Guo, L. and Liang, C. and Zocca, A. and Low, S. H. and Wierman, A.},
title = {Less is More: Real-time Failure Localization in Power Systems},
booktitle = {2019 IEEE 58th Conference on Decision and Control (CDC)},
pages = {3871–3877},
doi = {https://doi.org/10.1109/CDC40024.2019.9029393}
}
|
|||||
| Hjorring, C.A. and Hansen, J. | Column generation with a rule modelling language for airline crew pairing [BibTeX] |
inproceedings | |||
BibTeX:
@inproceedings{Hjorring,
author = {Hjorring, Curt A and Hansen, Jesper},
title = {Column generation with a rule modelling language for airline crew pairing}
}
|
|||||
| Kleinberg, R. and Immorlica, N. | Recharging Bandits [BibTeX] |
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 309–319 | inproceedings | DOI | |
BibTeX:
@inproceedings{Kleinberg,
author = {Kleinberg, R. and Immorlica, N.},
title = {Recharging Bandits},
booktitle = {2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)},
pages = {309–319},
doi = {https://doi.org/10.1109/FOCS.2018.00037}
}
|
|||||
| Liu, J., Martinez, M.G., Li, B., Mathieu, J. and Anderson, C.L. | A Comparison of Robust and Probabilistic Reliability for Systems with Renewables and Responsive Demand [BibTeX] |
2016 49th Hawaii International Conference on System Sciences (HICSS), pp. 2373–2380 | inproceedings | DOI | |
BibTeX:
@inproceedings{Liu,
author = {Liu, J. and Martinez, M. G. and Li, B. and Mathieu, J. and Anderson, C. L.},
title = {A Comparison of Robust and Probabilistic Reliability for Systems with Renewables and Responsive Demand},
booktitle = {2016 49th Hawaii International Conference on System Sciences (HICSS)},
pages = {2373–2380},
doi = {https://doi.org/10.1109/HICSS.2016.297}
}
|
|||||
| Liu, Q., Jia, H., Wu, D., Li, N., Qi, Q. and Huang, X. | Hybrid Optimization Algorithm Based on Arithmetic and Golden Sine Algorithms for Constrained Engineering Problem [BibTeX] |
2022 China Automation Congress (CAC), pp. 157–162 | inproceedings | DOI | |
BibTeX:
@inproceedings{Liua,
author = {Liu, Q. and Jia, H. and Wu, D. and Li, N. and Qi, Q. and Huang, X.},
title = {Hybrid Optimization Algorithm Based on Arithmetic and Golden Sine Algorithms for Constrained Engineering Problem},
booktitle = {2022 China Automation Congress (CAC)},
pages = {157–162},
doi = {https://doi.org/10.1109/CAC57257.2022.10054988}
}
|
|||||
| Liu, Q., Qi, Q., Jia, H. and Li, N. | An Improved Slime Mould Algorithm with Quasi Reflection-based Learning for Global Optimization Problems [BibTeX] |
2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), pp. 1996–2003 | inproceedings | DOI | |
BibTeX:
@inproceedings{Liub,
author = {Liu, Q. and Qi, Q. and Jia, H. and Li, N.},
title = {An Improved Slime Mould Algorithm with Quasi Reflection-based Learning for Global Optimization Problems},
booktitle = {2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)},
pages = {1996–2003},
doi = {https://doi.org/10.1109/HPCC-DSS-SmartCity-DependSys53884.2021.00298}
}
|
|||||
| Liu, Q., Qi, Q. and Li, N. | SLEO: An efficient Equilibrium Optimizer for numerical optimization [BibTeX] |
2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta), pp. 1696–1701 | inproceedings | DOI | |
BibTeX:
@inproceedings{Liuc,
author = {Liu, Q. and Qi, Q. and Li, N.},
title = {SLEO: An efficient Equilibrium Optimizer for numerical optimization},
booktitle = {2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta)},
pages = {1696–1701},
doi = {https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00241}
}
|
|||||
| Liu, S.Q., D’Ariano, A., Kozan, E., Masoud, M. and Chung, S. | A classification and literature survey on aviation management [BibTeX] |
2019 International Conference on Industrial Engineering and Systems Management (IESM), pp. 1–5 | inproceedings | DOI | |
BibTeX:
@inproceedings{Liud,
author = {Liu, S. Q. and D’Ariano, A. and Kozan, E. and Masoud, M. and Chung, S.},
title = {A classification and literature survey on aviation management},
booktitle = {2019 International Conference on Industrial Engineering and Systems Management (IESM)},
pages = {1–5},
doi = {https://doi.org/10.1109/IESM45758.2019.8948183}
}
|
|||||
| Lulli, A., Oneto, L., Canepa, R., Petralli, S. and Anguita, D. | Large-Scale Railway Networks Train Movements: A Dynamic, Interpretable, and Robust Hybrid Data Analytics System [BibTeX] |
2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA), pp. 371–380 | inproceedings | DOI | |
BibTeX:
@inproceedings{Lulli,
author = {Lulli, A. and Oneto, L. and Canepa, R. and Petralli, S. and Anguita, D.},
title = {Large-Scale Railway Networks Train Movements: A Dynamic, Interpretable, and Robust Hybrid Data Analytics System},
booktitle = {2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA)},
pages = {371–380},
doi = {https://doi.org/10.1109/DSAA.2018.00048}
}
|
|||||
| Mittal, S. and Schulz, A.S. | A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One | , pp. 179–192 | inproceedings | ||
| Abstract: In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one objective function are combined into one using any norm. The main idea is to exploit the approximate Pareto-optimal frontier for multi-criteria optimization problems. Using this approach, we obtain an FPTAS for a novel resource allocation problem, for the problem of scheduling jobs on unrelated parallel machines, and for the Santa Claus problem, when the number of agents/machines is fixed, for any norm, including the l ∞ -norm. Moreover, either FPTAS can be implemented in a manner so that the space requirements are polynomial in all input parameters. We also give approximation algorithms and hardness results for the resource allocation problem when the number of agents is not fixed. | |||||
BibTeX:
@inproceedings{Mittal,
author = {Mittal, Shashi and Schulz, Andreas S.},
title = {A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One},
publisher = {Springer Berlin Heidelberg},
pages = {179–192}
}
|
|||||
| Ogryczak, W. | Fair Optimization -- Methodological Foundations of Fairness in Network Resource Allocation [BibTeX] |
2014 IEEE 38th International Computer Software and Applications Conference Workshops, pp. 43–48 | inproceedings | DOI | |
BibTeX:
@inproceedings{Ogryczak,
author = {Ogryczak, W.},
title = {Fair Optimization -- Methodological Foundations of Fairness in Network Resource Allocation},
booktitle = {2014 IEEE 38th International Computer Software and Applications Conference Workshops},
pages = {43–48},
doi = {https://doi.org/10.1109/COMPSACW.2014.11}
}
|
|||||
| Oneto, L., Fumeo, E., Clerico, G., Canepa, R., Papa, F., Dambra, C., Mazzino, N. and Anguita, D. | Advanced Analytics for Train Delay Prediction Systems by Including Exogenous Weather Data [BibTeX] |
2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA), pp. 458–467 | inproceedings | DOI | |
BibTeX:
@inproceedings{Oneto,
author = {Oneto, L. and Fumeo, E. and Clerico, G. and Canepa, R. and Papa, F. and Dambra, C. and Mazzino, N. and Anguita, D.},
title = {Advanced Analytics for Train Delay Prediction Systems by Including Exogenous Weather Data},
booktitle = {2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA)},
pages = {458–467},
doi = {https://doi.org/10.1109/DSAA.2016.57}
}
|
|||||
| Pruhs, K. and Stein, C. | How to Schedule When You Have to Buy Your Energy | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 352–365 | inproceedings | ||
| Abstract: We consider a situation where jobs arrive over time at a data center, consisting of identical speed-scalable processors. For each job, the scheduler knows how much income is lost as a function of how long the job is delayed. The scheduler also knows the fixed cost of a unit of energy. The online scheduler determines which jobs to run on which processors, and at what speed to run the processors. The scheduler’s objective is to maximize profit, which is the income obtained from jobs minus the energy costs. We give a (1 + ε)-speed O(1)-competitive algorithm, and show that resource augmentation is necessary to achieve O(1)-competitiveness. | |||||
BibTeX:
@inproceedings{Pruhs,
author = {Pruhs, Kirk and Stein, Cliff},
title = {How to Schedule When You Have to Buy Your Energy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
publisher = {Springer Berlin Heidelberg},
pages = {352–365}
}
|
|||||
| Scherp, L., Janssen, R. and Santos, B. | Dynamic Design Of Reserve Crew Duties For Long Haul Airline Crew [BibTeX] |
inproceedings | |||
BibTeX:
@inproceedings{Scherp,
author = {Scherp, L. and Janssen, R. and Santos, B.},
title = {Dynamic Design Of Reserve Crew Duties For Long Haul Airline Crew}
}
|
|||||
| Seliverstov, A.V. | On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem | , pp. 285–293 | inproceedings | ||
| Abstract: Earlier, I.V. Latkin and the author have shown the set partition problem can be reduced to the problem of finding singular points of a cubic hypersurface. The article focuses on the new link between two different research areas as well as on methods to look for singular points or to confirm the smoothness of the hypersurface. Our approach is based on the description of tangent lines to the hypersurface. The existence of at least one singular point imposes a restriction on the algebraic equation that determines the set of tangent lines passing through the selected point of the space. This equation is based on the formula for the discriminant of a univariate polynomial. We have proposed a probabilistic algorithm for some set of inputs of the set partition problem. The probabilistic algorithm is not proved to have polynomial complexity. | |||||
BibTeX:
@inproceedings{Seliverstov,
author = {Seliverstov, Alexandr V.},
title = {On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem},
publisher = {Springer International Publishing},
pages = {285–293}
}
|
|||||
| Shalev-Shwartz, S. and Ben-David, S. | Understanding machine learning : from foundations to algorithms [BibTeX] |
book | URL | ||
BibTeX:
@book{ShalevShwartz,
author = {Shalev-Shwartz, Shai and Ben-David, Shai},
title = {Understanding machine learning : from foundations to algorithms},
note = {GBB447286 bnb Shai Shalev-Shwartz, The Hebrew University, Jerusalem, Shai Ben-David, University of Waterloo, Canada. Formerly CIP. Uk Includes bibliographical references (pages 385-393) and index. Machine generated contents note: 1. Introduction; Part I. Foundations: 2. A gentle start; 3. A formal learning model; 4. Learning via uniform convergence; 5. The bias-complexity tradeoff; 6. The VC-dimension; 7. Non-uniform learnability; 8. The runtime of learning; Part II. From Theory to Algorithms: 9. Linear predictors; 10. Boosting; 11. Model selection and validation; 12. Convex learning problems; 13. Regularization and stability; 14. Stochastic gradient descent; 15. Support vector machines; 16. Kernel methods; 17. Multiclass, ranking, and complex prediction problems; 18. Decision trees; 19. Nearest neighbor; 20. Neural networks; Part III. Additional Learning Models: 21. Online learning; 22. Clustering; 23. Dimensionality reduction; 24. Generative models; 25. Feature selection and generation; Part IV. Advanced Theory: 26. Rademacher complexities; 27. Covering numbers; 28. Proof of the fundamental theorem of learning theory; 29. Multiclass learnability; 30. Compression bounds; 31. PAC-Bayes; Appendix A. Technical lemmas; Appendix B. Measure concentration; Appendix C. Linear algebra. "Machine learning is one of the fastest growing areas of computer science, with far-reaching applications. The aim of this textbook is to introduce machine learning, and the algorithmic paradigms it offers, in a principled way. The book provides an extensive theoretical account of the fundamental ideas underlying machine learning and the mathematical derivations that transform these principles into practical algorithms. Following a presentation of the basics of the field, the book covers a wide array of central topics that have not been addressed by previous textbooks. These include a discussion of the computational complexity of learning and the concepts of convexity and stability; important algorithmic paradigms including stochastic gradient descent, neural networks, and structured output learning; and emerging theoretical concepts such as the PAC-Bayes approach and compression-based bounds. Designed for an advanced undergraduate or beginning graduate course, the text makes the fundamentals and algorithms of machine learning accessible to students and non-expert readers in statistics, computer science, mathematics, and engineering"-- Provided by publisher.},
url = {Cover image http://assets.cambridge.org/97811070/57135/cover/9781107057135.jpg}
}
|
|||||
| Shang, Q., Li, N., Qi, Q. and Lin, X.-W. | A Semi-supervised Learning Approach for High Dimensional Android Malware Classification | Cyberspace Safety and Security, pp. 20–31 | inproceedings | ||
| Abstract: In this paper, we proposed a semi-supervised learning approach to deal with the task of high dimensional Android malware classification. Our approach includes a random projection method for reducing feature dimensionality which would be more efficient than usual feature selection methods in existing work for the task. We also introduced a new method of SGD-based SVM with adapted sampling, which was based on the insight from the confidence and nearest neighbor clustering analysis of input data. The approach was tested on a real-world competition dataset, and effectiveness of the new method was verified by experimental results. By using the new method, we can even obtain a better classification accuracy than the best score produced in the competition. | |||||
BibTeX:
@inproceedings{Shang,
author = {Shang, Qiao and Li, Ni and Qi, Qi and Lin, Xiao-Wei},
title = {A Semi-supervised Learning Approach for High Dimensional Android Malware Classification},
booktitle = {Cyberspace Safety and Security},
publisher = {Springer International Publishing},
pages = {20–31}
}
|
|||||
| Siemonsmeier, M., Heel, M.v. and Moser, A. | Impact of Uncertainties on Grid Congestion Management Measures with Long Lead Time [BibTeX] |
2021 IEEE International Conference on Environment and Electrical Engineering and 2021 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe), pp. 1–6 | inproceedings | DOI | |
BibTeX:
@inproceedings{Siemonsmeier,
author = {Siemonsmeier, M. and Heel, M. v. and Moser, A.},
title = {Impact of Uncertainties on Grid Congestion Management Measures with Long Lead Time},
booktitle = {2021 IEEE International Conference on Environment and Electrical Engineering and 2021 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe)},
pages = {1–6},
doi = {https://doi.org/10.1109/EEEIC/ICPSEurope51590.2021.9584777}
}
|
|||||
| Stoyanov, D.e., Taylor, Z.e., Kia, S.M.e., Oguz, I.e. and Reyes, M.e. | Understanding and interpreting machine learning in medical image computing applications : first International Workshops, MLCN 2018, DLF 2018, and iMIMIC 2018, held in conjunction with MICCAI 2018, Granada, Spain, September 16-20, 2018, Proceedings [BibTeX] |
book | |||
BibTeX:
@book{Stoyanov,
author = {Stoyanov, Danail editor and Taylor, Zeike editor and Kia, Seyed Mostafa editor and Oguz, Ipek editor and Reyes, Mauricio editor},
title = {Understanding and interpreting machine learning in medical image computing applications : first International Workshops, MLCN 2018, DLF 2018, and iMIMIC 2018, held in conjunction with MICCAI 2018, Granada, Spain, September 16-20, 2018, Proceedings},
note = {GBB8K6584 bnb 10.1007/978-3-030-02628-8 doi Danail Stoyanov, Zeike Taylor, Seyed Mostafa Kia, Ipek Oguz, Mauricio Reyes [and ten others]. Lecture notes in computer science ; 11038 LNCS sublibrary. SL 6, Image processing, computer vision, pattern recognition, and graphics International conference proceedings. Includes author index. International Workshop on Deep Learning Fails (1st : 2018 : Granada, Spain), jointly held conference. International Workshop on Interpretability of Machine Intelligence in Medical Image Computing (1st : 2018 : Granada, Spain), jointly held conference. International Conference on Medical Image Computing and Computer-Assisted Intervention (21st : 2018 : Granada, Spain) jointly held conference.}
}
|
|||||
| Tao, Y., Rahn Christopher, D., Archer Lynden, A. and You, F. | Second life and recycling: Energy and environmental sustainability perspectives for high-performance lithium-ion batteries [BibTeX] |
Science Advances Vol. 7(45), pp. eabi7633 |
article | DOI URL | |
BibTeX:
@article{Tao,
author = {Tao, Yanqiu and Rahn Christopher, D. and Archer Lynden, A. and You, Fengqi},
title = {Second life and recycling: Energy and environmental sustainability perspectives for high-performance lithium-ion batteries},
journal = {Science Advances},
volume = {7},
number = {45},
pages = {eabi7633},
url = {https://doi.org/10.1126/sciadv.abi7633},
doi = {https://doi.org/10.1126/sciadv.abi7633}
}
|
|||||
| Thakolsri, S., Kellerer, W. and Steinbach, E. | Application-driven cross layer optimization for wireless networks using MOS-based utility functions [BibTeX] |
2009 Fourth International Conference on Communications and Networking in China, pp. 1–5 | inproceedings | DOI | |
BibTeX:
@inproceedings{Thakolsri,
author = {Thakolsri, S. and Kellerer, W. and Steinbach, E.},
title = {Application-driven cross layer optimization for wireless networks using MOS-based utility functions},
booktitle = {2009 Fourth International Conference on Communications and Networking in China},
pages = {1–5},
doi = {https://doi.org/10.1109/CHINACOM.2009.5339767}
}
|
|||||
| Villa, C., Lozinguez, E. and Labayrade, R. | Multi-objective Optimization under Uncertain Objectives: Application to Engineering Design Problem | Evolutionary Multi-Criterion Optimization, pp. 796–810 | inproceedings | ||
| Abstract: In the process of multi-objective optimization of real-world systems, uncertainties have to be taken into account. We focus on a particular type of uncertainties, related to uncertain objective functions. In the literature, such uncertainties are considered as noise that should be eliminated to ensure convergence of the optimization process to the most accurate solutions. In this paper, we adopt a different point of view and propose a new framework to handle uncertain objective functions in a Pareto-based multi-objective optimization process: we consider that uncertain objective functions are not only biasing errors due to the optimization, but also contain useful information on the impact of uncertainties on the system to optimize. From the Probability Density Function (PDF) of random variables modeling uncertainties of objective functions, we determine the ”Uncertain Pareto Front”, defined as a ”tradeoff probability function” in objective space and a ”solution probability function” in decision space. Then, from the ”Uncertain Pareto Front”, we show how the reliable solutions, i.e. the most probable solutions, can be identified. We propose a Monte Carlo process to approximate the ”Uncertain Pareto Front”. The proposed process is illustrated through a case study of a famous engineering problem: the welded beam design problem aimed at identifying solutions featuring at the same time low cost and low deflection with respect to an uncertain Young’s modulus. | |||||
BibTeX:
@inproceedings{Villa,
author = {Villa, Céline and Lozinguez, Eric and Labayrade, Raphaël},
title = {Multi-objective Optimization under Uncertain Objectives: Application to Engineering Design Problem},
booktitle = {Evolutionary Multi-Criterion Optimization},
publisher = {Springer Berlin Heidelberg},
pages = {796–810}
}
|
|||||
| Zanette, A., Zhang, J. and Kochenderfer, M.J. | Robust Super-Level Set Estimation Using Gaussian Processes | , pp. 276–291 | inproceedings | ||
| Abstract: This paper focuses on the problem of determining as large a region as possible where a function exceeds a given threshold with high probability. We assume that we only have access to a noise-corrupted version of the function and that function evaluations are costly. To select the next query point, we propose maximizing the expected volume of the domain identified as above the threshold as predicted by a Gaussian process, robustified by a variance term. We also give asymptotic guarantees on the exploration effect of the algorithm, regardless of the prior misspecification. We show by various numerical examples that our approach also outperforms existing techniques in the literature in practice. | |||||
BibTeX:
@inproceedings{Zanette,
author = {Zanette, Andrea and Zhang, Junzi and Kochenderfer, Mykel J.},
title = {Robust Super-Level Set Estimation Using Gaussian Processes},
publisher = {Springer International Publishing},
pages = {276–291}
}
|
|||||
| Zhang, Z., Zhou, M. and Guo, S. | Multiobjective Optimization Approaches to Airline Crew Rostering Problems: A Case Study [BibTeX] |
2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), pp. 750–755 | inproceedings | DOI | |
BibTeX:
@inproceedings{Zhang,
author = {Zhang, Z. and Zhou, M. and Guo, S.},
title = {Multiobjective Optimization Approaches to Airline Crew Rostering Problems: A Case Study},
booktitle = {2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)},
pages = {750–755},
doi = {https://doi.org/10.1109/COASE.2018.8560581}
}
|
|||||
| Zou, M. and Guo, W. | Infection and Re-Infection: Stability of Complex Air Transport Network [BibTeX] |
2021 IEEE International Smart Cities Conference (ISC2), pp. 1–4 | inproceedings | DOI | |
BibTeX:
@inproceedings{Zou,
author = {Zou, M. and Guo, W.},
title = {Infection and Re-Infection: Stability of Complex Air Transport Network},
booktitle = {2021 IEEE International Smart Cities Conference (ISC2)},
pages = {1–4},
doi = {https://doi.org/10.1109/ISC253183.2021.9562818}
}
|
|||||
