Search results

The next generation of mobility is arising, and various challenging mobilities have entered the limelight. One of the most exciting of these is urban air mobility (UAM), and one of its challenges is constructing effective and efficient UAM service network. This study took a quantitative approach to the problem in an effort to support and facilitate the UAM service industry.

This study derived a multi-objective and multi-period (MOMP) location optimization model to support strategic UAM service network design. The model, based on its long-term service plan, determines where and when to open UAM airports. In addition, this study applied a modified e-constraint algorithm to derive managerial decisions on the Pareto relationship in consideration of multiple objectives and multiple periods.

Each Pareto solution represents a different UAM service network configuration. Thus, the model can analyze the trade-offs between Pareto decisions for the UAM service network. A case study of UAM service network design in South Korea demonstrates the validity of the proposed mathematical model and algorithm.

The design of a UAM service network should consider various aspects. Its construction and operation would require significant investments of time, capital and people, which would redound to society over a significant span of time. The results of this study provide quantitative guidelines for derivation and analysis of various UAM service network configurations in consideration of multiple objectives and multiple periods.

This paper proposes MOMP optimization, which approach is suitable to the fundamental characteristics of expanding UAM service networks and their design. It is expected that the present study will make significant contributions to the efforts of those deriving and analyzing future UAM service networks.

Efficient management of earthmoving equipment is critical for decision-makers in construction engineering management. Thus, the purpose of this paper is to prudently identify, select, manage and optimize the associated decision variables (e.g. capacity, number and speed) for trucks and loaders equipment to minimize cost and time objectives.

This paper addresses an innovative multiobjective and multivariable mathematical optimization model to generate a Pareto-optimality set of solutions that offers insights of optimal tradeoffs between minimizing earthmoving activity’s cost and time. The proposed model has three major stages: first, define all related decision variables for trucks and loaders and detect all related constraints that affect the optimization model; second, derive the mathematical optimization model and apply the multiobjective genetic algorithms and classify all inputs and outputs related to the mathematical model; and third, model validation.

The efficiency of the proposed optimization model has been validated using a case study of earthmoving activities based on data collected from the real-world construction site. The outputs of the conducted optimization process promise the model’s originality and efficiency in generating optimal solutions for optimal time and cost objectives.

This model provides the decision-maker with an efficient tool to select the optimal design variables to minimize the activity's time and cost.

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.

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.

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.

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.

Although disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.

The epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.

The effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.

In this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

By introducing the mass customization service mode into the cloud logistics environment, this paper studies the joint optimization of service provider selection and customer order decoupling point (CODP) positioning based on the mass customization service mode to provide customers with more diversified and personalized service content with lower total logistics service cost.

This paper addresses the general process of service composition optimization based on the mass customization mode in a cloud logistics service environment and constructs a joint decision model for service provider selection and CODP positioning. In the model, the two objective functions of minimum service cost and most satisfactory delivery time are considered, and the Pareto optimal solution of the model is obtained via the NSGA-II algorithm. Then, a numerical case is used to verify the superiority of the service composition scheme based on the mass customization mode over the general scheme and to verify the significant impact of the scale effect coefficient on the optimal CODP location.

(1) Under the cloud logistics mode, the implementation of the logistics service mode based on mass customization can not only reduce the total cost of logistics services by means of the scale effect of massive orders on the cloud platform but also make more efficient use of a large number of logistics service providers gathered on the cloud platform to provide customers with more customized and diversified service content. (2) The scale effect coefficient directly affects the total cost of logistics services and significantly affects the location of the CODP. Therefore, before implementing the mass customization logistics service mode, the most reasonable clustering of orders on the cloud logistics platform is very important for the follow-up service combination.

The originality of this paper includes two aspects. One is to introduce the mass customization mode in the cloud logistics service environment for the first time and summarize the operation process of implementing the mass customization mode in the cloud logistics environment. Second, in order to solve the joint decision optimization model of provider selection and CODP positioning, this paper designs a method for solving a mixed-integer nonlinear programming model using a multi-layer coding genetic algorithm.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.

The purpose of this paper is to consider three factors, namely, intra-week demand fluctuations, interrelationship between the number of robots and order scheduling and conflicting objectives (i.e. cost minimization and customer satisfaction maximization), to optimize the robot logistics system.

The number of robots and the sequence of delivery orders are first optimized using the heuristic algorithm NSGACoDEM, which is designed using genetic algorithm and composite difference evolution. The superiority of this method is then confirmed by a case study of a four-star grade hotel in South Korea and several comparative experiments.

Two performance metrics reveal the superior performance of the proposed approach compared to other baseline approaches. Results of comparative experiments found that the consideration of three influencing factors in the operation design of a robot logistic system can effectively balance cost and customer satisfaction over the course of a week in hotel operation and optimize robot scheduling flexibility.

The results of this study reveal that numerous factors (e.g. intra-week demand fluctuations) can optimize the performance efficiency of robots. The proposed algorithm can be used by hotels to overcome the influence of intra-week demand fluctuations on robot scheduling flexibility effectively and thereby enhance work efficiency.

The design of a novel algorithm in this study entails enhancing the current robot logistics system. This algorithm can successfully manage cost and customer satisfaction during off-seasons and peak seasons in the hotel industry while offering diversified schemes to various types of hotels.

This paper aims to extend the Shapley value (SV) into a discussion of Zakat, a Pillar of Islam. Lloyd Shapley was awarded the Nobel Prize in Economics in 2012. This study shows that their relationship is significant for all nations, that of levelling up. An important but neglected paper by Datta (1939) showed insights provided by the Power Law, or as it is sometimes called, the Pareto distribution, into the role of Zakat in raising the income of all above the subsistence level. The Pareto distribution describes the prevailing tendency. The SV illustrates the interdependence perspective of Zakat with the Pareto distribution, wealth, income and poverty. Payoffs apply equally to both givers and receivers. For this study’s purposes, payoffs are considered as transferable utilities. They are formed by individuals who willingly cooperate in society rather than atomistic individuals who act independently. Zakat represents the recognition that society needs to be cooperative rather than individualistic; people cooperate in groups or societies to create value. SV implications and axioms are evaluated with an illustration.

This study extends Datta’s approach by introducing distribution weights into the SV. The authors set out the concept of weighted Shapley values that retain the elements of randomness and marginal contribution to a coalition contained in pure/true SVs and weights that follow a ley-Pareto distribution. This paper is a viewpoint work that relies primarily on the author’s qualitative interpretation.

The findings indicate that individual members of a coalition make multiple contributions that are often unrewarded. The contribution of one member of a coalition is dependent upon the contribution of others. The measure of contributions is payoffs, which have both monetary and non-monetary aspects; transferable payoffs or utilities are usually assumed. Furthermore, the significant agents in society or an organisation are stakeholders rather than the usual categories: managers, staff, shareholders, etc.

Contextualising these concepts within the Islamic values and principles that guide Zakat administration is crucial to ensure that the distribution of Zakat funds is fair, equitable and meets the needs of all eligible recipients. By applying these concepts appropriately, Zakat administrators can ensure that the Zakat system functions effectively and fulfils its religious obligation.

The novelty of this paper is that it blends the SV and the idea behind Zakat by introducing the idea of alternatives of Shapley weights. The link between the institution of Zakat and SV in terms of equality, poverty elimination and wealth distribution should be at the top of the research agenda.

The purpose of this study is to propose a new mathematical model that integrates strategic decision-making with tactical-operational decision-making in order to optimize production and scheduling decisions.

This study presents a multi-objective optimization framework to make production planning, scheduling and maintenance decisions. An epsilon-constraint method is used to solve small instances of the model, while new hybrid optimization algorithms, including multi-objective particle swarm optimization (MOPSO), non-dominated sorting genetic algorithm, multi-objective harmony search and improved multi-objective harmony search (IMOHS) are developed to address the high complexity of large-scale problems.

The computational results demonstrate that the metaheuristic algorithms are effective in obtaining economic solutions within a reasonable computational time. In particular, the results show that the IMOHS algorithm is able to provide optimal Pareto solutions for the proposed model compared to the other three algorithms.

This study presents a new mathematical model that simultaneously determines green production planning and scheduling decisions by minimizing the sum of the total cost, makespan, lateness and energy consumption criteria. Integrating production and scheduling of a shop floor is critical for achieving optimal operational performance in production planning. To the best of the authors' knowledge, the integration of production planning and maintenance has not been adequately addressed.

This study aims to investigate the feasibility of employing a multi-objectives integer-programming model for effective allocation of resources for cyberfraud mitigation. The formulated objectives are the minimisation of the total allocation cost of the anti-fraud capacities and the maximisation of the forensic accounting capacities in all cyberfraud incident prone spots.

From the literature survey conducted and primary qualitative data gathered from the 17 licenced banks in South Africa on fraud investigators, the suggested fraud investigators are the organisation’s finance department, the internal audit committee, the external risk manager, accountants and forensic accountants. These five human resource capacities were considered for the formulation of the multi-objectives integer programming (MOIP) model. The MOIP model is employed for the optimisation of the employed capacities for cyberfraud mitigation to ensure the effective allocation and utilisation of human resources. Thus, the MOIP model is validated by a genetic algorithm (GA) solver to obtain the Pareto-optimum solution without the violation of the identified constraints.

The formulated objective functions are optimised simultaneously. The Pareto front for the two objectives of the MOIP model comprises the set of optimal solutions, which are not dominated by any other feasible solution. These are the feasible choices, which indicate the suitability of the MOIP to achieve the set objectives.

The results obtained indicate the feasibility of simultaneously achieving the minimisation of the total allocation cost of the anti-fraud capacities, or the maximisation of the forensic accounting capacities in all cyberfraud incident prone spots – or the trade-off between them, if they cannot be reached simultaneously. This study recommends the use of an iterative MOIP framework for decision-makers which may aid decision-making with respect to the allocation and utilisation of human resources.

The originality of this work lies in the development of multi-objectives integer-programming model for effective allocation of resources for cyberfraud mitigation.