CN114693201A - Logistics information processing method, device, equipment and storage medium - Google Patents

Logistics information processing method, device, equipment and storage medium Download PDF

Info

Publication number
CN114693201A
CN114693201A CN202011615138.4A CN202011615138A CN114693201A CN 114693201 A CN114693201 A CN 114693201A CN 202011615138 A CN202011615138 A CN 202011615138A CN 114693201 A CN114693201 A CN 114693201A
Authority
CN
China
Prior art keywords
kilometer
quotation
mileage
price
quoted price
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
CN202011615138.4A
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.)
Nanjing Fuyou Online E Commerce Co ltd
Original Assignee
Nanjing Fuyou Online E Commerce 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 Nanjing Fuyou Online E Commerce Co ltd filed Critical Nanjing Fuyou Online E Commerce Co ltd
Priority to CN202011615138.4A priority Critical patent/CN114693201A/en
Publication of CN114693201A publication Critical patent/CN114693201A/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
    • 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
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0611Request for offers or quotes
    • 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
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635Processing of requisition or of purchase orders

Landscapes

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

Abstract

The application discloses a logistics information processing method, a logistics information processing device, logistics information processing equipment and a storage medium. The method comprises the steps of obtaining a plurality of orders with the same origin, destination, transportation vehicle type and delivery time in the orders currently issued by the same user, obtaining the price information of the orders according to the information by combining a relational curve database and a neighbor price list or an inter-provincial price list, screening the orders by using the price information, reserving the order with the minimum difference between the price and the price information in the orders, and canceling other orders. The method and the device solve the problems of resource occupation, user loss and poor user experience caused by the fact that a plurality of orders are issued according to the same freight transportation requirement.

Description

Logistics information processing method, device, equipment and storage medium
Technical Field
The present application relates to the field of logistics technology, and in particular, to a method, an apparatus, a device, and a storage medium for processing logistics information.
Background
At present, in the field of logistics, particularly in the field of truck freight, due to the characteristics of truck freight, the transport mileage is generally long, so that the price of an order is highly restricted by factors such as seasons, geography and weather, and the price of the order is difficult to determine. At present, a platform for order information distribution exists in a network, and a user can distribute own order information on the platform and wait for other users to receive orders. However, at present, the price of an order is difficult to determine, so that a user often issues a plurality of orders with different prices according to a certain freight transportation requirement of the user, and further, the time for the user to wait for the order to be filled is reduced, or the user cancels the previously filled order with a lower price after waiting for the order with a higher price to be filled.
For the case that a user issues multiple orders for a shipping requirement, the inventor finds that many problems arise: one is the problem of resource occupation, only one order in a plurality of orders is finally committed, and other orders which are not committed inevitably cancel the issuance of the order at last, so that processing resources, storage resources, network resources and the like are inevitably occupied during the issuance of the order, and great waste is caused; meanwhile, due to the limited resources of the order display, the experience of other users intending to receive orders can be influenced. Secondly, some users cancel the previously committed orders with lower price after waiting for the orders with higher price to commit, which may cause loss to the order receiving users. If the user is pulled into the blacklist or the user is restricted from issuing an order, these approaches cannot not only fundamentally solve the above problems, but also affect the user experience. Therefore, how to solve the problems of resource occupation, user loss and poor user experience caused by issuing a plurality of orders with the same freight transportation requirement is urgent to solve.
Disclosure of Invention
The main purpose of the present application is to provide a method, an apparatus, a device and a storage medium for processing logistics information, so as to solve the problems of resource occupation, user loss and poor user experience caused by issuing multiple orders for the same freight transportation requirement.
In order to achieve the above object, according to a first aspect of the present application, there is provided a logistics information processing method, the method including:
s101, obtaining a plurality of orders with the same origin, destination, transport vehicle type and delivery time in the current issued orders of the same user; judging whether the orders are in the same city or not according to the origins and the destinations in the orders; if yes, generating a quotation by using the city-sharing rule and then executing S106; if not, executing S102;
s102, obtaining a target basic route, a first mileage and a second mileage according to the starting place, the destination and the transport vehicle type in the orders; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage;
s103, judging whether corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table; if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S104;
s104, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table; if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S105;
s105, executing S106 after taking the product of the first single-kilometer quoted price and the first kilometer as a quoted price;
s106, one order with the price closest to the quoted price in the orders is reserved, and the release of other orders is cancelled.
Further, the method further comprises:
and establishing a relational curve database according to the transport mileage, the single-kilometer freight rate and the transport vehicle type in the historical order.
Further, the establishing a relational database according to the transportation mileage, the single-kilometer transportation price and the transportation vehicle type in the historical order includes:
determining the mileage characteristics and the single-kilometer freight rate in each data set according to the transport mileage data, the single-kilometer freight rate data and the transport vehicle type data in the historical order, wherein each data set corresponds to one group, and different groups correspond to different transport vehicle types;
fitting the mileage characteristics and the single-kilometer freight rate in each data set by using a regression algorithm to obtain a relation curve between the transport mileage and the single-kilometer freight rate in each group;
and establishing a relation curve database by utilizing the corresponding relation between the transportation vehicle type data and the relation curve.
Further, the method further comprises:
and establishing a neighbor quotation table according to the origin, the destination, the transportation vehicle type, the neighbor lines of the transportation line and the single-kilometer freight rate of the neighbor lines in the historical order.
Further, the method further comprises:
and establishing an inter-provincial quotation table according to the starting place, the destination, the transportation vehicle type, the inter-provincial routes of the transportation routes and the single-kilometer freight rate of the inter-provincial routes in the historical orders.
According to a second aspect of the present application, there is provided a logistics information processing method, the method including:
s201, acquiring an origin, a destination and a transportation vehicle type uploaded by a user side; judging whether the origin and the destination are within the same city distance range; if yes, generating a quotation by using the city quotation rule and executing S206; if not, executing S202;
s202, obtaining a target basic route, a first mileage and a second mileage according to an origin, a destination and a vehicle type; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage;
s203, judging whether the corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table; if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S204;
s204, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table; if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S205;
s205, executing S206 after taking the product of the first single-kilometer quoted price and the first mile as a quoted price;
s206, sending the quotation to the user side, and displaying the quotation for the user by the user side.
According to a third aspect of the present application, there is provided a logistics information processing apparatus, the apparatus comprising:
the acquisition unit is used for acquiring a plurality of orders with the same origin, destination, transport vehicle type and delivery time in the orders currently issued by the same user, and sending the information of the orders to the city unit and the cancellation unit.
The city-sharing unit is used for judging whether the origins and the destinations in the orders are the same city or not; if yes, after a quotation is generated by using the city sharing rule, the quotation is sent to a revocation unit; and if not, sending the information of the orders to a single-kilometer quotation unit.
The single-kilometer quotation unit is used for obtaining a target basic line, a first mileage and a second mileage according to a starting place, a destination and a transport vehicle type in the orders after receiving the information of the orders sent by the city sharing unit; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; the target base line, the first mile, the first single-kilometer bid, and the second single-kilometer bid are sent to the neighboring units.
The neighbor unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the neighbor quotation table after receiving the target basic line, the first mile, the first single-kilometer quoted price and the second single-kilometer quoted price sent by the single-kilometer quotation unit; if yes, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quotation by dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation, taking the product of the final single-kilometer quotation and the first mile as a quotation, and sending the quotation to a revocation unit; and if not, sending the target basic line, the first mileage, the first single-kilometer quotation and the second single-kilometer quotation to the provincial unit.
The inter-provincial unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the inter-provincial quotation table after receiving the target basic line, the first single-kilometer quoted price and the second single-kilometer quoted price sent by the neighbor unit; if yes, obtaining a fourth single-kilometer quoted price according to the target basic line and the provincial quotation table, obtaining a final single-kilometer quoted price by dividing the product of the first single-kilometer quoted price and the fourth single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to a revocation unit; and if not, sending the first mileage and the first single-kilometer quotation to a quotation unit.
And the quotation unit is used for taking the product of the first single-kilometer quotation and the first mileage as quotation after receiving the first mileage and the first single-kilometer quotation sent by the inter-provincial unit and sending the quotation to the revocation unit.
And the canceling unit is used for reserving one order with the order price closest to the quoted price in the plurality of orders and canceling the release of other orders after receiving the order information and the quoted price.
According to a fourth aspect of the present application, there is provided a logistics information processing apparatus, the apparatus comprising:
the city price unit is used for acquiring the origin, the destination and the transportation vehicle type uploaded by the user side; judging whether the origin and the destination are within the same city distance range; if yes, generating a quotation by using the city sharing rule, and sending the quotation to a sending unit; if not, the information of the origin, the destination and the transport vehicle type is sent to the single kilometer price unit;
the single-kilometer price unit is used for obtaining a target basic line, a first mileage and a second mileage according to the origin, the destination and the transportation vehicle type after receiving the information of the origin, the destination and the transportation vehicle type sent by the same-city price unit; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; sending the target basic line, the first mile, the first single-kilometer quote and the second single-kilometer quote to a neighbor price unit;
the neighbor price unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the neighbor quoted price list or not after receiving the target basic line, the first mile, the first single-kilometer quoted price and the second single-kilometer quoted price which are sent by the single-kilometer price unit; if yes, obtaining a third single-kilometer quoted price according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quoted price after dividing the product of the first single-kilometer quoted price and the third single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to a sending unit; if not, sending the target basic line, the first mileage, the first single-kilometer quoted price and the second single-kilometer quoted price to an inter-provincial price unit;
the inter-provincial price unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the inter-provincial quotation table or not after receiving the target basic line, the first single-kilometer quoted price and the second single-kilometer quoted price which are sent by the neighbor price unit; if yes, obtaining a fourth single-kilometer quoted price according to the target basic line and the provincial quotation table, obtaining a final single-kilometer quoted price by dividing the product of the first single-kilometer quoted price and the fourth single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to a sending unit; if not, sending the first mileage and the first single-kilometer quoted price to a price unit;
the price unit is used for taking the product of the first single-kilometer quoted price and the first mile as a quoted price after receiving the first mile and the first single-kilometer quoted price sent by the inter-provincial price unit and sending the quoted price to the sending unit;
and the sending unit is used for sending the quotation to the user side after receiving the quotation, and the user side displays the quotation for the user.
In the method and the device for processing the logistics information, for a plurality of orders of the same user, the quotation information of the plurality of orders can be obtained according to the information by combining the relational curve database and the adjacent quotation table or the provincial quotation table, then the plurality of orders are screened by using the quotation information, one order with the minimum difference between the order price and the quotation information in the plurality of orders is reserved, and other orders are cancelled. Therefore, the order quantity of the same freight requirement can be controlled, and the problems of resource occupation, user loss and poor user experience caused by the fact that a plurality of orders are issued by the same freight can be effectively solved. In addition, in the embodiment of the application, the corresponding relation between the basic line and the single-kilometer quote is obtained by calculation according to the neighboring lines corresponding to the historical orders and the single-kilometer freight rate, so that the single-kilometer transportation quote obtained according to the neighboring quote table or the provincial-provincial quote table is reasonable, the order with the minimum difference value with the transportation quote is reserved, the balance can be achieved in the aspects of maintaining the market order and ensuring the order transaction speed, and the user experience is improved. In addition, because the corresponding relation between the basic line and the single-kilometer quoted price is calculated according to the adjacent line corresponding to the historical order and the single-kilometer freight price thereof, even if the historical order is less or no historical order is available on the transportation line of the order, the more accurate quoted price can be provided.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, serve to provide a further understanding of the application and to enable other features, objects, and advantages of the application to be more apparent. The drawings and their description illustrate the embodiments of the invention and do not limit it. In the drawings:
fig. 1 is a flowchart of a method for processing logistics information according to an embodiment of the present application;
fig. 2 is a flowchart of a method for processing logistics information according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a logistics information processing apparatus according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a logistics information processing apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the application described herein may be used. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
The present application provides a method for processing logistics information, which is shown in the flow chart of fig. 1; the method comprises the following steps:
s101, obtaining a plurality of orders with the same origin, destination, transport vehicle type and delivery time in the current issued orders of the same user; judging whether the orders are in the same city or not according to the origins and the destinations in the orders;
if yes, generating a quotation by using the city-sharing rule and then executing S106;
if not, executing S102.
After the origin, the destination and the transportation vehicle type in the order currently issued by the same user are obtained, whether the origin and the destination are in the same city range can be judged according to the origin and the destination in the order, for example, when the origin and the destination are in the same administrative area and/or the current transportation mileage between the origin and the destination is less than or equal to 100KM (the value here can be set manually, and can also be 60KM, etc.), the origin and the destination are in the same city range. Wherein the current transport mileage can be obtained by using the prior art of navigation, route planning and the like. If the determination result is negative, S102 is executed. If yes, the same city rule is used to generate a quote and S106 is executed.
If the judgment result is yes, namely the city is in the same city range, the same city quotation rule is used for generating quotation, and S106 is executed; a city-wide quotation rule is given, such as quotation base price + adjusted price, where the base price may be a fixed value, such as 500, and the adjusted price may be adjusted with the current shipping mileage, such as adjusted price of 0 when the current shipping mileage is less than or equal to 50KM, and the adjusted price may increase with the current shipping mileage when the current shipping mileage is greater than 50KM, such as quotation 500+ Max (0, (D-50) × 10), where D represents the current shipping mileage. Or, the offer is 500+ (D-50) × 10, where D represents the current mileage, and when the calculation result is below 500, the offer is 500.
S102, obtaining a target basic route, a first mileage and a second mileage according to the origin, the destination and the transportation vehicle type in the plurality of orders; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; and obtaining a second single-kilometer quoted price according to the relation curve and the second mileage.
Obtaining the target basic route according to the origin, the destination and the transportation vehicle type of the plurality of orders, which may be to determine one target basic route, that is, the target basic route corresponding to the plurality of orders, according to the origin, the destination and the transportation vehicle type, for example, assuming that the origin in the plurality of orders is wu luqi, the destination is hangzhou, and the transportation vehicle type is 16.5 m high column, the target basic route is: Wulumuqi-Hangzhou, 16.5 m high hurdle.
The first mileage is obtained from the origin, the destination, and the transportation vehicle type of the plurality of orders, and after the origin and the destination in the plurality of orders are obtained, the position information of the origin and the destination may be obtained from the origin and the destination, and then the current shortest travel path between the two places may be obtained by means of navigation, route planning, or other technologies (the related information of the transportation vehicle type may be used in the process of determining the travel path), and the travel mileage of the path may be used as the current first mileage.
The second mileage is obtained according to the origin, the destination and the transportation vehicle type of the multiple orders, and may be that a target basic route is determined according to the origin, the destination and the transportation vehicle type, a plurality of corresponding historical orders (i.e., historical orders with the same origin, destination and transportation vehicle type) are obtained according to the target basic route, and the average value of the transportation mileage of the multiple historical orders is taken as the second mileage. For example, assuming that the origin of the orders is beijing, the destination is shanghai, and the transportation vehicle type is 9.6 meters van, the target basic route is: the method comprises the following steps that a Beijing-Shanghai van and a 9.6-meter van can be used for obtaining a plurality of corresponding historical orders according to a target basic line, obtaining the respective transportation mileage of the historical orders, and taking the average value of the transportation mileage as a second mileage; it should be noted that the process of acquiring the second mileage is the same as the process of acquiring the average value of the mileage of the basic line in the establishment of the neighboring quotation table, so the process can also directly utilize the average value of the mileage of the basic line in the neighboring quotation table; in addition, the neighbor bid table and the establishment process thereof will be described later.
Obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the plurality of orders, wherein the relation curve corresponding to the transportation vehicle types can be selected from the relation curve database according to the transportation vehicle types of the plurality of orders; it should be noted that there are multiple relationship curves in the relationship curve database, each transportation vehicle type corresponds to one transportation vehicle type, each relationship curve has a corresponding relationship between mileage and quoted price, and the relationship curve database and the establishment process thereof will be described later.
The first single-kilometer offer is obtained according to the relationship curve and the first mileage, and the single-kilometer running price corresponding to the first mileage can be obtained according to the corresponding relationship between the mileage on the relationship curve and the single-kilometer running price, and the single-kilometer running price is used as the first single-kilometer offer.
And obtaining a second single-kilometer quote according to the relationship curve and the second mileage, wherein the single-kilometer running price corresponding to the second mileage can be obtained according to the corresponding relationship between the mileage on the relationship curve and the single-kilometer running price, and the single-kilometer running price is used as the second single-kilometer quote.
S103, judging whether corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table;
if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price;
if not, executing S104.
Specifically, whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the neighbor quotation table is judged; according to the transport vehicle type, the origin and the destination of the target basic line, the corresponding basic line (namely the basic line which is the same as the transport vehicle type, the origin and the destination of the target basic line) can be found in the neighbor quotation table; in addition, because the corresponding relationship exists between the basic line and the single-kilometer quotation in the neighbor quotation table, the corresponding single-kilometer quotation can be searched through the target basic line and the neighbor quotation table; if the corresponding basic line is not found in the neighbor quotation table through the target basic line, or the corresponding single-kilometer quotation of the basic line is found after the basic line is found, judging that the result is negative, and if the corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table, judging that the result is positive;
regarding the judgment of whether the corresponding single-kilometer quoted prices can be obtained through the target basic line and the neighbor quoted price table, preferably, all neighbor lines of the target basic line are determined, and whether the historical order number corresponding to each neighbor line is more than or equal to 4 is judged;
specifically, the method of determining all neighbor lines of the target base line may be according to a method of determining neighbor lines of the base line in the neighbor bid table. And then, judging whether the historical order quantity corresponding to each adjacent line is more than or equal to 4. It should be noted that, through simulation calculation, it is found that, in the process of establishing a neighbor line, when the number of historical orders corresponding to the neighbor line is less than 4, the confidence of the neighbor coefficient of the neighbor line is significantly improved as the number of historical orders increases, and when the number of historical orders is greater than or equal to 4, the confidence of the neighbor coefficient is higher and the change area of the confidence is gentle, so that it is determined whether the number of historical orders corresponding to each neighbor line is greater than or equal to 4. In the process, according to the transportation vehicle type, the origin and the destination of the target basic line, the corresponding basic line (namely, the basic line which is the same as the transportation vehicle type, the origin and the destination of the target basic line) can be found in the neighbor quotation table, and whether the historical order number corresponding to each neighbor line of the basic line is more than or equal to 4 or not is judged;
if not, S104 is executed.
If so, finding a corresponding basic line (namely the basic line with the same transportation vehicle type, origin and destination of the target basic line) in the neighbor quotation table according to the transportation vehicle type, origin and destination of the target basic line; because the corresponding relation exists between the basic line and the single-kilometer quoted price in the neighbor quotation table, the single-kilometer running price corresponding to the basic line can be used as a third single-kilometer quoted price;
then obtaining the final single kilometer quoted price, and finally obtaining the final single kilometer quoted price
Figure BDA0002870165670000111
Figure BDA0002870165670000112
It can also be understood that the distance adjustment coefficient is obtained by dividing the first single-kilometer quoted price by the second single-kilometer quoted price, and then multiplying the distance adjustment coefficient by the third single-kilometer quoted price to obtain the final single-kilometer quoted price; the product of the final single-kilometer quote and the first kilometer is taken as a quote and S106 is performed.
S104, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table;
if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price;
if not, go to S105.
Specifically, whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the provincial quotation table is judged; the corresponding basic route (namely the basic route which is the same as the transport vehicle type, the origin and the destination of the target basic route) can be found in the provincial quotation table according to the transport vehicle type, the origin and the destination of the target basic route; in addition, because the corresponding relationship exists between the basic line and the single-kilometer quotation in the provincial quotation table, the corresponding single-kilometer quotation can be searched through the target basic line and the provincial quotation table; if the corresponding basic line is not found in the inter-provincial quotation table through the target basic line, or the corresponding single-kilometer quotation of the basic line is found after the basic line is found, judging that the result is negative, and if the corresponding single-kilometer quotation can be obtained through the target basic line and the inter-provincial quotation table, judging that the result is positive;
regarding the judgment of whether the corresponding single-kilometer quoted prices can be obtained through the target basic line and the inter-provincial quotation table, preferably, all inter-provincial lines of the target basic line are determined, and whether the number of the historical orders corresponding to each inter-provincial line is greater than or equal to 4 is judged;
specifically, the method of determining all the inter-provincial routes of the target base route may be according to a method of determining the inter-provincial routes of the base route in establishing an inter-provincial quotation table. And then, judging whether the historical order number corresponding to each inter-provincial route is more than or equal to 4. It should be noted that, it is found through simulation calculation that, in the process of establishing an inter-provincial route, when the number of historical orders corresponding to the inter-provincial route is less than 4, the confidence of the neighbor coefficient of the inter-provincial route is significantly improved as the number of the historical orders increases, and when the number of the historical orders is greater than or equal to 4, the confidence of the inter-provincial route is higher, and the change area of the confidence is mild, so that it is determined whether the number of the historical orders corresponding to each inter-provincial route is greater than or equal to 4. In the process, according to the transportation vehicle type, the origin and the destination of the target basic route, the corresponding basic route (namely the basic route which is the same as the transportation vehicle type, the origin and the destination of the target basic route) is found in the provincial quotation table, and whether the historical order number corresponding to each provincial route of the basic route is more than or equal to 4 or not is judged;
if not, go to S105.
If so, finding the corresponding basic route (namely the basic route which is the same as the transport vehicle type, the origin and the destination of the target basic route) in the provincial quotation table according to the transport vehicle type, the origin and the destination of the target basic route; because the corresponding relation exists between the basic line and the single-kilometer quoted price in the provincial quoted price list, the single-kilometer freight rate corresponding to the basic line can be used as the fourth single-kilometer quoted price;
then obtaining the final single kilometer quoted price, and finally obtaining the final single kilometer quoted price
Figure BDA0002870165670000121
Figure BDA0002870165670000122
It can also be understood that the distance adjustment coefficient is obtained by dividing the first single-kilometer quoted price by the second single-kilometer quoted price, and then multiplying the distance adjustment coefficient by the fourth single-kilometer quoted price to obtain the final single-kilometer quoted price; s106 is performed after taking the product of the final single-kilometer offer and the first mile as an offer.
And S105, executing S106 after taking the product of the first single-kilometer quoted price and the first mile as a quoted price.
Here, the first one-kilometer quoted price obtained before is directly multiplied by the first mile to obtain a quoted price, and after the quoted price is obtained, S106 is executed.
S106, one order with the price closest to the quoted price in the orders is reserved, and the release of other orders is cancelled.
When a user issues an order, the order price is given in each order. And the service background processes the multiple orders according to the quoted prices obtained in the mode, specifically, the difference value between the price of each order and the quoted price is calculated respectively, the order with the minimum difference value between the price of the order and the quoted price is finally reserved according to the multiple difference results, the release of other orders is cancelled, and the cancelled message is returned to the user side so as to inform the user.
The method for establishing the relational curve database is described below.
The relational curve database is established according to the transport mileage, the single-kilometer freight rate and the transport vehicle type in the historical order. The relational curve database comprises the corresponding relational curves of different transportation vehicle types, so that the corresponding relational curves can be determined according to the transportation vehicle types. And the relation curve is a relation curve between the transport mileage and the single-kilometer freight rate obtained by fitting the mileage characteristics corresponding to the historical orders and the single-kilometer freight rate by using a regression algorithm.
The relational database is established in advance, and needs to be established before the process of obtaining the corresponding relational curve from the relational curve database according to the transportation vehicle types of the orders is completed, wherein the specific establishment flow of the relational database is as follows:
step a 1: and determining the mileage characteristics and the single-kilometer freight rate in each data set according to the transport mileage data, the single-kilometer freight rate data and the transport vehicle type data in the historical order, wherein each data set corresponds to one group, and different groups correspond to different transport vehicle types.
The method comprises the following steps of determining the mileage characteristics and the single-kilometer freight rate in each data set, wherein the specific implementation flow is as follows:
step a 11: acquiring the transport mileage data, the single-kilometer freight rate data and the transport vehicle type data of a plurality of historical orders;
in particular, the method comprises the following steps of,
since all data about the historical order (completed normal transportation order) is contained in the historical order, various data of the historical order can be directly obtained from a system or a storage device; what is needed here is haul mileage data, single kilometer freight rate data, and haul vehicle type data for historical orders.
The transport mileage data is the travel mileage of the vehicle in the actual transport process, the numerical value of the transport mileage data is the existing numerical value in the order, if some orders do not have the numerical value, the travel track can be obtained on the map by using the continuous vehicle positioning information recorded in the order, and the transport mileage data can be obtained according to the track.
The value of the single kilometer freight rate data is usually the value of the single kilometer freight rate data in the order, and if the value is not available in some orders, the single kilometer freight rate data can also be obtained by dividing the order price by the transport mileage.
The transportation vehicle type data is vehicle data for carrying the order, and the transportation vehicle type information may include any one or a combination of the following: vehicle model, vehicle length, vehicle upper load limit.
Step a 12: grouping a plurality of historical orders according to transport vehicle types;
in particular, the method comprises the following steps of,
since the transportation vehicle type data in a plurality of historical orders are obtained before, the historical orders can be grouped according to the transportation vehicle type data; such as grouping the historical orders by vehicle length or by vehicle length and upper vehicle load limit.
Step a 13: characterizing the transport mileage in each historical order to generate mileage characteristics;
since the shipping mileage in each historical order has been previously obtained, the shipping mileage can be characterized to obtain corresponding mileage characteristics. The specific method can be as follows:
the method comprises the following steps:
inputting the transport mileage into a feature function to generate corresponding mileage features; wherein the characteristic function can be any one of the following
1)
Figure BDA0002870165670000141
2)
Figure BDA0002870165670000142
3)
Figure BDA0002870165670000143
4)
Figure BDA0002870165670000144
In the above formula, x represents the transport mileage, and f represents the mileage characteristic;
in addition to the above-described feature functions, a plurality of similar functions derived may be utilized to generate the mileage feature.
The second method comprises the following steps:
inputting the transport mileage into a plurality of feature functions to generate a plurality of initial mileage features, and splicing or calculating the plurality of initial mileage features to obtain the mileage features corresponding to the transport mileage.
The plurality of feature functions may be any combination of at least two of the first method, and each feature function correspondingly obtains an initial mileage feature. The concrete steps of splicing or calculating the initial mileage characteristics to obtain the mileage characteristics corresponding to the transport mileage are as follows: multiple initial mileage features may be stitched together to form a vector as a mileage feature. The following are exemplary: assuming that the transportation mileage of the historical order 1 is 300 km, the initial mileage characteristics calculated by using the formula 1 and the formula 3 are 0.003 and 0.058, respectively, and the mileage characteristics obtained after splicing are [0.003,0.058 ]. The mileage characteristics may also be obtained by calculating a plurality of initial miles, for example, performing addition and subtraction, averaging, and the like.
Step a 14: and establishing a corresponding data set according to the group, wherein the data set comprises the mileage characteristics and the single-kilometer freight rate of all historical orders in the group.
In particular, the method comprises the following steps of,
since the historical orders are grouped according to the types of the transportation vehicles, one group can contain a plurality of historical orders, and the mileage characteristics and the single-kilometer freight rate of each historical order are obtained before, a corresponding data set can be established for each group. Illustratively, as shown in Table 1, is a representation of a data set. Including order number, mileage characteristics, and single kilometer freight rate.
TABLE 1 data set
Order numbering Mileage characteristics Freight rate per kilometer
1001 0.003 5
1002 0.005 3
1003 0.002 10
For example, as shown in table 2, which is another data set representation, only the mileage characteristics, the single-kilometer freight rate, and the corresponding relationship thereof are retained, the initial mileage characteristics X1, the initial mileage characteristics X2, and the initial mileage characteristics X3 are multiple initial mileage characteristics of one order, and the mileage characteristics X is obtained by splicing.
Figure BDA0002870165670000151
Figure BDA0002870165670000161
Step a 2: fitting the mileage characteristics and the single-kilometer freight rate in each data set by using a regression algorithm to obtain a relation curve between the transport mileage and the single-kilometer freight rate in each group;
specifically, since a plurality of data sets are obtained by grouping, the mile features and the single-kilometer freight rate in each data set can be fitted according to a ridge regression algorithm or a LASSO regression algorithm to obtain an initial relationship curve of the mile features and the single-kilometer freight rate corresponding to each data set; then converting the mileage characteristics on the initial relation curve into transportation mileage according to the corresponding relation between the transportation mileage and the mileage characteristics to obtain a relation curve between the transportation mileage and the single-kilometer freight rate corresponding to each data set; and determining a relation curve between the transport mileage and the single-kilometer freight rate corresponding to each data set as a relation curve between the transport mileage and the single-kilometer freight rate in each group. Illustratively, the abscissa of the relationship curve corresponds to the transport mileage and the ordinate corresponds to the single-kilometer freight rate.
It should be noted that, after testing is performed by using other historical data, it is found that the relationship curve obtained by the ridge regression algorithm or the LASSO regression algorithm has a better effect, and the obtained relationship curve is more in line with the actual situation; in addition, since both the ridge regression algorithm and the LASSO regression algorithm are existing algorithms, and the implementation manner of using the ridge regression algorithm or the LASSO regression algorithm to complete data fitting is also existing, the implementation manner of fitting the mileage feature and the single-kilometer freight rate in each data set according to the ridge regression algorithm or the LASSO regression algorithm is not described in detail here.
Step a 3: and establishing a relation curve database by utilizing the corresponding relation between the transportation vehicle type data and the relation curve.
And correspondingly storing the transportation vehicle type and the obtained relation curve of each group to obtain a relation curve database.
The method for establishing the neighbor quotation table is described as follows.
The neighbor quotation table at least comprises each basic line and the corresponding single-kilometer quotation; the neighbor quotation table is required to be established in advance, the neighbor quotation table is required to be established before the process of obtaining the third single-kilometer quotation according to the target basic line and the neighbor quotation table, and the neighbor quotation table can also be established before the process of obtaining the target basic line and the second kilometer quotation according to the origins, the destinations and the transportation models of the plurality of orders is completed. The neighbor quote table is established according to the origin, destination, model of the transportation vehicle, neighbor of the transportation line (or target base line), and single kilometer freight rate of the neighbor. The specific establishment process is as follows:
step b 1: obtaining a plurality of historical orders, and grouping the historical orders according to the starting place and the destination of each line in a road transportation line table and by combining transportation vehicle types, wherein each group corresponds to a basic line;
specifically, in order to establish a model capable of accurately providing all road transportation route offers, it is first necessary to determine which of the road transportation routes are available, and a transportation route table, specifically, a national road transportation route table (the national road transportation route table includes all available road transportation routes, such as beijing-shanghai, baoji-nanzhang, and the like) is used to determine the road transportation routes.
The historical orders and the various information contained therein (e.g., origin, destination, shipping mileage, shipping vehicle type, order price, etc.) may then be retrieved from the system and storage device. All historical orders can be acquired, or historical orders generated in a certain time or in a certain time in the history can be acquired, and the acquisition mode is not limited here. The historical orders are grouped after being acquired, and because various information in the historical orders is acquired before, the origin and the destination of each line in a transportation line table are required to be compared with the origin and the destination in the historical orders, and the transportation vehicle type is required to be compared with the transportation vehicle type in the historical orders, so that the historical orders are grouped; that is, historical orders are grouped by origin, destination and vehicle type, thus forming a plurality of groups containing historical orders. The purpose of the grouping is to complete the quote later, i.e. to give a quote on one transport line for one vehicle type. In addition, each group corresponds to a basic line, which is set for convenience of calculation and explanation later, and if the origin is beijing, the destination is shanghai, and the vehicle type is 9.6 meters carriage, the basic line can be expressed as: Beijing-Shanghai, 9.6 m van.
The transportation vehicle type is vehicle data for carrying the order, and the transportation vehicle type information may include any one or a combination of the following: 1) the vehicle model; 2) a vehicle length; 3) upper limit of vehicle load. It should be noted that the vehicle type information is considered in the grouping because the transportation mileage of different vehicle types between the same origin and destination is likely to be greatly different due to geographical factors, and the quotation process needs to be adjusted accordingly.
Step b 2: determining the number of orders, the average value of the transport mileage and the single kilometer freight rate corresponding to each basic line according to the historical orders in each group;
specifically, since the historical orders in each group are determined in step 1, and each group and each basic line are also in one-to-one correspondence, the number of orders, the average transportation mileage value and the single kilometer freight rate corresponding to each basic line can be obtained according to the historical order data in the group;
it should be noted that the order quantity is the quantity of the historical orders in the group;
the average transport mileage is obtained by dividing the sum of the transport mileage of all historical orders in the group by the number of orders. The transport mileage is the travel mileage of the vehicle in the actual transport process, the numerical value of the transport mileage is the existing numerical value in the order, if some orders do not have the numerical value, the travel track can be obtained on the map by using the continuous vehicle positioning information recorded in the order, and the transport mileage can be obtained according to the track.
The freight rate per kilometer needs to be obtained through calculation, and the embodiment provides a calculation method, wherein a specific calculation formula is as follows:
Figure BDA0002870165670000181
where n represents the historical order quantity within the group; omeganThe weight is expressed, and the value of the weight decreases with the increase of the difference between the historical order transaction date and the current date (i.e. the number of days between the historical order transaction date and the current date), and specifically can be
Figure BDA0002870165670000182
pnThe unit kilometer freight rate of a certain historical order in the group is represented, and the numerical value of the unit kilometer freight rate of the certain historical order can be obtained by dividing the order price of the historical order by the transport mileage of the historical order.
Step b 3: determining all adjacent lines corresponding to each basic line according to the transport vehicle type, the origin and the destination of the basic lines;
specifically, since the origin and destination of the base line are known, the neighbor line can be determined from the origin and destination of the base line. The neighboring lines in this embodiment may be the following four cases:
the first type is a line with the same transportation vehicle type and the same origin and destination, and the line is only one; the following are exemplary: if the basic line is Beijing-Shanghai, the adjacent line can only be Beijing-Shanghai;
the second type is a route with the same transport vehicle type, the same origin and different destinations; there may be multiple such lines; the following are exemplary: if the basic line is Beijing-Shanghai, the adjacent line can be Beijing-Kun shan, or Beijing-Suzhou, etc.;
the third is a route with the same transportation vehicle type, different starting places and the same destination; there may be multiple such lines; the following are exemplary: if the basic line is Beijing-Shanghai, the adjacent line can be Tianjin-Shanghai, or Baoding-Shanghai, etc.;
fourthly, the routes are the same in transportation vehicle type and different in both origin and destination, and multiple routes may exist; the following are exemplary: if the base line is Beijing-Shanghai, the neighbor lines may be Tianjin-Suzhou, or Baoding-Kunshan, etc.
It should be noted that, in the above four cases, the transportation vehicle types of the basic line and the neighboring line are the same, and for convenience of description, the transportation vehicle type is omitted in the example, that is, the original basic line is a beijing-shanghai and 9.6 m van, and is only written as beijing-shanghai, and the original neighboring line is a baoding-kunshan and 9.6 m van, and is only written as baoding-kunshan; the same is true in the following examples.
For the determination of the neighbor line, a manner is given in this embodiment, which is specifically as follows:
firstly, acquiring all neighbor origins according to the origins of basic lines;
the neighbor origination is the origination of the neighbor line. Specifically, the manner of acquiring all neighbor origins is as follows: the origin of the basic line is used as the neighbor origin, and then the neighbor origin can be obtained according to the previously calculated average values of the mileage of other basic lines, specifically, since the transportation vehicle type is used in the process of grouping, many other basic lines going to the origin can be found under the same transportation vehicle type, and if the average values of the mileage of the other basic lines are less than the first preset distance (or the average values of the mileage of the other basic lines are less than the first preset proportion of the average values of the mileage of the basic lines), the origins of the other basic lines can be used as the neighbor origin. The first preset distance can be adaptively adjusted according to requirements, wherein 200KM is an optimal value; the first preset proportion can also be adaptively adjusted according to requirements, wherein 0.4 is a preferred value.
The above description of acquiring the neighbor origins is made with reference to examples: if the basic line is Beijing-Shanghai, Beijing is the origin of the basic line, so the Beijing can be used as a neighbor origin; in addition, many other basic lines going to Beijing can be found under the same transport vehicle type, such as Tianjin-Beijing, Baoding-Beijing, Shijiazhuang-Beijing, and the like; then, the other basic lines can be selected, if the average value of the transport mileage of the other basic lines, namely the insurance-Beijing, is less than 200KM, the insurance can be used as a neighboring origin; the average of the mileage of other basic routes, such as Shijiazhuang-Beijing, is greater than 200KM, so Shijiazhuang cannot be a neighbor origin. Alternatively, the neighbor origination points may be obtained according to whether the other basic route mileage average value is smaller than the basic route mileage average value 0.4. If the mean transport mileage of the other basic route, Tianjin-Beijing, is less than 0.4, Tianjin can be used as the nearest neighbor origin.
Secondly, acquiring all neighbor destinations according to the destinations of the basic line;
wherein the neighbor destination is a destination of the neighbor line. The specific way to obtain all the neighbor destinations is as follows: the destination of the basic line is taken as a neighbor destination, and then the neighbor destination can be obtained by using the previously calculated average value of the mileage of other basic lines, because the type of the transportation vehicle is used in the previous grouping process, many other basic lines driven away from the destination can be searched under the same type of the transportation vehicle, and if the average value of the mileage of the other basic lines is smaller than the second preset distance (or the average value of the mileage of the other basic lines is smaller than the second preset proportion of the average value of the mileage of the basic lines), the destination of the other basic lines can be taken as the neighbor destination. The second preset distance can be adaptively adjusted according to requirements, wherein 200KM is an optimal value; the second preset proportion can also be adaptively adjusted according to requirements, wherein 0.4 is a preferred value. It should be noted that the first preset distance and the second preset distance may be the same or different; the first predetermined ratio and the second predetermined ratio may be the same or different.
The above description of obtaining a neighbor destination is made with reference to an example: if the basic line is Beijing-Shanghai, Shanghai is the destination of the basic line, the Shanghai can be used as a neighboring destination; in addition, many other basic lines which drive away from Shanghai can be found under the same transport vehicle type, such as Shanghai-Kun shan, Shanghai-Suzhou, Shanghai-Nanjing, and the like; then, the other basic lines can be selected, and if the average value of the transport mileage of the other basic lines is less than 200KM, the Queen mountain can be used as a neighboring destination; if the average value of the mileage transported by other basic lines, Shanghai-Nanjing, is greater than 200KM, Nanjing cannot be used as a neighboring destination. Alternatively, the neighbor destinations may be obtained according to whether the other base route mileage average is less than the base route mileage average 0.4. If shanghai-suzhou is the baseline route mileage average 0.4, suzhou may be the neighbor destination.
And finally, matching the adjacent origin with the adjacent destination one by one, and traversing to obtain all adjacent lines.
And matching all the neighbor origins and all the neighbor destinations acquired in the previous step one by one, and traversing all matching results to obtain all the neighbor lines.
Step b 4: calculating the average value difference of the transport mileage, the originating mileage difference and the destination mileage difference between each adjacent line and the corresponding basic line;
all the neighbor lines corresponding to the basic line are determined before, so that the average value difference of the transport mileage between each neighbor line and the basic line can be calculated; if the basic line is Beijing-Shanghai, and if the adjacent line is also Beijing-Shanghai, the difference between the average value of the transport mileage of the adjacent line and the transport mileage of the basic line is 0; if the neighboring line is a baoding-kunshan, calculating the difference value (such as the value of | X-Y |) between the average value of the transportation mileage of Beijing-Shanghai (such as the value of X) and the average value of the transportation mileage of the basic line of the baoding-kunshan (such as the value of Y); it should be noted that, when the baoding-kunshan is taken as an example of a neighboring line of beijing-shanghai, the data of the average transportation mileage of the baoding-kunshan line obtained in step 2 may be directly utilized during calculation, so that compared with the method of obtaining the average transportation mileage of the neighboring line by using other methods, processing resources and calculation time are saved.
In addition, the origin mileage difference is actually related to the origin, that is, when the neighboring origin is determined, the number is obtained, so that the destination mileage difference can be directly used, and similarly, the destination mileage difference can also be directly used. The following are exemplary: if the basic line is Beijing-Shanghai, if the adjacent line is Baoding-Kunshan, the original place mileage difference between the adjacent line and the basic line can directly utilize the average value of the transportation mileage of the Baoding-Beijing-based line; similarly, the target mileage difference between the neighboring line and the basic line can directly use the average value of the mileage of Shanghai-Kunshan.
Step b 5: and obtaining the weighted mileage difference of each adjacent line according to the origin mileage difference, the destination mileage difference, the transportation mileage average difference and the weight thereof, and calculating the mileage weight coefficient of each adjacent line according to the weighted mileage difference.
Specifically, in this embodiment, the mileage weight coefficient of each neighbor line is calculated according to the following formula:
Figure BDA0002870165670000221
wherein DC is mileage weight coefficient, WD is weighted mileage difference
WD is obtained from the origin mileage difference, the destination mileage difference, the mean transportation mileage difference, and their weights (i.e., three weights corresponding to the origin mileage difference, the destination mileage difference, and the transportation mileage difference). Wherein the sum of the three weights corresponding to the origin mileage difference, the destination mileage difference and the transportation mileage difference is equal to 1; the weight of the corresponding origin mileage difference or the corresponding destination mileage difference is larger than the weight of the corresponding transportation mileage difference; the weights for the origin mileage difference and the destination mileage difference may be equal. The following are exemplary: if yes, the corresponding origin mileage weight is 0.375; the weight corresponding to the target mileage difference is 0.375; the weight corresponding to the transport mileage difference is 0.25. Wherein, 0.375, 0.25 are the preferred values, and the three weights can be adjusted adaptively according to the above rules in practical application.
And then multiplying the origin mileage difference, the destination mileage difference and the transportation mileage difference by respective corresponding weights respectively and then summing to obtain the weighted mileage difference, namely WD.
Illustratively, if the base line is beijing-shanghai and the neighbor line is baoding-kunshan, using the preferred values of the above three weights, then the WD of the baoding-kunshan neighbor line is as follows:
WD ═ 0.375+ ("shanghai-shanghai" basic line transport mileage mean and "baoding-kunshan" basic line transport mileage mean) ("beijing-shanghai" basic line transport mileage mean and "baoding-kunshan" basic line transport mileage mean) ("difference) (" baoding-beijing-shanghai "basic line transport mileage mean and" baoding-kunshan "basic line transport mileage mean) (" baoding-beijing "basic line transport mileage mean and" baoding-kunshan "basic line transport mileage mean) (" baoding-beijing "basic line transport mileage mean and" baoding-kunshan "transport mileage mean)
After WD is obtained, the mileage weighting factor of the neighbor line can be obtained according to the formula for calculating DC in the foregoing.
The mileage weight coefficient of each neighbor line can be obtained according to the above steps.
Step b 6: calculating an order confidence coefficient of each neighboring line according to the historical order quantity corresponding to each neighboring line;
specifically, in this embodiment, the order confidence coefficient of each neighbor line is calculated according to the following formula:
Figure BDA0002870165670000231
wherein RC is order confidence coefficient, n is historical order quantity
Since each neighboring line has other corresponding basic lines, the historical orders of the other basic lines can be used, and the historical orders are obtained before and can be directly used.
Step b 7: obtaining the neighbor coefficient of each neighbor line according to the mileage weight coefficient and the order confidence coefficient of each neighbor line;
specifically, the mileage weight coefficient of each neighbor line is multiplied by the order confidence coefficient (i.e., DC × RC), so as to obtain the neighbor coefficient of the neighbor line.
Step b 8: obtaining single-kilometer quoted price of each basic line according to the neighbor coefficient of the neighbor line and the single-kilometer freight price;
specifically, the neighbor coefficients of all neighbor lines corresponding to each basic line are normalized to obtain the quotation coefficients of all neighbor lines corresponding to each basic line; and then multiplying the quotation coefficients of all the adjacent lines corresponding to each basic line by the single-kilometer freight rate of the adjacent lines, and summing to obtain the respective single-kilometer quotation of each basic line. The normalization may be to map the neighbor coefficients of all neighbor lines to a decimal number between (0,1), so that the sum of the quotation coefficients of all neighbor lines corresponding to one basic line is equal to 1.
More specifically, each basic line has its own corresponding neighboring line, and therefore, a basic line is used for illustration, neighbor coefficients of all neighboring lines corresponding to the basic line are normalized to obtain quotation coefficients of all neighboring lines, for example, the basic line 1 has 3 corresponding neighboring lines, the neighboring line 1, the neighboring line 2, the neighboring line 3, the neighboring line 1 has a neighbor coefficient of 0.7, the single-kilometer running price is 15 yuan, the neighboring line 2 has a neighbor coefficient of 0.5, the single-kilometer running price is 18 yuan, the neighboring line 3 has a neighbor coefficient of 0.8, and the single-kilometer running price is 16 yuan, so after normalization, the quotation coefficient of the neighboring line 1 is 0.35, the quotation coefficient of the neighboring line 2 is 0.25, and the quotation coefficient of the neighboring line 3 is 0.4; after that, the single-kilometer quote of the basic line is obtained by multiplying the quote coefficients of all the neighboring lines corresponding to the basic line by the single-kilometer running price thereof, that is, the single-kilometer quote of the basic line 1 is the quote coefficient of the neighboring line 1 is the single-kilometer running price of the neighboring line 1 + the quote coefficient of the neighboring line 2 is the single-kilometer running price of the neighboring line 2 + the quote coefficient of the neighboring line 3 is the single-kilometer running price of the neighboring line 3 is 0.35 + 15.25 + 18+0.4 is 16.15.
Step b 9: and establishing a neighbor quotation table according to the corresponding relation between each basic line and the single-kilometer quotation.
Because each basic line can obtain the corresponding single-kilometer quotation by the method, the relation can be utilized to establish a neighbor quotation table. For example, the abscissa of the neighbor quotation table can be the base line, and the ordinate can be the single kilometer quotation, or other forms of lists.
The method of establishing the inter-provincial quotation table will be described below.
The provincial quotation table at least comprises each basic line and the corresponding single-kilometer running price; the inter-provincial quotation tables are required to be established in advance, before the process of obtaining the third single-kilometer freight rate according to the target basic line and the inter-provincial quotation tables is required, and also before the process of obtaining the target basic line and the second kilometer according to the origins, the destinations and the transportation vehicle types of the plurality of orders is completed. The provincial quote table is established according to the origin, destination, transportation vehicle type, provincial line of the transportation line (or target basic line), and single-kilometer freight rate of the provincial line in the historical order. The specific establishment process is as follows:
step c 1: obtaining a plurality of historical orders, and grouping the historical orders according to the starting place and the destination of each line in a road transportation line table and by combining transportation vehicle types, wherein each group corresponds to a basic line;
specifically, in order to establish a model capable of accurately providing all road transportation route offers, it is first necessary to specify which of the road transportation routes are available, and a transportation route table, specifically, a national road transportation route table (the national road transportation route table includes all available road transportation routes, such as uniu-hangzhou, eichun-hui, and the like) is used to determine the road transportation routes.
The historical orders and the various information contained therein (e.g., origin, destination, shipping mileage, shipping vehicle type, order price, etc.) may then be retrieved from the system and storage device. All historical orders can be acquired, or historical orders generated in a certain time or in a certain time in the history can be acquired, and the acquisition mode is not limited here. The historical orders are grouped after being acquired, and because various information in the historical orders is acquired before, the origin and the destination of each line in a transportation line table are required to be compared with the origin and the destination in the historical orders, and the transportation vehicle type is required to be compared with the transportation vehicle type in the historical orders, so that the historical orders are grouped; that is, historical orders are grouped by origin, destination and vehicle type, thus forming a plurality of groups containing historical orders. The purpose of the grouping is to complete the quote later, i.e. to give a quote on a transport route for one vehicle type. In addition, each group corresponds to a basic line, which is set for convenience of calculation and explanation later, and if the origin is wu-chu, the destination is hangzhou, and the vehicle type is 16.5 m high column, the basic line can be expressed as: Wulumuqi-Hangzhou, 16.5 m high hurdle.
The transportation vehicle type is vehicle data for carrying the order, and the transportation vehicle type information may include any one or a combination of the following: 1) the vehicle model; 2) a vehicle length; 3) upper limit of vehicle load. It should be noted that the vehicle type information is considered in the grouping because the transportation mileage of different vehicle types between the same origin and destination is likely to be greatly different due to geographical factors, and the quotation process needs to be adjusted accordingly.
Step c 2: determining the number of orders, the average value of the transport mileage and the single kilometer freight rate corresponding to each basic line according to the historical orders in each group;
specifically, since the historical orders in each group are determined in step 1, and each group and each basic line are also in one-to-one correspondence, the number of orders, the average transportation mileage value and the single kilometer freight rate corresponding to each basic line can be obtained according to the historical order data in the group;
it should be noted that the order quantity is the quantity of the historical orders in the group;
the average transport mileage is obtained by dividing the sum of the transport mileage of all historical orders in the group by the number of orders. The transport mileage is the travel mileage of the vehicle in the actual transport process, the numerical value of the transport mileage is the existing numerical value in the order, if some orders do not have the numerical value, the travel track can be obtained on the map by using the continuous vehicle positioning information recorded in the order, and the transport mileage can be obtained according to the track.
The freight rate per kilometer needs to be obtained through calculation, and the embodiment provides a calculation method, wherein a specific calculation formula is as follows:
Figure BDA0002870165670000261
where n represents the historical order quantity within the group; omeganThe weight is expressed, and the value of the weight decreases with the increase of the difference between the historical order transaction date and the current date (i.e. the number of days between the historical order transaction date and the current date), and specifically can be
Figure BDA0002870165670000262
pnRepresenting the single kilometer shipping rate of a historical order within the group, wherein the value is obtained by dividing the order rate of the historical order by the shipping mileage of the historical orderThus obtaining the compound.
Step c 3: determining all inter-provincial routes corresponding to each basic route according to the transport vehicle type, the origin and the destination of the basic routes;
specifically, since the origin and destination of the base line are known, the inter-provincial line can be determined from the origin and destination of the base line. The inter-provincial route in this embodiment may be the following four cases:
the first type is a line with the same transportation vehicle type and the same origin and destination, and only one line is provided; the following are exemplary: if the basic circuit is Wuluqizi-Hangzhou, the inter-provincial circuit can only be Wuluqizi-Hangzhou;
secondly, the routes are the same in transportation vehicle type, the same in origin and different in destination, and the destinations need to be located in the same provincial administrative district; there may be multiple such lines; the following are exemplary: if the basic line is Wuluqin-Hangzhou, because Hangzhou is in Zhejiang province, other places in Zhejiang province can be used as destinations, so the inter-province line can be Wuluqin-Shaoxing, Wuluqin-Wenzhou, and the like;
thirdly, the routes are the same in transportation vehicle type, different in origin and same in destination, and the origin needs to be located in the same provincial administrative area; there may be multiple such lines; the following are exemplary: if the basic line is Wulu wood qi-Hangzhou, because Wulu wood qi is in Xinjiang Uygur autonomous region, other places of Xinjiang Uygur autonomous region can be used as the initial place, so the provincial line can be Clarity-Hangzhou, Turpan-Hangzhou, etc.;
fourthly, the routes are the same in transportation vehicle type and different in origin and destination, the origin position needs to be located in the same provincial administrative district, the destination needs to be located in the same provincial administrative district, and multiple routes may exist; the following are exemplary: if the basic line is Wuluqizi-Hangzhou, because Wuluqizi is in Xinjiang Uygur autonomous region, other places in Xinjiang Uygur autonomous region can be used as the starting place, and because Hangzhou is in Zhejiang province, other places in Zhejiang province can be used as the destination, so the inter-province line can be Crayi-Shaoxing, Turpan-Wenzhou, and the like.
It should be noted that in the above four cases, the transportation vehicle types of the basic line and the provincial line are the same, and for convenience of description, the transportation vehicle types are omitted in the example, that is, the basic line is wu qi-hangzhou and 16.5 m high fence originally, and is only written as wu qi-hangzhou, and the provincial line is craly-shaxing and 16.5 m high fence originally, and is only written as cray-shaxing here; the same is true in the following examples.
For the determination of the inter-provincial route, a manner is given in this embodiment, which is specifically as follows:
firstly, acquiring all inter-provincial origins according to the origins of the basic lines and the provincial administrative districts where the basic lines are located;
specifically, a provincial administrative district where the origin of the basic line is located is determined, and then other places which are located in the same provincial administrative district with the origin of the basic line are determined as inter-provincial origins by division of the provincial administrative districts; to facilitate data acquisition and subsequent calculations, other origins within the national highway transit line table in the same provincial administrative district as the origin of the base line may also be determined as inter-provincial origins.
Secondly, acquiring all inter-provincial destinations according to the destinations of the basic lines and the provincial administrative regions where the destinations are located;
specifically, a provincial administrative district where the destination of the basic line is located is determined, and then other places in the same provincial administrative district as the destination of the basic line are determined as inter-provincial destinations by dividing the provincial administrative district; for convenience of data acquisition and subsequent calculation, other destinations within the national highway transportation line table in the same provincial administrative district as the destination of the base line may be determined as inter-provincial destinations.
And finally, matching the inter-provincial origin and the inter-provincial destination one by one, and traversing to obtain all inter-provincial routes.
And matching all the inter-provincial origins and all the inter-provincial destinations acquired in the previous step one by one, and traversing all matching results to obtain all inter-provincial routes.
Step c 4: calculating the average value difference of the transport mileage, the originating mileage difference and the destination mileage difference between each inter-provincial line and the corresponding basic line;
since all the inter-provincial lines corresponding to the basic line are determined before, the average value difference of the transport mileage between each inter-provincial line and the basic line can be calculated; if the basic line is Wuluqizi-Hangzhou, and if the inter-provincial line is also Wuluqizi-Hangzhou, the average difference of the transport mileage of the inter-provincial line and the basic line is 0; if the inter-provincial line is crameri-shaoxing, calculating the difference value (such as the value of | X-Y |) between the average value of the transportation mileage of Wu-Qi-Hangzhou (such as the value of Y) and the average value of the transportation mileage of the basic line (such as the value of | X-Y |); it should be noted that, taking cramayi-shaoxing as an example of the provincial line of wulumuqi-hangzhou, the data of the average transportation mileage of the cramayi-shaoxing line obtained in step 2 can be directly utilized in the calculation, so that compared with the method of obtaining the average transportation mileage of the provincial line by other methods, the processing resource and the calculation time are saved.
In addition, the origin-origin mileage difference between the inter-provincial route and the corresponding basic route is the transportation mileage from the origin of the inter-provincial route to the origin of the corresponding basic route. For example, the basic line is wullurginian-hang state, the inter-provincial line is craiyi-shaoxing, and the transportation mileage of the craiyi-wullurginian line is the originating courier difference between the inter-provincial line and the corresponding basic line; this process can be implemented by using the prior art, and certainly, in order to speed up the processing speed and reduce the computation amount, the mean value of the transportation mileage of other basic lines (such as the basic line of crambe-muluko) can be used as the origin-destination mileage difference between the provincial line and the corresponding basic line.
The destination mileage between the inter-provincial route and the corresponding basic route is the transportation mileage between the destination of the inter-provincial route and the destination of the corresponding basic route. For example, the basic line is Wuluqizi-Hangzhou, the inter-provincial line is Clariti-Shaoxing, and the transportation mileage of the inter-provincial line and the corresponding basic line is the target mileage difference; the process can be implemented by using the prior art, and certainly, in order to accelerate the processing speed and reduce the computation amount, the average value of the transportation mileage of other basic lines (such as the basic line of hangzhou-shaoxing) can be used as the target mileage difference between the provincial line and the corresponding basic line.
Step c 5: and obtaining the inter-provincial weighted mileage difference of each inter-provincial line according to the original inter-provincial mileage difference, the destination inter-provincial mileage difference, the transportation mileage mean difference and the weight thereof, and calculating the inter-provincial mileage weight coefficient of each inter-provincial line according to the inter-provincial weighted mileage difference.
Specifically, in this embodiment, the inter-provincial mileage weight coefficient of each inter-provincial route is calculated according to the following formula:
Figure BDA0002870165670000291
wherein sDC is the inter-provincial mileage weight coefficient, sWD is the inter-provincial weighted mileage difference
sWD is obtained according to the origin mileage difference, the destination mileage difference, the mean difference of the transportation mileage and its weight (three weights corresponding to the origin mileage difference, the destination mileage difference and the transportation mileage difference). Wherein the sum of the three weights corresponding to the origin mileage difference, the destination mileage difference and the transportation mileage difference is equal to 1; the weight of the corresponding origin mileage difference or the corresponding destination mileage difference is larger than the weight of the corresponding transportation mileage difference; the weights for the origin mileage difference and the destination mileage difference may be equal. The following are exemplary: if yes, the corresponding origin mileage weight is 0.375; the weight corresponding to the target mileage difference is 0.375; the weight corresponding to the transport mileage difference is 0.25. Wherein, 0.375, 0.25 are the preferred values, and the three weights can be adjusted adaptively according to the above rules in practical application.
And then multiplying the origin mileage difference, the destination mileage difference and the transportation mileage difference by respective corresponding weights respectively, and then summing to obtain the inter-provincial weighted mileage difference, namely sWD.
Illustratively, if the base line is ulinqi-hangzhou and the province line is cramy-shaw, using the preferred values of the three weights described above, then sWD for the cramy-shaw province line is as follows:
sWD ═ 0.375+ ("hangzhou-shaoxing" base line mean of "krameri-wujiuxi" base line and "krameri-shaoxing" base line) × 0.25
After sWD is obtained, the inter-provincial mileage weighting factor of the inter-provincial route can be obtained according to the formula of calculation sDC in the foregoing description.
The inter-provincial mileage weight coefficient of each inter-provincial line can be obtained by referring to the above steps.
Step c 6: calculating the inter-provincial order confidence coefficient of each inter-provincial line according to the historical order number corresponding to each inter-provincial line;
specifically, in this embodiment, the inter-provincial order confidence coefficient of each inter-provincial route is calculated according to the following formula:
Figure BDA0002870165670000301
wherein sRC is the confidence coefficient of the order between provinces, n is the historical order quantity
Since each inter-provincial line has other corresponding basic lines, the historical orders of the other basic lines can be used, and the historical orders are obtained before and can be directly used.
Step c 7: obtaining an inter-provincial coefficient of each inter-provincial line according to the inter-provincial mileage weight coefficient and the inter-provincial order confidence coefficient of each inter-provincial line;
specifically, the inter-provincial mileage weight coefficient of each inter-provincial line is multiplied by the inter-provincial order confidence coefficient (i.e., DC × RC), so as to obtain the inter-provincial coefficient of the inter-provincial line.
Step c 8: obtaining the single-kilometer quoted price of each basic line according to the inter-provincial coefficient of the inter-provincial line and the single-kilometer running price;
specifically, the inter-provincial coefficients of all inter-provincial lines corresponding to each basic line are normalized to obtain inter-provincial quotation coefficients of all inter-provincial lines corresponding to each basic line; and multiplying the inter-provincial quotation coefficients of all the inter-provincial lines corresponding to each basic line by the single-kilometer running price of the inter-provincial lines, and summing to obtain the respective single-kilometer quotation of each basic line. The normalization may be performed by mapping the inter-provincial coefficients of all inter-provincial lines to a decimal between (0,1), so that the sum of the inter-provincial quotation coefficients of all inter-provincial lines corresponding to one basic line is equal to 1.
More specifically, each basic line has a corresponding inter-provincial line, and therefore a basic line is used for explanation, the inter-provincial coefficients of all inter-provincial lines corresponding to the basic line are normalized to obtain inter-provincial quotation coefficients of all inter-provincial lines, for example, the basic line 1 has 3 corresponding inter-provincial lines, the inter-provincial line 1, the inter-provincial line 2 and the inter-provincial line 3, the inter-provincial coefficient of the inter-provincial line 1 is 0.7, the single-kilometer freight rate is 15 yuan, the inter-provincial coefficient of the inter-provincial line 2 is 0.5, the single-kilometer freight rate is 18 yuan, the inter-provincial coefficient of the inter-provincial line 3 is 0.8, and the single-kilometer freight rate is 16 yuan, and then after normalization, the inter-provincial quotation coefficient of the inter-provincial line 1 is 0.35, the inter-provincial quotation coefficient of the inter-provincial line 2 is 0.25, and the inter-provincial quotation coefficient of the inter-provincial line 3 is 0.4; after that, the single-kilometer quote of the basic line is obtained by multiplying the single-kilometer running price by the inter-provincial quote coefficients of all inter-provincial lines corresponding to the basic line, that is, the single-kilometer quote of the basic line 1 is equal to the inter-provincial quote coefficient of the inter-provincial line 1 × the single-kilometer running price of the inter-provincial line 1 + the inter-provincial quote coefficient of the inter-provincial line 2 × the single-kilometer running price of the inter-provincial line 2 + the inter-provincial quote coefficient of the inter-provincial line 3 × the single-kilometer running price of the inter-provincial line 3 is equal to 0.35 × 15+0.25 × 18+0.4 × 16 equal to 16.15.
Step c 9: and establishing an inter-provincial quotation table according to the corresponding relation between each basic line and the single-kilometer quotation.
Because each basic line can obtain the corresponding single-kilometer quotation through the method, the provincial quotation table can be established by utilizing the relation.
Further, another logistics information processing method is provided in an embodiment of the present application, as shown in fig. 2, the method includes the following steps:
s201, acquiring an origin, a destination and a transportation vehicle type uploaded by a user side; judging whether the origin and the destination are within the same city distance range;
if yes, generating a quotation by using the city quotation rule and executing S206;
if not, go to S202.
Specifically, the server or the background system and other execution devices may obtain information about an origin, a destination, and a transportation vehicle type uploaded by the user through the user side of the server or the background system, and may determine whether the origin and the destination are within the same city distance range, which may refer to S101.
S202, obtaining a target basic route, a first mileage and a second mileage according to an origin, a destination and a transportation vehicle type; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; and obtaining a second single-kilometer quoted price according to the relation curve and the second mileage.
Since the information on the origin, destination and carrier type has been obtained before, the process can refer to S102.
S203, judging whether the corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table;
if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price;
if not, go to S204.
The implementation process of this step can refer to S103.
S204, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table;
if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price;
if not, go to S205.
The implementation process of this step can refer to S104.
And S205, executing S206 after taking the product of the first single-kilometer quote and the first mile as a quote.
The implementation process of this step can refer to S105.
S206, sending the quotation to the user side, and displaying the quotation for the user by the user side.
As can be seen from the above description, in the embodiment of the present application, the transportation quote can be directly provided for the user according to the origin, the destination and the transportation vehicle type issued by the user, and no matter the user is the user who issues the order or the user who intends to pick up the order, as long as the user proposes the quote demand, the system can give the transportation quote, and the user is prevented from issuing the order for the same transportation demand multiple times.
Finally, beneficial effects of the logistics information processing method of the application are summarized as follows:
1. the system can directly provide quotation for the user, and the system can provide quotation as long as the user puts forward a quotation demand no matter the user is the user who releases the order or the user who intends to receive the order, so that the user is prevented from releasing the order for the same transportation demand for many times;
2. the method has the advantages that the method can cancel the issuance of other orders and reduce resource consumption by judging whether a user issues a plurality of orders with different prices for the same transportation demand and not finding out the order which is closest to the quoted price, and in addition, the issuance state of the order which is closest to the price of the order is kept because the quoted value is the price fixed value which is closest to the order, so that the method can balance the market order and the order transaction speed and improve the user experience;
3. the quote can provide more accurate quote even aiming at the condition that the historical orders on the transportation line are few or no.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than presented herein. The descriptions of the related contents in the above embodiments may be referred to each other.
According to an embodiment of the present application, there is also provided a logistics information processing apparatus for implementing the method of fig. 1, as shown in fig. 3, the apparatus includes:
the acquiring unit 31 acquires a plurality of orders having the same origin, destination, transportation vehicle type, and delivery time among the orders currently issued by the same user, and transmits information of the plurality of orders to the city unit 32 and the cancel unit 37.
A city sharing unit 32 configured to determine whether the origin and destination of the orders are in a same city; if yes, the same city rule is used to generate a quotation, and the quotation is sent to the revocation unit 37; if not, the information of the orders is sent to the single kilometer quotation unit 33.
The single-kilometer quotation unit 33 is configured to obtain a target basic route, a first mileage and a second mileage according to an origin, a destination and a transportation vehicle type in the plurality of orders after receiving the information of the plurality of orders sent by the city sharing unit 32; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; the target base line, first mile, first single-kilometer quote, and second single-kilometer quote are sent to the neighbor unit 34.
A neighbor unit 34, which, after receiving the target basic line, the first mile, the first single-kilometer quote and the second single-kilometer quote sent by the single-kilometer quote unit 33, judges whether the corresponding single-kilometer quote can be obtained through the target basic line and the neighbor quote table; if yes, obtaining a third single-kilometer quoted price according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quoted price by dividing the product of the first single-kilometer quoted price and the third single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quotation, and sending the quotation to the canceling unit 37; if not, the target base line, the first mile, the first single-kilometer quote, and the second single-kilometer quote are sent to the provincial unit 35.
An inter-provincial unit 35 that, after receiving the target basic line, the first single-kilometer quote, and the second single-kilometer quote sent by the neighbor unit 34, determines whether the corresponding single-kilometer quote can be obtained through the target basic line and the inter-provincial quote table; if yes, a fourth single-kilometer quote is obtained according to the target basic line and the provincial quotation table, a final single-kilometer quotation is obtained by dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation, the product of the final single-kilometer quotation and the first mile is used as a quotation, and the quotation is sent to a cancellation unit 37; if not, the first mileage and first single kilometer quotes are sent to the quote unit 36.
After receiving the first mileage and the first one-kilometer price quoted by the inter-provincial unit 35, the price quoting unit 36 takes the product of the first one-kilometer price quoted and the first mileage as a price quoted, and sends the price quoted to the canceling unit 37.
And the canceling unit 37, after receiving the order information and the quote, retains one order with the order price closest to the quote in the plurality of orders, and cancels the release of other orders.
According to an embodiment of the present application, there is also provided a logistics information processing apparatus for implementing the method of fig. 2, as shown in fig. 4, the apparatus includes:
the city price unit 41 is used for acquiring the origin, destination and transportation vehicle type uploaded by the user side; judging whether the origin and the destination are within the same city distance range; if yes, the same city rule is used to generate a quote, and the quote is sent to the sending unit 46; if not, the information of the origin, destination and transport vehicle type is sent to the single kilometer price unit 42.
The single-kilometer price unit 42 is used for obtaining a target basic line, a first mileage and a second mileage according to the origin, the destination and the transportation vehicle type after receiving the information of the origin, the destination and the transportation vehicle type sent by the same-city price unit 41; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; the target base line, first mile, first single kilometer quote, and second single kilometer quote are sent to the neighbor price unit 43.
A neighbor price unit 43, which, after receiving the target basic line, the first mileage, the first single-kilometer quote and the second single-kilometer quote sent by the single-kilometer price unit 42, determines whether the corresponding single-kilometer quote can be obtained through the target basic line and the neighbor quotation table; if yes, obtaining a third single-kilometer quoted price according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quoted price by dividing the product of the first single-kilometer quoted price and the third single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to the sending unit 46; if not, the target base line, the first mile, the first single kilometer quote, and the second single kilometer quote are sent to the inter-provincial price unit 44.
An inter-provincial price unit 44 that, upon receiving the target basic line, the first single-kilometer quote, and the second single-kilometer quote sent by the neighborhood price unit 43, determines whether the corresponding single-kilometer quote can be obtained via the target basic line and the inter-provincial quotation table; if yes, a fourth single-kilometer quote is obtained according to the target basic line and the provincial quotation table, a final single-kilometer quotation is obtained according to the division of the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation, the product of the final single-kilometer quotation and the first mile is used as a quotation, and the quotation is sent to the sending unit 46; if not, the first mile and the first single kilometer quote are sent to price unit 45.
After receiving the first mileage and the first one-kilometer price quote transmitted by the inter-provincial price unit 44, the price unit 45 transmits the price quote to the transmission unit 46, taking the product of the first one-kilometer price quote and the first mileage as a price quote.
The sending unit 46, after receiving the quotation, sends the quotation to the user side, and the user side displays the quotation for the user.
As can be seen from the above description, in the embodiment of the present application, the transportation quote can be directly provided for the user according to the origin, the destination and the transportation vehicle type issued by the user, and no matter the user is the user who issues the order or the user who intends to pick up the order, as long as the user proposes the quote demand, the system can give the transportation quote, and the user is prevented from issuing the order for the same transportation demand multiple times.
There is further provided a computer-readable storage medium according to an embodiment of the present application, where the computer-readable storage medium stores computer instructions for causing the computer to execute the inter-provincial quotation table-based transportation order processing method in the above method embodiment.
According to an embodiment of the present application, there is also provided an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor to cause the at least one processor to perform the inter-provincial quotation table based transportation order processing method of the above method embodiments.
It will be apparent to those skilled in the art that the modules or steps of the present application described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and they may alternatively be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, or fabricated separately as individual integrated circuit modules, or fabricated as a single integrated circuit module from multiple modules or steps. Thus, the present application is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims (10)

1. A logistics information processing method is characterized by comprising the following steps:
s101, obtaining a plurality of orders with the same origin, destination, transport vehicle type and delivery time in the current issued orders of the same user; judging whether the orders are in the same city or not according to the origins and the destinations in the orders; if yes, utilizing the city-sharing rule to generate a quotation and then executing S106; if not, executing S102;
s102, obtaining a target basic route, a first mileage and a second mileage according to the origin, the destination and the transportation vehicle type in the plurality of orders; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage;
s103, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and a neighbor quotation table; if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S104;
s104, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table; if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S106 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S105;
s105, executing S106 after taking the product of the first single-kilometer quoted price and the first mile as a quoted price;
s106, one order with the price closest to the quoted price in the orders is reserved, and the release of other orders is cancelled.
2. The logistics information processing method of claim 1, wherein the method further comprises:
and establishing a relational curve database according to the transport mileage, the single-kilometer freight rate and the transport vehicle type in the historical order.
3. The method of claim 2, wherein the step of establishing a relational database according to the transportation mileage, the single kilometer freight rate, and the transportation vehicle type in the historical orders comprises:
determining the mileage characteristics and the single-kilometer freight rate in each data set according to the transport mileage data, the single-kilometer freight rate data and the transport vehicle type data in the historical order, wherein each data set corresponds to one group, and different groups correspond to different transport vehicle types;
fitting the mileage characteristics and the single-kilometer freight rate in each data set by using a regression algorithm to obtain a relation curve between the transport mileage and the single-kilometer freight rate in each group;
and establishing a relation curve database by utilizing the corresponding relation between the transportation vehicle type data and the relation curve.
4. The logistics information processing method of claim 1, wherein the method further comprises:
and establishing a neighbor quotation table according to the origin, the destination, the transportation vehicle type, the neighbor lines of the transportation line and the single-kilometer freight rate of the neighbor lines in the historical order.
5. The logistics information processing method of claim 1 wherein said method further comprises:
and establishing an inter-provincial quotation table according to the origin, the destination, the transport vehicle type, the inter-provincial route of the transport route and the single-kilometer freight rate of the inter-provincial route in the historical orders.
6. A logistics information processing method is characterized by comprising the following steps:
s201, acquiring an origin, a destination and a transportation vehicle type uploaded by a user side; judging whether the origin and the destination are within the same city distance range; if yes, generating a quotation by using the city quotation rule and executing S206; if not, executing S202;
s202, obtaining a target basic route, a first mileage and a second mileage according to an origin, a destination and a transportation vehicle type; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage;
s203, judging whether the corresponding single-kilometer quotation can be obtained through the target basic line and the neighbor quotation table; if so, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S204;
s204, judging whether a corresponding single-kilometer quotation can be obtained through a target basic line and an inter-provincial quotation table; if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial quotation table, and obtaining a final single-kilometer quotation after dividing the product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation; executing S206 after taking the product of the final single-kilometer quoted price and the first mile as a quoted price; if not, executing S205;
s205, executing S206 after taking the product of the first single-kilometer quoted price and the first mile as a quoted price;
s206, sending the quotation to the user side, and displaying the quotation for the user by the user side.
7. A logistics information processing apparatus, characterized in that the apparatus comprises:
the system comprises an acquisition unit, a city sharing unit and a revocation unit, wherein the acquisition unit is used for acquiring a plurality of orders with the same starting place, destination, transport vehicle type and delivery time in the orders currently issued by the same user and sending the information of the orders to the city sharing unit and the revocation unit;
the city-sharing unit is used for judging whether the origins and the destinations in the orders are the same city or not; if yes, generating a quotation by using the city sharing rule, and sending the quotation to a revocation unit; if not, the information of the orders is sent to a single-kilometer quotation unit;
the single-kilometer quotation unit is used for obtaining a target basic line, a first mileage and a second mileage according to the starting place, the destination and the transport vehicle type in the multiple orders after receiving the information of the multiple orders sent by the city sharing unit; obtaining a corresponding relation curve from a relation curve database according to the transportation vehicle types of the orders; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; sending the target basic line, the first mileage, the first single-kilometer quoted price and the second single-kilometer quoted price to a neighboring unit;
the neighbor unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the neighbor quotation table after receiving the target basic line, the first mile, the first single-kilometer quoted price and the second single-kilometer quoted price sent by the single-kilometer quotation unit; if yes, obtaining a third single-kilometer quotation according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quotation by dividing the product of the first single-kilometer quotation and the third single-kilometer quotation by the second single-kilometer quotation, taking the product of the final single-kilometer quotation and the first mile as a quotation, and sending the quotation to a revocation unit; if not, the target basic line, the first mileage, the first single-kilometer quoted price and the second single-kilometer quoted price are sent to an inter-provincial unit;
the inter-provincial unit is used for judging whether corresponding single-kilometer quotations can be obtained through the target basic line and the inter-provincial quotation table or not after receiving the target basic line, the first single-kilometer quotation and the second single-kilometer quotation which are sent by the adjacent unit; if yes, obtaining a fourth single-kilometer quoted price according to the target basic line and the provincial quotation table, obtaining a final single-kilometer quoted price by dividing the product of the first single-kilometer quoted price and the fourth single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to a revocation unit; if not, sending the first mileage and the first single-kilometer quotation to a quotation unit;
the quotation unit is used for taking the product of the first single-kilometer quotation and the first mileage as quotation after receiving the first mileage and the first single-kilometer quotation sent by the provincial unit and sending the quotation to the cancellation unit;
and the canceling unit is used for reserving one order with the order price closest to the quoted price in the plurality of orders and canceling the release of other orders after receiving the order information and the quoted price.
8. A logistics information processing apparatus, characterized in that the apparatus comprises:
the city price unit is used for acquiring the origin, the destination and the transportation vehicle type uploaded by the user side; judging whether the origin and the destination are within the same city distance range; if yes, generating a quotation by using the city sharing rule, and sending the quotation to a sending unit; if not, the information of the origin, the destination and the transport vehicle type is sent to the single kilometer price unit;
the single-kilometer price unit is used for obtaining a target basic line, a first mileage and a second mileage according to the origin, the destination and the transportation vehicle type after receiving the information of the origin, the destination and the transportation vehicle type sent by the same-city price unit; obtaining a corresponding relation curve from a relation curve database according to the type of the transportation vehicle; obtaining a first single-kilometer quoted price according to the relation curve and the first mile; obtaining a second single-kilometer quoted price according to the relation curve and the second mileage; sending the target basic line, the first mile, the first single-kilometer quote and the second single-kilometer quote to a neighbor price unit;
the neighbor price unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the neighbor quoted price list or not after receiving the target basic line, the first mile, the first single-kilometer quoted price and the second single-kilometer quoted price which are sent by the single-kilometer price unit; if yes, obtaining a third single-kilometer quoted price according to the target basic line and the neighbor quotation table, obtaining a final single-kilometer quoted price after dividing the product of the first single-kilometer quoted price and the third single-kilometer quoted price by the second single-kilometer quoted price, taking the product of the final single-kilometer quoted price and the first mile as a quoted price, and sending the quoted price to a sending unit; if not, sending the target basic line, the first mileage, the first single-kilometer quoted price and the second single-kilometer quoted price to an inter-provincial price unit;
the inter-provincial price unit judges whether the corresponding single-kilometer quoted price can be obtained through the target basic line and the inter-provincial quotation table or not after receiving the target basic line, the first single-kilometer quoted price and the second single-kilometer quoted price which are sent by the neighbor price unit; if yes, obtaining a fourth single-kilometer quotation according to the target basic line and the provincial-to-provincial quotation table, obtaining a final single-kilometer quotation by dividing a product of the first single-kilometer quotation and the fourth single-kilometer quotation by the second single-kilometer quotation, taking the product of the final single-kilometer quotation and the first kilometer quotation as a quotation, and sending the quotation to a sending unit; if not, sending the first mileage and the first single-kilometer quoted price to a price unit;
the price unit is used for taking the product of the first single-kilometer quoted price and the first mile as a quoted price after receiving the first mile and the first single-kilometer quoted price sent by the inter-provincial price unit and sending the quoted price to the sending unit;
and the sending unit is used for sending the quotation to the user side after receiving the quotation, and the user side displays the quotation for the user.
9. A computer-readable storage medium storing computer instructions for causing a computer to perform the neighbor-quote-table-based transportation order processing method of any one of claims 1-6.
10. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor to cause the at least one processor to perform the method of neighboring-quote-table-based transport order processing of claims 1-6.
CN202011615138.4A 2020-12-29 2020-12-29 Logistics information processing method, device, equipment and storage medium Pending CN114693201A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011615138.4A CN114693201A (en) 2020-12-29 2020-12-29 Logistics information processing method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011615138.4A CN114693201A (en) 2020-12-29 2020-12-29 Logistics information processing method, device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN114693201A true CN114693201A (en) 2022-07-01

Family

ID=82133191

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011615138.4A Pending CN114693201A (en) 2020-12-29 2020-12-29 Logistics information processing method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114693201A (en)

Similar Documents

Publication Publication Date Title
CN105070044B (en) Dynamic scheduling method for customized buses and car pooling based on passenger appointments
CN107101643B (en) A kind of share-car matching process
Sayarshad et al. Non-myopic dynamic routing of electric taxis with battery swapping stations
Wang et al. Role of customized bus services in the transportation system: Insight from actual performance
CN111667085B (en) Logistics routing network determining method, device, medium and electronic equipment
Eitzen et al. A multi-objective two-echelon vehicle routing problem. An urban goods movement approach for smart city logistics
CN113962639B (en) Distribution path planning method and system based on global map
CN110941691B (en) Method and device for taking and matching in forward-draught manner
CN112001557B (en) TMS system-based logistics distribution path optimization method, storage medium and computer equipment
AU2014324087A1 (en) Determining network maps of transport networks
CN111311138A (en) Same city express delivery method, device, equipment and storage medium
CN111861009A (en) Intelligent route planning method, device and equipment
CN108805481A (en) A kind of goods delivery method of shipping share-car end
CN114358677A (en) Logistics transportation distribution method and device, computer equipment and storage medium
Anderluh et al. Sustainable logistics with cargo bikes—Methods and applications
Gaul et al. Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph
CN114936666A (en) Electric vehicle charging navigation method and system based on vehicle-station-platform system
CN113739812B (en) Distribution plan generating method, device, system and computer readable storage medium
CN106682759B (en) Battery supply system for electric taxi and network optimization method
CN114492904A (en) Transportation path optimization method of logistics management system
CN102445208A (en) Method for acquiring multiple vehicle navigation paths from map data
Lu et al. Creating an agent-based long-haul freight transport model for Germany
Perera et al. Genetic algorithm based dynamic scheduling of EV in a demand responsive bus service for first mile transit
CN114693201A (en) Logistics information processing method, device, equipment and storage medium
CN114693199A (en) Logistics order information processing method, device, equipment and storage medium

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