Search results

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

The purpose of this study is to formulate an algorithm designed to discern the optimal routes for efficient municipal solid waste (MSW) collection.

The research method is simulation. The proposed algorithm combines heuristics derived from the constructive genetic algorithm (CGA) and tabu search (TS). The algorithm is applied in a municipality located at Southern Brazil, with 40,000 inhabitants, circa.

The implementation achieved a remarkable 25.44% reduction in daily mileage of the vehicles, resulting in savings of 150.80 km/month and 1,809.60 km/year. Additionally, it reduced greenhouse gas emissions (including fossil CO₂, CH₄, N₂O, total CO₂e and biogenic CO₂) by an average of 26.15%. Moreover, it saved 39 min of daily working time.

Further research should thoroughly analyze the feasibility of decision-making regarding planning, scheduling and scaling municipal services using digital technology.

The municipality now has a tool to improve public management, mainly related with municipal solid waste. The municipality reduced the cost of public management of municipal solid waste, redirecting funds to other priorities, such as public health and education.

The study integrates MSW collection service with an online platform based on Google MapsTM. The advantages of employing geographical information systems are agility, low cost, adaptation to changes and accuracy.

Time-cost trade-off is normal conduct in construction projects when projects are expectedly late for delivery. Existing research on time-cost trade-off strategic management mostly focused on the technical calculation towards the optimal combination of activities to be accelerated, while the managerial aspects are mostly neglected. This paper aims to understand the managerial efforts necessary to prepare construction projects ready for an upcoming trade-off implementation.

A preliminary list of critical factors was first identified from the literature and verified by a Delphi survey. Quantitative data was then collected by a questionnaire survey to first shortlist the preliminary factors and quantify the predictive model with different machine learning algorithms, i.e. k-nearest neighbours (kNN), radial basis function (RBF), multiplayer perceptron (MLP), multinomial logistic regression (MLR), naïve Bayes classifier (NBC) and Bayesian belief networks (BBNs).

The model's independent variable importance ranking revealed that the top challenges faced were the realism of contractual obligation, contractor planning and control and client management and monitoring. Among the tested machine learning algorithms, multilayer perceptron was demonstrated to be the most suitable in this case. This model accuracy reached 96.5% with the training dataset and 95.6% with an independent test dataset and could be used as the contingency approach for time-cost trade-offs.

The identified factor list contributed to the theoretical explanation of the failed implementation in general and practical managerial improvement to better avoid such failure. In addition, the established predictive model provided an ad-hoc early warning and diagnostic tool to better ensure time-cost implementation success.

The target of this research is to develop a mathematical model which combines the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and the Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP). Due to the importance of resource management, the proposed formulation comprises resource leveling considerations as well. The model aims to simultaneously optimize: (1) the total time to accomplish all projects and (2) the total deviation of resource consumptions from the uniform utilization levels.

The K-Means (KM) and Fuzzy C-Means (FCM) clustering methods have been separately applied to discover the clusters of activities which have the most similar resource demands. The discovered clusters are given to the scheduling process as priori knowledge. Consequently, the execution times of the activities with the most common resource requests will not overlap. The intricacy of the problem led us to incorporate the KM and FCM techniques into a meta-heuristic called the Bi-objective Symbiosis Organisms Search (BSOS) algorithm so that the real-life samples of this problem could be solved. Therefore, two clustering-based algorithms, namely, the BSOS-KM and BSOS-FCM have been developed.

Comparisons between the BSOS-KM, BSOS-FCM and the BSOS method without any clustering approach show that the clustering techniques could enhance the optimization process. Another hybrid clustering-based methodology called the NSGA-II-SPE has been added to the comparisons to evaluate the developed resource leveling framework.

The practical importance of the model and the clustering-based algorithms have been demonstrated in planning several construction projects, where multiple water supply systems are concurrently constructed.

Reviewing the literature revealed that there was a need for a hybrid formulation that embraces the characteristics of the RCMPSP and MSRCPSP with resource leveling considerations. Moreover, the application of clustering algorithms as resource leveling techniques was not studied sufficiently in the literature.

Vehicle allocation problems (VAPs), which are frequently confronted in many transportation activities, primarily including but not limited to full truckload freight transportation operations, induce a significant economic impact. Despite the increasing academic attention to the field, literature still fails to match the needs of and opportunities in the growing industrial practices. In particular, the literature can grow upon the ideas on sustainability, Industry 4.0 and collaboration, which shape future practices not only in logistics but also in many other industries. This review has the potential to enhance and accelerate the development of relevant literature that matches the challenges confronted in industrial problems. Furthermore, this review can help to explore the existing methods, algorithms and techniques employed to address this problem, reveal directions and generate inspiration for potential improvements.

This study provides a literature review on VAPs, focusing on quantitative models that incorporate any of the following emerging logistics trends: sustainability, Industry 4.0 and logistics collaboration.

In the literature, sustainability interactions have been limited to environmental externalities (mostly reducing operational-level emissions) and economic considerations; however, emissions generated throughout the supply chain, other environmental externalities such as waste and product deterioration, or the level of stakeholder engagement, etc., are to be monitored in order to achieve overall climate-neutral services to the society. Moreover, even though there are many types of collaboration (such as co-opetition and vertical collaboration) and Industry 4.0 opportunities (such as sharing information and comanaging distribution operations) that could improve vehicle allocation operations, these topics have not yet received sufficient attention from researchers.

The scientific contribution of this study is twofold: (1) This study analyses decision models of each reviewed article in terms of decision variable, constraint and assumption sets, objectives, modeling and solving approaches, the contribution of the article and the way that any of sustainability, Industry 4.0 and collaboration aspects are incorporated into the model. (2) The authors provide a discussion on the gaps in the related literature, particularly focusing on practical opportunities and serving climate-neutrality targets, carried out under four main streams: logistics collaboration possibilities, supply chain risks, smart solutions and various other potential practices. As a result, the review provides several gaps in the literature and/or potential research ideas that can improve the literature and may provide positive industrial impacts, particularly on how logistics collaboration may be further engaged, which supply chain risks are to be incorporated into decision models, and how smart solutions can be employed to cope with uncertainty and improve the effectiveness and efficiency of operations.

The purpose of this study is to formulate a new class of vehicle routing problem with an objective to minimise the total cost of raw material collection and derive a new approach to solve optimization problems. This study can help to select the optimum number of suppliers based on cost.

To model the raw material vehicle routing problem, a mixed integer linear programming (MILP) problem is formulated. An interesting phenomenon added to the proposed problem is that there is no compulsion to visit all suppliers. To guarantee the demand of semiconductor industry, all visited suppliers should reach a given raw material capacity requirement. To solve the proposed model, the authors developed a novel hybrid approach that is a combination of block and edge recombination approaches. To avoid bias, the authors compare the results of the proposed methodology with other known approaches, such as genetic algorithms (GAs) and ant colony optimisation (ACO).

The findings indicate that the proposed model can be useful in industries, where multiple suppliers are used. The proposed hybrid approach provides a better sequence of suppliers compared to other heuristic techniques.

The data used in the proposed model is generated based on previous literature. The problem derives from the assumption that semiconductor industries use a variety of raw materials.

This study provides a new model and approach that can help practitioners and policymakers select suppliers based on their logistics costs.

This study provides two important contributions in the context of the supply chain. First, it provides a new variant of the vehicle routing problem in consideration of raw material collection; and second, it provides a new approach to solving optimisation problems.

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.

The aim of this paper is to empirically investigate whether social contacts can mediate the way in which current unemployment impacts future unemployment.

We use 2006–2017 data from the Household Income and Labour Dynamics in Australia (HILDA) survey and a dynamic random-effects model to describe the evolution of individual unemployment status over time.

Once controlled for the local context where individuals live and create friendships, we find that above-average social contacts reduce unemployment persistence. However, social contacts seem to be slightly less effective in deprived neighborhoods. These findings are consistent with the idea that individuals obtain information about job opportunities through a network of social contacts, and unemployment may lead to a decay of social capital, making it more difficult to find employment in future periods. Our results also show that neighborhood deprivation increases individual unemployment risk, while above-average neighborhood cohesion reduces the probability of unemployment in deprived neighborhoods.

Although many studies have been published on unemployment persistence, to the best of the author's knowledge, this is the first study quantifying the impact of social contacts on unemployment persistence. The study also offers fresh empirical evidence on the impact of neighborhood characteristics on unemployment risk.

This study aims to deal with the multi-mode resource-constrained project scheduling problem (MRCPSP) with the ability to transport resources among multiple sites, aiming to minimize the total completion time and the total cost of the project simultaneously.

To deal with the problem under consideration, a bi-objective optimization model is developed. All activities are interconnected by finish-start precedence relations, and pre-emption is not allowed. Then, the ɛ-constraint optimization method is used to solve 24 different-sized instances, ranging from 5 to 120 activities, and report the makespan, total cost and CPU time. A set of Pareto-optimal solutions are determined for some instances, and sensitivity analyses are performed to find the impact of changing parameters on objective values.

Results highlight the importance of resource transportability assumption on project completion time and cost, providing useful insights for decision makers and practitioners.

A novel bi-objective optimization model is proposed to deal with the multi-site MRCPSP, considering both the cost and time of resource transportation between multiple sites. To the best of the authors’ knowledge, none of the studies in the project scheduling area has yet addressed this problem.