Search results

The purpose of the paper is to propose and demonstrate a novel approach for addressing the challenges of path planning and obstacle avoidance in the context of mobile robots (MR). The specific objectives and purposes outlined in the paper include: introducing a new methodology that combines Q-learning with dynamic reward to improve the efficiency of path planning and obstacle avoidance. Enhancing the navigation of MR through unfamiliar environments by reducing blind exploration and accelerating the convergence to optimal solutions and demonstrating through simulation results that the proposed method, dynamic reward-enhanced Q-learning (DRQL), outperforms existing approaches in terms of achieving convergence to an optimal action strategy more efficiently, requiring less time and improving path exploration with fewer steps and higher average rewards.

The design adopted in this paper to achieve its purposes involves the following key components: (1) Combination of Q-learning and dynamic reward: the paper’s design integrates Q-learning, a popular reinforcement learning technique, with dynamic reward mechanisms. This combination forms the foundation of the approach. Q-learning is used to learn and update the robot’s action-value function, while dynamic rewards are introduced to guide the robot’s actions effectively. (2) Data accumulation during navigation: when a MR navigates through an unfamiliar environment, it accumulates experience data. This data collection is a crucial part of the design, as it enables the robot to learn from its interactions with the environment. (3) Dynamic reward integration: dynamic reward mechanisms are integrated into the Q-learning process. These mechanisms provide feedback to the robot based on its actions, guiding it to make decisions that lead to better outcomes. Dynamic rewards help reduce blind exploration, which can be time-consuming and inefficient and promote faster convergence to optimal solutions. (4) Simulation-based evaluation: to assess the effectiveness of the proposed approach, the design includes a simulation-based evaluation. This evaluation uses simulated environments and scenarios to test the performance of the DRQL method. (5) Performance metrics: the design incorporates performance metrics to measure the success of the approach. These metrics likely include measures of convergence speed, exploration efficiency, the number of steps taken and the average rewards obtained during the robot’s navigation.

The findings of the paper can be summarized as follows: (1) Efficient path planning and obstacle avoidance: the paper’s proposed approach, DRQL, leads to more efficient path planning and obstacle avoidance for MR. This is achieved through the combination of Q-learning and dynamic reward mechanisms, which guide the robot’s actions effectively. (2) Faster convergence to optimal solutions: DRQL accelerates the convergence of the MR to optimal action strategies. Dynamic rewards help reduce the need for blind exploration, which typically consumes time and this results in a quicker attainment of optimal solutions. (3) Reduced exploration time: the integration of dynamic reward mechanisms significantly reduces the time required for exploration during navigation. This reduction in exploration time contributes to more efficient and quicker path planning. (4) Improved path exploration: the results from the simulations indicate that the DRQL method leads to improved path exploration in unknown environments. The robot takes fewer steps to reach its destination, which is a crucial indicator of efficiency. (5) Higher average rewards: the paper’s findings reveal that MR using DRQL receive higher average rewards during their navigation. This suggests that the proposed approach results in better decision-making and more successful navigation.

The paper’s originality stems from its unique combination of Q-learning and dynamic rewards, its focus on efficiency and speed in MR navigation and its ability to enhance path exploration and average rewards. These original contributions have the potential to advance the field of mobile robotics by addressing critical challenges in path planning and obstacle avoidance.

This paper aims to present a literature review of the most recent optimisation methods applied to Credit Scoring Models (CSMs).

The research methodology employed technical procedures based on bibliographic and exploratory analyses. A traditional investigation was carried out using the Scopus, ScienceDirect and Web of Science databases. The papers selection and classification took place in three steps considering only studies in English language and published in electronic journals (from 2008 to 2022). The investigation led up to the selection of 46 publications (10 presenting literature reviews and 36 proposing CSMs).

The findings showed that CSMs are usually formulated using Financial Analysis, Machine Learning, Statistical Techniques, Operational Research and Data Mining Algorithms. The main databases used by the researchers were banks and the University of California, Irvine. The analyses identified 48 methods used by CSMs, the main ones being: Logistic Regression (13%), Naive Bayes (10%) and Artificial Neural Networks (7%). The authors conclude that advances in credit score studies will require new hybrid approaches capable of integrating Big Data and Deep Learning algorithms into CSMs. These algorithms should have practical issues considered consider practical issues for improving the level of adaptation and performance demanded for the CSMs.

The results of this study might provide considerable practical implications for the application of CSMs. As it was aimed to demonstrate the application of optimisation methods, it is highly considerable that legal and ethical issues should be better adapted to CSMs. It is also suggested improvement of studies focused on micro and small companies for sales in instalment plans and commercial credit through the improvement or new CSMs.

The economic reality surrounding credit granting has made risk management a complex decision-making issue increasingly supported by CSMs. Therefore, this paper satisfies an important gap in the literature to present an analysis of recent advances in optimisation methods applied to CSMs. The main contribution of this paper consists of presenting the evolution of the state of the art and future trends in studies aimed at proposing better CSMs.

Disaster management and humanitarian logistics (HT) play crucial roles in large-scale events such as earthquakes, floods, hurricanes and tsunamis. Well-organized disaster response is crucial for effectively managing medical centres, staff allocation and casualty distribution during emergencies. To address this issue, this study aims to introduce a multi-objective stochastic programming model to enhance disaster preparedness and response, focusing on the critical first 72 h after earthquakes. The purpose is to optimize the allocation of resources, temporary medical centres and medical staff to save lives effectively.

This study uses stochastic programming-based dynamic modelling and a discrete-time Markov Chain to address uncertainty. The model considers potential road and hospital damage and distance limits and introduces an a-reliability level for untreated casualties. It divides the initial 72 h into four periods to capture earthquake dynamics.

Using a real case study in Istanbul’s Kartal district, the model’s effectiveness is demonstrated for earthquake scenarios. Key insights include optimal medical centre locations, required capacities, necessary medical staff and casualty allocation strategies, all vital for efficient disaster response within the critical first 72 h.

This study innovates by integrating stochastic programming and dynamic modelling to tackle post-disaster medical response. The use of a Markov Chain for uncertain health conditions and focus on the immediate aftermath of earthquakes offer practical value. By optimizing resource allocation amid uncertainties, the study contributes significantly to disaster management and HT research.

The purpose of this study is to develop an optimization method for charging plans with the implementation of time-of-day (TOD) electricity tariff, to reduce electricity bill.

Two optimization models for charging plans respectively with fixed and stochastic trip travel times are developed, to minimize the electricity costs of daily operation of an electric bus. The charging time is taken as the optimization variable. The TOD electricity tariff is considered, and the energy consumption model is developed based on real operation data. An optimal charging plan provides charging times at bus idle times in operation hours during the whole day (charging time is 0 if the bus is not get charged at idle time) which ensure the regular operation of every trip served by this bus.

The electricity costs of the bus route can be reduced by applying the optimal charging plans.

This paper produces a viable option for transit agencies to reduce their operation costs.

Giant orthogonal grid barrel vault is generated by deleting members in the inessential force transfer path of the two-layer lattice barrel vault. Consisting of members in the essential transfer path only, giant orthogonal grid barrel vault is a new type of structure with clear mechanical behavior and efficient material utilization. The paper aims to discuss this issue.

The geometrical configuration of this structure is analyzed, and the geometrical modeling method is proposed. When necessary parameters are determined, such as the structural span, length, vault rise, longitudinal and lateral giant grid number and section height to top chord length ratio of the lattice member, the structure geometrical model can be generated.

Numerical models of giant orthogonal grid barrel vaults with different rise–span ratios are built using the member model that can simulate the pre-buckling and post-buckling behavior. So the possible member buckle-straighten process and the plastic hinge form–disappear process of the structure under strong earthquake can be simulated.

Seismic analysis results indicate that when the structure damages under strong earthquake there are a large number of buckling members and few endpoint plastic hinges in the structure. Dynamic damage of giant orthogonal grid barrel vault under strong earthquake is caused by buckling members that weaken the structural bearing capacity.

This paper proposes an approach to solve the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) in the context of the Physical Internet (PI) supply chain. The main objective is to minimize the total distribution costs (transportation cost and holding cost) to supply retailers from PI hubs.

Mixed integer programming (MIP) is proposed to solve the problem in smaller instances. A random local search (RLS) algorithm and a simulated annealing (SA) metaheuristic are proposed to solve larger instances of the problem.

The results show that SA provides the best solution in terms of total distribution cost and provides a good result regarding holding cost and transportation cost compared to other heuristic methods. Moreover, in terms of total carbon emissions, the PI concept proposed a better solution than the classical supply chain.

The sustainability of the route construction applied to the PI is validated through carbon emissions.

This approach also relates to the main objectives of transportation in the PI context: reduce empty trips and share transportation resources between PI-hubs and retailers. The proposed approaches are then validated through a case study of agricultural products in Thailand.

This approach is also relevant with the reduction of driving hours on the road because of share transportation results and shorter distance than the classical route planning.

This paper addresses the VRPSPD problem in the PI context, which is based on sharing transportation and storage resources while considering sustainability.

Due to unceasing declination in environment, sustainable agro-food supply chains have become a topic of concern to business, government organizations and customers. The purpose of this study is to examine a problem associated with sustainable network design in context of Indian agro-food grain supply chain.

A mixed integer nonlinear programming (MINLP) model is suggested to apprehend the major complications related with two-echelon food grain supply chain along with sustainability aspects (carbon emissions). Genetic algorithm (GA) and quantum-based genetic algorithm (Q-GA), two meta-heuristic algorithms and LINGO 18 (traditional approach) are employed to establish the vehicle allocation and selection of orders set.

The model minimizes the total transportation cost and carbon emission tax in gathering food grains from farmers to the hubs and later to the selected demand points (warehouses). The simulated data are adopted to test and validate the suggested model. The computational experiments concede that the performance of LINGO is superior than meta-heuristic algorithms (GA and Q-GA) in terms of solution obtained, but there is trade-off with respect to computational time.

In literature, inadequate study has been perceived on defining environmental sustainable issues connected with agro-food supply chain from farmer to final distribution centers. A MINLP model has been formulated as practical scenario for central part of India that captures all the major complexities to make the system more efficient. This study is regulated to agro-food Indian industries.

The suggested network design problem is an innovative approach to design distribution systems from farmers to the hubs and later to the selected warehouses. This study considerably assists the organizations to design their distribution network more efficiently.

Improving business processes provides companies with advantages in terms of efficiency and profitability, as well as competitiveness against other companies in the market. Companies that integrate business processes with enterprise resource planning (ERP) systems into digital platforms also have the opportunity to strengthen their weaknesses by recognizing disruptions and bottlenecks in inefficient business processes thanks to this digital transformation. Descriptive and bibliometric analyses were performed in this study for a systematic evaluation of studies on artificial intelligence (AI) in the ERP literature. The studies in which the keywords determined from the AI literature were firstly used together with ERP were investigated from the Scopus database. 837 publications meeting the search criteria were reached and a descriptive analysis of these publications was presented. Then, bibliometric analysis was performed using common author, common citation, and common keyword analysis methods for 296 publications in the article type. Tsinghua University and Obuda University have the most publications according to the results. The most commonly used AI keywords in the ERP studies were “genetic algorithm”, “fuzzy logic”, and “machine learning”. This study aims to guide future studies by providing a systematic and new perspective to researchers and experts working on ERP-AI.

The purpose of this paper is to maximize the total demand covered by the established additive manufacturing and distribution centers and maximize the total literal weight assigned to the drones.

Disaster management or humanitarian supply chains (HSCs) differ from commercial supply chains in the fact that the aim of HSCs is to minimize the response time to a disaster as compared to the profit maximization goal of commercial supply chains. In this paper, the authors develop a relief chain structure that accommodates emerging technologies in humanitarian logistics into the two phases of disaster management – the preparedness stage and the response stage.

Solving the model by the genetic and the cuckoo optimization algorithm (COA) and comparing the results with the ones obtained by The General Algebraic Modeling System (GAMS) clear that genetic algorithm overcomes other options as it has led to objective functions that are 1.6% and 24.1% better comparing to GAMS and COA, respectively.

Finally, the presented model has been solved with three methods including one exact method and two metaheuristic methods. Results of implementation show that Non-dominated sorting genetic algorithm II (NSGA-II) has better performance in finding the optimal solutions.

The purpose of this paper is to develop an original model and a solution procedure for solving jointly three main strategic fleet management problems (fleet composition, replacement and make-or-buy), taking into account interdependencies between them.

The three main strategic fleet management problems were analyzed in detail to identify interdependencies between them, mathematically modeled in terms of integer nonlinear programing (INLP) and solved using evolutionary based method of a solver compatible with a spreadsheet.

There are no optimization methods combining the analyzed problems, but it is possible to mathematically model them jointly and solve together using a solver compatible with a spreadsheet obtaining a solution/fleet management strategy answering the questions: Keep currently exploited vehicles in a fleet or remove them? If keep, how often to replace them? If remove then when? How many perspective/new vehicles, of what types, brand new or used ones and when should be put into a fleet? The relatively large scale instance of problem (50 vehicles) was solved based on a real-life data. The obtained results occurred to be better/cheaper by 10% than the two reference solutions – random and do-nothing ones.

The methodology of developing optimal fleet management strategy by solving jointly three main strategic fleet management problems is proposed allowing for the reduction of the fleet exploitation costs by adjusting fleet size, types of exploited vehicles and their exploitation periods.