Search results

The purpose of this study was to create an air movement operations planning model to rapidly generate air mission request (AMR) assignment and routing courses of action (COA) in order to minimize unsupported AMRs, aircraft utilization and routing cost.

In this paper, the US Army Aviation air movement operations planning problem is modeled as a mixed integer linear program (MILP) as an extension of the dial-a-ride problem (DARP). The paper also introduces a heuristic as an extension of a single-vehicle DARP demand insertion algorithm to generate feasible solutions in a tactically useful time period.

The MILP model generates optimal solutions for small problems (low numbers of AMRs and small helicopter fleets). The heuristic generates near-optimal feasible solutions for problems of various sizes (up to 100 AMRs and 10 helicopter team fleet size) in near real time.

Due to the inability of the MILP to produce optimal solutions for mid- and large-sized problems, this research is limited in commenting on the heuristic solution quality beyond the numerical experimentation. Additionally, the authors make several simplifying assumptions to generalize the average performance and capabilities of aircraft throughout a flight.

This research is the first to solve the US Army Aviation air movement operations planning problem via a single formulation that incorporates multiple refuel nodes, minimization of unsupported demand by priority level, demand time windows, aircraft team utilization penalties, aircraft team time windows and maximum duration and passenger ride time limits.

This study aims to understand how the recent COVID-19 pandemic impacted burnout levels among working mothers in leadership positions and how income and work schemes play an important role in their burnout.

Data were collected from 961 working mothers and fathers in leadership positions in Mexico under different work schemes during the COVID-19 lockdown. Snowball sampling was used in this study. The Maslach Burnout Inventory General Survey was distributed online, using the burnout scale, with income and work schemes as categorical variables.

Burnout levels among working mothers in leadership positions were higher than those among working fathers. The hybrid work scheme (i.e. working from home combined with working from office) lessens burnout in working mothers, contributing both theoretically and empirically to better understanding burnout levels of mothers in leadership positions.

The findings can encourage human resource areas to reflect on the overexertion and work stress of mothers in leadership positions, and potential support resources can be provided to motivate them and retain their talent.

The introduction of the notion of lockdown in a conceptual model to observe its interaction with burnout and hybrid work schemes (i.e. working from the office and home) has rarely been discussed in existing literature. The impact, especially for working mothers in leadership positions, must be thus carefully considered while dealing with future crises, thereby helping to develop policies and processes accordingly.

This paper aims to correct the existing mixed integer programming (MIP) model proposed by Yadav et al. (2019) [“Bi-objective optimization for sustainable supply chain network design in omnichannel.”, Journal of Manufacturing Technology Management, Vol. 30 No. 6, pp. 972–986].

This paper first presents a counterexample to show that the existing MIP model is incorrect and then proposes an improved mixed integer linear programming (MILP) model for the considered problem. Last, a numerical experiment is conducted to test our improved MILP model.

This paper demonstrates that the formulations of the facility capacity constraints and the product flow balance constraints in the existing MIP model are incorrect and incomplete. Due to this reason, infeasible solutions could be identified as feasible ones by the existing MIP model. Hence, the optimal solution obtained with the existing MIP model could be infeasible. A counter-example is used to verify our observations. Computational results verify the effectiveness of our improved MILP model.

This paper gives a complete and correct formulation of the facility capacity constraints and the product flow balance constraints, and conducts other improvements on the existing MIP model. The improved MILP model can be easily implemented and would help companies to have more effective distribution networks under the omnichannel environment.

The ocean transportation of automobiles is carried out by specialized Roll‐on/Roll‐off ships, which are designed to carry a large number of automobiles at a time. Many of these shipping companies have vertically integrated or collaborated with other logistics services providers to offer integrated maritime logistics solution to car manufacturers. The purpose of this study is to develop an optimization model to address the tactical level maritime logistics planning for such a company.

The problem is formulated as a mixed integer linear program and we propose an iterative combined Ant colony and linear programming‐based solution technique for the same.

This paper can integrate the maritime transportation planning of internally managed cargoes with the inventory management at the loading and discharging ports to minimize supply‐chain cost and also maximize additional revenue through optional cargoes using same fleet of ships.

The mathematical model does not consider the variability in production and consumption of products across various locations, travel times between different nodes, etc.

The suggested mathematical model to the supply‐chain planning problem and solution technique can be considered in the development of decision support system for operations planning.

This paper extends the maritime inventory routing model by considering simultaneous planning of optional cargoes with internally managed cargoes.

This paper aims to present two mathematical models to solve the Energy Management problem of a building microgrid (MG). In particular, it proposes a deterministic mixed integer linear programming (MILP) and non-linear programming (NLP) formulations. This paper focuses on the modelling process and the optimization performances for both approaches regarding optimal operation of near-zero energy buildings connected to an electric MG with a 24-h time horizon.

A general architecture of a MG is detailed, involving energy storage systems, distributed generation and a thermal reduced model of the grid-connected building. A continuous non-linear model is detailed along with linearizations for the mixed-integer liner formulation. Multi-physic, non-linear and non-convex phenomena are detailed, such as ventilation and air quality models.

Results show that both approaches are relevant for solving the energy management problem of the building MG.

Introduction and modelling of the thermal loads within the MG. The resulting linear program handles the mutli-objective trade-off between discomfort and the cost of use taking into account air quality criterion. Linearization and modelling of the ventilation system behaviour, which is generally non-linear and non-convex equality constraints, involving air quality model, heat transfer and ventilation power. Comparison of both MILP and NLP methods on a general use case provides a solution that can be interpreted for implementation.

This paper aims to address the problem of optimal allocation of demand of items among candidate suppliers to maximize the purchase value of items. The purchase value of the items directly relates to cost and quality of raw materials purchased from the supplier. In an increasingly competitive environment, firms are paying more attention to selecting the right suppliers for procurement of raw materials and component parts for their products. The present research work focuses on this issue of supply chain management.

This present research work devises a hybrid algorithm for multi-period demand allocation among the suppliers. The customer demand is allocated by using a hybrid algorithm based on the technique for order preference by similarity to ideal solution (TOPSIS), fuzzy set theory and the mixed linear integer programming (MILP) approaches.

The supply chain network is witnessing a changing business environment due to government policies aimed at promoting new small manufacturing enterprises (small and medium-sized enterprises) for intermediate parts and components. Hence, the managers have an option to select a new group of suppliers and allocate the optimal multi-period demand among the new group of suppliers to maximize their purchase value. In this context, the proposed hybrid model would be beneficial for the managers to operate their supply chain effectively and efficiently. The present research work will be helpful for the managers who are interested to reconfigure their supply chain under the failure of any supply chain partner or in a changing business environment. The model provides flexibility to the managers for evaluation of the different available alternatives to take a decision of optimal demand allocation among the suppliers. The proposed hybrid (fuzzy, TOPSIS and MILP) model provides more objective information for supplier evaluation and demand allocation among suppliers in a supply chain. The managers can use the proposed model to the analysis of other management decision-making problems.

This present research work devises a hybrid algorithm for multi-period demand allocation among the suppliers. This hybrid algorithm prioritizes the suppliers and then allocates the multi-period demand among the suppliers. The customer demand is allocated by using a hybrid algorithm based on the technique for order preference by similarity to ideal solution (TOPSIS), fuzzy set theory and the mixed linear integer programming (MILP) approaches.

Resource-constrained assembly lines are widely found in industries that manufacture complex products. In such lines, tasks may require specific resources to be processed. Therefore, decisions on which tasks and resources will be assigned to each station must be made. When the number of available stations is fixed, the problem’s main goal becomes the minimisation of cycle time (type-II version). This paper aims to explore this variant of the problem that lacks investigation in the literature.

In this paper, the authors propose mixed-integer linear programming (MILP) models to minimise cycle time in resource-constrained assembly lines, given a limited number of stations and resources. Dedicated and alternative resource types for tasks are considered in different scenarios.

Besides, past modelling decisions and assumptions are questioned. The authors discuss how they were leading to suboptimal solutions and offer a rectification.

The proposed models and data set fulfil more practical concerns by taking into account characteristics found in real-world assembly lines.

The proposed MILP models are applied to an existing data set, results are compared against a constraint programming model, and new optimal solutions are obtained. Moreover, a data set extension is proposed due to the simplicity of the current one and instances up to 70 tasks are optimally solved.

The purpose of this paper is to find a sustainable facility location solution for a closed-loop distribution network in the uncertain environment created by of high levels of product returns from online retailing coupled with growing pressure to reduce carbon emissions.

A case study approach attempts to optimize the distribution centre (DC) location decision for single and double hub scenarios. A hybrid approach combining centre of gravity and mixed integer programming is established for the un-capacitated multiple allocation facility location problem. Empirical data from a major national UK retail distributor network is used to validate the model.

The paper develops a contemporary model that can take into account multiple factors (e.g. operational and transportation costs and supply chain (SC) risks) while improving performance on environmental sustainability.

Based on varying product return rates, SC managers can decide whether to choose a single or a double hub solution to meet their needs. The study recommends a two hub facility location approach to mitigate emergent SC risks and disruptions.

A two-stage hybrid approach outlines a unique technique to generate candidate locations under twenty-first century conditions for new DCs.

This study aims to reduce carbon emissions and costs in an automobile production plant by improving the operational management efficiency of a serial assembly line assisted by a feeding electric tow vehicle (ETV).

A multi-objective function is formulated to minimize the energy consumption of the ETV from which emissions and costs are measured. First, a mixed-integer linear programming model is used to solve the feeding problem for different sizes of the assembly line. Second, a bi-objective optimization (HBOO) model is used to simultaneously minimize the most eco-efficient objectives: the number of completed runs (tours) by the ETV along the assembly line, and the number of visits (stops) made by the ETV to deliver kits of components to workstations.

The most eco-efficient strategy is always the bi-objective optimal solution regardless of the size of the assembly line, whereas, for single objectives, the optimization strategy differs depending on the size of the assembly line.

Instances of the problem are randomly generated to reproduce real conditions of a particular automotive factory according to a previous case study. The optimization procedure allows managers to assess real scenarios improving the assembly line eco-efficiency. These results promote the implementation of automated control of feeding processes in green manufacturing.

The HBOO-model assesses the assembly line performance with a view to reducing the environmental impact effectively and contributes to reducing the existent gap in the literature. The optimization results define key strategies for manufacturing industries eager to integrate battery-operated motors or to address inefficient traffic of automated transport to curb the carbon footprint.

The purpose of this paper is to provide feasible and fast solutions for the multi-objective airport gate assignment problem (AGAP) considering both passenger-oriented and airline-oriented objectives, which is the total walking distance from gate to baggage carousels (TWD) and the total aircraft fuel consumption during taxi operations (TFC). In addition, obtaining feasible and near-optimal solutions in a short time reduces the gate planning time to be spent by air traffic controllers.

The mixed integer linear programming (MILP) approach is implemented to solve the multi-objective AGAP. The weighted sum approach technique was applied in the model to obtain non-dominated solutions. Because of the complexity of the problem, the simulated annealing (SA) algorithm was used for the proposed model. The results were compared with baseline results, which were obtained from the algorithm using the fastest gate assignment and baggage carousel combinations without any conflict taking place at the gate assignments.

The proposed model noticeably decreased both the TWD and TFC. The improvement of the TWD and TFC changed from 22.8% to 46.9% and from 4.7% to 7.1%, respectively, according to the priorities of the objectives. Additionally, the average number of non-dominated solutions was calculated as 6.94, which presents many feasible solutions for air traffic controllers to manage ground traffic while taking the airline and passenger objectives into consideration.

The proposed MILP model includes the objectives of different stakeholders: air traffic controllers, passengers and airlines. In addition, the proposed model can provide feasible gate and baggage carousel assignments together in a short time. Therefore, the model creates a flexibility for air traffic controllers to re-arrange assignments if any unexpected situations take place.

The proposed MILP model combines the TWD and TFC together for the AGAP problem using the SA. Moreover, the proposed model integrates passenger-oriented and airline-oriented objectives together and reveals the relationships between the objectives in only a short time.