CN110826951A - Transportation line stowage method and device, electronic equipment and computer readable medium - Google Patents

Transportation line stowage method and device, electronic equipment and computer readable medium Download PDF

Info

Publication number
CN110826951A
CN110826951A CN201810907124.6A CN201810907124A CN110826951A CN 110826951 A CN110826951 A CN 110826951A CN 201810907124 A CN201810907124 A CN 201810907124A CN 110826951 A CN110826951 A CN 110826951A
Authority
CN
China
Prior art keywords
transportation
stowage
vehicle
route
volume
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.)
Pending
Application number
CN201810907124.6A
Other languages
Chinese (zh)
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.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
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 Beijing Jingdong Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201810907124.6A priority Critical patent/CN110826951A/en
Publication of CN110826951A publication Critical patent/CN110826951A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The disclosure provides a transportation line stowage method, a transportation line stowage device, electronic equipment and a computer readable medium, and belongs to the technical field of internet. The method comprises the following steps: configuring at least one stowage ground for a route destination of a transport route; acquiring a plurality of transportation plans, wherein the transportation plans at least comprise loading information; screening a transportation plan meeting screening conditions from the plurality of transportation plans by using the route destination and the stowage area; and combining the transportation plan meeting the screening condition with corresponding loading information to carry out vehicle loading. The method comprises the steps of configuring at least one allocation place for a route destination of a transportation route, and then carrying out vehicle allocation on transportation plans from the same origin to the route destination and the allocation place according to the same transportation route, so that cargoes from the same origin to different places are preferentially delivered to the destination, and the problem of transportation resource waste caused by the fact that a new transportation route from the origin to the allocation place needs to be additionally arranged in the prior art is solved.

Description

Transportation line stowage method and device, electronic equipment and computer readable medium
Technical Field
The present disclosure relates generally to the field of internet technologies, and in particular, to a transportation line stowage method, an apparatus, an electronic device, and a computer-readable medium.
Background
In recent years, with the popularization of the internet and the rise of the logistics industry, transportation becomes more and more important, and the transportation cost is the key competitiveness of the logistics industry. How to save the transportation cost, effectively utilize the transportation resources and improve the transportation timeliness becomes a pain point of enterprises.
At present, a dispatcher of each service line manually creates an appointment task according to a transportation plan of each service line, so that one or more transportation plans can be associated with an appointment document and dispatched, but the dispatcher does not know which transportation plans can be combined into a whole vehicle, and the transportation resources cannot be effectively utilized.
Therefore, there is still a need for improvement in the prior art solutions.
The above information disclosed in this background section is only for enhancement of understanding of the background of the disclosure and therefore it may contain information that does not constitute prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
The present disclosure provides a transportation line stowage method, device, electronic device, and computer readable medium, which solve the above technical problems.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to an aspect of the present disclosure, there is provided a transportation line stowage method, including:
configuring at least one stowage ground for a route destination of a transport route;
acquiring a plurality of transportation plans, wherein the transportation plans at least comprise loading information;
screening a transportation plan meeting screening conditions from the plurality of transportation plans by using the route destination and the stowage area;
and combining the transportation plan meeting the screening condition with corresponding loading information to carry out vehicle loading.
In one embodiment of the present disclosure, configuring at least one stowage ground for a route destination of a transportation route comprises:
specifying a route origin of the transport route;
calculating a distance between the route origin and the route destination;
and configuring at least one stowage ground for the route destination, so that the distance between the stowage ground and the route destination is within a preset range.
In one embodiment of the present disclosure, the transportation plan further includes a transportation origin and a transportation destination, and the screening of the transportation plan meeting the screening condition from the plurality of transportation plans using the route destination and the stowage location includes:
setting a screening condition that the route origin coincides with the transportation origin and that the route destination or the at least one stowage area coincides with the transportation destination;
and screening the plurality of transportation plans according to the screening conditions and the line information to obtain the transportation plan meeting the screening conditions.
In an embodiment of the present disclosure, the vehicle loading for the transportation plan meeting the screening condition in combination with the corresponding loading information includes:
calculating the volume sum of the transportation plans meeting the screening conditions according to the loading information, wherein the loading information comprises the transportation service type and the cargo volume, and the volume sum is equal to the sum of the cargo volumes in all the transportation plans meeting the conditions;
determining the vehicle types matched with the transportation business types as transportation vehicles according to the transportation business types, wherein each vehicle type is divided into at least two vehicle types according to the volume;
comparing the volume of the transport vehicle with the sum of the volumes in descending order to obtain a comparison result;
and selecting the vehicle type corresponding to the volume size from the transport vehicles according to the comparison result to carry out vehicle stowage.
In one embodiment of the present disclosure, selecting a vehicle type corresponding to a volume size from the transportation vehicles for vehicle stowage according to the comparison result includes:
if the comparison result is that the volume corresponding to the vehicle type with the largest volume of the transport vehicle is smaller than or equal to the sum of the volumes, the vehicle type with the largest volume is taken as an appointment-able vehicle type;
and if the comparison result shows that the vehicle type with the largest volume of the transport vehicles is larger than the sum of the volumes, selecting the vehicle type with the smaller volume from the transport vehicles for vehicle stowage.
In one embodiment of the present disclosure, after marking the transportation vehicle as a reservable vehicle type, the method further includes:
and recalculating to obtain a new volume sum according to the volume of the transport vehicle and the volume sum, wherein the calculation formula is as follows:
new sum of volumes-volume of transport vehicle;
comparing the volume of the transport vehicle with the new volume sum again according to the sequence from large to small to obtain a new comparison result;
and carrying out vehicle stowage according to the new comparison result and the vehicle type corresponding to the selected volume size in the transport vehicle.
In one embodiment of the present disclosure, the method further comprises:
and if the newly calculated volume sum is smaller than the minimum volume in the transport vehicle, marking the vehicle type with the minimum volume in the transport vehicle as an appointment-able vehicle type.
In an embodiment of the present disclosure, after selecting a vehicle type corresponding to a volume size from the transportation vehicles according to the comparison result for vehicle stowage, the method further includes:
and grouping the transportation plans of the screening conditions according to the vehicle loading result.
According to still another aspect of the present disclosure, there is provided a transportation line stowage device including:
a route configuration module configured to configure at least one stowage bin for a route destination of a transit route;
a plan acquisition module configured to acquire a plurality of transportation plans, the transportation plans including at least loading information;
a screening module configured to screen a transportation plan meeting a screening condition from the plurality of transportation plans using the route destination and the stowage location;
and the loading module is configured to load the vehicles for the transportation plans meeting the screening conditions in combination with the corresponding loading information.
According to yet another aspect of the present disclosure, there is provided an electronic device comprising a processor; a memory storing instructions for the processor to control the method steps as described above.
According to another aspect of the present disclosure, there is provided a computer-readable medium having stored thereon computer-executable instructions that, when executed by a processor, implement the method steps as described above.
According to the transportation route stowage method, the transportation route stowage device, the electronic equipment and the computer readable medium provided by the embodiment of the disclosure, on one hand, at least one stowage area is configured for the route destination of the transportation route, and then the transportation plans from the same origin to the route destination and the stowage areas are subjected to vehicle stowage according to the same transportation route, so that goods from the same origin to different cities or places are preferentially delivered to the destination, and the problem that transportation resources are wasted due to the fact that a new transportation route from the origin to the stowage areas needs to be additionally arranged in the prior art is solved. On the other hand, due to the introduction of the loading ground, the transportation cost can be reduced, the utilization rate of transportation resources is improved, the volume space of the vehicle is more fully utilized, and the volume rate is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings.
Fig. 1 shows a flow chart of a transportation line stowage method provided in an embodiment of the present disclosure.
Fig. 2 shows a stowage schematic diagram of a transportation route in an embodiment of the present disclosure.
Fig. 3 shows a flowchart of step S140 in fig. 1 according to an embodiment of the disclosure.
Fig. 4 shows a flowchart of step S344 in fig. 3 according to an embodiment of the present disclosure.
Fig. 5 is a flowchart illustrating specific processing steps of a transportation line stowage method according to an embodiment of the present disclosure.
Fig. 6 shows a schematic view of a transport line stowage arrangement provided in another embodiment of the present disclosure.
Fig. 7 shows a system architecture diagram for implementing a transportation line stowage method in another embodiment of the present disclosure.
Fig. 8 shows a detailed flowchart corresponding to the system architecture shown in fig. 7 in another embodiment of the present disclosure.
Fig. 9 shows a schematic structural diagram of an electronic device suitable for implementing an embodiment of the present application, provided by an embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known structures, methods, devices, implementations, materials, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.
Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to specific embodiments and the accompanying drawings.
In the related embodiment of the disclosure, if each service line (such as warehousing, fast distribution center TC, station) has a transportation demand, a transportation plan is established in the transportation system, and the transportation plan mainly includes information of an originating location, a destination location, originating person contact information, destination location contact information, cargo volume, weight, status, and the like. If the traffic plan of C city near city A and C city B is generated, the traffic plan of city A and C city is created additionally, so that the traffic of city A and C city A cannot be effectively utilized, and if the traffic plan of city B and C city is required to be dispatched twice, the dispatching of two car numbers from city A (namely, one dispatching is city A and city B, and the other dispatching is city A and city C) is required to increase the car number, and the vehicle transport volume of each car number is greatly wasted due to insufficient goods, so that the effective utilization cannot be achieved, the waste of transport resources is caused, and the transport cost is increased.
In addition, because the scheduling personnel generally manually create the car booking task according to the transportation plan during the booking, the scheduling personnel does not determine which transportation plans can be combined into a whole car, and the waste of transportation resources is also caused. The probability of error in manually creating a car appointment task is also higher, especially when the logistics order is on peak.
Fig. 1 shows a flowchart of a transportation route stowage method provided in an embodiment of the present disclosure, including the following steps:
as shown in fig. 1, in step S110, at least one stowage ground is allocated for the route destination of the transport route.
As shown in fig. 1, in step S120, a plurality of transportation plans are acquired, and the transportation plans at least include loading information.
As shown in fig. 1, in step S130, a transportation plan meeting the screening condition is screened out from the plurality of transportation plans using the route destination and the stowage space.
As shown in fig. 1, in step S140, vehicle loading is performed for the transportation plan meeting the screening condition in combination with the corresponding loading information.
According to the transportation route stowage method provided by the embodiment of the disclosure, on one hand, at least one stowage area is configured for the route destination of the transportation route, and then the transportation plans from the same origin to the route destination and the stowage area are subjected to vehicle stowage according to the same transportation route, so that goods from the same origin to different cities or places are preferentially delivered to the destination, and the problem that transportation resources are wasted due to the fact that a new transportation route from the origin to the stowage area needs to be additionally arranged in the prior art is solved. On the other hand, due to the introduction of the loading ground, the transportation cost can be reduced, the utilization rate of transportation resources is improved, the volume space of the vehicle is more fully utilized, and the volume rate is improved.
The detailed description of the transportation route stowage method provided by the present disclosure is described below with reference to the flowchart shown in fig. 1, specifically as follows:
in step S110, at least one stowage location is allocated for the route destination of the transport route.
In one embodiment of the present disclosure, configuring at least one stowage ground for a route destination of a transportation route comprises:
firstly, a line origin of a transportation line is determined; then, calculating the distance between the line origin and the line destination; and finally, configuring at least one loading ground for the line destination, so that the distance between the loading ground and the line destination is within a preset range, wherein the distance between the line origin and the line destination is far larger than the preset range.
Fig. 2 shows a schematic stowage diagram of a transportation route, and as shown in fig. 2, the transportation route includes a route origin, a corresponding route destination, and N stowage locations, i.e., the stowage locations 1 and 2 … …, which correspond to the route destination.
It should be noted that the preset range may be determined according to the requirements of a specific use scenario, and the range limitation may be defined by an area, or may be defined by a distance, for example, the distance between the route destination and the stowage location may be limited within 200KM, or the route destination and the stowage location may be limited to be in the same province and city, and so on. In any way, the preset range should be much smaller than the distance between the line origin and the line destination, and taking the line origin in cantonese and the line destination in beijing as examples, some cities or places around the line destination can be configured as stowage areas.
In a system for vehicle stowage, a plurality of transport routes may exist, in which step, route information needs to be configured for each transport route, the route information may specifically include a route origin, a route destination, and a stowage place meeting a certain condition with the route destination, and the number of the stowage places may be set and changed according to requirements.
In step S120, a plurality of transportation plans are acquired. The mode of acquiring the transportation plan in this step may be acquired by the customer through information input by the mobile terminal by self, or acquired by adding information in the system by an operator.
In an embodiment of the present disclosure, a transportation plan of a customer may be obtained through a mobile terminal, an operation interface, and other manners, where the transportation plans may be multiple transportation plans from one customer or multiple customers, and each transportation plan at least includes a transportation origin, a transportation destination, and loading information equal to some key parameters related to completing the transportation plan. The loading information includes a transportation service type and a cargo volume, and the transportation service type is a type of service requirement for completing a transportation plan, such as whether the transportation plan requires a common cargo or a cold-chain vehicle, or whether the transportation plan requires a common cargo vehicle or a common cargo vehicle, or whether the transportation plan requires a cold-chain vehicle or a cold-chain vehicle, and the like.
The cargo volume is the total volume of the cargo in the transportation plan, and the transportation plan further comprises field information such as the acquired weight, the originating contact information, the destination contact information and the plan state, wherein the plan state comprises an initial state, a confirmation state and a car appointment state.
In practical application, when a transportation plan is created according to requirements, the default plan state is an initial state. The created transportation plan needs to be checked later, that is, whether the information items of the fields of the transportation plan are complete or not is checked (the checking process can be automatically checked by a system or manually checked by a worker), and when the information of a certain transportation plan is confirmed to be complete, the transportation plan can be submitted to the transportation plan pool.
In an embodiment of the present disclosure, for a plurality of transportation plans in the transportation plan pool, task grouping is performed mainly by using at least one field of a transportation origin, a transportation destination, a distribution place, a transportation service type and the like as a division basis, and a task group with the same transportation origin can be screened from the plurality of transportation plans, or a task group with the same transportation service type can be screened from the plurality of transportation plans, or a task group with the same transportation origin and transportation service type can be screened from the plurality of transportation plans.
In step S130, a transportation plan meeting the screening condition is screened out from the plurality of transportation plans using the route destination and the stowage space.
In one embodiment of the present disclosure, the step of screening the transportation plan meeting the screening condition from the plurality of transportation plans by using the route destination and the stowage place includes:
first, a screening condition is set, wherein the screening condition may be that the route origin coincides with the transportation origin, and that the route destination or at least one of the stowage locations coincides with the transportation destination. In other embodiments of the present disclosure, the rule of the screening condition may also be changed according to specific requirements.
And then, screening the plurality of transportation plans according to the screening conditions and the line information to obtain the transportation plans meeting the screening conditions.
It should be noted that the screening condition set by the present embodiment is also usually related to the task grouping situation that the transportation plan eat in the previous step. For example, if no grouping is performed in step S120, in step S130, a transportation plan meeting the screening conditions is obtained by screening according to the screening conditions in which the origin and the destination match. However, if the transportation plans are grouped according to the transportation origins after the plurality of transportation plans are acquired in step S120, the screening condition in step S130 only includes the screening of the destinations, and a specific screening condition may be that the route destination or at least one of the stowage locations has a correspondence with the transportation destination, so that the screening condition can be used to screen out that the route origin and the transportation origin are consistent, and the route destination or at least one of the stowage locations has a transportation plan corresponding to the destination of the transportation plan (i.e., the transportation destination). The specific implementation process may be that, according to the field of the route origin, a task group of the transportation origin with the same value as the corresponding value of the field is directly selected, and then the transportation plan in the task group is screened by using the field of the route destination or at least one loading place of the route destination, and the transportation plan meeting the screening condition is obtained as follows: the origin of the transportation plan coincides with the origin of the route, and the destination of the transportation plan coincides with the route destination or the stowage location of one of the route destinations.
In step S140, vehicle loading is performed for the transportation plan meeting the screening condition in combination with the corresponding loading information.
In one embodiment of the present disclosure, fig. 3 shows a flowchart of step S140, including the steps of:
as shown in fig. 3, in step S341, the sum of the volumes of the transportation plans that meet the screening conditions is calculated based on the loading information. Because the cargo volume is recorded in the loading information of the transportation plan, the cargo volumes in the transportation plan which meet the screening conditions can be summed to obtain the volume sum.
As shown in fig. 3, in step S342, the vehicle category matched with the transportation service type is determined to be a transportation vehicle according to the transportation service type, and each vehicle category is divided into at least two vehicle types according to the volume size. Because the type of the service duration required for completing the transportation plan is recorded in the transportation service type of the transportation plan, the transportation vehicle can be determined according to the transportation service type, namely, the transportation plan is completed by which vehicle, for example, the transportation service type is a cold chain whole vehicle or a cold chain car pool, which indicates that goods transported by the transportation plan may be fresh, so that the transportation vehicle can be determined to be a cold chain vehicle.
In addition, in order to meet the transportation plans with different volumes, each vehicle category needs to comprise at least two vehicle models with different volumes, such as two vehicle models including a cold chain cart and a cold chain trolley, or three vehicle models including a cold chain cart, a cold chain middle vehicle and a cold chain trolley, and the like. The common goods can be carried, and the vehicle type can also comprise a plurality of vehicle types with different sizes, and the vehicle can be easily sized by using parameters such as carriage length and the like besides large, medium and small.
As shown in fig. 3, in step S343, the volume of the transportation vehicle is compared with the sum of the volumes in order from large to small, and a comparison result is obtained. In the vehicle loading process, the vehicle type with larger volume is firstly compared with the total volume of the cargos in sequence, so that the loading mode which can complete the transportation plan and reduce the transportation cost as much as possible can be selected according to the volume of the cargos to complete the transportation.
As shown in fig. 3, in step S344, a vehicle model corresponding to the volume size is selected from the transportation vehicles according to the comparison result, and vehicle loading is performed.
The method specifically comprises the following steps:
and if the comparison result is that the volume corresponding to the vehicle type with the largest volume of the transport vehicle is less than or equal to the sum of the volumes, the vehicle type with the largest volume is taken as the vehicle type which can be reserved, so that the vehicle type with the larger volume can be filled.
It should be noted that "full" in this embodiment refers to absolute full, that is, the loading amount may set the floating percentage of the volume of one vehicle type, that is, the floating percentage may be reserved within a range that meets the requirement, except that the volume of the vehicle type after loading reaches 100%. For example, 98% to 100% of the load may be considered full, and the scaling factor may be configured as a variable according to the requirement, but not below a certain ratio (e.g., not below 98%).
And if the comparison result shows that the model with the largest volume of the transport vehicles is larger than the sum of the volumes, selecting the model with the smaller volume from the transport vehicles for vehicle stowage. According to the comparison result, if the vehicle type with larger volume can not be fully loaded, the vehicle with smaller volume is continuously selected for loading, and the comparison method is the same as the steps S343 to S344 until the vehicle type capable of being fully loaded is selected.
In one embodiment of the present disclosure, if the last calculated new volume sum is less than the smallest volume in the transport vehicle, the model with the smallest volume in the transport vehicle is marked as the reservable model. That is, if the model which can fill the vehicle is not found until the comparison is completed (that is, the model with the smallest volume cannot be filled), the transportation plans in the transportation plan pool are traversed again within the preset waiting time before departure (specifically, several hours can be configured according to the requirement, specifically, the size of the traffic can be combined, for example, if the traffic is large, the waiting time can be appropriately shortened), and if the filling of the minimum model is not met, the minimum model is taken as a part-reduced vehicle task to complete the stowage.
In one embodiment of the present disclosure, fig. 4 further shows a flowchart after the transportation vehicle is marked as the bookable vehicle type in step S344, further comprising the following steps:
as shown in fig. 4, in step S4441, a new volume sum is recalculated according to the volume of the transportation vehicle and the volume sum, wherein the calculation formula is: new sum of volumes-volume of transport vehicle.
As shown in fig. 4, in step S4442, the volume of the transportation vehicle is compared with the new total volume in descending order to obtain a new comparison result.
As shown in fig. 4, in step S4443, the vehicle is loaded according to the vehicle type corresponding to the selected volume size of the transportation vehicle according to the new comparison result.
Based on the steps shown in fig. 4, when the sum of the volumes of the cargo volumes of the transportation plans meeting the screening conditions is larger than the maximum volume of the vehicle, the vehicle model with the maximum volume is filled first, and the vehicle models with the maximum volume are sequentially used for comparison, wherein the vehicle models with the maximum volume are left for comparison, and the alternative vehicle models are sequentially used for comparison and stowage from large to small, so that the stowage can be performed in a mode of filling the vehicle with the larger volume first as much as possible, and a transportation mode with lower cost can be selected as much as possible on the premise of completing the transportation plans.
In an embodiment of the present disclosure, after selecting a vehicle type corresponding to the volume size from the transportation vehicles according to the comparison result to perform vehicle stowage, the method further includes:
and (3) grouping the transportation plans of the screening conditions according to the vehicle loading results, specifically, dividing the transportation meters distributed to the same vehicle into the same group, so that the corresponding relation between the vehicle type of the whole vehicle and the transportation plan grouping can be formed. Furthermore, the same group of transportation plans can be produced into a unique preset record, and the state of the corresponding transportation plan is changed into the reserved vehicle.
In the embodiment of the disclosure, if the vehicle is the whole vehicle, the vehicle booking mode is identified as the whole vehicle, a unique vehicle booking record is generated to establish association with the transportation plan combination, the transportation plan is compiled, and the state of the transportation plan is identified as the reserved vehicle; according to the transportation route, the transportation plan combination and the reserved vehicle type, if the vehicle is a spare load vehicle, the vehicle reservation mode is identified as the spare load, a unique vehicle reservation record is generated to establish association with the transportation plan combination, the transportation plan is traversed, and the transportation plan is identified as the reserved vehicle.
Based on the above, the transportation route stowage method in the embodiment of the present disclosure is described in detail with reference to the flowchart of the specific processing steps of the transportation route stowage method shown in fig. 5:
as shown in fig. 5, in step S501, the service person performs configuration according to the transportation route (origin, destination), and allocates at least one allocation place for the route destination so that each route supports city allocation. In the configuration step, besides manual configuration by service personnel, the configuration can be automatically performed by the system according to preset configuration conditions.
As shown in fig. 5, in step S502, the customers of each service line establish a plurality of transportation plans in the system according to their own transportation demands, so that the plurality of transportation plans form a total transportation plan pool. And if the transportation plan established by the service line is the whole vehicle appointment, directly jumping to the step S506 to finish the whole vehicle appointment.
As shown in fig. 5, in step S503, the system periodically traverses a plurality of transportation routes according to the waiting time (which may be reduced according to the service configuration when the traffic volume is large) of the first few hours of the departure time, and performs filtering according to each transportation route and the allocation place on the route to obtain a corresponding transportation plan meeting the filtering condition.
As shown in fig. 5, in step S504, the volume sum is calculated according to the filtered transportation plan. Generally, whether the truck is full or not is calculated according to the volume (or volume), and in special cases, the weight sum can be calculated or the volume sum and the weight sum can be calculated by directly using a database. For example, some large and heavy cargoes not only meet the condition that the volume does not exceed the vehicle statistics, but also consider that the total weight of the cargoes cannot exceed the maximum load capacity of the vehicle, so as to avoid the safety problem caused by the overweight of the cargoes.
As shown in fig. 5, in step S505, traversing all vehicle type sets according to the vehicle volume from large to small, comparing with the volume sum, if the volume of a vehicle type is smaller than the volume sum, recording the corresponding vehicle type to an orderable vehicle type, forming a combination of transportation plans capable of filling the vehicle type, recalculating a new volume sum which is the volume sum-vehicle type volume, and performing a circular comparison again until no orderable vehicle type can be found finally, that is, the final volume sum is not enough to fill any whole vehicle type, selecting the vehicle type with the smallest volume to establish a part-load car.
As shown in fig. 5, in step S506, according to the transportation route, the transportation plan combination, and the reserved vehicle type, specifically: if the vehicle is a part load vehicle reservation, identifying the vehicle reservation mode as the part load, generating a unique vehicle reservation record and establishing association with the transportation plan combination, traversing the transportation plan, and identifying the transportation plan as the reserved vehicle; and if the vehicle is the whole vehicle, identifying the vehicle booking mode as the whole vehicle, generating a unique vehicle booking record and establishing association with the transportation plan combination, compiling the transportation plan, and identifying the transportation plan as the reserved vehicle.
As shown in fig. 5, in step S507, a car is dispatched according to the automatically created car-booking task (including a complete car-booking and a part car-booking), and the dispatching process may be manually or automatically issued by the system, and a message is sent to the relevant carrier to inform the relevant carrier of the specific information of the transportation plan of the carrier.
Based on the steps, the line information of the transportation line is established in advance, the line information comprises basic information such as a starting place, a destination, a loading place and the like, the system filters out the transportation plan of unfinished whole car booking according to the maintained transportation line and the loading place of the line at regular time, calculates the required car type according to the volume statistics in the transportation plan, and automatically creates a booking task according to the car type, the related information of the transportation line and the corresponding transportation plan.
In summary, the transportation route stowage method provided by the embodiment of the disclosure allocates at least one stowage area to the route destination of the transportation route, and then performs vehicle stowage on the transportation plan from the same origin to the route destination and the stowage area according to the same transportation route, so as to preferentially deliver the goods from the same origin to different cities or places to the destination, thereby solving the problem that transportation resources are wasted because a new transportation route from the origin to the stowage area needs to be additionally arranged in the prior art. Due to the introduction of the loading ground, the transportation cost can be reduced, the utilization rate of transportation resources is improved, the volume space of the vehicle is more fully utilized, and the volume rate is improved.
Fig. 6 shows a schematic diagram of a transportation line loading device provided in another embodiment of the present disclosure, and as shown in fig. 6, the device 600 includes: a line configuration module 610, a plan acquisition module 620, a screening module 630, and a stowage module 640.
The route configuration module 610 is configured to configure at least one stowage bin for a route destination of a transit route; the plan obtaining module 620 is configured to obtain a plurality of transportation plans, the transportation plans including at least loading information; the screening module 630 is configured to screen a transportation plan meeting the screening condition from the plurality of transportation plans using the route destination and the stowage; the stowage module 640 is configured to stowage vehicles for transportation plans that meet the screening conditions in combination with corresponding loading information.
The functions of each module in the apparatus are described in the above method embodiments, and are not described again here.
Fig. 7 is a system architecture diagram for implementing the transportation line stowage method according to the embodiment, as shown in fig. 7, the system architecture diagram includes a mobile terminal 710 and a server 720, where the mobile terminal can obtain information input by a user and timely receive alarm information, and the server 720 is used for managing basic data information and maintaining information of related modules to a system through the system. The server 720 includes a transportation route management unit 721, a site management unit 722, a data dictionary 723, a transportation plan management unit 724, and a reservation management unit 725, and the specific functions of each unit are as follows:
1) a transportation line management unit: basic information maintenance for a transportation route is mainly maintained, for example, from a certain station in beijing to a certain station in shanghai, a stowage city of a set destination can be made for the route (the stowage city is mainly used for a filtering transportation plan).
2) A site management unit: the management (increase, change, activation/deactivation) of each site or sorting center and the like all over the country is mainly managed, and the management comprises site numbers, site names, logistics four-level address provinces, cities, counties and counties.
3) A data dictionary: data management (addition, modification, activation/deactivation) of the type of transportation service, the mode of transportation, etc. is mainly maintained.
4) A transportation plan management unit: when a business client has a cargo transportation demand, a corresponding transportation plan is formulated through the system, and the transportation plan mainly comprises fields such as states (initial state, confirmation state and contracted vehicle state), an origin, originating contact information, a destination, destination contact information, business types (whole general cargo vehicle, whole cold chain vehicle, general cargo, large piece and the like), volume, weight and the like.
When the business creates a transportation plan according to the requirement, the default state is the initial state. And when the information is confirmed to be complete and error-free, submitting the transportation plan to a transportation plan pool (the transportation plan pool mainly comprises the originating city and the type of business).
5) Car appointment management unit: and the manual car booking is mainly used for generating corresponding car booking tasks according to the transportation plan pool.
The transportation route stowage is realized according to the system architecture, and the specific flow shown in fig. 8 is as follows:
as shown in fig. 8, in step S801, a plurality of transportation plans of customer 1, customer 2 … …, customer M are acquired.
As shown in fig. 8, in step S802, it is determined whether or not the vehicle is ordered, and if so, the process proceeds to step S804, and if not, the process proceeds to step S803.
As shown in fig. 8, in step S803, the transportation plans are grouped, and the process proceeds to step S804 for each group.
As shown in fig. 8, in step S804, a car-booking task is generated, that is, a corresponding entire car-booking task is generated in step S802, and a corresponding car-booking task is generated for each group in step S803.
The method also comprises the following steps: task grouping can be carried out in the transportation plan pool according to at least one field of a transportation starting place, a transportation destination, a loading place, a transportation service type and the like as a division basis, and if the volume sum of the transportation plan of each task group in the transportation plan pool just reaches the volume of a whole vehicle, a whole vehicle booking task is generated; if the sum of the volumes of the transportation plans of each task group in the transportation plan pool does not reach the volume of a whole vehicle and does not reach the volume in a waiting time before departure, a part-load car-saving task is generated.
As shown in fig. 8, in step S805, it is determined whether the car reservation was successful, and if so, the process goes to step S806; if not, go to step S807.
As shown in fig. 8, in step S806, the status of the transportation plan is updated to be reserved, and the car-booking task is issued to the carrier.
As shown in fig. 8, in step S807, a report is sent to the monitoring person.
In summary, the transportation route stowage method provided by the embodiment of the disclosure allocates at least one stowage area to the route destination of the transportation route, and then performs vehicle stowage on the transportation plan from the same origin to the route destination and the stowage area according to the same transportation route, so as to preferentially deliver the goods from the same origin to different cities or places to the destination, thereby solving the problem that transportation resources are wasted because a new transportation route from the origin to the stowage area needs to be additionally arranged in the prior art. Due to the introduction of the loading ground, the transportation cost can be reduced, the utilization rate of transportation resources is improved, the volume space of the vehicle is more fully utilized, and the volume rate is improved.
In another aspect, the present disclosure also provides an electronic device, including a processor and a memory, where the memory stores operating instructions for the processor to control the following method:
configuring at least one stowage ground for a route destination of a transport route; acquiring a plurality of transportation plans, wherein the transportation plans at least comprise loading information; screening a transportation plan meeting screening conditions from the plurality of transportation plans by using the route destination and the stowage area; and combining the transportation plan meeting the screening condition with corresponding loading information to carry out vehicle loading.
Referring now to FIG. 9, shown is a block diagram of a computer system 900 suitable for use in implementing the electronic device of an embodiment of the present application. The electronic device shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 9, the computer system 900 includes a Central Processing Unit (CPU)901 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage section 907 into a Random Access Memory (RAM) 903. In the RAM903, various programs and data necessary for the operation of the system 900 are also stored. The CPU 901, ROM 902, and RAM903 are connected to each other via a bus 904. An input/output (I/O) interface 905 is also connected to bus 904.
The following components are connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present application when executed by the Central Processing Unit (CPU) 801.
It should be noted that the computer readable medium shown in the present application may be a computer readable signal medium or a computer readable medium or any combination of the two. A computer readable medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a transmitting unit, an obtaining unit, a determining unit, and a first processing unit. The names of these units do not in some cases constitute a limitation to the unit itself, and for example, the sending unit may also be described as a "unit sending a picture acquisition request to a connected server".
In another aspect, the present disclosure also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include the method steps of:
configuring at least one stowage ground for a route destination of a transport route; acquiring a plurality of transportation plans, wherein the transportation plans at least comprise loading information; screening a transportation plan meeting screening conditions from the plurality of transportation plans by using the route destination and the stowage area; and combining the transportation plan meeting the screening condition with corresponding loading information to carry out vehicle loading.
It should be clearly understood that this disclosure describes how to make and use particular examples, but the principles of this disclosure are not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.
Exemplary embodiments of the present disclosure are specifically illustrated and described above. It is to be understood that the present disclosure is not limited to the precise arrangements, instrumentalities, or instrumentalities described herein; on the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (11)

1. A method of stowage in a transport line, comprising:
configuring at least one stowage ground for a route destination of a transport route;
acquiring a plurality of transportation plans, wherein the transportation plans at least comprise loading information;
screening a transportation plan meeting screening conditions from the plurality of transportation plans by using the route destination and the stowage area;
and combining the transportation plan meeting the screening condition with corresponding loading information to carry out vehicle loading.
2. The transportation line stowage method of claim 1 wherein configuring at least one stowage bin for a line destination of a transportation line comprises:
specifying a route origin of the transport route;
calculating a distance between the route origin and the route destination;
and configuring at least one stowage ground for the route destination, so that the distance between the stowage ground and the route destination is within a preset range.
3. The transportation route stowage method according to claim 2, wherein said transportation plan further includes a transportation origin and a transportation destination, and the screening of the transportation plan meeting the screening condition from said plurality of transportation plans using said route destination and said stowage destination comprises:
setting a screening condition that the route origin coincides with the transportation origin and that the route destination or the at least one stowage area coincides with the transportation destination;
and screening the plurality of transportation plans by combining the transportation lines according to the screening conditions to obtain the transportation plans meeting the screening conditions.
4. The transportation route stowage method according to claim 1, wherein the vehicle stowage in combination with the corresponding stowage information for the transportation plan meeting the screening condition includes:
calculating the volume sum of the transportation plans meeting the screening conditions according to the loading information, wherein the loading information comprises the transportation service type and the cargo volume, and the volume sum is equal to the sum of the cargo volumes in all the transportation plans meeting the conditions;
determining the vehicle types matched with the transportation business types as transportation vehicles according to the transportation business types, wherein each vehicle type is divided into at least two vehicle types according to the volume;
comparing the volume of the transport vehicle with the sum of the volumes in descending order to obtain a comparison result;
and selecting the vehicle type corresponding to the volume size from the transport vehicles according to the comparison result to carry out vehicle stowage.
5. The transportation line stowage method according to claim 4, wherein selecting a vehicle type corresponding to a volume size from the transportation vehicles for vehicle stowage according to the comparison result comprises:
if the comparison result is that the volume corresponding to the vehicle type with the largest volume of the transport vehicle is smaller than or equal to the sum of the volumes, the vehicle type with the largest volume is taken as an appointment-able vehicle type;
and if the comparison result shows that the vehicle type with the largest volume of the transport vehicles is larger than the sum of the volumes, selecting the vehicle type with the smaller volume from the transport vehicles for vehicle stowage.
6. The transit line stowage method according to claim 5, wherein after marking the transit vehicle as a reservable vehicle type, further comprising:
and recalculating to obtain a new volume sum according to the volume of the transport vehicle and the volume sum, wherein the calculation formula is as follows:
new sum of volumes-volume of transport vehicle;
comparing the volume of the transport vehicle with the new volume sum again according to the sequence from large to small to obtain a new comparison result;
and carrying out vehicle stowage according to the new comparison result and the vehicle type corresponding to the selected volume size in the transport vehicle.
7. The transit line stowage method according to claim 6 wherein said method further comprises:
and if the newly calculated volume sum is smaller than the minimum volume in the transport vehicle, marking the vehicle type with the minimum volume in the transport vehicle as an appointment-able vehicle type.
8. The transportation line stowage method according to any one of claims 5 to 7, wherein after selecting a vehicle type corresponding to a volume size from the transportation vehicles according to the comparison result to perform vehicle stowage, further comprising:
and grouping the transportation plans of the screening conditions according to the vehicle loading result.
9. A transportation line stowage device, comprising:
a route configuration module configured to configure at least one stowage bin for a route destination of a transit route;
a plan acquisition module configured to acquire a plurality of transportation plans, the transportation plans including at least loading information;
a screening module configured to screen a transportation plan meeting a screening condition from the plurality of transportation plans using the route destination and the stowage location;
and the loading module is configured to load the vehicles for the transportation plans meeting the screening conditions in combination with the corresponding loading information.
10. An electronic device, comprising:
a processor;
memory storing instructions for the processor to control the method steps according to any one of claims 1-8.
11. A computer-readable medium having stored thereon computer-executable instructions, which when executed by a processor, perform the method steps of any one of claims 1-8.
CN201810907124.6A 2018-08-10 2018-08-10 Transportation line stowage method and device, electronic equipment and computer readable medium Pending CN110826951A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810907124.6A CN110826951A (en) 2018-08-10 2018-08-10 Transportation line stowage method and device, electronic equipment and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810907124.6A CN110826951A (en) 2018-08-10 2018-08-10 Transportation line stowage method and device, electronic equipment and computer readable medium

Publications (1)

Publication Number Publication Date
CN110826951A true CN110826951A (en) 2020-02-21

Family

ID=69541113

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810907124.6A Pending CN110826951A (en) 2018-08-10 2018-08-10 Transportation line stowage method and device, electronic equipment and computer readable medium

Country Status (1)

Country Link
CN (1) CN110826951A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111476426A (en) * 2020-04-15 2020-07-31 中道明华建设工程项目咨询有限责任公司 Big data-based cost data collection method and system
CN111667103A (en) * 2020-05-25 2020-09-15 上海东普信息科技有限公司 Method, device, equipment and storage medium for logistics scheduling based on destination
CN113537866A (en) * 2020-04-20 2021-10-22 北京京东振世信息技术有限公司 Method, apparatus and storage medium for determining product distribution parameters
CN114219403A (en) * 2021-12-17 2022-03-22 佛山市海天调味食品股份有限公司 B2B order splitting method, device and storage medium
WO2023082724A1 (en) * 2021-11-11 2023-05-19 北京京东振世信息技术有限公司 Logistics routing network determination method and apparatus, and electronic device
WO2023082782A1 (en) * 2021-11-09 2023-05-19 北京京东振世信息技术有限公司 Logistics route network determination method and apparatus
WO2023087508A1 (en) * 2021-11-18 2023-05-25 广州工商学院 Cold chain logistics monitoring method and system, and computer device

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002114330A (en) * 2000-10-10 2002-04-16 Toyota Motor Corp Transportation program planning device and transportation program planning method
CN103745329A (en) * 2013-12-19 2014-04-23 柳州职业技术学院 Internet-of-things-oriented economical type logistics transportation delivery method
KR20160050617A (en) * 2014-10-30 2016-05-11 대우조선해양 주식회사 Transporter terminal apparatus, signal man terminal apparatus and method for providing transport route of blocks using thereof
CN105702020A (en) * 2016-04-13 2016-06-22 广州市沃希信息科技有限公司 Car pooling-based parcel delivery method, system and server
CN106022864A (en) * 2016-05-09 2016-10-12 广西大学 Vehicle goods supply and demand intelligent matching calculation method
WO2017033308A1 (en) * 2015-08-26 2017-03-02 株式会社日立物流 Transport plan generating system, transport plan generating method, and non-transitory storage medium
CN106537444A (en) * 2014-05-06 2017-03-22 埃尔瓦有限公司 System and methods for travel planning that calls for at least one transportation vehicle unit
CN106920053A (en) * 2015-12-25 2017-07-04 阿里巴巴集团控股有限公司 Method and device that a kind of dispatching transport power to dispatching point is allocated
CN107944807A (en) * 2017-12-27 2018-04-20 广西师范学院 Logistic management system
CN107958315A (en) * 2018-01-09 2018-04-24 广西师范学院 Intelligent logistics allocator
CN108364105A (en) * 2018-02-26 2018-08-03 镇江宝华物流股份有限公司 A kind of purpose optimal method of logistics distribution circuit

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002114330A (en) * 2000-10-10 2002-04-16 Toyota Motor Corp Transportation program planning device and transportation program planning method
CN103745329A (en) * 2013-12-19 2014-04-23 柳州职业技术学院 Internet-of-things-oriented economical type logistics transportation delivery method
CN106537444A (en) * 2014-05-06 2017-03-22 埃尔瓦有限公司 System and methods for travel planning that calls for at least one transportation vehicle unit
KR20160050617A (en) * 2014-10-30 2016-05-11 대우조선해양 주식회사 Transporter terminal apparatus, signal man terminal apparatus and method for providing transport route of blocks using thereof
WO2017033308A1 (en) * 2015-08-26 2017-03-02 株式会社日立物流 Transport plan generating system, transport plan generating method, and non-transitory storage medium
CN106920053A (en) * 2015-12-25 2017-07-04 阿里巴巴集团控股有限公司 Method and device that a kind of dispatching transport power to dispatching point is allocated
CN105702020A (en) * 2016-04-13 2016-06-22 广州市沃希信息科技有限公司 Car pooling-based parcel delivery method, system and server
CN106022864A (en) * 2016-05-09 2016-10-12 广西大学 Vehicle goods supply and demand intelligent matching calculation method
CN107944807A (en) * 2017-12-27 2018-04-20 广西师范学院 Logistic management system
CN107958315A (en) * 2018-01-09 2018-04-24 广西师范学院 Intelligent logistics allocator
CN108364105A (en) * 2018-02-26 2018-08-03 镇江宝华物流股份有限公司 A kind of purpose optimal method of logistics distribution circuit

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
KYOUNGHO AHN, HESHAM RAKHA: "The effects of route choice decisions on vehicle energy consumption and emissions", TRANSPORTATION RESEARCH PART D:TRANSPORT AND ENVIRONMENT, no. 2008, 31 January 2008 (2008-01-31), pages 151 - 167 *
严蓉: "区域干线物流的运输网络优化研究", 区域干线物流的运输网络优化研究, pages 3 - 40 *
于波: "快运网络构建及快运车辆配载配送优化研究", 快运网络构建及快运车辆配载配送优化研究:, pages 4 - 100 *
任保宽,林兰刚,杨栋: "大件货物运输路线选择分析", 中国储运, no. 2014, 30 November 2014 (2014-11-30), pages 116 - 118 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111476426A (en) * 2020-04-15 2020-07-31 中道明华建设工程项目咨询有限责任公司 Big data-based cost data collection method and system
CN113537866A (en) * 2020-04-20 2021-10-22 北京京东振世信息技术有限公司 Method, apparatus and storage medium for determining product distribution parameters
CN111667103A (en) * 2020-05-25 2020-09-15 上海东普信息科技有限公司 Method, device, equipment and storage medium for logistics scheduling based on destination
CN111667103B (en) * 2020-05-25 2023-08-29 上海东普信息科技有限公司 Method, device, equipment and storage medium for destination-based logistics scheduling
WO2023082782A1 (en) * 2021-11-09 2023-05-19 北京京东振世信息技术有限公司 Logistics route network determination method and apparatus
WO2023082724A1 (en) * 2021-11-11 2023-05-19 北京京东振世信息技术有限公司 Logistics routing network determination method and apparatus, and electronic device
WO2023087508A1 (en) * 2021-11-18 2023-05-25 广州工商学院 Cold chain logistics monitoring method and system, and computer device
CN114219403A (en) * 2021-12-17 2022-03-22 佛山市海天调味食品股份有限公司 B2B order splitting method, device and storage medium

Similar Documents

Publication Publication Date Title
CN110826951A (en) Transportation line stowage method and device, electronic equipment and computer readable medium
CN109308540B (en) Distribution plan generation method, device and system for distribution vehicle
Magnanti Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
CN113379102B (en) Multi-network trunk transport optimization method, computer equipment and storage medium
CN114902257A (en) Improved logistics management system
CN109726863A (en) A kind of material-flow method and system of multiple-objection optimization
CN107169677A (en) A kind of civil airport machine level ground support vehicles centralized scheduling command system
CN113627792B (en) Unmanned vehicle scheduling management method, device, equipment, storage medium and program
CN113177752B (en) Route planning method and device and server
CN111667085A (en) Method, device, medium and electronic equipment for determining logistics routing network
CN111667103B (en) Method, device, equipment and storage medium for destination-based logistics scheduling
Bombelli et al. The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations
Ninikas et al. Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls
Gaul et al. Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph
CN112184092A (en) Logistics node determination method, device, server and storage medium
Narayanan et al. Using Lagrangian relaxation to solve ready mixed concrete dispatching problems
CN111860918B (en) Distribution method and device, electronic equipment and computer readable medium
CN110400004A (en) The time limit method for early warning and device of railway goods
CN109784816A (en) Express delivery distribution method and device
JP2002193450A (en) Physical distribution control method and physical distribution control system for transported cargo
CN113379340B (en) Order transportation route determining method and device, storage medium and electronic equipment
CN115186928A (en) Vehicle driving path scheduling method and device, electronic equipment and storage medium
CN116663844A (en) Resource scheduling management method and device, electronic equipment and storage medium
CN111325426B (en) Electronic lock distribution method and device
TWI416431B (en) Commercial fleet dispatch system and method

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
TA01 Transfer of patent application right

Effective date of registration: 20210304

Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080

Applicant after: Beijing Jingbangda Trading Co.,Ltd.

Address before: 100195 Beijing Haidian Xingshikou Road 65 West Cedar Creative Garden 4 District 11 Building East 1-4 Floor West 1-4 Floor

Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd.

Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd.

Effective date of registration: 20210304

Address after: 6 / F, 76 Zhichun Road, Haidian District, Beijing 100086

Applicant after: Beijing Jingdong Zhenshi Information Technology Co.,Ltd.

Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080

Applicant before: Beijing Jingbangda Trading Co.,Ltd.

TA01 Transfer of patent application right