Search results
1 – 10 of 345Anne Stouby Persson and Line Revsbæk
This paper aims to answer report how mentors who onboard newcomers to a high-stress social work organization can learn about their onboarding practice by treating onboarding as a…
Abstract
Purpose
This paper aims to answer report how mentors who onboard newcomers to a high-stress social work organization can learn about their onboarding practice by treating onboarding as a wicked problem that escapes definitive formulation and final solutions.
Design/methodology/approach
The authors follow an action research approach with three iterations of learning about onboarding with mentors in a Danish social work organization struggling with an employee turnover exceeding 30%.
Findings
The authors unfold the authors’ emerging sensitivity to wickedity over the iterations of learning about onboarding with the mentors. As the authors foreground the wickedity of the authors onboarding in the last iteration, three lessons learned could be derived: it warrants the mentors’ continuous inquiry; opens inquiry into the ambivalence of mentoring; and convenes responsibility for inquiry to a community of mentors.
Research limitations/implications
This study of problematic onboarding to high-stress social work shows the value of fore-grounding wickedity instead of hiding it with a positive framing. This wickedity rests on situated grounding and is only transferrable to other organizations with the utmost caution.
Practical implications
High-stress social work organizations without the capacity to systematically sustain best practices for onboarding may, instead, increase attention to the wickedity of onboarding as a motivation for continuous inquiry by a broader community of mentors.
Originality/value
To the best of the authors’ knowledge, this paper is the first to present an action research study of problem wickedity to motivate mentors’ inquiry into onboarding newcomers to high-stress social work.
Details
Keywords
Jonan Phillip Donaldson, Ahreum Han, Shulong Yan, Seiyon Lee and Sean Kao
Design-based research (DBR) involves multiple iterations, and innovations are needed in analytical methods for understanding how learners experience a learning experience in ways…
Abstract
Purpose
Design-based research (DBR) involves multiple iterations, and innovations are needed in analytical methods for understanding how learners experience a learning experience in ways that both embrace the complexity of learning and allow for data-driven changes to the design of the learning experience between iterations. The purpose of this paper is to propose a method of crafting design moves in DBR using network analysis.
Design/methodology/approach
This paper introduces learning experience network analysis (LENA) to allow researchers to investigate the multiple interdependencies between aspects of learner experiences, and to craft design moves that leverage the relationships between struggles, what worked and experiences aligned with principles from theory.
Findings
The use of network analysis is a promising method of crafting data-driven design changes between iterations in DBR. The LENA process developed by the authors may serve as inspiration for other researchers to develop even more powerful methodological innovations.
Research limitations/implications
LENA may provide design-based researchers with a new approach to analyzing learner experiences and crafting data-driven design moves in a way that honors the complexity of learning.
Practical implications
LENA may provide novice design-based researchers with a structured and easy-to-use method of crafting design moves informed by patterns emergent in the data.
Originality/value
To the best of the authors’ knowledge, this paper is the first to propose a method for using network analysis of qualitative learning experience data for DBR.
Details
Keywords
Sanaz Khalaj Rahimi and Donya Rahmani
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…
Abstract
Purpose
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.
Design/methodology/approach
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.
Findings
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.
Originality/value
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.
Details
Keywords
Samrat Gupta and Swanand Deodhar
Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is…
Abstract
Purpose
Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.
Design/methodology/approach
The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.
Findings
Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.
Research limitations/implications
The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.
Practical implications
This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al., 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al., 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.
Social implications
The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al., 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al., 2014; Zhang et al., 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.
Originality/value
This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.
Details
Keywords
Yahao Wang, Zhen Li, Yanghong Li and Erbao Dong
In response to the challenge of reduced efficiency or failure of robot motion planning algorithms when faced with end-effector constraints, this study aims to propose a new…
Abstract
Purpose
In response to the challenge of reduced efficiency or failure of robot motion planning algorithms when faced with end-effector constraints, this study aims to propose a new constraint method to improve the performance of the sampling-based planner.
Design/methodology/approach
In this work, a constraint method (TC method) based on the idea of cross-sampling is proposed. This method uses the tangent space in the workspace to approximate the constrained manifold pattern and projects the entire sampling process into the workspace for constraint correction. This method avoids the need for extensive computational work involving multiple iterations of the Jacobi inverse matrix in the configuration space and retains the sampling properties of the sampling-based algorithm.
Findings
Simulation results demonstrate that the performance of the planner when using the TC method under the end-effector constraint surpasses that of other methods. Physical experiments further confirm that the TC-Planner does not cause excessive constraint errors that might lead to task failure. Moreover, field tests conducted on robots underscore the effectiveness of the TC-Planner, and its excellent performance, thereby advancing the autonomy of robots in power-line connection tasks.
Originality/value
This paper proposes a new constraint method combined with the rapid-exploring random trees algorithm to generate collision-free trajectories that satisfy the constraints for a high-dimensional robotic system under end-effector constraints. In a series of simulation and experimental tests, the planner using the TC method under end-effector constraints efficiently performs. Tests on a power distribution live-line operation robot also show that the TC method can greatly aid the robot in completing operation tasks with end-effector constraints. This helps robots to perform tasks with complex end-effector constraints such as grinding and welding more efficiently and autonomously.
Details
Keywords
Nirodha Fernando, Kasun Dilshan T.A. and Hexin (Johnson) Zhang
The Government’s investment in infrastructure projects is considerably high, especially in bridge construction projects. Government authorities must establish an initial…
Abstract
Purpose
The Government’s investment in infrastructure projects is considerably high, especially in bridge construction projects. Government authorities must establish an initial forecasted budget to have transparency in transactions. Early cost estimating is challenging for Quantity Surveyors due to incomplete project details at the initial stage and the unavailability of standard cost estimating techniques for bridge projects. To mitigate the difficulties in the traditional preliminary cost estimating methods, there is a requirement to develop a new initial cost estimating model which is accurate, user friendly and straightforward. The research was carried out in Sri Lanka, and this paper aims to develop the artificial neural network (ANN) model for an early cost estimate of concrete bridge systems.
Design/methodology/approach
The construction cost data of 30 concrete bridge projects which are in Sri Lanka constructed within the past ten years were trained and tested to develop an ANN cost model. Backpropagation technique was used to identify the number of hidden layers, iteration and momentum for optimum neural network architectures.
Findings
An ANN cost model was developed, furnishing the best result since it succeeded with around 90% validation accuracy. It created a cost estimation model for the public sector as an accurate, heuristic, flexible and efficient technique.
Originality/value
The research contributes to the current body of knowledge by providing the most accurate early-stage cost estimate for the concrete bridge systems in Sri Lanka. In addition, the research findings would be helpful for stakeholders and policymakers to propose policy recommendations that positively influence the prediction of the most accurate cost estimate for concrete bridge construction projects in Sri Lanka and other developing countries.
Details
Keywords
Jianlan Zhong, Han Cheng and Fu Jia
Despite its crucial role in ensuring food safety, traceability remains underutilized by small and medium-sized enterprises (SMEs), a vital component of China’s agricultural supply…
Abstract
Purpose
Despite its crucial role in ensuring food safety, traceability remains underutilized by small and medium-sized enterprises (SMEs), a vital component of China’s agricultural supply chain, thereby compromising the integrity of the supply chain traceability system. Therefore, this study sets out to explore the factors influencing SMEs’ adoption of traceability systems and the impact of these factors on SMEs’ intent to adopt such systems. Furthermore, the study presents a model to deepen understanding of system adoption in SMEs and provides a simulation demonstrating the evolutionary trajectory of adoption behavior.
Design/methodology/approach
This study considers the pivotal aspects of system adoption in SMEs, aiming to identify the influential factors through a grounded theory-based case study. Concurrently, it seeks to develop a mathematical model for SMEs’ adoption patterns and simulate the evolution of SMEs’ adoption behaviors using the Q-learning algorithm.
Findings
The adoption of traceability among SMEs is significantly influenced by factors such as system attributes, SMEs’ capability endowment, environmental factors and policy support and control. However, aspects of the SMEs’ capability endowment, specifically their learning rate and decay rate, have minimal impact on the adoption process. Furthermore, group pressure can expedite the attainment of an equilibrium state, wherein all SMEs adopt the system.
Originality/value
This study fills the existing knowledge gap about the adoption of traceability by SMEs in China’s agricultural supply chain. This study represents the pioneer study that identifies the factors influencing SMEs’ adoption and examines the effects of these factors on their traceability adoption, employing a multi-methodological approach that incorporates grounded theory, mathematical modeling and the Q-learning algorithm.
Details
Keywords
Huijuan Zhou, Rui Wang, Dongyang Weng, Ruoyu Wang and Yaoqin Qiao
The interruption event will seriously affect the normal operation of urban rail transit lines,causing a large number of passengers to be stranded in the station and even making…
Abstract
Purpose
The interruption event will seriously affect the normal operation of urban rail transit lines,causing a large number of passengers to be stranded in the station and even making the train stranded in the interval between stations. This study aims to reduce the impact of interrupt events and improve service levels.
Design/methodology/approach
To address this issue, this paper considers the constraints of train operation safety, capacity and dynamic passenger flow demand. It proposes a method for adjusting small loops during interruption events and constructs a train operation adjustment model with the objective of minimizing the total passenger waiting time. This model enables the rapid development of train operation plans in interruption scenarios, coordinating train scheduling and line resources to minimize passenger travel time and mitigate the impact of interruptions. Regarding the proposed train operation adjustment model, an improved genetic algorithm (GA) is designed to solve it.
Findings
The model and algorithm are applied to a case study of interruption events on Beijing Subway Line 5. The results indicate that after solving the constructed model, the train departure intervals can be maintained between 1.5 min and 3 min. This ensures both the safety of train operations on the line and a good match with passengers’ travel demands, effectively reducing the total passenger waiting time and improving the service level of the urban rail transit system during interruptions. Compared to the GA algorithm, the algorithm proposed in this paper demonstrates faster convergence speed and better computational results.
Originality/value
This study explicitly outlines the adjustment method of using short-turn operation during operational interruptions, with train departure times and station stop times as decision variables. It takes into full consideration safety constraints on train operations, train capacity constraints and dynamic passenger demand. It has constructed a train schedule optimization model with the goal of minimizing the total waiting time for all passengers in the system.
Details
Keywords
This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.
Abstract
Purpose
This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.
Design/methodology/approach
In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.
Findings
The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.
Originality/value
In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.
Details
Keywords
Pham Duc Tai, Krit Jinawat and Jirachai Buddhakulsomsiri
Distribution network design involves a set of strategic decisions in supply chains because of their long-term impacts on the total logistics cost and environment. To incorporate a…
Abstract
Purpose
Distribution network design involves a set of strategic decisions in supply chains because of their long-term impacts on the total logistics cost and environment. To incorporate a trade-off between financial and environmental aspects of these decisions, this paper aims to determine an optimal location, among candidate locations, of a new logistics center, its capacity, as well as optimal network flows for an existing distribution network, while concurrently minimizing the total logistics cost and gas emission. In addition, uncertainty in transportation and warehousing costs are considered.
Design/methodology/approach
The problem is formulated as a fuzzy multiobjective mathematical model. The effectiveness of this model is demonstrated using an industrial case study. The problem instance is a four-echelon distribution network with 22 products and a planning horizon of 20 periods. The model is solved by using the min–max and augmented ε-constraint methods with CPLEX as the solver. In addition to illustrating model’s applicability, the effect of choosing a new warehouse in the model is investigated through a scenario analysis.
Findings
For the applicability of the model, the results indicate that the augmented ε-constraint approach provides a set of Pareto solutions, which represents the ideal trade-off between the total logistics cost and gas emission. Through a case study problem instance, the augmented ε-constraint approach is recommended for similar network design problems. From a scenario analysis, when the operational cost of the new warehouse is within a specific fraction of the warehousing cost of third-party warehouses, the solution with the new warehouse outperforms that without the new warehouse with respective to financial and environmental objectives.
Originality/value
The proposed model is an effective decision support tool for management, who would like to assess the impact of network planning decisions on the performance of their supply chains with respect to both financial and environmental aspects under uncertainty.
Details