Airline maintenance task scheduling takes place in a disruptive environment. The stochastic arrival of corrective maintenance tasks and changes in both fleet and resource availability require schedules to be continuou...
详细信息
Airline maintenance task scheduling takes place in a disruptive environment. The stochastic arrival of corrective maintenance tasks and changes in both fleet and resource availability require schedules to be continuously adjusted. An optimal schedule ensures that all tasks are executed before their due date in both an efficient (at minimum use of ground-time) and a stable (limited number of schedule changes) manner. This paper is the first study to address disruption management for the hangar maintenance task scheduling problem, proposing a practical and efficient modeling framework. The framework comprises a mixed integer linear programming model for airline maintenance task rescheduling in a disruptive envi-ronment, in which task scheduling is constrained by the availability of resources. The model's capabilities include creating and adjusting maintenance schedules continuously and dynamically reacting to new in-formation when this becomes available. The modeling framework was tested in a case study provided by a large airline, and its performance was compared to the current practice of the airline. The results show that the proposed approach produces more efficient and stable results. A 3% ground time decrease was achieved, while the number of schedule changes in the last days before operations was decreased by more than half.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )
The literature has shown how to optimize and analyze the parameters of different types of neural networks using mixedintegerlinear programs (MILP). Building on these developments, this work presents an approach to d...
详细信息
The literature has shown how to optimize and analyze the parameters of different types of neural networks using mixedintegerlinear programs (MILP). Building on these developments, this work presents an approach to do so for a McCulloch/Pitts and Rosenblatt neurons. As the original formulation involves a step-function, it is not differentiable, but it is possible to optimize the parameters of neurons, and their concatenation as a shallow neural network, by using a mixedintegerlinear program. The main contribution of this paper is to additionally enforce sparsity constraints on the weights and activations as well as on the amount of used neurons. Several experiments demonstrate that such constraints effectively prevent overfitting in neural networks, and ensure resource optimized models.
The purpose of this study is to solve the multi-instance classification problem by maximizing the area under the Receiver Operating Characteristic (ROC) curve obtained for witness instances. We derive a mixedinteger ...
详细信息
The purpose of this study is to solve the multi-instance classification problem by maximizing the area under the Receiver Operating Characteristic (ROC) curve obtained for witness instances. We derive a mixed integer linear programming model that chooses witnesses and produces the best possible ROC curve using a linear ranking function for multi-instance classification. The formulation is solved using a commercial mathematical optimization solver as well as a fast metaheuristic approach. When the data is not linearly separable, we illustrate how new features can be generated to tackle the problem. We present a comprehensive computational study to compare our methods against the state-of-the-art approaches in the literature. Our study reveals the success of an optimal linear ranking function through cross validation for several benchmark instances.
This paper extends the single-item single-stocking location nonstationary stochastic inventory problem to relax the assumption of independent demand. We present a mathematical programming-based solu-tion method built ...
详细信息
This paper extends the single-item single-stocking location nonstationary stochastic inventory problem to relax the assumption of independent demand. We present a mathematical programming-based solu-tion method built upon an existing piecewise linear approximation strategy under the receding horizon control framework. Our method can be implemented by leveraging off-the-shelf mixed-integerlinear pro-gramming solvers. It can tackle demand under various assumptions: the multivariate normal distribution, a collection of time-series processes, and the Martingale Model of Forecast Evolution. We compare against exact solutions obtained via stochastic dynamic programming to demonstrate that our method leads to near-optimal plans.(c) 2022 Elsevier B.V. All rights reserved.
The effective management of resources in bulk ports presents substantial challenges, prominently concerning the intricate scheduling of bucket wheel reclaimers (BWRs). These essential machines play a vital role in the...
详细信息
The effective management of resources in bulk ports presents substantial challenges, prominently concerning the intricate scheduling of bucket wheel reclaimers (BWRs). These essential machines play a vital role in the reclamation of dry bulk materials, facilitating their loading onto vessels via ship-loaders. The research at hand centers around the BWR scheduling problem, wherein the sequence-dependent setup times and eligibility restrictions of these machines are duly considered. The optimization of BWR schedules holds direct implications for terminal throughput, which is a paramount performance metric for dry bulk terminals. The primary objective revolves around the minimization of total completion times, as it pertains to enhancing the overall efficiency and productivity of the terminal operations. For this NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{N}\mathcal{P}$$\end{document}-hard problem, we present a novel mixed-integerlinearprogramming (MILP) formulation based on one commodity variables. Additionally, we develop three efficient greedy heuristics, each with three variants, resulting in a total of nine heuristics, to solve large-sized instances of the problem. Furthermore, an efficient general variable neighborhood search (GVNS) algorithm is proposed to improve the quality of the heuristic solutions. Through extensive computational experiments, we assess the effectiveness of the proposed methods. The results demonstrate that the developed greedy heuristics efficiently yield high-quality approximation solutions for solving large-scale instances of the problem. Moreover, the application of the GVNS algorithm further enhances the solutions obtained through the heuristics, leading to an improvement in scheduling efficiency.
A new mathematical model of transportation along the transport network represented by an undirected multigraph is formulated. A new criterion for the optimality of cargo carriages schedule is proposed. The criterion i...
详细信息
A new mathematical model of transportation along the transport network represented by an undirected multigraph is formulated. A new criterion for the optimality of cargo carriages schedule is proposed. The criterion in addition to the time characteristics of transportation includes their cost, the number of undelivered cargoes. The problem to find the optimal schedule is formulated as a problem of mixed integer linear programming. Various variants of the algorithm for searching for an approximate solution to the problem are proposed. Informative examples are considered.
Machine learning is taking on a significant role in materializing a new vision of 6G. 6G aspires to provide more use cases, handle high-complexity tasks, and improvise the current 5G and beyond 5G infrastructure. Arti...
详细信息
Machine learning is taking on a significant role in materializing a new vision of 6G. 6G aspires to provide more use cases, handle high-complexity tasks, and improvise the current 5G and beyond 5G infrastructure. Artificial Intelligence (AI) and machine learning (ML) are the optimal candidates to support and deliver these aspirations. Traffic steering functions encompass many opportunities to help enable new use cases and improve overall performance. The emergence and advancement of the non-terrestrial network is another driving factor for creating an intelligence selection scheme to have a dynamic traffic steering function. With service-based architecture, 5G and 6G are data-driven architectures that use massive transactional data to emerge a new approach to handling highly complex processes. A highly complex process, a massive volume of data, and a short timeframe require a scheme using machine learning techniques to resolve the challenges. In this paper, the study creates a scheme to use the massive historical data and provide a decision scheme that enables dynamic traffic steering functions addressing the future emergence of the heterogeneous transport network and aligns with the Open Radio Access Network (O-RAN). The proposed scheme in this paper gives an inference to be programmed in the telecommunication nodes. It provides a novel scheme to enable dynamic traffic steering functions for the 6G transport network. The study shows an appropriate data size to create a high-performance multi-output classification model that produces more than 90% accuracy for traffic steering functions.
As the hydrogen economy recently gains momentum, the Korean government is actively encouraging Independent Power Producers (IPPs) to leverage hydrogen energy. The surging uncertainties in the power market, precipitate...
详细信息
As the hydrogen economy recently gains momentum, the Korean government is actively encouraging Independent Power Producers (IPPs) to leverage hydrogen energy. The surging uncertainties in the power market, precipitated by the rapid increase in renewable energy sources (RES), necessitates IPPs to formulate a new benefit structure that utilizes green hydrogen. However, the current economic challenges associated with the operation of RES linked to water electrolysis result in diminished participation from IPPs. In response, the Korean government is planning to implement the Clean Hydrogen Portfolio Standard (CHPS), which requires clean hydrogen power generation and offers corresponding Fixed Premium (FP) subsidies. In this paper, we incrementally increase the FP for RES linked to electrolyzers (ELZ) and derive a marginal fixed premium (FPmar). This method initiates a shift towards higher economic feasibility compared to the traditional benefit structure of power tradingbased RES. We suggest a green hydrogen-based business model (BM) that synergizes hydropower with water electrolysis and calculate a suitable CHPS subsidy to ensure the economic feasibility of this BM. In conclusion, this paper equips IPPs operating hydropower with the capability to evaluate the adequacy of the government-provided FP for the economical operation of a hydropower plant linked to water electrolysis. Furthermore, it provides policymakers with the framework to make informed decisions regarding the necessary FPmar to stimulate IPPs' participation.& COPY;2023 The Authors. Published by Elsevier *** is an open access article under the CC BY license (http://***/licenses/by/4.0/).
The transportation sector, which is largely dependent on oil, is faced with many problems such as the danger of depletion of fossil fuels that are harmful to the environment. Moreover, the situations such as epidemics...
详细信息
The transportation sector, which is largely dependent on oil, is faced with many problems such as the danger of depletion of fossil fuels that are harmful to the environment. Moreover, the situations such as epidemics and war cause excessive fluctuations in oil prices. Therefore, there is a need for new solutions based on alternative energy sources for a sustainable transportation sector. Hydrogen fuel cell electric vehicles (HFCEV) are one of the significant alternatives for an efficient, zero emissions and sustainable transportation system. Considering the potential investment in HFCEV technology, the need for a cost effective, green, and low risk Hydrogen Supply Chain (HSC) network infrastructure is inevitable. In this study, the HSC design of the Turkish transportation sector over a 25-year period (2026-2050) is investigated. The problem is modeled using a multi-period mixed integer linear programming (MIP) model. Three objectives are addresses: cost, carbon dioxide (CO2) emissions and safety risk. In order to consider the uncertainty in the hydrogen demand, five different scenarios are analyzed using fuzzy concept. There are four main results. First, unit hydrogen cost is found to be very high due to low demand and high capital cost in the initial period (2026-2031). Second, HSC network is established in a decentralized setting in all scenario solutions. The level of decentralization gets stronger over time and with increasing demand. Third, short-distance road transport is generally preferred for hydrogen transport. Fourth, since the aim is to minimize cost, CO2 emissions, and risk level, a mixed production strategy based on cost-oriented SMR and zeroemissions-oriented Electrolysis (ELE) is observed in all scenarios.& COPY;2023 Hydrogen Energy Publications LLC. Published by Elsevier Ltd. All rights reserved.
The weapon-target assignment problem is a classic task assignment problem in combinatorial optimization, and its goal is to assign some number of workers (the weapons) to some number of tasks (the targets). Classical ...
详细信息
The weapon-target assignment problem is a classic task assignment problem in combinatorial optimization, and its goal is to assign some number of workers (the weapons) to some number of tasks (the targets). Classical approaches for this problem typically use a centralized planner leading to a single point of failure and often preventing real-time replanning as conditions change. This paper introduces a new approach for distributed, autonomous assignment planning executed by the weapons where each weapon is responsible for optimizing over distinct subsets of the decision variables. A continuous, convex relaxation of the associated cost function and constraints is introduced, and a distributed primal-dual optimization algorithm is developed that will be shown to have guaranteed bounds on its convergence rate, even with asynchronous computations and communications. This approach has several advantages in practice due to its robustness to asynchrony and resilience to time-varying scenarios, and these advantages are exhibited in experiments with simulated and physical commercial off-the-shelf ground robots as weapon surrogates that are shown to successfully compute their assignments under intermittent communications and unexpected attrition (loss) of weapons.
暂无评论