Search results

The intelligent Central Traffic Control (CTC) system plays a vital role in establishing an intelligent high-speed railway (HSR) system. As the core of HSR transportation command, the intelligent CTC system is a new HSR dispatching command system that integrates the widely used CTC in China with the practical service requirements of intelligent dispatching. This paper aims to propose key technologies and applications for intelligent dispatching command in HSR in China.

This paper first briefly introduces the functions and configuration of the intelligent CTC system. Some new servers, terminals and interfaces are introduced, which are plan adjustment server/terminal, interface for automatic train operation (ATO), interface for Dynamic Monitoring System of Train Control Equipment (DMS), interface for Power Supervisory Control and Data Acquisition (PSCADA), interface for Disaster Monitoring, etc.

The key technologies applied in the intelligent CTC system include automatic adjustment of train operation plans, safety control of train routes and commands, traffic information data platform, integrated simulation of traffic dispatching and ATO function. These technologies have been applied in the Beijing-Zhangjiakou HSR, which commenced operations at the end of 2019. Implementing these key intelligent functions has improved the train dispatching command capacity, ensured the safe operation of intelligent HSR, reduced the labor intensity of dispatching operators and enhanced the intelligence level of China's dispatching system.

This paper provides further challenges and research directions for the intelligent dispatching command of HSR. To achieve the objectives, new measures need to be conducted, including the development of advanced technologies for intelligent dispatching command, coping with new requirements with the development of China's railway signaling system, the integration of traffic dispatching and train control and the application of AI and data-driven modeling and methods.

Advanced big data analysis and machine learning methods are concurrently used to unleash the value of the data generated by government hotline and help devise intelligent applications including automated process management, standard construction and more accurate dispatched orders to build high-quality government service platforms as more widely data-driven methods are in the process.

In this study, based on the influence of the record specifications of texts related to work orders generated by the government hotline, machine learning tools are implemented and compared to optimize classify dispatching tasks by performing exploratory studies on the hotline work order text, including linguistics analysis of text feature processing, new word discovery, text clustering and text classification.

The complexity of the content of the work order is reduced by applying more standardized writing specifications based on combining text grammar numerical features. So, order dispatch success prediction accuracy rate reaches 89.6 per cent after running the LSTM model.

The proposed method can help improve the current dispatching processes run by the government hotline, better guide staff to standardize the writing format of work orders, improve the accuracy of order dispatching and provide innovative support to the current mechanism.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.

Untimely responses to emergency situations in urban areas contribute to a rising mortality rate and impact society's primary capital. The efficient dispatch and relocation of ambulances pose operational and momentary challenges, necessitating an optimal policy based on the system's real-time status. While previous studies have addressed these concerns, limited attention has been given to the optimal allocation of technicians to respond to emergency situation and minimize overall system costs.

In this paper, a bi-objective mathematical model is proposed to maximize system coverage and enable flexible movement across bases for location, dispatch and relocation of ambulances. Ambulances relocation involves two key decisions: (1) allocating ambulances to bases after completing services and (2) deciding to change the current ambulance location among existing bases to potentially improve response times to future emergencies. The model also considers the varying capabilities of technicians for proper allocation in emergency situations.

The Augmented Epsilon-Constrained (AEC) method is employed to solve the proposed model for small-sized problem. Due to the NP-Hardness of the model, the NSGA-II and MOPSO metaheuristic algorithms are utilized to obtain efficient solutions for large-sized problems. The findings demonstrate the superiority of the MOPSO algorithm.

This study can be useful for emergency medical centers and healthcare companies in providing more effective responses to emergency situations by sending technicians and ambulances.

In this study, a two-objective mathematical model is developed for ambulance location and dispatch and solved by using the AEC method as well as the NSGA-II and MOPSO metaheuristic algorithms. The mathematical model encompasses three primary types of decision-making: (1) Allocating ambulances to bases after completing their service, (2) deciding to relocate the current ambulance among existing bases to potentially enhance response times to future emergencies and (3) considering the diverse abilities of technicians for accurate allocation to emergency situations.

This study identifies the policing pre-deployment training content for Korean experts based on needs assessments. Korean policing is at an excellent level to transfer knowledge and skills. Pre-deployment training should be designed systematically and training of trainers approaches should be implemented.

This study used T-tests, Borich needs assessments, and Locus for Focus model analyses to determine the priorities of needs for pre-deployment training in policing. A survey of 116 experienced experts was conducted, with 87 responding (75%).

The study identified 26 factors that deployed law enforcement professionals want to learn from pre-deployment training. These factors were categorized into three areas: research, training design and methods and understanding of partner countries and international development cooperation. The nine highest priorities for training needs were related to understanding the status and conditions of police training in the country to which policing experts are deployed.

This study was limited to Korean policing experts. And the study did not evaluate the validity of the training curriculum or indicators.

Technical assistance in international policing development cooperation aims to train future trainers who can train local police. This study found that limited learner information and poor communication skills can lead to ineffective technical assistance.

This study highlights the importance of knowledge transfer and effective pre-deployment training for policing. The findings can be used to improve training programs and police human resource development.

Currently, more renewable energy resources with advanced technology levels are incorporated in the electric power networks. Under this circumstance, the attainment of optimal economic dispatch is very much essential by the power system as the system requires more power generation cost and also has a great demand for electrical energy. Therefore, one of the primary difficulties in the power system is lowering the cost of power generation, which includes both economic and environmental costs. This study/paper aims to introduce a meta-heuristic algorithm, which offers an solution to the combined economic and emission dispatch (CEED).

A novel algorithm termed Levy-based glowworm swarm optimization (LGSO) is proposed in this work, and it provides an excellent solution to the combined economic and emission dispatch (CEED) difficulties by specifying the generation of the optimal renewable energy systems (RES). Moreover, in hybrid renewable energy systems, the proposed scheme is extended by connecting the wind turbine because the thermal power plant could not control the aforementioned costs. In terms of economic cost, emission cost and transmission loss, the suggested CEED model outperforms other conventional schemes genetic algorithm, Grey wolf optimization, whale optimization algorithm (WOA), dragonfly algorithm (DA) and glowworm swarm optimization (GSO) and demonstrates its efficiency.

According to the results, the suggested model for Iteration 20 was outperformed GSO, DA and WOA by 23.46%, 97.33% and 93.33%, respectively. For Iteration 40, the proposed LGSO was 60%, 99.73% and 97.06% better than GSO, DA and WOA methods, respectively. The proposed model for Iteration 60 was 71.50% better than GSO, 96.56% better than DA and 95.25% better than WOA. As a result, the proposed LGSO was shown to be superior to other existing techniques with respect to the least cost and loss.

This research introduces the latest optimization algorithm known as LGSO to provide an excellent solution to the CEED difficulties by specifying the generation of the optimal RES. To the best of the authors’ knowledge, this is the first work that utilizes LGSO-based optimization for providing an excellent solution to the CEED difficulties by specifying the generation of the optimal RES.

In this study, the authors investigate a different routing and scheduling problem in the field of home health care (HHC) management system. The purpose of this paper is to route and schedule the workday of health workers, assign the patients to suitable health workers, make accurate decisions to minimize costs, provide timely services and, in general, enhance the efficiency of HHC centers.

A mixed-integer linear programming model is developed to assign health workers to patients. The model considers health professionals with different skills, namely nurses and physicians. Additionally, three groups of patients are considered: patients who need a nurse, patients who need a physician and patients who need both. In the third group, the nurse must be present at the patient’s home following the physician’s visit in order to perform the required tasks.

The results of this study show a reduction in costs which results from the fewer health workers employed and dispatched in comparison with traditional approaches. With the help of our solution approach and model, HHC centers may not only successfully reduce their costs but also manage to meet their patients’ demands by assigning suitable nurses and physicians.

Previous studies have often focused on problems involving only one group of health professionals and rarely address problems involving multiple groups. The authors consider this a shortcoming, because in many cases, patients should be visited several times and by various health professionals.

This paper aims to provide a promising memetic algorithm (MA) for an unrelated parallel machine scheduling problem with grey processing times by using a simple dispatching rule in the local search phase of the proposed MA.

This paper proposes a MA for an unrelated parallel machine scheduling problem where the objective is to minimize the sum of weighted completion times of jobs with uncertain processing times. In the optimal schedule of the problem’s single machine version with deterministic processing time, the machine has a sequence where jobs are ordered in their increasing order of weighted processing times. The author adapts this property to some of their local search mechanisms that are required to assure the local optimality of the solution generated by the proposed MA. To show the efficiency of the proposed algorithm, this study uses other local search methods in the MA within this experiment. The uncertainty of processing times is expressed with grey numbers.

Experimental study shows that the MA with the swap-based local search and the weighted shortest processing time (WSPT) dispatching rule outperforms other MA alternatives with swap-based and insertion-based local searches without that dispatching rule.

A promising and effective MA with the WSPT dispatching rule is designed and applied to unrelated parallel machine scheduling problems where the objective is to minimize the sum of the weighted completion times of jobs with grey processing time.

Influenced by the constantly changing manufacturing environment, no single dispatching rule (SDR) can consistently obtain better scheduling results than other rules for the dynamic job-shop scheduling problem (DJSP). Although the dynamic SDR selection classifier (DSSC) mined by traditional data-mining-based scheduling method has shown some improvement in comparison to an SDR, the enhancement is not significant since the rule selected by DSSC is still an SDR.

This paper presents a novel data-mining-based scheduling method for the DJSP with machine failure aiming at minimizing the makespan. Firstly, a scheduling priority relation model (SPRM) is constructed to determine the appropriate priority relation between two operations based on the production system state and the difference between their priority values calculated using multiple SDRs. Subsequently, a training sample acquisition mechanism based on the optimal scheduling schemes is proposed to acquire training samples for the SPRM. Furthermore, feature selection and machine learning are conducted using the genetic algorithm and extreme learning machine to mine the SPRM.

Results from numerical experiments demonstrate that the SPRM, mined by the proposed method, not only achieves better scheduling results in most manufacturing environments but also maintains a higher level of stability in diverse manufacturing environments than an SDR and the DSSC.

This paper constructs a SPRM and mines it based on data mining technologies to obtain better results than an SDR and the DSSC in various manufacturing environments.

Ores and minerals are extracted from the earth’s crust depending on the type of deposit. Iron ore mines come under massive deposit patterns and have their own mine development and life cycles. This study aims to depict the development and life cycle of large open-pit iron ore mines and the intertwined organizational design of the departments/sections operated within the industry.

Primary data were collected on the site by participant observation, in-depth interviews of the field staff and executives, and field notes. Secondary data were collected from the literature review to compare and cite similar or previous studies on each mining activity. Finally, interactions were conducted with academic experts and top field executives to validate the findings. An organizational ethnography methodology was employed to study and analyse four large-scale iron ore mines of India’s largest iron-producing state, Odisha, from January to April 2023.

Six stages were observed for development and life cycle, and the operations have been depicted in a schematic diagram for ease of understanding. The intertwined functioning of organizational set-up is also discovered.

The paper will benefit entrepreneurs, mining and geology students, new recruits, and professionals in allied services linked to large iron ore mines. It offers valuable insights for knowledge enhancement, operational manual preparation and further research endeavours.