Search results

As the world is becoming more volatile and uncertain, organizations face much complexity in their daily operations. Further, there is a much ambiguity in business operations to achieve the effective utilization of resources. The work optimizes a novel constraint programming model approach of the utilization of shuttle services vehicle while considering cost savings, employee wellbeing and other real an Information Technology enabled service (ITES) industry constraints.

The present work considers a novel extension of the vehicle routing problem related to the shuttle service operation in an ITES industry in VUCA context. Additionally, the model considers the women safety aspects, which engages the company to provide a security guard for women employees in the night shift.

Numerical experiments were conducted on real instances data of ITES industrial partner. The results show that the vehicle utilization increased from 75% up to 96% while ensuring in parallel the wellbeing of employees and women safety during the night shift. Finally, the proposed model is converted to a decision support application allowing ITES partner to plan employees shuttle service operations efficiently.

Study has evaluated the shuttle services optimization for ITES industry using data from industrial which makes it a unique contribution to literature in shuttle operations. Further, the study used constraint programming to evaluate the vehicle utilization and security allocation, thereby introducing new parameter on security allocation in open VRP problem.

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.

Using a real-time road network combined with historical traffic data for Al-Salt city, the paper aims to propose a new federated genetic algorithm (GA)-based optimization technique to solve the dynamic vehicle routing problem. Using a GA solver, the estimated routing time for 300 chromosomes (routes) was the shortest and most efficient over 30 generations.

In transportation systems, the objective of route planning techniques has been revised from focusing on road directors to road users. As a result, the new transportation systems use advanced technologies to support drivers and provide them with the road information they need and the services they require to reduce traffic congestion and improve routing problems. In recent decades, numerous studies have been conducted on how to find an efficient and suitable route for vehicles, known as the vehicle routing problem (VRP). To identify the best route, VRP uses real-time information-acquired geographical information systems (GIS) tools.

This study aims to develop a route planning tool using ArcGIS network analyst to enhance both cost and service quality measures, taking into account several factors to determine the best route based on the users’ preferences.

Furthermore, developing a route planning tool using ArcGIS network analyst to enhance both cost and service quality measures, taking into account several factors to determine the best route based on the users’ preferences. An adaptive genetic algorithm (GA) is used to determine the optimal time route, taking into account factors that affect vehicle arrival times and cause delays. In addition, ArcGIS' Network Analyst tool is used to determine the best route based on the user's preferences using a real-time map.

This paper aims to focus on a medical goods distribution problem and pharmacological waste collection by plug-in hybrid vehicles with some real-world restrictions. In this research, considering alternative energy sources and simultaneous pickup and delivery led to a decrease in greenhouse gas emissions and distribution costs, respectively.

Here, this problem has been modeled as mixed-integer linear programming with the traveling and energy consumption costs objective function. The GAMS was used for model-solving in small-size instances. Because the problem in this research is an NP-hard problem and solving real-size problems in a reasonable time is impossible, in this study, the artificial bee colony algorithm is used.

Then, the algorithm results are compared with a simulated annealing algorithm that recently was proposed in the literature. Finally, the results obtained from the exact solution and metaheuristic algorithms are compared, analyzed and reported. The results showed that the artificial bee colony algorithm has a good performance.

In this paper, medical goods distribution with pharmacological waste collection is studied. The paper was focused on plug-in hybrid vehicles with simultaneous pickup and delivery. The problem was modeled with environmental criteria. The traveling and energy consumption costs are considered as an objective function.

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.

This study aims to minimize the transportation-related cost in distribution while utilizing a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach. An increased cost in distribution is a major problem for many companies due to the absence of efficient planning methods to overcome operational challenges in distinct distribution networks. The problem addressed in this study is to minimize the transportation-related cost in distribution while using a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach which has not gained the adequate attention in the literature.

This study formulated the transportation problem as a vehicle routing problem with a heterogeneous fixed fleet and workload balancing, which is a combinatorial optimization problem of the NP-hard category. The model was solved using both the simulated annealing and a genetic algorithm (GA) adopting distinct local search operators. A greedy approach has been used in generating an initial solution for both algorithms. The paired t-test has been used in selecting the best algorithm. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet compositions of the heterogeneous fleet. Results were analyzed using analysis of variance (ANOVA) and Hsu’s MCB methods to identify the best scenario.

The solutions generated by both algorithms were subjected to the t-test, and the results revealed that the GA outperformed in solution quality in planning a heterogeneous fleet for distribution with load balancing. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet utilization with different compositions of the heterogeneous fleet. Results were analyzed using ANOVA and Hsu’s MCB method and found that removing the lowest capacities trucks enhances the average vehicle utilization with reduced travel distance.

The developed model has considered both planning of heterogeneous fleet and the requirement of work load balancing which are very common industry needs, however, have not been addressed adequately either individually or collectively in the literature. The adopted solution methodologies to solve the NP-hard distribution problem consist of metaheuristics, statistical analysis and scenario analysis are another significant contribution. The planning of distribution operations not only addresses operational-level decision, through a scenario analysis, but also strategic-level decision has also been considered.

The planning of distribution operations not only addresses operational-level decisions, but also strategic-level decisions conducting a scenario analysis.

The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.

The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.

As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.

The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.

Every day, small and big incidents happen all over the world, and given the human, financial and spiritual damage they cause, proper planning should be sought to deal with them so they can be appropriately managed in times of crisis. This study aims to examine humanitarian supply chain models.

A new model is developed to pursue the necessary relations in an optimal way that will minimize human, financial and moral losses. In this developed model, in order to optimize the problem and minimize the amount of human and financial losses, the following subjects have been applied: magnitude of the areas in which an accident may occur as obtained by multiple attribute decision-making methods, the distances between relief centers, the number of available rescuers, the number of rescuers required and the risk level of each patient which is determined using previous data and machine learning (ML) algorithms.

For this purpose, a case study in the east of Tehran has been conducted. According to the results obtained from the algorithms, problem modeling and case study, the accuracy of the proposed model is evaluated very well.

Obtaining each injured person's priority using ML techniques and each area's importance or risk level, besides developing a bi-objective mathematical model and using multiple attribute decision-making methods, make this study unique among very few studies that concern ML in the humanitarian supply chain. Moreover, the findings validate the results and the model's functionality very well.

Despite large bodies of research related to the impacts of e-commerce on last-mile logistics and sustainability, there has been limited effort to evaluate urban freight using an equity lens. Therefore, this study proposes a modeling framework that enables researchers and planners to estimate the baseline equity performance of a major e-commerce platform and evaluate equity impacts of possible urban freight management strategies. The study also analyzes the sensitivity of various operational decisions to mitigate bias in the analysis.

The model adapts empirical methodologies from activity-based modeling, transport equity evaluation, and residential freight trip generation (RFTG) to estimate person- and household-level delivery demand and cargo van traffic exposure in 41 U.S. Metropolitan Statistical Areas (MSAs).

Evaluating 12 measurements across varying population segments and spatial units, the study finds robust evidence for racial and socio-economic inequities in last-mile delivery for low-income and, especially, populations of color (POC). By the most conservative measurement, POC are exposed to roughly 35% more cargo van traffic than white populations on average, despite ordering less than half as many packages. The study explores the model’s utility by evaluating a simple scenario that finds marginal equity gains for urban freight management strategies that prioritize line-haul efficiency improvements over those improving intra-neighborhood circulations.

Presents a first effort in building a modeling framework for more equitable decision-making in last-mile delivery operations and broader city planning.

Organisations and industries are often looking for technologies that can accomplish multiple tasks, providing economic benefits and an edge over their competitors. In this context, drones have the potential to change many industries by making operations more efficient, safer and more economic. Therefore, this study investigates the use of drones as the next step in smart/digital warehouse management to determine their socio-economic benefits.

The study identifies various enablers impacting drone applications to improve inventory management, intra-logistics, inspections and surveillance in smart warehouses through a literature review, a test of concordance and the fuzzy Delphi method. Further, the graph theory matrix approach (GTMA) method was applied to ranking the enablers of drone application in smart/digital warehouses. In the subsequent phase, researchers investigated the relation between the drone application's performance and the enablers of drone adoption using logistic regression analysis under the TOE framework.

This study identifies inventory man agement, intra-logistics, inspections and surveillance are three major applications of drones in the smart warehousing. Further, nine enablers are identified for the adoption of drone in warehouse management. The findings suggest that operational effectiveness, compatibility of drone integration and quality/value offered are the most impactful enablers of drone adoption in warehouses. The logistic regression findings are useful for warehouse managers who are planning to adopt drones in a warehouse for efficient operations.

This study identifies the enablers of drone adoption in the smart and digital warehouse through the literature review and fuzzy Delphi. Therefore, some enablers may be overlooked during the identification process. In addition to this, the analysis is based on the opinion of the expert which might be influenced by their field of expertise.

By considering technology-organisation-environment (TOE) framework warehousing companies identify the opportunities and challenges associated with using drones in a smart warehouse and develop strategies to integrate drones into their operations effectively.

This study proposes a TOE-based framework for the adoption of drones in warehouse management to improve the three prominent warehouse functions inventory management, intra-logistics, inspections and surveillance using the mixed-method.