Search results

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 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.

In recent years, railway systems worldwide have faced challenges such as the modernization of engineering projects, efficient management of intelligent digital railway equipment, rapid growth in passenger and freight transport demands, customized transport services and ubiquitous transport safety. The transformation toward intelligent digital transformation in railways has emerged as an effective response to the formidable challenges confronting the railway industry, thereby becoming an inevitable global trend in railway development.

This paper, therefore, conducts a comprehensive analysis of the current state of global railway intelligent digital transformation, focusing on the characteristics and applications of intelligent digital transformation technology. It summarizes and analyzes relevant technologies and applicable scenarios in the realm of railway intelligent digital transformation, theoretically elucidating the development process of global railway intelligent digital transformation and, in practice, providing guidance and empirical examples for railway intelligence and digital transformation.

Digital and intelligent technologies follow a wave-like pattern of continuous iterative evolution, progressing from the early stages, to a period of increasing attention and popularity, then to a phase of declining interest, followed by a resurgence and ultimately reaching a mature stage.

The results offer reference and guidance to fully leverage the opportunities presented by the latest wave of the digitalization revolution, accelerate the overall upgrade of the railway industry and promote global collaborative development in railway intelligent digital transformation.

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.

This study aims to address the challenge of automatic guided vehicle (AGV) scheduling for parcel storage and retrieval in an intelligent warehouse.

This study presents a scheduling solution that aims to minimize the maximum completion time for the AGV scheduling problem in an intelligent warehouse. First, a mixed-integer linear programming model is established, followed by the proposal of a novel genetic algorithm to solve the scheduling problem of multiple AGVs. The improved algorithm includes operations such as the initial population optimization of picking up goods based on the principle of the nearest distance, adaptive crossover operation evolving with iteration, mutation operation of equivalent exchange and an algorithm restart strategy to expand search ability and avoid falling into a local optimal solution. Moreover, the routing rules of AGV are described.

By conducting a series of comparative experiments based on the actual package flow situation of an intelligent warehouse, the results demonstrate that the proposed genetic algorithm in this study outperforms existing algorithms, and can produce better solutions for the AGV scheduling problem.

This paper optimizes the different iterative steps of the genetic algorithm and designs an improved genetic algorithm, which is more suitable for solving the AGV scheduling problem in the warehouse. In addition, a path collision avoidance strategy that matches the algorithm is proposed, making this research more applicable to real-world scheduling environments.

With Industry 4.0 and the extensive rise of smart technologies, we are seeing remarkable transformations in work practices and workplaces. Scholars report the phenomenal progress of smart technologies. At the same time, we can hear the rhetoric emphasising their potential threats. This study focusses on how and where intelligent machines are leveraged in the workplace, how humans co-working with intelligent machines are affected and what they believe can be done to mitigate the risks of the increased use of intelligent machines.

We conducted in-depth interviews with 15 respondents working in various leadership capacities associated with intelligent machines and technologies. Using NVivo, we coded and churned out the themes from the qualitative data collected.

This study shows how intelligent machines are leveraged across different industries, ranging from chatbots, intelligent sensors, cognitive systems and computer vision to the replica of the entire human being. They are used end-to-end in the value chain, increasing productivity, complementing human workers’ skillsets and augmenting decisions made by human workers. Human workers experience a blend of positive and negative emotions whilst co-working with intelligent machines, which influences their job satisfaction level. Organisations adopt several anticipatory strategies, like transforming into a learning organisation, identifying futuristic technologies and upskilling their human workers, regularly conducting social learning events and designing accelerated career paths to embrace intelligent technologies.

This study seeks to understand the emotional and practical implications of the use of intelligent machines by humans and how both entities can integrate and complement each other. These insights can help organisations and employees understand what future workplaces and practices will look like and how to remain relevant in this transformation.

A real-time production scheduling method for semiconductor back-end manufacturing process becomes increasingly important in industry 4.0. Semiconductor back-end manufacturing process is always accompanied by order splitting and merging; besides, in each stage of the process, there are always multiple machine groups that have different production capabilities and capacities. This paper studies a multi-agent based scheduling architecture for the radio frequency identification (RFID)-enabled semiconductor back-end shopfloor, which integrates not only manufacturing resources but also human factors.

The architecture includes a task management (TM) agent, a staff instruction (SI) agent, a task scheduling (TS) agent, an information management center (IMC), machine group (MG) agent and a production monitoring (PM) agent. Then, based on the architecture, the authors developed a scheduling method consisting of capability & capacity planning and machine configuration modules in the TS agent.

The authors used greedy policy to assign each order to the appropriate machine groups based on the real-time utilization ration of each MG in the capability & capacity (C&C) planning module, and used a partial swarm optimization (PSO) algorithm to schedule each splitting job to the identified machine based on the C&C planning results. At last, we conducted a case study to demonstrate the proposed multi-agent based real-time production scheduling models and methods.

This paper proposes a multi-agent based real-time scheduling framework for semiconductor back-end industry. A C&C planning and a machine configuration algorithm are developed, respectively. The paper provides a feasible solution for semiconductor back-end manufacturing process to realize real-time scheduling.

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.

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.

This paper aims to reduce the impact of disordered charging of large-scale electric vehicles (EVs) on the grid. EV is great significance for environmental protection, energy conservation and emission reduction to replace fuel vehicles with EVs. However, as a kind of random mobile load, large-scale integration into the power grid may lead to power quality problems such as line overload, line loss increase and voltage reduction. This paper realizes the orderly charging of electric vehicles and the safe operation of the distribution network by optimizing the dispatching scheme.

This paper takes the typical IEEE-33 node distribution system as the research object, adopts the improved particle swarm optimization algorithm and takes the minimum operation cost, the minimum environmental pollution, the minimum standard deviation of daily load, the minimum peak valley difference of load, the minimum node voltage offset rate and the minimum system grid loss rate as the optimization objectives.

Controlling the disordered charging of large-scale electric vehicles by optimizing the dispatching algorithm can realize the full consumption of renewable energy and the safe operation of the power grid.

Results show that the proposed scheme can realize the transfer of charging load in time and space, so as to stabilize the load fluctuation of distribution grid, improve the operation quality of power grid, reduce the charging cost of users and achieve the expected research objectives.