阅读说明：本技术 一种化工园区车辆排号优化方法、储存介质以及电子设备 (Chemical industry park vehicle number optimizing method, storage medium and electronic equipment ) 是由 朱剑川 谢道德 肖建峰 于 2021-08-17 设计创作，主要内容包括：本发明涉及车辆运输控制技术领域,具体涉及一种化工园区车辆排号优化方法、储存介质以及电子设备,所述方法包括车辆预约进场时段；车辆是否在预定的预约进场时段内进场签到申请进场令牌,若是,则根据预约进场时段获取指定的排队序号后进入外场等待后依序进入内场开始作业；若否,则判断是否需要重新预约区号,若需要重新取号,则判断是否需要申请优先令牌,若不需要则重新预约进场时段,若需要则获取优先令牌,通过优先令牌进入外场等待后依序进入内场开始作业；若不需要重新取号,则结束；本发明能够保证车辆有序的进场、出场,保证仓储运输安全性、车辆调度时效性、降低进场之后空置率等目的,可以有效的提高生产效率,降低成本。(The invention relates to the technical field of vehicle transportation control, in particular to a chemical industry park vehicle number optimizing method, a storage medium and electronic equipment, wherein the method comprises the steps that a vehicle reserves an entrance period; whether the vehicle enters the entrance sign-in application entrance token in a preset entrance time period or not is judged, if yes, a specified queuing number is obtained according to the preset entrance time period, then the vehicle enters an external field to wait, and then the vehicle sequentially enters an internal field to start operation; if not, judging whether the area code needs to be reserved again, if the area code needs to be reserved again, judging whether a priority token needs to be applied, if not, reserving the entry time period again, if so, acquiring the priority token, entering an external field through the priority token, waiting, and then entering an internal field to start operation in sequence; if no number is required to be fetched again, ending; the invention can ensure the orderly entrance and exit of vehicles, ensure the storage and transportation safety, the scheduling timeliness of the vehicles, reduce the vacancy rate after the entrance and the like, effectively improve the production efficiency and reduce the cost.)

1. A chemical industry park vehicle number optimizing method is characterized by comprising

Step one, reserving an approach time period for a vehicle;

step two, whether the vehicle enters the entrance sign-in and applies for the entrance token within a preset reservation entrance time period or not is judged, if yes, a specified queuing number is obtained according to the reservation entrance time period, and then step three is executed; if not, judging whether the area code needs to be reserved again, if the area code needs to be reserved again, judging whether a priority token needs to be applied, if the priority token does not need to be applied, reserving the entrance time period again, if the priority token needs to be applied, acquiring the priority token, and executing the step three through the priority token; if no number is required to be fetched again, the step is ended;

step three, entering an external field for waiting, then entering an internal field in sequence to start operation, and executing step four after finishing the operation;

and step four, leaving the internal field, and ending the step.

2. The chemical industry park vehicle queue optimization method of claim 1, wherein the determination of whether a priority token needs to be applied for manual review by park personnel is made.

3. The chemical industry park vehicle ranking optimization method according to claim 1, wherein when the vehicle reserves an approach period, the vehicle generates identification segment numbers with a sequence relationship according to the sequence of the reserved approach period, and generates identification sequence numbers with a sequence relationship according to the sequence of successful reservations of the same reserved approach period;

and the queuing serial number generates a queuing serial number with a sequential relationship according to the identification segment number and the identification serial number according to the vehicles successfully signed in within the reserved entrance time period.

4. The chemical industry park vehicle ranking optimization method of claim 3, wherein the outfield waiting time is ranked with the identification segment number as the first priority, and if the identification segment numbers are the same, the ranking is performed according to the identification sequence number.

5. The chemical industry park vehicle ranking optimization method of claim 1, wherein if there are a plurality of priority tokens, a sequence relationship is generated according to the front and back of the acquisition time.

6. The chemical industry park vehicle ranking optimization method of claim 1, wherein the vehicle reservation approach period is through app or on-site reservation.

7. The chemical industry park vehicle queue optimization method of claim 6, wherein vehicle field booking confirms check-in at the same time.

8. The chemical industry park vehicle ranking optimization method of claim 1, wherein a vehicle holding a priority token preferentially enters the infield when entering the infield.

9. A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the chemical park vehicle consist optimization method of any one of claims 1-8.

10. An electronic device comprising at least a memory and a processor, the memory having a computer program stored thereon, wherein the processor, when executing the computer program on the memory, implements the chemical park vehicle consist optimization method of any one of claims 1-8.

Technical Field

The invention relates to the technical field of vehicle transportation control, in particular to a chemical industry park vehicle number optimizing method, a storage medium and electronic equipment.

Background

The transportation of the chemical industry is still in a relatively laggard stage of information-based development at present, the chemical products often have unique characteristics, such as obvious characteristics of large commodity volume, heavy weight, large human body injury, various forms and the like, and large special vehicles are often required to transport the chemical products in the storage and transportation processes, and the vehicles have the characteristics of large volume, large length, large turning direction difficulty, high oil consumption cost and the like; the special transport vehicles need to enter a park for queuing and scheduling when entering a park, and are arranged to enter the park through manual work after the special transport vehicles arrive at the park, so that the efficiency of the vehicles is low, the park is blocked, the time is long, the cost is high, and the chemical engineering is a high-level product, so that the risk coefficient of the park is increased.

Disclosure of Invention

The technical problem to be solved by the invention is as follows: the utility model provides a chemical industry garden vehicle row number optimization method, storage medium and electronic equipment of dispatching to the garden special type vehicle in order to promote the timeliness, reduce the vacancy rate after the approach.

In order to solve the above technical problems, a first technical solution adopted by the present invention is:

a method for optimizing the number of vehicles in chemical industry park includes

Step one, reserving an approach time period for a vehicle;

step two, whether the vehicle enters the entrance sign-in and applies for the entrance token within a preset reservation entrance time period or not is judged, if yes, a specified queuing number is obtained according to the reservation entrance time period, and then step three is executed; if not, judging whether the area code needs to be reserved again, if the area code needs to be reserved again, judging whether a priority token needs to be applied, if the priority token does not need to be applied, reserving the entrance time period again, if the priority token needs to be applied, acquiring the priority token, and executing the step three through the priority token; if no number is required to be fetched again, the step is ended;

step three, entering an external field for waiting, then entering an internal field in sequence to start operation, and executing step four after finishing the operation;

and step four, leaving the internal field, and ending the step.

Preferably, the judgment is made whether the priority token needs to be applied for manual review for the park staff.

Preferably, when the vehicle reserves the approach time period, the identification segment numbers with the sequence relation are generated according to the sequence of the reserved approach time period, and the identification sequence numbers with the sequence relation are generated according to the sequence of successful reservation of the same reserved approach time period;

and the queuing serial number generates a queuing serial number with a sequential relationship according to the identification segment number and the identification serial number according to the vehicles successfully signed in within the reserved entrance time period.

Preferably, when the outfield waits, the identification segment numbers are used as the first priority to be sorted, and if the identification segment numbers are the same, the sorting is carried out according to the identification sequence numbers.

Preferably, if there are a plurality of priority tokens, the order relationship is generated according to the front and back of the acquisition time.

Preferably, the vehicle reservation approach period is reserved through an app or on site.

Preferably, the vehicle field booking confirms the check-in at the same time.

Preferably, when entering the entrance, the vehicle holding the priority token preferentially enters the entrance.

In order to solve the above technical problem, the second technical solution adopted by the present invention is:

a storage medium storing a computer program which, when executed by a processor, implements the chemical park vehicle consist optimization method described above.

In order to solve the above technical problems, the third technical solution adopted by the present invention is:

an electronic device at least comprises a memory and a processor, wherein the memory is stored with a computer program, and the processor realizes the chemical industry park vehicle ranking optimization method covered above when executing the computer program on the memory.

The invention has the beneficial effects that: through the chemical industry park vehicle number arrangement optimization method, orderly entrance and exit of vehicles can be guaranteed, the aims of guaranteeing storage transportation safety, vehicle scheduling timeliness, reducing the vacancy rate after entrance and the like are fulfilled, the production efficiency can be effectively improved, and the cost is reduced.

Drawings

FIG. 1 is a schematic flow chart of a method for optimizing vehicle numbers in a chemical industry park according to an embodiment of the present invention;

fig. 2 is a schematic diagram of an appointment entry period and priority of a priority token of a chemical park vehicle queue optimization method according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of vehicle queuing queue priorities in a chemical park vehicle queuing optimization method according to an embodiment of the present invention;

fig. 4 is a schematic view of an approach of a chemical industry park vehicle number optimization method according to an embodiment of the present invention.

Detailed Description

In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.

Example one

Referring to fig. 1 to 4, a method for optimizing the vehicle number of a chemical industry park comprises

Reserving an entrance time period for the vehicle;

whether the vehicle enters the field and signs in (signs in to a park worker (a guard) (an actual sign-in/confirmation step)) within a preset reserved entrance time period applies for an entrance token, if so, a specified queuing number is acquired according to the reserved entrance time period, and then a step three is executed; if not, judging whether the area code needs to be reserved again, if the area code needs to be reserved again, judging whether a priority token needs to be applied, if the priority token does not need to be applied, reserving the entrance time period again, if the priority token needs to be applied, acquiring the priority token, and executing the step three through the priority token; if no number is required to be fetched again, the step is ended;

step three, entering an external field for waiting, then entering an internal field in sequence to start operation, and executing step four after finishing the operation;

and step four, leaving the internal field, and ending the step.

Wherein

And judging whether a priority token needs to be applied for manual examination for the park workers.

When the vehicle reserves the approach time period, generating identification segment numbers with sequential relation according to the sequence of the reserved approach time period, and generating identification serial numbers with sequential relation according to the sequence of successful reservation of the same reserved approach time period; and the queuing serial number generates a queuing serial number with a sequential relationship according to the identification segment number and the identification serial number according to the vehicles successfully signed in within the reserved entrance time period.

And when the outfield waits, sorting by taking the identification segment number as a first priority, and if the identification segment numbers are the same, sorting according to the identification sequence number.

If there are a plurality of priority tokens, a sequence relation is generated according to the front and back of the acquisition time.

The reserved entry period of the vehicle is reserved through an app or on-site (on-site area code, realized by park workers).

And the vehicle on-site reservation confirms the check-in at the same time.

When entering the interior, the vehicle having the priority token preferentially enters the interior.

Example two

A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the chemical industry park vehicle ranking optimization method of one embodiment.

EXAMPLE III

An electronic device at least comprises a memory and a processor, wherein the memory is stored with a computer program, and the processor realizes the chemical industry park vehicle ranking optimization method of the first embodiment when executing the computer program on the memory.

The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.