CN109615472A - Folk prescription method and terminal, storage medium are spelled based on buying order in nursery stock transaction platform - Google Patents

Folk prescription method and terminal, storage medium are spelled based on buying order in nursery stock transaction platform Download PDF

Info

Publication number
CN109615472A
CN109615472A CN201811504810.5A CN201811504810A CN109615472A CN 109615472 A CN109615472 A CN 109615472A CN 201811504810 A CN201811504810 A CN 201811504810A CN 109615472 A CN109615472 A CN 109615472A
Authority
CN
China
Prior art keywords
range
buying
nursery stock
buying order
transaction platform
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.)
Granted
Application number
CN201811504810.5A
Other languages
Chinese (zh)
Other versions
CN109615472B (en
Inventor
黄永旺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Xijia Ruiyun Management Consulting Co.,Ltd.
Original Assignee
Fuzhou Beauty Network Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fuzhou Beauty Network Technology Co Ltd filed Critical Fuzhou Beauty Network Technology Co Ltd
Priority to CN201811504810.5A priority Critical patent/CN109615472B/en
Publication of CN109615472A publication Critical patent/CN109615472A/en
Application granted granted Critical
Publication of CN109615472B publication Critical patent/CN109615472B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • 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
    • 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
    • G06Q50/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/02Agriculture; Fishing; Mining

Abstract

The invention discloses one kind to spell folk prescription method based on buying order in nursery stock transaction platform, it at least includes the following steps: obtaining all be completed in nursery stock transaction platform and select target buying order, and obtain at least one in buying order and have been labeled as that shipping point of origin corresponding to the buying kind of single state and transportation terminal can be spelled;Electronic map is called to construct initial transport model, the shipping point of origin and selection that selection is in the first range in a plurality of first transit route are in the transportation terminal in the second range, then buying order belonging to the first transit route will be chosen to merge spelling single.It is provided by the present invention a kind of based on buying order spelling folk prescription method in nursery stock transaction platform, to selected in platform mark finish be ready for transport and the buying order in also non-haulage stage calculate spell it is single, the nursery stock in the buying order of transport will be merged and merge spelling list, reduce transportation cost.Invention additionally discloses the terminal, the storage mediums that execute the above method.

Description

Folk prescription method and terminal, storage medium are spelled based on buying order in nursery stock transaction platform
Technical field
The present invention relates to computer processing technical fields, more particularly to one kind to spell list based on buying order in nursery stock transaction platform Method and its terminal, computer readable storage medium.
Background technique
When current online carry out nursery stock transaction, when purchaser needs to purchase more nursery stock and it is hoped that there will be multiple selections To be screened for, and in the online nursery stock transaction store in part or platform, using the mode of bid, provided according to supplier Buying kind, purchaser, which makes decision, selects the nursery stock of which supplier, and often purchaser needs while purchasing The nursery stock of several kinds, the nursery stock of each kind require to call for bid, and supplier submits a tender one by one, and the superior wins, Resulting in a buying order in this way may have multiple suppliers to get the bid, and a supplier is possible to one or more seedling of getting the bid The wooden kind, but when in institute, supplier target nursery stock quantity it is insufficient, if individually to will cause transportation cost excessively high for transport.
Summary of the invention
In view of this, the present invention provides one kind based in nursery stock transaction platform buying order spelling folk prescription method and its terminal, based on Calculation machine readable storage medium storing program for executing.
The technological means that the present invention uses is as follows:
One kind spelling folk prescription method based on buying order in nursery stock transaction platform, and the buying order includes at least one buying product Kind, it is described to be at least included the following steps based on buying order spelling folk prescription method in nursery stock transaction platform:
It obtains all be completed in the nursery stock transaction platform and selects buying order described in target, and obtain in the buying order extremely Few one has been labeled as that shipping point of origin and transportation terminal corresponding to the buying kind of single state can be spelled;
It calls electronic map and inputs all shipping point of origin and the transportation terminal, construct initial transport model, The initial transport model includes a plurality of first transit route being made of the corresponding shipping point of origin and the transportation terminal;
It chooses the shipping point of origin that is in the first range in a plurality of first transit route and selection is in the The transportation terminal in two ranges, if in first range including at least two shipping point of origin, and second model There is the transportation terminal corresponding with the shipping point of origin in first range in enclosing, then will choose first transport The buying order belonging to route merges spelling list, then by the shipping point of origin and described second in first range The transportation terminal in range carries out integration and recreates ultimate shipping model, and the ultimate shipping model is included in described All transportation terminals in all shipping point of origin and second range in first range are in series One the second transit route.
It is provided by the present invention a kind of based on buying order spelling folk prescription method in nursery stock transaction platform, it has been selected in platform It marks to finish and is ready for transport and the buying order in also non-haulage stage calculate and spells list, adopting for transport will be merged Nursery stock in buying order merges spelling list, reduces transportation cost.
In addition, described the present invention also provides a kind of terminal, including processor, input equipment, output equipment and memory Processor, input equipment and memory are connected with each other, wherein the memory is for storing computer program, the computer Program includes program instruction, and it is above-mentioned based on nursery stock friendship that described program instruction when being executed by a processor executes the processor Buying order spells folk prescription method in easy platform.
In addition, the present invention also provides a kind of computer readable storage medium, the computer storage medium is stored with meter Calculation machine program, the computer program include program instruction, and described program instruction makes the processor when being executed by a processor It executes above-mentioned based on buying order spelling folk prescription method in nursery stock transaction platform.
Detailed description of the invention
Fig. 1 is that the present invention is based on the operational flowcharts that folk prescription method is spelled based on buying order in nursery stock transaction platform.
Specific embodiment
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and It is non-to be used to limit the scope of the invention.
The technological means that the present invention uses is as follows:
One kind spelling folk prescription method based on buying order in nursery stock transaction platform, and buying order includes at least one buying kind, base Buying order is spelled folk prescription method and is at least included the following steps in nursery stock transaction platform:
It obtains all be completed in nursery stock transaction platform and selects target buying order, and obtain at least one in buying order and marked Note is that can spell shipping point of origin corresponding to the buying kind of single state and transportation terminal;
It calls electronic map and inputs all shipping point of origin and transportation terminal, construct initial transport model, initial transport Model includes a plurality of first transit route being made of corresponding shipping point of origin and transportation terminal;
The shipping point of origin being in the first range is chosen in a plurality of first transit route and selection is in the second range Transportation terminal and have in the second range and the transport in the first range if including at least two shipping point of origin in the first range The corresponding transportation terminal of starting point will then choose buying order belonging to the first transit route to merge spelling list, then by first The transportation terminal in shipping point of origin and the second range in range carries out integration and recreates ultimate shipping model, ultimate transport Model includes in series one of all transportation terminals in all shipping point of origin and the second range in the first range The second transit route of item.
It is provided by the present invention a kind of based on buying order spelling folk prescription method in nursery stock transaction platform, it has been selected in platform It marks to finish and is ready for transport and the buying order in also non-haulage stage calculate and spells list, adopting for transport will be merged Nursery stock in buying order merges spelling list, reduces transportation cost.
In current nursery stock transaction platform, nursery stock process of exchange uses a kind of mode below: purchaser will be purchased It is singly published to and exclusively carries out on nursery stock transaction platform, be similar to bid behavior, nurseries' supplies quotient is allowed to go competitive bidding, and wherein issuing Buying order in generally can all have at least one buying kind, that is, purchaser can be wanted to buy simultaneously in a buying order it is several The nursery stock of different type or different size, since buying kind is different, the specification of buying is different, some suppliers be can satisfy One of buying kind, but it is not able to satisfy other buying kind, therefore the different buying kinds in buying order are all It is progress competitive bidding respectively, after bid, different buying kinds may be by different suppliers in a buying order Acceptance of the bid, and different buying kinds just have different transit routes, thus will appear the problem of transport disperses, i.e., it is same to adopt It purchases quotient and supplies nursery stock by different high suppliers respectively, if the quantity of single buying kind is bigger, transport is got up would not There is the problem of cost waste, but if the quantity of buying kind is that is not suitable for employing carload freight expense using express delivery It is again excessively high, it is therefore desirable to carry out spelling single transport, will complete that target is selected not complete transport also still in nursery stock transaction platform Buying kind in buying order carries out spelling list in the case where meeting some requirements, and multiple buying kinds are by different transports after spelling list Route integration is at a transit route, wherein the condition met is shipping point of origin in certain similar range, and transportation terminal In certain similar range.
As shown in Figure 1, for having completed to select target buying order, the supplier of the buying kind in buying order is also really It decides, wherein there is a nursery lot i.e. shipping point of origin in corresponding supplier in buying kind, is also corresponding with one with seedling i.e. Transportation terminal has many buying orders at this time on nursery stock transaction platform, at least one buying kind is had in each buying order, In some buying kind by its owning user carried out spelling single operation and in single state of spelling is waited, in the present invention In for that above-mentioned a part carried out spelling single operation by its owning user and in waiting the buying for spelling single state Kind obtains the shipping point of origin and transportation terminal of these buying kinds first.Then electronic map is called, by these shipping point of origin It is input in electronic map with transportation terminal, many shipping point of origin and transportation terminal can be distributed on the electronic map.It will belong to altogether The shipping point of origin and transportation terminal of the same buying kind are depicted as initial transport route, as the first transit route, in electronics The first all transit routes just constitutes initial transport model in map, and the effect of initial transport model is in subsequent delineation When first range and the second range, makes corresponding shipping point of origin and transportation terminal that there is the relationship mutually mapped, guarantee The accuracy of data.
Then the shipping point of origin being in the first range is chosen in a plurality of first transit route and selection is in the second model Interior transportation terminal is enclosed, wherein referring to the region of certain area on the electronic map in the first range and in the second range, specifically Area is that can manually be set in how many.Drawing a circle to approve the first range or when the second range, can according to shipping point of origin and The difference of transportation terminal attribute, the density of shipping point of origin, which is more than or equal to 2, first in delineation unit area (indicates in unit area The number of interior shipping point of origin is more than or equal to the first range 2), then transports road according to each item first in initial transport model Line goes to draw a circle to approve the second range of the transportation terminal corresponding with the shipping point of origin in the first range, if opposite in the second range The number for the transportation terminal answered is less than 2, then the second range of redeterimination, accords with if traversing entire electronic map and can not all draw a circle to approve out Second range of conjunction condition, then the first range of redeterimination, until the delineation of the first range and the second range is completed, when the first model It encloses after once being drawn a circle to approve with the second range, all transportation terminals of all shipping point of origin and the second range in the first range are all It cannot drawn a circle to approve for the second time.Or the method according to above-mentioned delineation, can also draw a circle to approve transportation terminal first, mode with it is above-mentioned Method unanimously just repeat no more.
By the delineation of the above method, if in the first range include at least two shipping point of origin, and have in the second range with The corresponding transportation terminal of shipping point of origin in first range, then will choose buying order belonging to the first transit route to merge It spells single.List cannot be spelled if being unsatisfactory for above-mentioned condition.
It will then choose buying order belonging to the first transit route to merge spelling list, then play the transport in the first range Transportation terminal in point and the second range carries out integration and recreates ultimate shipping model, and ultimate shipping model is included in first All transportation terminals in all shipping point of origin and the second range in range second transit route in series. It determines after spelling list, then one new transit route of planning department again automatically by above-mentioned selected shipping point of origin and transportation terminal, newly Transit route be ultimate shipping model.In new ultimate shipping model, buying kind is merged from shipping point of origin one by one Each transportation terminal is transported into nursery stock entrucking, in ultimate shipping model, the user of each buying kind ownership is then according to certain Ratio share freight charges, total freight charges certainly in ultimate shipping model will lower than it is each buying kind individually transport when fortune Defeated cost summation.
In the present invention, the following conditions can be set: if total freight charges in ultimate shipping model be higher than it is each Transportation cost summation when buying kind is individually transported, then re-start spelling single operation, until meeting in ultimate shipping model Total freight charges will lower than it is each buying kind individually transport when transportation cost summation condition.
In addition, if shipping point of origin in the first range in the second range without corresponding transportation terminal, by Shipping point of origin in one range is rejected, or if transportation terminal in the second range in the first range without corresponding transport Starting point then rejects the transportation terminal in the second range.Setting above-mentioned condition is by the abnormal point of the first range and the second range Point is rejected, otherwise will appear mistake in the ultimate shipping model of building.
Preferably, spelling single operation is carried out to the buying kind in buying order, spelling single operation includes that will purchase kind to be set as Single state can be spelled and single deadline is spelled in setting;
All in acquisition nursery stock transaction platform to be completed in the step of selecting target buying order, acquisition is before deadline All be completed in nursery stock transaction platform selects target and still in the buying kind for waiting the single state of spelling.It will be in buying order Buying kind is set as after can spelling single state, which has entered waiting and spelled single state, can be acquired and be spelled It is single;And setting spelling single deadline is due to spelling list in waiting if cannot spell list success with others buying kinds always The buying kind of state can not wait always, purchaser purchase the buying kind be in order to plant or greening activity, There is certain timeliness, nursery stock is supplied since being accomplished to transaction and needs to carry out in time to purchaser, and supplier is also required to It emerges as early as possible, supplier is less likely also to cultivate nursery stock for a period of time for purchaser after selling out nursery stock, also to consider into This problem, it is therefore desirable to which single deadline is spelled in setting, else if waiting too long, can waste time and cost.
Preferably, constructing initial transport model includes, after all shipping point of origin and transportation terminal input electronic map, Electronic map is subjected to gridding, the first range is the corresponding grid area of electronic map, and the second range is that electronic map is corresponding Grid area.In this is bright, in order to draw a circle to approve the first range and the second range, need to carry out digitization to electronic map, it will be electric The form of sub- map gridding is divided into the identical grid area of size, can be used as reference system when delineation, can be with Be that delineation unit carries out delineation the first range and the second range with single grid, be particularly in net boundary shipping point of origin or Person's transportation terminal is in the range of delineation.
Preferably, delineation condition can further be set: when the unit intensity of the shipping point of origin in the first range of selection Less than 2, then the first range chosen again, when the unit intensity of the transportation terminal in the second range of selection is less than 2, then Again the second range chosen.
Preferably, further include the gross freight for calculating the second transit route and total haulage time, and transport road second First freight charges and the first haulage time required for each buying kind for participating in the second transit route in line form transporter Case;
Traffic program is sent to the corresponding user of all buying kinds, when all use agree to traffic program per family, Execute traffic program.
Preferably, further include calculate each buying kind for participating in the second transit route the first transit route it is individual Second freight charges and the second haulage time, and calculate separately out the first difference of all the first freight charges and the second freight charges and all First difference and the second difference are sent to corresponding user by the second difference of the first haulage time and the second haulage time.
Preferably, traffic program further includes recommending transport vehicle.
The formation of above-mentioned traffic program needs to calculate the parameter of cost therein and time, above-mentioned time and cost parameter It is sent to corresponding user, only considering and agree to by user, which can be performed.
When calculating cost, need to calculate following cost: the total transport cost of second transit route is transported second First freight charges required for each buying kind for participating in the second transit route in defeated route each participate in the second transport road Individual second freight charges of first transit route of the buying kind of line, three parameters are reference value, are supplied to user and join It examines for doing decision, total transport cost is the total transport cost of the second transit route whole process, and wherein due to there is multiple buying product Kind, which participates in the second transit route, transports, and multiple buying kinds may belong to multiple and different purchasers, and be to spell Single state, the distance that wherein each buying kind is transported in the second transit route are not quite similar, therefore cannot be according to equality Ratio share freight charges, need to calculate each first freight charges in the second transit route of buying kind at this time, it follows that Each user deals with how many freight charges;First freight charges therein can first extract the nursery stock quantity for purchasing kind and required mileage, press It is calculated according to experience, wherein empirical formula, which can be acquired empirical data in advance and is trained using computer, obtains empirical formula, so The nursery stock quantity for extracting buying kind and required mileage empirical formula is substituted into afterwards to be calculated.It can while calculating the first freight charges To calculate the first haulage time.
And the calculating of several time parameters can be calculated according to the method for above-mentioned calculating cost, details are not described herein again.
In addition, the present invention also provides a kind of terminal, including processor, input equipment, output equipment and memory, processing Device, input equipment and memory are connected with each other, wherein for memory for storing computer program, computer program includes program Instruction, it is above-mentioned based on buying order spelling folk prescription in nursery stock transaction platform that program instruction when being executed by a processor executes processor Method.
In addition, the present invention also provides a kind of computer readable storage medium, computer storage medium is stored with computer Program, computer program include program instruction, and it is above-mentioned based on seedling that program instruction when being executed by a processor executes processor Buying order spells folk prescription method in the wooden transaction platform.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the present invention.

Claims (10)

1. one kind spells folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that the buying order includes at least one A buying kind, described to be at least included the following steps based on buying order spelling folk prescription method in nursery stock transaction platform:
It obtains all be completed in the nursery stock transaction platform and selects buying order described in target, and obtain at least one in the buying order It is a to have been labeled as that shipping point of origin and transportation terminal corresponding to the buying kind of single state are spelled;
It calls electronic map and inputs all shipping point of origin and the transportation terminal, construct initial transport model, it is described Initial transport model includes a plurality of first transit route being made of the corresponding shipping point of origin and the transportation terminal;
The shipping point of origin being in the first range is chosen in a plurality of first transit route and selection is in the second model The interior transportation terminal is enclosed, if including at least two shipping point of origin in first range, and in second range There is the transportation terminal corresponding with the shipping point of origin in first range, then will choose first transit route The affiliated buying order merges that spelling is single, then by first range the shipping point of origin and second range The interior transportation terminal carries out integration and recreates ultimate shipping model, and the ultimate shipping model is included in described first In series one of all transportation terminals in all shipping point of origin and second range in range Second transit route.
2. according to claim 1 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that if described The shipping point of origin in first range in second range without the corresponding transportation terminal, then by first model The shipping point of origin in enclosing is rejected, or if the transportation terminal in second range does not have in first range There is the corresponding shipping point of origin, then rejects the transportation terminal in second range.
3. according to claim 1 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that described to be based on Buying order spells folk prescription method in nursery stock transaction platform further include:
Spelling single operation is carried out to the buying kind in the buying order, the spelling single operation includes setting the buying kind Single state and setting spelling single deadline can be spelled by being set to;
All in the acquisition nursery stock transaction platform to be completed in the step of selecting buying order described in target, acquisition is in institute All be completed before deadline in the nursery stock transaction platform is stated to select target and spell described in single state still in waiting Purchase kind.
4. according to claim 1 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that the building Initial transport model includes, will be described after all shipping point of origin and the transportation terminal are inputted the electronic map Electronic map carries out gridding, and first range is the corresponding grid area of the electronic map, and second range is institute State the corresponding grid area of electronic map.
5. according to claim 4 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that when selection For the unit intensity of the shipping point of origin in first range less than 2, then first range chosen again works as selection Second range in the transportation terminal unit intensity less than 2, then second range chosen again.
6. according to claim 1 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that further include meter Calculate second transit route gross freight and total haulage time, and each in second transit route participate in institute The first freight charges required for the buying kind of the second transit route and the first haulage time are stated, traffic program is formed;
The traffic program is sent to the corresponding user of all buying kinds, when all described with agreeing to per family When the traffic program, the traffic program is executed.
7. according to claim 6 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that further include meter Calculate each buying kind for participating in second transit route individual second freight charges of first transit route and Second haulage time, and calculate separately out the first difference and all described of all first freight charges and the second freight charges First difference and second difference are sent to corresponding by the second difference of one haulage time and the second haulage time The user.
8. according to claim 6 spell folk prescription method based on buying order in nursery stock transaction platform, which is characterized in that the transport Scheme further includes recommending transport vehicle.
9. a kind of terminal, which is characterized in that the processor, defeated including processor, input equipment, output equipment and memory Enter equipment and memory is connected with each other, wherein for the memory for storing computer program, the computer program includes journey Sequence instruction, described program instruction execute the processor as claim 1-8 is described in any item Folk prescription method is spelled based on buying order in nursery stock transaction platform.
10. a kind of computer readable storage medium, which is characterized in that the computer storage medium is stored with computer program, The computer program includes program instruction, and described program instruction makes the processor execute such as right when being executed by a processor It is required that 1-8 is described in any item to spell folk prescription method based on buying order in nursery stock transaction platform.
CN201811504810.5A 2018-12-10 2018-12-10 Method for combining purchase orders based on nursery stock transaction platform, terminal and storage medium Active CN109615472B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811504810.5A CN109615472B (en) 2018-12-10 2018-12-10 Method for combining purchase orders based on nursery stock transaction platform, terminal and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811504810.5A CN109615472B (en) 2018-12-10 2018-12-10 Method for combining purchase orders based on nursery stock transaction platform, terminal and storage medium

Publications (2)

Publication Number Publication Date
CN109615472A true CN109615472A (en) 2019-04-12
CN109615472B CN109615472B (en) 2021-07-09

Family

ID=66007981

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811504810.5A Active CN109615472B (en) 2018-12-10 2018-12-10 Method for combining purchase orders based on nursery stock transaction platform, terminal and storage medium

Country Status (1)

Country Link
CN (1) CN109615472B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113141901A (en) * 2021-01-29 2021-07-23 山东汇友市政园林集团有限公司 Split type arbor and shrub remote acceptance trimmer and acceptance method

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030135383A1 (en) * 2002-01-17 2003-07-17 Fujitsu Limited Travelable range calculation method and marketing support method
CN104616490A (en) * 2015-02-17 2015-05-13 北京九五智驾信息技术股份有限公司 Car sharing method
CN104640074A (en) * 2015-02-17 2015-05-20 北京九五智驾信息技术股份有限公司 Method for providing taxi pooling service
CN106709591A (en) * 2016-08-11 2017-05-24 淮阴工学院 Cooperative car-pooling route selection method with uncertain demand in Internet of Vehicles environment
CN107682419A (en) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 Offer method, client, server and the Carpooling system of share-car route

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030135383A1 (en) * 2002-01-17 2003-07-17 Fujitsu Limited Travelable range calculation method and marketing support method
CN104616490A (en) * 2015-02-17 2015-05-13 北京九五智驾信息技术股份有限公司 Car sharing method
CN104640074A (en) * 2015-02-17 2015-05-20 北京九五智驾信息技术股份有限公司 Method for providing taxi pooling service
CN106709591A (en) * 2016-08-11 2017-05-24 淮阴工学院 Cooperative car-pooling route selection method with uncertain demand in Internet of Vehicles environment
CN107682419A (en) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 Offer method, client, server and the Carpooling system of share-car route

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113141901A (en) * 2021-01-29 2021-07-23 山东汇友市政园林集团有限公司 Split type arbor and shrub remote acceptance trimmer and acceptance method

Also Published As

Publication number Publication date
CN109615472B (en) 2021-07-09

Similar Documents

Publication Publication Date Title
Gupta Driving digital strategy: A guide to reimagining your business
Buchanan et al. The return to increasing returns
Sandholm Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions
CN109074622A (en) Determine the system and method for transportation service route
CN104036405B (en) A kind of processing method and processing device of virtual resource trading order form
Mancini et al. Bundle generation for last-mile delivery with occasional drivers
CN106779897A (en) Goods of joint object exchange information processing method and device
Dogan et al. A reinforcement learning approach to competitive ordering and pricing problem
CN110348963A (en) A kind of method and system for realizing that polynary commodity intelligent Trade is recommended for transaction platform
CN110555748A (en) business object recommendation method and device and travel platform
CN109255007A (en) Geographical space basic data sharing method and device based on block chain
EP4173685A1 (en) Method and apparatus for establishing association between virtual and real vehicles in blockchain network
Rimmer et al. Consumer logistics: Surfing the digital wave
Carroll The political economy of Southeast Asia’s development from independence to hyperglobalisation
CN112200526A (en) Order output method and device, computer equipment and computer readable storage medium
CN109615472A (en) Folk prescription method and terminal, storage medium are spelled based on buying order in nursery stock transaction platform
Wang Transaction costs and the structure of the market: a case study
CN111062769B (en) Order dispatching method, system and storage device
CN111882257A (en) Method and device for modifying delivery address
CN116595390A (en) Commodity information processing method and electronic equipment
CN109598591A (en) Buying order merging method and terminal, storage medium in the transaction of network nursery stock
CN110852771A (en) Multi-level architecture sale system and method for establishing multi-level architecture sale system
Alizadeh et al. Analyzing a stochastic inventory system for deteriorating items with stochastic lead time using simulation modeling
CN104036395B (en) Method and device for processing stackable item trade order
KR100877642B1 (en) Method for Operating Cooperative Buying Events

Legal Events

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

Effective date of registration: 20220110

Address after: 211100 room 33 2001, Jiangning headquarters base, No. 70 Phoenix Road, Jiangning District, Nanjing, Jiangsu Province (Jiangning Development Zone)

Patentee after: Nanjing Xijia Ruiyun Management Consulting Co.,Ltd.

Address before: 350000 Fujian Province Mawei Town Mawei Town Zongtang Road 18 (original Chuangan Road 18) Kailong Plaza 1 # Building 2 floors 07 apartment office 1-E (Free Trade Test Zone)

Patentee before: FUZHOU ZHENMEI NETWORK TECHNOLOGY CO.,LTD.

TR01 Transfer of patent right