Search results

The purpose of this study is to solve the problem of healthcare waste management in developing countries. The buildup of medical waste has attracted the attention of all spheres of society due to the expanding population and developing economy. Timely collection and processing of medical waste are extremely important due to its potential hazards. Although the problem of planning medical waste management has been addressed in developed countries, it persists in several developing countries. This research is motivated by an example of a city in India characterized by a dense population, abundant health-care facilities and a lack of planning for managing large medical waste generated daily.

The authors address the problem of designing the network of collection and processing facilities for medical waste and optimizing the vehicle route that collects and transfers the waste between facilities. Due to distinct topographic restrictions in the considered city, the collection and transfer process needs to be conducted in two echelons – from hospitals to collection centers using smaller vehicles and then to the processing facilities using trucks. This work addresses these two problems as a two-echelon location-routing problem.

A mixed-integer programming model is developed to minimize the cost of opening the facilities and transporting medical waste. Several managerial insights are drawn up to assist planners and decision-makers.

This study follows a case study approach to provide a descriptive and prescriptive approach to hospital waste management in the ancient city of Varanasi. The city has witnessed unplanned growth over the years and is densely populated. The health-care facilities in the city have a large catchment area and attract patients from neighboring districts. The situation analysis based on secondary data and unstructured interviews of the stakeholders suggests that the ad hoc approach prevails in present hospital waste management in the city.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

This study presents a systematic literature review (SLR) of the interdisciplinary literature on drones in last-mile delivery (LMD) to extrapolate pertinent insights from and into the logistics management field.

Rooting their analytical categories in the LMD literature, the authors performed a deductive, theory refinement SLR on 307 interdisciplinary journal articles published during 2015–2022 to integrate this emergent phenomenon into the field.

The authors derived the potentials, challenges and solutions of drone deliveries in relation to 12 LMD criteria dispersed across four stakeholder groups: senders, receivers, regulators and societies. Relationships between these criteria were also identified.

This review contributes to logistics management by offering a current, nuanced and multifaceted discussion of drones' potential to improve the LMD process together with the challenges and solutions involved.

The authors provide logistics managers with a holistic roadmap to help them make informed decisions about adopting drones in their delivery systems. Regulators and society members also gain insights into the prospects, requirements and repercussions of drone deliveries.

This is one of the first SLRs on drone applications in LMD from a logistics management perspective.

To assess the introduction and performance of light electric freight vehicles (LEFVs), more specifically cargo cycles in major 3PL organizations in at least two Nordic countries.

Case studies. Interviews. Company data on performance before as well as after the introduction. Study of differing business models as well as operational setups.

The results from the studied cases show that LEFVs can compete with conventional vans in last mile delivery operations of e-commerce parcels. We account for when this might be the case, during which circumstances and why.

Inherent limitations of the case study approach, specifically on generalization. Future research to include more public–private partnership and multi-actor approach for scalability.

Adding to knowledge on the public sector facilitation necessary to succeed with implementation and identifying cases in which LEFVs might offer efficiency gains over more traditional delivery vehicles.

One novelty is the access to detailed data from before the implementation of new vehicles and the data after the implementation. A fair comparison is made possible by the operational structure, area of delivery, number of customers, customer density, type of packages, and to some extent, the number of packages being quite similar. Additionally, we provide data showing how city hubs can allow cargo cycles to work synergistically with delivery vans. This is valuable information for organizations thinking of trying LEFVs in operations as well as municipalities/local authorities that are interested.

The purpose of this paper is to explore and disseminate knowledge about quantum-inspired computing technology's potential to solve complex challenges faced by the operational agility capability in Industry 4.0 manufacturing and logistics operations.

A multi-case study approach is used to determine the impact of quantum-inspired computing technology in manufacturing and logistics processes from the supplier perspective. A literature review provides the basis for a framework to identify a set of flexibility and agility operational capabilities enabled by Industry 4.0 Information and Digital Technologies. The use cases are analyzed in depth, first individually and then jointly.

Study results suggest that quantum-inspired computing technology has the potential to harness and boost companies' operational flexibility to enhance operational agility in manufacturing and logistics operations management, particularly in the Industry 4.0 context. An exploratory model is proposed to explain the relationships between quantum-inspired computing technology and the deployment of operational agility capabilities.

This is study explores the use of quantum-inspired computing technology in Industry 4.0 operations management and contributes to understanding its potential to enable operational agility capability in manufacturing and logistics operations.

Ensuring the safety of structures is important. However, when a structure possesses both an implicit performance function and an extremely small failure probability, traditional methods struggle to conduct a reliability analysis. Therefore, this paper proposes a reliability analysis method aimed at enhancing the efficiency of rare event analysis, using the widely recognized Relevant Vector Machine (RVM).

Drawing from the principles of importance sampling (IS), this paper employs Harris Hawks Optimization (HHO) to ascertain the optimal design point. This approach not only guarantees precision but also facilitates the RVM in approximating the limit state surface. When the U learning function, designed for Kriging, is applied to RVM, it results in sample clustering in the design of experiment (DoE). Therefore, this paper proposes a FU learning function, which is more suitable for RVM.

Three numerical examples and two engineering problem demonstrate the effectiveness of the proposed method.

By employing the HHO algorithm, this paper innovatively applies RVM in IS reliability analysis, proposing a novel method termed RVM-HIS. The RVM-HIS demonstrates exceptional computational efficiency, making it eminently suitable for rare events reliability analysis with implicit performance function. Moreover, the computational efficiency of RVM-HIS has been significantly enhanced through the improvement of the U learning function.

Untimely responses to emergency situations in urban areas contribute to a rising mortality rate and impact society's primary capital. The efficient dispatch and relocation of ambulances pose operational and momentary challenges, necessitating an optimal policy based on the system's real-time status. While previous studies have addressed these concerns, limited attention has been given to the optimal allocation of technicians to respond to emergency situation and minimize overall system costs.

In this paper, a bi-objective mathematical model is proposed to maximize system coverage and enable flexible movement across bases for location, dispatch and relocation of ambulances. Ambulances relocation involves two key decisions: (1) allocating ambulances to bases after completing services and (2) deciding to change the current ambulance location among existing bases to potentially improve response times to future emergencies. The model also considers the varying capabilities of technicians for proper allocation in emergency situations.

The Augmented Epsilon-Constrained (AEC) method is employed to solve the proposed model for small-sized problem. Due to the NP-Hardness of the model, the NSGA-II and MOPSO metaheuristic algorithms are utilized to obtain efficient solutions for large-sized problems. The findings demonstrate the superiority of the MOPSO algorithm.

This study can be useful for emergency medical centers and healthcare companies in providing more effective responses to emergency situations by sending technicians and ambulances.

In this study, a two-objective mathematical model is developed for ambulance location and dispatch and solved by using the AEC method as well as the NSGA-II and MOPSO metaheuristic algorithms. The mathematical model encompasses three primary types of decision-making: (1) Allocating ambulances to bases after completing their service, (2) deciding to relocate the current ambulance among existing bases to potentially enhance response times to future emergencies and (3) considering the diverse abilities of technicians for accurate allocation to emergency situations.

This paper investigates the logistics management in the e-grocery sector. It contrasts the key issues faced by practitioners and the topics addressed in the academic literature, to identify potential misalignments between research and practice and propose avenues for future efforts.

This work adopts a twofold methodological approach. From an academic perspective, a systematic literature review (SLR) is performed to define the topics addressed so far by scholars when analysing e-grocery logistics. From a managerial perspective, a Delphi study is accomplished to identify the most significant issues faced by logistics practitioners in the e-grocery context and the associated significance.

The study develops a conceptual framework, identifying and mapping the 9 main logistics challenges for e-grocery along 4 clusters, in the light of a logistics-related revision of the SCOR model: distribution network design (area to be served, infrastructures), order fulfilment process (picking, order storage, consolidation, delivery), logistics-related choices from other domains (product range, stock-out management) and automation. These elements are discussed along three dimensions: criticalities, basic and advanced/automation-based solutions. Finally, the main gaps are identified – in terms of both under-investigated topics (order storage and stock-out management) and investigated topics needing further research (picking and automation) – and research questions and hypotheses are outlined.

This paper provides a threefold contribution, revolving around the developed framework. First, it investigates the state of the art about e-grocery logistics, classifying the addressed themes. Second, it explores the main issues e-grocery introduces for logistics practitioners. Third, it contrasts the two outcomes, identifying the misalignment between research and practice, and accordingly, proposing research directions.

This study primarily aims to develop and solve an enhanced optimisation model for an assembly product multi-period inbound inventory routing problem (IRP). The many-to-one (inbound) model considers the bill of materials (BOM), supply failure risks (SFR) and customer demand uncertainty. The secondary objective is to study the influence of potential time-dependent model variables on the overall supply network costs based on a full factorial design of experiments (DOE).

A five-step solution approach is proposed to derive the optimal inventory levels, best sourcing strategy and vehicle route plans for a multi-period discrete manufacturing product assembly IRP. The proposed approach considers an optimal risk mitigation strategy by considering less risk-prone suppliers to deliver the required components in a specific period. A mixed-integer linear programming formulation was solved to derive the optimal supply network costs.

The simulation results indicate that lower demand variation, lower component price and higher supply capacity can provide superior cost performance for an inbound supply network. The results also demonstrate that increasing supply capacity does not necessarily decrease product shortages. However, when demand variation is high, product shortages are reduced at the expense of the supply network cost.

A two-echelon supply network for a single assembled discrete product with homogeneous vehicle fleet availability was considered in this study.

The proposed multi-period inbound IRP model considers realistic SFR, customer demand uncertainties and product assembly requirements based on a specific BOM. The mathematical model includes various practical aspects, such as supply capacity constraints, supplier management costs and target service-level requirements. A sensitivity analysis based on a full factorial DOE provides new insights that can aid practitioners in real-life decision-making.

Pre-positioning and distributing relief items are important parts of disaster management as it simultaneously considers activities from both pre- and post-disaster stages. This study aims to address this problem with a novel mathematical model.

In this research, a bi-objective mixed-integer linear programming model is developed to tackle pre-positioning and distributing relief items, and it is formulated as an integrated location-allocation-routing problem with uncertain parameters. The humanitarian supply chain consists of relief facilities (RFs) and demand points (DPs). Perishable and imperishable relief commodities (RCs), different types of vehicles, different transportation modes, a time window for delivering perishable commodities and the occurrence of unmet demand are considered. A scenario-based game theory is applied for purchasing RCs from different suppliers and an integrated best-worst method-technique for order of preference by similarity to ideal solution technique is implemented to determine the importance of DPs. The proposed model is used to solve several random test problems for verification, and to validate the model, Iran’s flood in 2019 is investigated as a case study for which useful managerial insights are provided.

Managers can effectively adjust their preferences towards response time and total cost of the network and use sensitivity analysis results in their decisions.

The model locates RFs, allocates DPs to RFs in the pre-disaster stage, and determines the routing of RCs from RFs to DPs in the post-disaster stage with respect to minimizing total costs and response time of the humanitarian logistics network.