Operations Research Perspectives最新文献

An alternative approach for the panel second stage of data envelopment analysis (DEA) is presented in this paper. Instead of efficiency scores, we propose to model rankings in the second stage using a dynamic ranking model in the score-driven framework. We argue that this approach is suitable to complement traditional panel regression as a robustness check. To demonstrate the proposed approach, we determine research efficiency of higher education systems at country level by examining scientific publications and analyze its relation to good governance. The proposed approach confirms positive relation to the Voice and Accountability indicator, as found by the standard panel linear regression, while suggesting caution regarding the Government Effectiveness indicator.

We construct a new family of chance constrained directional models in stochastic data envelopment analysis, generalizing the deterministic directional models and the chance constrained radial models. We prove that chance constrained directional models define the same concept of stochastic efficiency as the one given by chance constrained radial models and, as a particular case, we obtain a stochastic version of the generalized Farrell measure. Finally, we give some examples of application of chance constrained directional models with stochastic and deterministic directions, showing that inefficiency scores obtained with stochastic directions are less or equal than those obtained considering deterministic directions whose values are the means of the stochastic ones.

One of the main challenges of food bank warehouses in developing countries is to determine how to allocate perishable products to beneficiary agencies with different expiry dates while ensuring food safety, meeting nutritional requirements, and minimizing the shortage. The contribution of this research is to introduce a new multi-objective, multi-product, and multi-period perishable food allocation problem based on a single warehouse management system for a First Expired-First Out (FEFO) policy. Moreover, it incorporates the temporal aspect, guaranteeing the dispatch of only those perishable products that meet the prescribed minimum quality standards. A weighted sum approach converts the multi-objective problem of minimizing a vector of objective functions into a scalar problem by constructing a weighted sum of all the objectives. The problem can then be solved using a standard constrained optimization procedure. The proposed mixed integer linear model is solved by using the CPLEX solver. The solution obtained from the multi-objective problem allows us to identify days and products experiencing shortages. In such cases, when there is insufficient available inventory, the total quantity of product to be dispatched is redistributed among beneficiaries according to a pre-established prioritization. These redistributions are formulated as integer programming problems using a score-based criterion and solved by an exact method based on dynamic programming. Computational results demonstrate the applicability of the novel model for perishable items to a real-world study case.

The green vehicle routing problem (GVRP) has been a prominent topic in the literature on logistics and transportation, leading to extensive research and previous review studies covering various aspects. Operations research has seen the development of various exact and approximation approaches for different extensions of the GVRP. This paper presents an up-to-date and thorough review of GVRP literature spanning from 2016 to 2023, encompassing 458 papers. significant contribution lies in the updated solution approaches and algorithms applied to both single-objective and multi-objective GVRP. Notably, 92.58 % of the papers introduced a mathematical model for GVRP, with many researchers adopting mixed integer linear programming as the preferred modeling approach. The findings indicate that both metaheuristics and hybrid are the most employed solution approaches for addressing single-objective GVRP. Among hybrid approaches, the combination of metaheuristics-metaheuristics is particularly favored by GVRP researchers. Furthermore, large neighborhood search (LNS) and its variants (especially adaptive large neighborhood search) emerges as the most widely adopted algorithm in single-objective GVRP. These algorithms are proposed within both metaheuristic and hybrid approaches, where A-/LNS is often combined with other algorithms. Conversely, metaheuristics are predominant in addressing multi-objective GVRP, with NSGA-II being the most frequently proposed algorithm. Researchers frequently utilize GAMS and CPLEX as optimization modeling software and solvers. Furthermore, MATLAB is a commonly employed programming language for implementing proposed algorithms.

Home Health Care (HHC) services are essential for delivering healthcare programs to patients in their homes, with the goal of reducing hospitalization rates and improving patients’ quality of life. However, HHC organizations face significant challenges in scheduling and routing caregivers for home care visits due to complex criteria and constraints. This paper addresses these challenges by considering both caregiver assignments and transportation logistics. The objective is to minimize the total travel distance and CO${}_2$ emissions while ensuring a balanced workload for caregivers, meeting patients’ preferences, synchronization, precedence, and availability constraints. To tackle this problem, we propose a multiperiodic Green Home Health Care (GHHC) framework. In the first stage, we utilize multiobjective programming and the NSGA-II algorithm to generate Pareto front solutions that consider travel distance and CO${}_2$ emissions. In the second stage, a Mixed-Integer Linear Programming (MILP) model is proposed to balance caregivers’ workload by assigning them to the patient routes generated in the first stage. The results highlight the trade-off between shorter routes and lower emissions. Furthermore, we examine the impact of prioritizing continuity of care and patient satisfaction. This research provides valuable insights into addressing the scheduling and routing challenges in HHC services, contributing to a more efficient and environmentally friendly healthcare delivery.

The airplane boarding process, which can have a significant impact on a flight’s turnaround time, is often viewed by researchers and airlines primarily in terms of minimizing total boarding time (TBT). Airplane capacity, number of passengers on board, amount of luggage, and boarding strategy are common factors that affect TBT. However, besides operational efficiency, airlines are also concerned with customer satisfaction, which affects customer loyalty and financial return. One factor that influences passenger experience is the individual boarding time (IBT), here defined by the time passengers stand inside the cabin. Considering these two aspects, an agent-based model is presented that compares the performance of three alternative mainstream boarding strategies in a 132-seat and a 160-seat single-aisle commercial airplane. An important characteristic of the model that differentiates it from previous work is that overhead bins have a physical limitation, which could lead to an increase in aisle interferences on full flights as passengers take longer to find a place for their carry-on luggage. Another important contribution is the analysis of how passenger seat location affects IBT. Our results show that outside-in (OI) produces shorter TBT than random and back-to-front boarding, and also shorter IBT and much shorter maximum IBT than BTF, particularly for passengers seated in the middle of the airplane. This suggests that among the three most popular boarding strategies used by airlines across the world, OI is the best when it comes to balancing airplane boarding efficiency with individual customer satisfaction.

This paper presents a bi-level approach to support retailers in making investment decisions in renewable-based systems to provide clean electricity. The proposed model captures the strategic nature of the problem and combines capacity sizing decisions for installed technologies with pricing decisions regarding the electricity tariffs to offer to a reference end-user, representative of a class of residential prosumers. The interaction between retailer and end-user is modeled using the Stackelberg game framework, with the former acting as a leader and the latter as follower. The reaction of the follower to the electricity tariff affects the retailer’s profit, which is calculated as the difference between the revenue generated from selling electricity and the total investment, operation and management costs. To account for uncertainty in wholesale electricity prices, renewable resource availability and electricity request, the upper-level problem is formulated as a two-stage stochastic programming model. First-stage decisions refer to the sizing of installed technologies and electricity tariffs, whereas second-stage decisions refer to the operation and management of the designed system. The model also incorporates a safety measure to control the average profit that can be achieved in a given percentage of worst-case situations, thus providing a contingency against unforeseen changes. At the lower level, the follower reacts to the offered tariffs by defining the procurement plan in terms of energy to purchase from the retailer or potential competitors, with the final aim of minimizing the expected value of the electricity bill. A tailored approach that exploits the specific problem structure is designed to solve the proposed formulation and extensively tested on a realistic case study. The numerical results demonstrate the efficiency of the proposed approach and validate the significance of explicitly dealing with the uncertainty and the importance of incorporating a safety measure.

This paper proposes a novel method of Pareto front generation from a set of piecewise linear trade-off curves typically encountered in bi-objective just-in-time (JIT) scheduling problems. We have considered the simultaneous minimization of total weighted earliness and tardiness (TWET) and total flowtime (TFT) objectives in a single-machine scheduling problem (SMSP) with distinct job due dates allowing inserted idle times in the schedules. An optimal timing algorithm (OTA) is presented to generate the trade-off curve between TWET and TFT for a given sequence of jobs. The proposed method of Pareto front generation generates a Pareto-optimal front constituted of both line segments and points. Further, we employ a simple local search method to generate sequences of jobs and their respective trade-off curves, which are trimmed and merged to generate the Pareto-optimal front using the proposed method. Computational results obtained using problem instances of different sizes reveal the efficiency of the proposed OTA and the Pareto front generation method over the state-of-the-art methodologies adopted from the literature.

The presence of congestion is a common scenario in tertiary-level hospitals worldwide. Current research suggests that an increase in hospital bed capacity is not a long-term solution given that patient demand adapts to added capacity. Recent literature suggests the need for the implementation of a policy of inter-hospital transfers to divert patients to outpatient priority services or home care. This policy has proven to be effective in reducing ED boarding without compromising patient safety. However, determining the required number of patients to be admitted is key. The dynamic nature of hospital bed availability and discharges requires an admission process able to be in synchrony with those variations. A mismatch between patient demand and hospital admissions will result in either ED boarding or idle capacity. The purpose of this paper is to introduce a methodology to support the process of hospital admissions by providing as an input a threshold for the number of patients to be admitted. The methodology is tested using a system dynamics model that replicates one year of operations of a tertiary-level hospital. The simulations reveal the potential of the methodology to decrease the ED inpatient boarding rate as well as ED and hospital length of stay.

Fast-paced markets require complex interactions from all supply-chain agents to satisfy customer demands and needs. The manufacturing industries face some difficulties in terms of production amounts and smooth delivery rates. Technical experts found that a warm-up period before a production run helps address those challenges and improves the workability of machine tools in the manufacturing process. The use of a warm-up process causes a reduction of faulty products (an adverse production outcome) and improves operational efficiency. Also, a shortage in the supply of commodities creates difficult conditions for inventory management decisions, posing the same production problems as mentioned above. Consideration of the warm-up process has recently been included in the scope of operations research, but it is necessary to study its interaction with the presence of shortage. This study presents a system where a manufacturing environment utilizes the warm-up process in its initial phase and shortages are allowed during the production period, in addition, the study takes into account carbon emissions during manufacturing to integrate environmental concerns. We assume that the company has the capability to trade the surplus carbon capacity it hasn't produced. This study offers a comprehensive framework that incorporates former research that addresses warm-up process, carbon emissions, shortages, and defective items. To solve the proposed non-linear programming problem with inequality constraints, we employ the Karush-Kuhn-Tucker (KKT) conditions method to determine the optimal solutions. Managerial insights are derived, and sensitivity analysis highlights the effects of the system parameters on the decision variables. The sensitivity analysis results indicate that the carbon trading cost has a significant impact on the overall cost, and subsequently, the company's profit.