# US 2020/0346675 A1 · Arrangement of parallel maintenance lines for railway wagons

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0346675 A1
- Document ID: US20200346675A1
- Status: Published application
- Kind: A1
- Application number: 16/739,037
- Filed: 2020-01-09
- Published: 2020-11-05
- Earliest claimed: 2019-01-15
- Assignees: Southwest Jiaotong University
- Applicants: Southwest Jiaotong University
- Inventors: Zeqiang ZHANG; Lixia ZHU; Silu LIU; Ying ZHANG; Yanqing ZENG
- Web page: https://patentgrep.com/patent/US20200346675A1

## CPC

- B61L 27/16: Trackside optimisation of vehicle or train operation
- B61L 27/33: Backup systems, e.g. switching when failures occur
- B61L 27/37: Migration, e.g. parallel installations running simultaneously
- B61L 27/50: Trackside diagnosis or maintenance, e.g. software upgrades
- G06N 3/006: based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
- G06N 7/00: Computing arrangements based on specific mathematical models
- G06N 20/00: Machine learning
- G06Q 10/20: Administration of product repair or maintenance
- B61L 27/18: Crew rosters; Itineraries
- B61L 27/53: for trackside elements or systems, e.g. trackside supervision of trackside control system conditions
- B61L 27/60: Testing or simulation
- B61L: GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC (brakes or auxiliary equipment B61H, B61K; point or crossing construction E01B)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Disclosed is a method for arranging parallel maintenance lines for railway wagons, including: (1) obtaining design information of the parallel maintenance lines; (2) initially designing the parallel maintenance lines; where the maintenance lines comprise a disassembly line and an assembly line parallel to each other, and the disassembly line and the assembly line are connected through a track; (3) establishing a multi-objective mathematical model for solving a parallel maintenance line balancing problem, where the multi-objective mathematical model comprises a first model for minimizing the number of workstations, a second model for minimizing an idle time of the workstations and a third model for minimizing the number of maintenance resources; and (4) obtaining a feasible solution using an intelligent optimization algorithm.

## Claims

### Claim 1

A method for arranging parallel maintenance lines for railway wagons, comprising:
(1) obtaining design information of the parallel maintenance lines;
(2) initially designing the parallel maintenance lines; wherein the maintenance lines comprise a disassembly line and an assembly line parallel to each other, and the disassembly line and the assembly line are connected through a track;
(3) establishing a multi-objective mathematical model for solving a parallel maintenance line balancing problem, wherein the multi-objective mathematical model comprises a first model for minimizing the number of workstations, a second model for minimizing an idle time of the workstations and a third model for minimizing the number of maintenance resources; and
(4) obtaining a feasible solution using an intelligent optimization algorithm.

### Claim 2 (depends on 1)

The method of claim 1, wherein the design information comprises maintenance task information and maintenance resource information.

### Claim 3 (depends on 2)

The method of claim 2, wherein the maintenance task information comprises: the number and specification of products to be repaired, and disassembly precedence and assembly precedence for the products to be repaired; and the maintenance resource information comprises maintenance equipment, lifting devices and maintenance tools.

### Claim 4 (depends on 1)

The method of claim 1, wherein in step (3),
the first model is min
f
1
=
∑
k
=
1
K


Z
k
;
the second model is min
f
2
=
∑
k
=
1
K


(
C
·
Z
k
-
TT
k
)
2
;
and
the third model is min
f
3
=
∑
r
=
1
R


∑
k
=
1
K


M
rk
;
wherein K is the number of the workstations; k is a serial number of respective workstations, k∈{1, 2, . . . , K}; Zk is a binary variable, if a workstation k is open, Zk=1, if not, Zk=0; TTk is an operation time of the workstation k; C is a takt time of the workstation k; R is the number of resource types; r is a serial number of respective resource types, r∈{1, 2, . . . , R}; Mrk is a binary variable, if a resource type r is assigned to the workstation k, Mrk=1, if not, Mrk=0.

### Claim 5 (depends on 4)

The method of claim 4, wherein step (3) is performed under the following assumptions:
(1) there are sufficient supply of products to be repaired on the disassembly line and sufficient supply of components and parts, which have undergone maintenance, on the assembly line;
(2) uncertainty in operations of maintenance workers is ignored, that is, operation time of the disassembly and assembly tasks are certain and known;
(3) one maintenance worker is assigned to one parallel workstation, and the maintenance workers are multi-skilled and qualified for any operation tasks on the maintenance lines; and
(4) the maintenance worker walking time between the two maintenance lines are ignored.

### Claim 6 (depends on 4)

The method of claim 4, wherein step (3) is performed under the following constraints:
(1) the assembly tasks are assigned according to the precedence thereof;
(2) the disassembly tasks are assigned according to the precedence thereof;
(3) each of the assembly tasks is inseparable and is only allowed to be assigned to one workstation;
(4) each of the disassembly tasks is inseparable and is only allowed to be assigned to one workstation;
(5) the operation time of respective workstations is a sum of operation time of assembly and disassembly tasks assigned to the workstation, and a sum of operation time of the workstations is not allowed to exceed a preset takt time of the maintenance lines;
(6) the number of assembly tasks assigned to the workstation k is not more than a sum of the assembly tasks;
(7) the number of disassembly tasks assigned to the workstation k is not more than a sum of the disassembly tasks;
(8) the workstations are opened in sequence and all assigned with tasks;
(9) if an assembly task i using a resource r is assigned to the workstation k, the workstation k must be equipped with the corresponding resource r; and
(10) if a disassembly task j using the resource r is assigned to the workstation k, the workstation k must also be equipped with the corresponding resource r.

### Claim 7 (depends on 1)

The method of claim 1, wherein the intelligent optimization algorithm is an improved migrating birds algorithm.

### Claim 8 (depends on 7)

The method of claim 7, wherein step (4) comprises:
(1) initializing parameters of the intelligent optimization algorithm, wherein the parameters comprises: the number N of population, the number Iter of iterations of the intelligent algorithm, the number m of tours, the number k of individual neighborhood solutions of a population, the number x of individual shared neighborhood solutions, a local optimal count lim, an upper limit lim_up of the local optimal count;
(2) generating an initial population Pop; calculating target function values of population individuals and filtering Pareto preferable solutions;
(3) setting an iteration count iter to 1 and starting the iteration of the intelligent algorithm;
(4) setting a tour count m_count to 1;
(5) searching a neighborhood field of a leader, and after the leader is self-improved, sharing remaining x optimal neighborhood solutions with two first followers respectively next to the leader at left and right sides in a V-shaped formation;
(6) searching a neighborhood field of respective first followers to generate k-x neighborhood solutions; and after the first followers are self-improved, sharing the remaining x optimal neighborhood solutions respectively with two second followers;
(7) completing one tour when the last followers respectively at the left and right sides of the V-shaped formation complete the self-improvement; calculating the target function values and updating a set of the Pareto preferable solutions;
(8) comparing the updated set of the Pareto preferable solutions with the set of the Pareto preferable solutions before updating by calculating a Hypervolume index, wherein if the Hypervolume index is constant, one local optimal count is counted, lim=lim+1, if not, lim=0;
(9) resetting the population individuals if the local optimal count lim is greater than the upper limit lim_up thereof;
(10) if the tour count m_count>m, allowing the leader to move to a tail end of each of the left and right sides of the V-shaped formation to become a follower, so that the first follower at the corresponding side becomes a new leader and the remaining followers successively moves forward by one position, and proceeding to step (11), if not, m_count=m_count+1, returning to step (5);
(11) if the iteration count iter≤Iter, iter=iter+1, returning to step (4), if not, proceeding to step (12); and
(12) ending the intelligent algorithm.

### Claim 9 (depends on 8)

The method of claim 8, wherein in step (2), the initial population is randomly generated through a combination of a random generation algorithm and a position weight heuristic algorithm.

### Claim 10 (depends on 8)

The method of claim 8, wherein in step (5), the searching of neighborhood fields is performed based on a neighborhood search operation based on an optimal embedded mechanism.
