Jingtian Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jingtian Zhang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Fuxing Yang
Automation School Beijing University of Posts and Telecommunications 100876 Beijing China
2 shared publicationsXun Weng
Automation School Beijing University of Posts and Telecommunications 100876 Beijing China
2 shared publicationsLu Xiao
School of Mechanical and Electrical Engineering, University Of Electronic Science And Technology Of China, Chengdu, China
1 shared publicationNaixun Zhou
School of Mechanical and Electrical Engineering, University Of Electronic Science And Technology Of China, Chengdu, China
1 shared publication- Wei Zhang
Department of Nuclear Medicine, Sichuan Provincial People’s Hospital, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication
Latest Publications
- 3 November 2022
- Published by Springer Nature in Engineering with Computers
- Vol. 39 (5) , 3251-3268
An active learning Kriging model with adaptive parameters for reliability analysis
- 3 November 2022
- Published by Springer Nature in Engineering with Computers
- Vol. 39 (5) , 3251-3268
An active learning Kriging model with adaptive parameters for reliability analysis
- Open Access
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
A Building‐Block‐Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System
Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts‐to‐picker system, known as Kiva system, is especially suited for e‐commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource‐constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building‐blocks‐based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule‐based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Open AccessA Building‐Block‐Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System
Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts‐to‐picker system, known as Kiva system, is especially suited for e‐commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource‐constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building‐blocks‐based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule‐based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.
- Open Access
- 24 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 63468-63485
An Evolutionary Scatter Search Particle Swarm Optimization Algorithm for the Vehicle Routing Problem With Time Windows
Vehicle routing problem with time windows (VRPTW) contains two crucial objectives: minimizing the number of vehicles and minimizing the total travel distance. However, most algorithms focus on the number of vehicles while the travel distance should be considered as the primary objective in some practical situations especially in the modern logistics. Research has shown that designing a systematic framework to combine multiple algorithms with different characteristics will significantly improve the overall performance of the hybrid algorithm. This paper proposes an evolutionary scatter search particle swarm optimization algorithm(ESS-PSO) to solve the VRPTW with the objective of minimizing the total travel distance. In ESS, a genetic algorithm(GA) and a new "route+/-" evolutionary operator are introduced in scatter search template. Also, we proposed a discrete PSO that sets the route-segment as the velocity of particles and in which the velocity and position updating rules are designed based on the concept of "ruin and recreate." These two algorithms work in a cascade learning architecture in which PSO learns from the exemplary solutions in the reference set maintained by ESS. The search direction of the algorithm is adjusted by analyzing the relationship between the number of vehicles and the total travel distance in real time. We designed a new solution representation called "auxiliary code" based on customer allocation to maintain the diversity of the reference set. Experiments with the Solomon benchmark show that ESS-PSO is effective and efficient, and it achieves very competitive results especially in the datasets of the category "2".
- 24 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 63468-63485
Open AccessAn Evolutionary Scatter Search Particle Swarm Optimization Algorithm for the Vehicle Routing Problem With Time Windows
Vehicle routing problem with time windows (VRPTW) contains two crucial objectives: minimizing the number of vehicles and minimizing the total travel distance. However, most algorithms focus on the number of vehicles while the travel distance should be considered as the primary objective in some practical situations especially in the modern logistics. Research has shown that designing a systematic framework to combine multiple algorithms with different characteristics will significantly improve the overall performance of the hybrid algorithm. This paper proposes an evolutionary scatter search particle swarm optimization algorithm(ESS-PSO) to solve the VRPTW with the objective of minimizing the total travel distance. In ESS, a genetic algorithm(GA) and a new "route+/-" evolutionary operator are introduced in scatter search template. Also, we proposed a discrete PSO that sets the route-segment as the velocity of particles and in which the velocity and position updating rules are designed based on the concept of "ruin and recreate." These two algorithms work in a cascade learning architecture in which PSO learns from the exemplary solutions in the reference set maintained by ESS. The search direction of the algorithm is adjusted by analyzing the relationship between the number of vehicles and the total travel distance in real time. We designed a new solution representation called "auxiliary code" based on customer allocation to maintain the diversity of the reference set. Experiments with the Solomon benchmark show that ESS-PSO is effective and efficient, and it achieves very competitive results especially in the datasets of the category "2".