CN116205471B - Cache region scheduling method, device and equipment for automobile manufacturing - Google Patents

Cache region scheduling method, device and equipment for automobile manufacturing Download PDF

Info

Publication number
CN116205471B
CN116205471B CN202310495350.9A CN202310495350A CN116205471B CN 116205471 B CN116205471 B CN 116205471B CN 202310495350 A CN202310495350 A CN 202310495350A CN 116205471 B CN116205471 B CN 116205471B
Authority
CN
China
Prior art keywords
sequence
vehicle
car
lane
departure
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202310495350.9A
Other languages
Chinese (zh)
Other versions
CN116205471A (en
Inventor
张惠臻
戴浩天
吴坤龙
曾鑫燕
李伟
李庄
杨翎翔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huaqiao University
Original Assignee
Huaqiao University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huaqiao University filed Critical Huaqiao University
Priority to CN202310495350.9A priority Critical patent/CN116205471B/en
Publication of CN116205471A publication Critical patent/CN116205471A/en
Application granted granted Critical
Publication of CN116205471B publication Critical patent/CN116205471B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Educational Administration (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Mining & Analysis (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Manufacturing & Machinery (AREA)
  • Evolutionary Computation (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Automobile Manufacture Line, Endless Track Vehicle, Trailer (AREA)

Abstract

The invention provides a cache area scheduling method, a device and equipment for automobile manufacture, which are used for acquiring a paint shop departure sequence set by a method combining heuristic rules and random selection, taking a function of an optimization target as a fitness function, calling a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set, optimizing the optimal departure sequence based on a dispatching strategy of a car receiving traversing machine and a dispatching strategy of a car sending traversing machine, generating an ideal sequence for entering a general assembly workshop, and solving the problem that the departure sequence of the paint shop cannot be matched with the entering sequence of the general assembly workshop, so that the production efficiency of the general assembly workshop is low.

Description

Cache region scheduling method, device and equipment for automobile manufacturing
Technical Field
The present invention relates to the field of vehicle manufacturing, and in particular, to a method, an apparatus, and a device for scheduling a cache area in automobile manufacturing.
Background
The automobile manufacturing factory mainly comprises a welding workshop, a coating workshop and a final assembly workshop, and each workshop has different production preferences, such as: the welding workshop is biased to the minimum vehicle type and the configuration is switched to produce due to the limitation of the vehicle body clamp, the painting workshop is biased to the color is switched to produce by a multiple of 5 due to the limitation of paint spraying (the cleaning nozzle of every 5 vehicles are fixed, the color is switched to the cleaning nozzle is also required to be cleaned), and the general assembly workshop is biased to the production according to the vehicle type and the configuration due to the limitation of personnel man-hours (different vehicle types and configuration personnel man-hours), hardware (the number of parts and the like) and the like.
Because the production schedule cannot continuously produce according to the same sequence due to different constraints of workshops, particularly, the sequence difference between a painting workshop and a final assembly workshop is large, a buffer area with a sequence adjusting function, namely, a buffer space buffer (PBS) is required to be established between the two workshops and used for adjusting the departure sequence of the painting workshop to the arrival sequence meeting the constraints of the final assembly workshop.
At present, the number of vehicles which are arranged on line for production in one day is between 200 and 450, the attributes of the vehicles which are to be produced on line every day, such as vehicle types, colors and the like are changed, the number of the vehicles is 2 in the current vehicle type category, the colors are about 10, the productivity of each workshop is variable, and the process flows of a coating workshop and a final assembly workshop are mainly adjusted according to the production arrangement of the current day as follows:
the paint-spraying process is mainly to coat the paint on the surface of the white car body to finally form a coating film or a paint film or a coating layer. The detailed process of the painting workshop mainly comprises the steps of pre-treating and electrophoresis, intermediate coating, color paint and varnish on a white car body, and finally obtaining the finished car body.
The final assembly workshop treatment assembly process mainly comprises the steps of assembling the remaining parts to obtain the final finished vehicle. The vehicle is mainly composed of an inner decorative line, a chassis line and a final line, and after the final test, the finished vehicle is put off line and put in storage. If the production is carried out directly into the assembly plant in the sequence of the painting plant, the production efficiency is very low.
In view of this, the present application is presented.
Disclosure of Invention
The invention discloses a cache area scheduling method, device and equipment for automobile manufacturing, and aims to solve the problem that the production efficiency of a final assembly workshop is low because the departure sequence of the coating workshop is not matched with the entry sequence of the final assembly workshop.
The first embodiment of the invention provides a cache area scheduling method for automobile manufacturing, which comprises the following steps:
acquiring a paint shop departure sequence set;
according to a first optimization target, a second optimization target and constraint conditions of the departure sequence, invoking a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set;
and obtaining a dispatching strategy of the car receiving traversing machine and a dispatching strategy of the car sending traversing machine, and optimizing the optimal car discharging sequence to generate an ideal sequence for entering a car in a final assembly workshop.
Preferably, the first optimization objective is that the hybrid vehicle type is a non-hybrid vehicle type with a preset number of intervals, and the first optimization objective function is:
wherein ,a position index for indicating that the hybrid vehicle enters a workshop; />Representing the situation that two non-hybrid vehicle types are not spaced between the hybrid vehicle types; />Representing the sum of the conditions which do not meet the optimization target 1, wherein 100 is the initial score of 100;
the second optimization objective is a delivery sequence of a four-wheel drive vehicle type and a two-wheel drive vehicle type according to a preset proportion, and the second optimization objective function is as follows:
F=+/>
wherein ,、/>representing weight coefficients，/>Representing a subset of the chunks of the departure sequence; />Indicating that if the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is in accordance with the preset ratio, the count is 0; />Representing the sum of the condition counts of which the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is not in accordance with the preset ratio;
wherein, the constraint condition is:
①≦100
②≦100
③h≦n
④
⑤
wherein n is the total number of vehicles, h is the number of hybrid motor vehicles,for the difference of index subscripts of two adjacent hybrid motor vehicles at the position of the enqueue sequence,/->At->Two-drive number in subset, < >>At->Number of four-wheel drives in the subset.
Preferably, the step of calling a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set according to the first optimization target, the second optimization target and the constraint condition of the departure sequence specifically comprises:
and calling the particle swarm algorithm, restraining and iterating by using the function of the first optimization target and the function of the second target as fitness functions and using the constraint condition until the maximum iteration times are reached or the numerical value of the fitness function reaches a set fraction, and stopping iterating to generate an optimal train-out sequence.
Preferably, the dispatching strategy of the car-receiving traversing machine comprises the following steps:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the conveying lane is detected to be empty, the vehicle body is conveyed to the first empty parking space.
Preferably, the dispatching strategy of the vehicle-sending traversing machine comprises the following steps:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is different from the vehicle inlet sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
A second embodiment of the present invention provides a buffer scheduling device for automobile manufacturing, including:
the paint shop departure sequence set acquisition unit is used for acquiring a paint shop departure sequence set;
the optimal departure sequence determining unit is used for calling a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set according to a first optimization target, a second optimization target and constraint conditions of the departure sequence;
the ideal sequence generating unit is used for acquiring a dispatching strategy of the car receiving traversing machine and a dispatching strategy of the car sending traversing machine to optimize the optimal car-out sequence and generate an ideal sequence for car entering in a final assembly workshop.
Preferably, the ideal sequence generating unit is specifically configured to:
and calling the particle swarm algorithm, restraining and iterating by using the function of the first optimization target and the function of the second target as fitness functions and using the constraint condition until the maximum iteration times are reached or the numerical value of the fitness function reaches a set fraction, and stopping iterating to generate an optimal train-out sequence.
Preferably, the dispatching strategy of the car-receiving traversing machine comprises the following steps:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the conveying lane is detected to be empty, the vehicle body is conveyed to the first empty parking space.
Preferably, the dispatching strategy of the vehicle-sending traversing machine comprises the following steps:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is different from the vehicle inlet sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
A third embodiment of the present invention provides an automotive cache scheduling apparatus, which is characterized by comprising a memory and a processor, wherein the memory stores a computer program, and the computer program can be executed by the processor, so as to implement an automotive cache scheduling method according to any one of the above embodiments.
According to the cache area scheduling method, device and equipment for automobile manufacturing, provided by the invention, a coating workshop departure sequence set is obtained through a method of combining heuristic rules and random selection, a function of an optimization target is taken as an fitness function, a particle swarm algorithm is called to determine an optimal departure sequence from the departure sequence set, and the optimal departure sequence is optimized based on a dispatching strategy of a car receiving traversing machine and a dispatching strategy of a car sending traversing machine, so that an ideal sequence for entering a general assembly workshop is generated, and the problem that the departure sequence of the coating workshop cannot be matched with the entering sequence of the general assembly workshop, so that the production efficiency of the general assembly workshop is low is solved.
Drawings
Fig. 1 is a flow chart of a buffer scheduling method for automobile manufacturing according to a first embodiment of the present invention;
FIG. 2 is a schematic diagram of a coating-final assembly buffer sequencing area provided by the invention;
FIG. 3 is a schematic block diagram of a buffer scheduling device for automobile manufacturing according to a second embodiment of the present invention;
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
For a better understanding of the technical solution of the present invention, the following detailed description of the embodiments of the present invention refers to the accompanying drawings.
It should be understood that the described embodiments are merely some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one relationship describing the association of the associated objects, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
Depending on the context, the word "if" as used herein may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to detection". Similarly, the phrase "if determined" or "if detected (stated condition or event)" may be interpreted as "when determined" or "in response to determination" or "when detected (stated condition or event)" or "in response to detection (stated condition or event), depending on the context.
References to "first\second" in the embodiments are merely to distinguish similar objects and do not represent a particular ordering for the objects, it being understood that "first\second" may interchange a particular order or precedence where allowed. It is to be understood that the "first\second" distinguishing objects may be interchanged where appropriate to enable the embodiments described herein to be implemented in sequences other than those illustrated or described herein.
Specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The invention discloses a cache area scheduling method, device and equipment for automobile manufacturing, and aims to solve the problem that the production efficiency of a final assembly workshop is low because the departure sequence of the coating workshop is not matched with the entry sequence of the final assembly workshop.
A first embodiment of the present invention provides a buffer scheduling method for automobile manufacturing, which may be executed by a buffer scheduling device (hereinafter referred to as a scheduling device), and in particular, by one or more processors in the scheduling device, so as to implement at least the following steps:
s101, acquiring a paint shop departure sequence set;
in this embodiment, the scheduling device may be a terminal with data processing and analysis capabilities, such as a desktop computer, a notebook computer, a server, a workstation, etc., where the evaluation device may have a corresponding operating system and application software installed therein, and implement the functions required in this embodiment through the combination of the operating system and the application software.
It should be noted that, the paint shop departure sequence set is obtained based on a combination method of heuristic rules and random selection, where the heuristic rules are as follows:
when the front vehicle is a hybrid vehicle type, the latter vehicle preferentially selects a non-hybrid vehicle type; when the front two vehicles are non-hybrid vehicles, the hybrid vehicles are preferentially selected;
the rule (2) selects a four-wheel drive vehicle type or a two-wheel drive vehicle type when the rule (1) cannot be executed;
the rule (3) is that if the rule (2) selects a four-wheel-drive vehicle type, a two-wheel-drive vehicle type is selected next; if the two-wheel-drive vehicle type is selected, selecting a four-wheel-drive vehicle type in the next step, and selecting alternately;
and (4) when the rule (3) cannot be executed, the rest sequence to be discharged is directly placed behind the current train-in sequence.
S102, according to a first optimization target, a second optimization target and constraint conditions of a departure sequence, invoking a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set;
it should be noted that, the workshop scheduling problem belongs to the NP-hard problem, the particle swarm algorithm has strong applicability in solving the NP-hard problem, and the particle swarm algorithm (ParticleSwarmoptimization, PSO) has the characteristics of strong robustness and strong searching capability compared with other algorithms. Therefore, under the condition of considering the optimization target weight proportion, a particle swarm algorithm is adopted for solving.
In the embodiment, a coding rule based on a vehicle type is adopted, each particle represents a group of vehicle entering sequences, and each code represents a vehicle type; represented by 1, 2, 3, 4, wherein 1-、2-/>、3-/>、4-/>. As 112341, represent；
One of the key points of the particle swarm algorithm is to determine an fitness function of the particle swarm algorithm, wherein the fitness function can calculate an adaptation value of the particle in the current search space, and the better the adaptation value is, the more the particle approximates to the optimal solution. Each iteration of particles updates its own velocity and position according to two "extrema". The first extremum is the optimal solution found by the particle itself, denoted as individual extremum pBset, and the second extremum is the population optimal solution, denoted as global extremum gBest. In this embodiment, the objective function of the PBS buffer vehicle body dequeue scheduling problem is adopted as the fitness function, and the optimal departure sequence is selected from the departure sequence set according to the fitness function.
Specifically, in this embodiment, the particle swarm algorithm is invoked, the function of the first optimization objective and the function of the second objective are taken as fitness functions, constraint is performed on the constraint condition, iteration is performed until the maximum iteration number is reached or the numerical value of the fitness function reaches a set fraction, iteration is stopped, and an optimal departure sequence is generated;
an optimization score is calculated based on the condition setting objective function. The method aims to obtain a group of optimal or near optimal vehicle entering sequences under the condition that the ratio of four-wheel-drive vehicles to two-wheel-drive vehicles in each block is 1:1 after the vehicle entering sequences are blocked as far as possible under the condition that two non-hybrid vehicle types are spaced between two hybrid vehicle types in sequence. The specific process is as follows:
first of all,for the optimization objective 1 function, the value thereof represents the score of the optimal departure sequence meeting the optimization objective 1; 100 is the initial 100 minutes; />A position index for indicating that the hybrid vehicle enters a workshop; />Representing the situation that two non-hybrid vehicle types are not spaced between the hybrid vehicle types; />The sum of the conditions that the optimization target 1 is not met is shown as a specific formula 1:
(1)
secondly, the first step of the method comprises the steps of,to optimize the objective 2 function, the value thereof represents the score that the optimal departure sequence meets the optimization objective 2, and finallyAnd adding the weights to obtain a fitness function F, wherein the fitness function F is specifically shown in formulas 2 and 3:
(2)
F=+/>(3)
setting weight coefficient=0.4, weight coefficient +.>=0.3
wherein ,representing a subset of the chunks of the departure sequence; />Indicating that if the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is 1:1, the count is 0; />The sum of the condition counts representing that the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is not 1:1
Finally, determining constraint conditions:
①≦100
②≦100
③h≦n
④
⑤
wherein n is the total number of vehicles, h is the number of hybrid motor vehicles,is the difference between index subscripts of two adjacent hybrid motor vehicles at the position of the queue sequence, if the difference is equal to 3, two non-hybrid vehicle types exist between the two hybrid vehicle types, otherwise, the two non-hybrid vehicle types do not exist; />At->Two-drive number in subset, < >>At->Number of four-wheel drives in subset, < >>The ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type representing the subset is 1:1, otherwise, the ratio is not 1:1.
And S103, acquiring a dispatching strategy of the car receiving traversing machine and a dispatching strategy of the car sending traversing machine to optimize the optimal car-out sequence, and generating an ideal sequence for car entering of a final assembly workshop.
In one possible embodiment of the present invention, the dispatching strategy of the car-receiving traversing machine includes:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the conveying lane is detected to be empty, the vehicle body is conveyed to the first empty parking space.
In this embodiment, the method may further include keeping the vehicle receiver in an idle state according to the sequence to be allocated and when the buffer lanes are empty.
It should be noted that, referring to fig. 2, the PBS is composed of 7 areas such as a coating-PBS vehicle outlet, a vehicle receiving traversing machine, 6 vehicle entering lanes (each vehicle entering lane has 10 parking spaces and FIFO structures), 1 vehicle returning lane (10 parking spaces), a vehicle delivering traversing machine, a PBS-total vehicle receiving opening, and the like.
The car-receiving traversing machine works as follows: (1) transporting the vehicle body from the painting-PBS exit to a suitable lane 10 parking space (first vehicle location); (2) the vehicle body is transported from the return lane 10 parking space to the appropriate entry lane 10 parking space.
The car-feeding traversing machine works as: (1) conveying the vehicle body from a parking space 1 (the last parking space) of a lane to a PBS-general assembly vehicle receiving port; (2) and conveying the vehicle body to be sequenced from the parking space of the entering lane 1 to the parking space of the returning lane 1.
In one possible embodiment of the present invention, the dispatching strategy for the transverse conveyor comprises:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is different from the vehicle inlet sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
It should be noted that:
constraints that PBS scheduling needs to satisfy are:
(1) The vehicle-conveying traversing machine cannot convey the vehicle body of the return channel into the PBS-general assembly vehicle-receiving opening;
(2) The moving direction of the vehicle body in the entering lane and the returning lane is not changeable;
(3) The car receiving traversing machine and the car delivering traversing machine respectively have at most one car body at the same time;
(4) After the car receiving traversing machine and the car delivering traversing machine finish any action, the car receiving traversing machine and the car delivering traversing machine return to the middle initial position to execute the next action;
(5) The car receiving traversing machine and the car delivering traversing machine cannot be broken in the executing process;
(6) When the parking space of the return channel 10 is provided with a car body and the car receiving traversing machine is idle, the car body of the parking space of the return channel 10 is processed preferentially
(7) When a plurality of parking spaces of the lane 1 are reserved for waiting, and the vehicle feeding traversing machine is idle, the vehicle body which reaches the parking space 1 first is preferentially processed;
(8) If any parking space of the lane 1 is provided with a car body, the car-feeding traversing machine cannot be set to be in an idle state;
(9) The vehicle body is contained at most 10 vehicle bodies at each moment in a lane and a lane for returning, and each parking space contains at most 1 vehicle body;
(10) In the same lane, the movement of a plurality of vehicle bodies on different parking spaces can be performed asynchronously;
(11) When a space exists in the next parking space of the parking space where a certain car body is located, the car body must immediately start to move towards the next parking space;
(12) The car body cannot be scheduled in the process of moving between different parking spaces of the entering lane and the returning lane.
In general, the optimization objective and the weight size to be considered in the PBS scheduling problem are:
(1) Checking a train outlet sequence, finding all the mixed train bodies, calculating the number of the non-mixed train bodies between every two continuous mixed train bodies from the head of the train outlet sequence according to the sequence, and buckling 1 score (weight coefficient 0.4, initial score 100 score) if the number is not equal to 2;
(2) And dividing the train outlet sequence into blocks, judging whether the ratio of the four-wheel drive train type to the two-wheel drive train type in each dividing speed meets 1:1, and if not, buckling 1 division. The basis for blocking the departure sequence is as follows: if the sequence starts with 4, the sequence is partitioned according to the change from 2 to 4; if the sequence starts with 2, the sequence is partitioned according to a change from 4 to 2. For example: if the departure sequence is 22442242 (4 represents a four-wheel drive vehicle type and 2 represents a two-wheel drive vehicle type), the sequence blocking result is as follows: 2244,224,2, neither of the last two partitions 224 and 2 satisfies 1:1, deducting 2 points (weight coefficient 0.3, initial 100 points);
(3) The number of usage times of the returning lane tends to be 0, and each time the returning lane is used, the number of usage times is buckled by 1 minute (weight coefficient is 0.2, initial score is 100 minutes);
(4) The moment when the first vehicle body enters the coating-PBS exit is recorded as zero, the moment T when the last vehicle body enters the PBS-total mounting vehicle mouth is taken as the total completion time, the theoretical fastest completion time is 9C+72 (all the vehicle entering lanes 4, the vehicle exiting sequence is the same as the vehicle entering sequence), the time penalty value is set to be 0.01 x (T-9C-72), and finally the target score is 100-time penalty value (weight coefficient 0.1, initial score 100).
Referring to fig. 3, a second embodiment of the present invention provides a buffer scheduling device for automobile manufacturing, including:
a paint shop departure sequence set acquisition unit 201, configured to acquire a paint shop departure sequence set;
an optimal departure sequence determining unit 202, configured to invoke a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set according to a first optimization target, a second optimization target, and a constraint condition of the departure sequence;
and the ideal sequence generating unit 203 is configured to acquire a dispatching policy of the car-receiving traversing machine and a dispatching policy of the car-sending traversing machine, optimize the optimal car-out sequence, and generate an ideal sequence for car-entering in the assembly shop.
Preferably, the ideal sequence generating unit is specifically configured to:
and calling the particle swarm algorithm, restraining and iterating by using the function of the first optimization target and the function of the second target as fitness functions and using the constraint condition until the maximum iteration times are reached or the numerical value of the fitness function reaches a set fraction, and stopping iterating to generate an optimal train-out sequence.
Preferably, the dispatching strategy of the car-receiving traversing machine comprises the following steps:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the conveying lane is detected to be empty, the vehicle body is conveyed to the first empty parking space.
Preferably, the dispatching strategy of the vehicle-sending traversing machine comprises the following steps:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is different from the vehicle inlet sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
A third embodiment of the present invention provides an automotive cache scheduling apparatus, which is characterized by comprising a memory and a processor, wherein the memory stores a computer program, and the computer program can be executed by the processor, so as to implement an automotive cache scheduling method according to any one of the above embodiments.
According to the cache area scheduling method, device and equipment for automobile manufacturing, provided by the invention, a coating workshop departure sequence set is obtained through a method of combining heuristic rules and random selection, a function of an optimization target is taken as an fitness function, a particle swarm algorithm is called to determine an optimal departure sequence from the departure sequence set, and the optimal departure sequence is optimized based on a dispatching strategy of a car receiving traversing machine and a dispatching strategy of a car sending traversing machine, so that an ideal sequence for entering a general assembly workshop is generated, and the problem that the departure sequence of the coating workshop cannot be matched with the entering sequence of the general assembly workshop, so that the production efficiency of the general assembly workshop is low is solved.
Illustratively, the computer programs described in the third and fourth embodiments of the present invention may be divided into one or more modules, which are stored in the memory and executed by the processor to complete the present invention. The one or more modules may be a series of computer program instruction segments capable of performing particular functions for describing the execution of the computer program in the cache memory scheduling apparatus for implementing an automotive manufacturing. For example, the device described in the second embodiment of the present invention.
The processor may be a central processing unit (CentralProcessingUnit, CPU), other general purpose processors, digital signal processors (DigitalSignalProcessor, DSP), application specific integrated circuits (ApplicationSpecificIntegratedCircuit, ASIC), off-the-shelf programmable gate arrays (Field-ProgrammableGateArray, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor, etc., which is a control center of the cache scheduling method for automobile manufacturing, and uses various interfaces and lines to connect the various parts of the overall implementation of the cache scheduling method for automobile manufacturing.
The memory may be used to store the computer program and/or the module, and the processor may implement various functions of a cache scheduling method for automobile manufacturing by running or executing the computer program and/or the module stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, a text conversion function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, text message data, etc.) created according to the use of the cellular phone, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, a plug-in hard disk, a smart memory card (SmartMediaCard, SMC), a secure digital (SecureDigital, SD) card, a flash card (FlashCard), at least one magnetic disk storage device, a flash memory device, or other volatile solid state storage device.
Wherein the modules may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as a stand alone product. Based on this understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and the computer program may implement the steps of each method embodiment described above when executed by a processor. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a Read-only memory (ROM), a random access memory (RAM, randomAccessMemory), an electrical carrier signal, a telecommunication signal, a software distribution medium, and so forth. It should be noted that the computer readable medium contains content that can be appropriately scaled according to the requirements of jurisdictions in which such content is subject to legislation and patent practice, such as in certain jurisdictions in which such content is subject to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.
It should be noted that the above-described apparatus embodiments are merely illustrative, and the units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, in the drawings of the embodiment of the device provided by the invention, the connection relation between the modules represents that the modules have communication connection, and can be specifically implemented as one or more communication buses or signal lines. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The present invention is not limited to the above-mentioned embodiments, and any changes or substitutions that can be easily understood by those skilled in the art within the technical scope of the present invention are intended to be included in the scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims (6)

1. The cache area scheduling method for automobile manufacture is characterized by comprising the following steps of:
acquiring a paint shop departure sequence set;
according to a first optimization target, a second optimization target and constraint conditions of the departure sequence, invoking a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set;
the optimal train outlet sequence is optimized by acquiring a train receiving traversing machine scheduling strategy and a train sending traversing machine scheduling strategy, and an ideal train inlet sequence for a final assembly shop is generated;
wherein, the dispatching strategy of the car-receiving traversing machine comprises the following steps:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the lane is detected to be empty, the vehicle body is transported to the first empty parking space;
the dispatching strategy of the vehicle-conveying traversing machine comprises the following steps:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is the same as the vehicle entering sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
2. The method for scheduling a buffer area in an automotive manufacturing process according to claim 1, wherein the first optimization objective is a mixed-vehicle type, a preset number of non-mixed-vehicle types are spaced apart, and the first optimization objective function is as follows:
wherein ,a position index for indicating that the hybrid vehicle enters a workshop; />Representing the situation that two non-hybrid vehicle types are not spaced between the hybrid vehicle types; />Representing that the sum of the conditions of the first optimization target is not met, wherein 100 is an initial score of 100;
the second optimization objective is a delivery sequence of a four-wheel drive vehicle type and a two-wheel drive vehicle type according to a preset proportion, and the second optimization objective function is as follows:
F=+/>
wherein ,、/>representing the weight coefficient, ++>Representing a subset of the chunks of the departure sequence; />Indicating that if the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is in accordance with the preset ratio, the count is 0; />Representing the sum of the condition counts of which the ratio of the four-wheel drive vehicle type to the two-wheel drive vehicle type is not in accordance with the preset ratio;
wherein, the constraint condition is:
①≦100
②≦100
③h≦n
④
⑤
wherein n is the total number of vehicles, h is the number of hybrid motor vehicles,for the difference of index subscripts of two adjacent hybrid motor vehicles at the position of the enqueue sequence,/->At->Two-drive number in subset, < >>At->Number of four-wheel drives in the subset.
3. The buffer scheduling method of an automobile manufacturing according to claim 1 or 2, wherein the step of calling a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set according to a first optimization target, a second optimization target and a constraint condition of the departure sequence is specifically:
and calling the particle swarm algorithm, taking the function of the first optimization target and the function of the second optimization target as fitness functions, restraining by the constraint condition, and iterating until the maximum iteration times are reached or the numerical value of the fitness functions reaches a set fraction, and stopping iterating to generate an optimal train-out sequence.
4. A buffer scheduling apparatus for automobile manufacturing, comprising:
the paint shop departure sequence set acquisition unit is used for acquiring a paint shop departure sequence set;
the optimal departure sequence determining unit is used for calling a particle swarm algorithm to determine an optimal departure sequence from the departure sequence set according to a first optimization target, a second optimization target and constraint conditions of the departure sequence;
the ideal sequence generating unit is used for acquiring a dispatching strategy of the car receiving traversing machine and a dispatching strategy of the car sending traversing machine to optimize the optimal car-out sequence and generate an ideal sequence for entering a car in a final assembly workshop;
wherein, the dispatching strategy of the car-receiving traversing machine comprises the following steps:
acquiring a sequence to be allocated, and judging whether a first vehicle position of a return channel has a vehicle body to be allocated or not according to the sequence to be allocated;
if yes, controlling the car receiver to move to a first parking space of a return road, and conveying the car bodies to a lane with the minimum number of car bodies in a lane;
if not, when the first parking space of the lane is detected to be empty, the vehicle body is transported to the empty first parking space,
the dispatching strategy of the vehicle-conveying traversing machine comprises the following steps:
when the last parking spaces of all the lanes are monitored to have the vehicle bodies, controlling the vehicle-conveying traversing machine to move to the lane which reaches the vehicle body first;
acquiring a vehicle entering sequence of a final assembly workshop;
when judging that the vehicle body arriving first is different from the vehicle feeding sequence of the assembly workshop, feeding the vehicle body into the last parking space of a return lane or into a vehicle feeding lane with a vacant space in other last parking spaces;
and when judging that the vehicle body which arrives first is the same as the vehicle entering sequence of the assembly workshop, sending the vehicle body into the assembly workshop.
5. The buffer scheduling apparatus for automobile manufacturing according to claim 4, wherein the ideal sequence generating unit is specifically configured to:
and calling the particle swarm algorithm, taking the function of the first optimization target and the function of the second optimization target as fitness functions, restraining by the constraint condition, and iterating until the maximum iteration times are reached or the numerical value of the fitness functions reaches a set fraction, and stopping iterating to generate an optimal train-out sequence.
6. A buffer scheduling device for automotive manufacturing, characterized by comprising a memory and a processor, wherein the memory stores a computer program, which is executable by the processor to implement a buffer scheduling method for automotive manufacturing as claimed in any one of claims 1 to 3.
CN202310495350.9A 2023-05-05 2023-05-05 Cache region scheduling method, device and equipment for automobile manufacturing Active CN116205471B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310495350.9A CN116205471B (en) 2023-05-05 2023-05-05 Cache region scheduling method, device and equipment for automobile manufacturing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310495350.9A CN116205471B (en) 2023-05-05 2023-05-05 Cache region scheduling method, device and equipment for automobile manufacturing

Publications (2)

Publication Number Publication Date
CN116205471A CN116205471A (en) 2023-06-02
CN116205471B true CN116205471B (en) 2023-08-08

Family

ID=86509877

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310495350.9A Active CN116205471B (en) 2023-05-05 2023-05-05 Cache region scheduling method, device and equipment for automobile manufacturing

Country Status (1)

Country Link
CN (1) CN116205471B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116679659B (en) * 2023-08-04 2023-10-10 浙江大学 Automobile production optimization method and system based on PBS buffer area-final assembly workshop cooperation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2008202871A1 (en) * 2008-06-30 2010-01-14 Autonomous Solutions, Inc. Vehicle dispatching method and system
CN109242228A (en) * 2017-07-10 2019-01-18 中国科学院沈阳自动化研究所 A kind of PBS dispatching method that rule-based classification is autonomous
CN111538308A (en) * 2020-07-10 2020-08-14 上海交大智邦科技有限公司 Method and system for constructing production queue of flexible conversion production line manufacturing execution system
CN113435808A (en) * 2021-03-15 2021-09-24 中国第一汽车股份有限公司 AGV comprehensive scheduling method and system based on RFID technology

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2008202871A1 (en) * 2008-06-30 2010-01-14 Autonomous Solutions, Inc. Vehicle dispatching method and system
CN109242228A (en) * 2017-07-10 2019-01-18 中国科学院沈阳自动化研究所 A kind of PBS dispatching method that rule-based classification is autonomous
CN111538308A (en) * 2020-07-10 2020-08-14 上海交大智邦科技有限公司 Method and system for constructing production queue of flexible conversion production line manufacturing execution system
CN113435808A (en) * 2021-03-15 2021-09-24 中国第一汽车股份有限公司 AGV comprehensive scheduling method and system based on RFID technology

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨晋渝.《 汽车生产线自动调度系统设计》.《 自动化与仪器仪表》.2021,第1-5页. *

Also Published As

Publication number Publication date
CN116205471A (en) 2023-06-02

Similar Documents

Publication Publication Date Title
CN116205471B (en) Cache region scheduling method, device and equipment for automobile manufacturing
CN110450825B (en) Urban rail transit train operation control method
CN108417031B (en) Intelligent parking berth reservation strategy optimization method based on Agent simulation
CN114862226B (en) Warehouse logistics intelligent scheduling and loading and unloading management method and system
WO2014092628A1 (en) Device and method for platoon formation
CN111553501A (en) Order allocation method and device
CN106573624A (en) Method for operating a motor vehicle, motor vehicle, and computer program
CN111898909B (en) Unmanned bus dispatching method based on real-time requirements
CN112529487A (en) Vehicle scheduling method, device and storage medium
CN112070258A (en) Method and system for dispatching order of taxi taking in online taxi appointment
CN113763695A (en) Dispatching method and system for automatic driving vehicle
CN115130779A (en) Intelligent scheduling method based on mobile charging pile
CN106991555B (en) Urban vehicle crowdsourcing package transfer method based on incentive mechanism
CN115577833A (en) Particle swarm optimization method and system applied to solving path planning of cooperative delivery
CN108197879B (en) Multi-mode passenger and cargo co-transportation method and system
CN112183838A (en) Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm
CN114822007B (en) Automatic driving vehicle scheduling method and system
CN108960649A (en) A kind of take-away distribution scheduling method
CN110334940A (en) Material supply method, apparatus, equipment, storage medium and supply vehicle
CN115099716A (en) Method and system for dispatching bus in large station and bus in whole process for different lines
CN113611132A (en) Saturated single-intersection bus signal control method based on bus-road cooperative system
CN110969394A (en) Matching method, computer storage medium and electronic device
CN111160948A (en) Multi-objective optimized shared network car-booking and car-sharing pricing method
CN116337084B (en) Path planning method for delivering packages by multiple robots in part of same path section
CN116679659B (en) Automobile production optimization method and system based on PBS buffer area-final assembly workshop cooperation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant