METHOD AND SYSTEM FOR CROWD SOURCED TRANSPORTATION

TECHNICAL FIELD

[0001] Embodiments of the disclosure relate generally, to a supply chain network and more specifically, to manage supply chain networks using mobile phones.

BACKGROUND

[0002] A vast range of supply chains exists at present to ensure delivery of goods, for example medicines, construction materials and consumables, to both urban and rural areas. Supply chains can either be of high resource supply chains or of low resource supply chains. The high resource supply chains deliver consumer goods in cities and are typically well managed. On the other hand, the low resource supply chains deliver goods to smaller retailers in urban and rural areas. Moreover, due to lack of resources, the low resource supply chains are inefficient.

[0003] Further, the low resource supply chains lead to unreliable availability of essential commodities, for example, medicines, in rural areas. The essential commodities are not obtained in a reliable manner due to lack of visibility into supply chains and market opportunities. Furthermore, financial constraints, infrastructural constraints, information delay and material delay also contribute to unreliable availability of the essential commodities.

[0004] In one example, a retailer having a medical store in a remote village sells various medicines. The medical store of the retailer is generally located away from a vendor of medicines. The retailer periodically travels to a location of the vendor and purchases stock of medicines for selling at the medical store. However, the stock of medicines purchased becomes insufficient in time and the retailer encounters an out-of-stock condition for one or more medicines at the medical store. The retailer is unable to replenish the one or more medicines that are out-of-stock since transportation cost of travelling to purchase the one or more medicines, or in another example, the transportation cost for a truck to deliver the one or more medicines, is greater than aggregate cost of the medicines sold. Hence, the retailer waits until most of the medicines are out-of-stock and subsequently travels to the location of the vendor and purchases new stock. As a result, essential medicines are unavailable in a timely manner to people living in the remote village.

[0005] In light of the foregoing discussion, there is a need for a method and system for efficient and economic transportation of goods to remote locations.

SUMMARY

[0006] The above-mentioned needs are met by a computer-implemented method, computer program product, and system for crowd sourced transportation.

[0007] An example of a computer-implemented method for crowd sourced transportation includes receiving orders by multiple vendors, the orders being placed by multiple customers and establishing two-way handshakes between multiple vendor-customer pairs. The computer-implemented method also includes identifying transport requirements for each of the multiple vendor-customer pair and aggregating the transport requirements related to the plurality of vendors. Further, the computer-implemented method includes broadcasting the aggregated transport requirements of the plurality of vendors to a plurality of transporters. Furthermore, the computer-implemented method includes selecting one or more transporters from the plurality of transporters for one or more hops to deliver goods to the plurality of customers located close to each other. Moreover, the computer-implemented method includes establishing a three-way handshake between the vendor-customer pair and selected one or more transporters.

[0008] An example of a computer program product stored on a non-transitory computer-readable medium that when executed by a processor, performs a method for crowd sourced transportation includes receiving orders by multiple vendors, the orders being placed by multiple customers and establishing two-way handshakes between multiple vendor-customer pairs. The computer program product includes identifying transport requirements for each of the multiple vendor-customer pair and aggregating the

transport requirements related to the plurality of vendors. The computer program product also includes broadcasting the aggregated transport requirements of the plurality of vendors to a plurality of transporters. Further, the computer program product includes selecting one or more transporters from the plurality of transporters for one or more hops to deliver goods to the plurality of customers located close to each other. Moreover, the computer program product includes establishing a three-way handshake between the vendor-customer pair and selected one or more transporters.

[0009] An example of a system for crowd sourced transportation includes a transaction management module to enable transactions over mobile networks. The system also includes a data management module to enable a plurality of retailers and vendors to input accurate data. Further, the system includes a personalized order recommendation module to enable the retailers to make purchase decisions. Furthermore, the system includes an incentive management module to provide one or more incentives to a user.

[0010] The features and advantages described in this summary and in the following detailed description are not all-inclusive, and particularly, many additional features and advantages will be apparent to one of ordinary skill in the relevant art in view of the drawings, specification, and claims hereof. Moreover, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter, resort to the claims being necessary to determine such inventive subject matter.

BRIEF DESCRIPTION OF THE FIGURES

[0011] In the following drawings like reference numbers are used to refer to like elements. Although the following figures depict various examples of the invention, the invention is not limited to the examples depicted in the figures.

[0012] FIG. 1 is a flowchart illustrating a method of implementing crowd sourced transportation, in accordance with one embodiment;

[0013] FIG. 2 is a block diagram of an environment, in accordance with which various embodiments can be implemented;

[0014] FIG. 3is a schematic representation of a system, in accordance with one embodiment;

[0015] FIG. 4 is a schematic representation of a transporter selection module for implementing crowd sourced transportation, in accordance with one embodiment; and

[0016] FIG. 5is a schematic representation of a supply chain modeled as a network, in accordance with one embodiment.

DETAILED DESCRIPTIONOF THE EMBODIMENTS

[0017J A computer-implemented method, computer program product, and system for crowd sourced transportation are disclosed. The following detailed description is intended to provide example implementations to one of ordinary skill in the art, and is not intended to limit the invention to the explicit disclosure, as one of ordinary skill in the art will understand that variations can be substituted that are within the scope of the invention as described.

[0018] Various embodiments of the invention provide a method and system for optimal transportation of goods from vendors to retailers. The retailers can be located proximally close to each other. A plurality of goods, from each vendor, that requires to be supplied to one or more retailers, located close to each other, is aggregated. A transporter transports supplies that are aggregated from each vendor to appropriate retailers, thereby reducing transportation cost.

[0019] FIG. 1 is a flow chart illustrating a method for crowd sourced transportation, in accordance with one embodiment.

[0020] At step 110, a plurality of orders placed from multiple customers is received by multiple vendors.

[0021] In one example, vendors can also be referred to as wholesalers. Examples of the customers include but are not limited to, retailers, sales agents and a micro entrepreneur. The orders are placed using electronic devices. The order includes a combination of goods and quantity of each good. The order can also include a delivery term to specify a time of delivery of the goods. Examples of the electronic devices include, but are not limited to, mobile phones, computers, laptops, hand held devices, telecommunication devices and personal digital assistants (PDAs). The customers can be registered to an application for placing the order. The application can be downloaded on the electronic devices. The order can be placed using multi-modal inputs. Examples of the multi-modal inputs include, but are not limited to, a text, a voice and a graphical image. In one example, if the order is placed using a voice input, then the voice input is stored as a voice mail on a server. In one example, the orders can be placed by sales agents on behalf of the retailers.

[0022] The orders are placed on a cloud network for viewing by the vendors. The vendors are registered to the application for viewing the orders placed by the customers. The orders can be viewed using the electronic device. Further, the orders placed on the cloud network are viewed based on privacy settings of the customer. In one example, the privacy settings of the customer can be such that the privacy settings grant permission to specific vendors to view the orders. In another example, the privacy settings can be such that each vendor present in the cloud network can view the order. The vendors can also view a contact number of the customer and a location of the customer. The contact number and the location associated with the customer are stored in a database. The contact number of the customer, in one example, is used to call the customer for confirming the order placed, to query needs of the customer and to negotiate about terms and conditions in a transaction between the vendor and the customer. The location of the customer is stored to deliver goods, included in the order, to the customer.

[0023] At step 115, two-way handshakes are established between multiple vendor-customer pairs.

[0024] The vendor and the customer form a vendor-customer pair. Similarly multiple two-way handshakes are established for multiple vendor-customer pairs. One or more vendors, upon viewing the order, can bid on the order placed by the customer. The customer can chose a vendor from the one or more bidding vendors. The vendors chosen by the customer is considered to win the bid. The vendor is chosen based on, in one example, a best offer offered by the vendor. Hence the two-way handshake between the customer and the vendor winning the bid is established. The two-way handshake between the customer and the vendor is also referred to as a buyer-seller relationship. Upon establishing the two-way handshake, the vendor transmits a status message to the customer. Examples of the status message can include, but are not limited to, confirming the order, processing the order and rejecting the order. The vendor also specifies pricing details of the order, to the customer. The vendor further transmits a message, to the customer, for negotiating with the pricing details. Upon establishing the two-way handshake, a transportation facility is arranged for shipping the goods to the customer.

[0025] At step 120, transport requirements, for each vendor-customer pair, are identified by each vendor.

[0026] The transport requirements are identified for shipping the goods. The transport requirements include determining a location of the vendor. The transport requirement also includes determining a location of the customer for delivering the goods. The transport requirements, of each vendor, are broadcasted on the cloud network.

[0027] At step 125, the transport requirements, of each vendor are aggregated.

[0028] The aggregation of the transport requirements for each vendor, in one example, can be system performed. The aggregation is performed based on a location of multiple customers. In one example, transport requirements for orders placed by the multiple customers located close to each other are aggregated. Aggregation of the transport requirements enables a single transporter to determine a shipping opportunity for shipping the goods to multiple customers located close to each other.

[0029] In one embodiment, geo-coordinates including latitude and longitude of a location is captured for transporting the goods. In one example, the geo-coordinates of the location from where a transaction was placed, by a customer, are captured. The geo-coordinates captured are used for providing optimal routes to the transporter. Further, the geo-coordinates captured enables a vendor or a distributor to determine if a sales agent of the vendor or the distributor is present at the location, of the customer, from where the transaction was placed.

[0030] At step 130, the aggregated transport requirement, of each vendor, is broadcasted to multiple transporters.

[0031] Transport requirements from the location of the vendor along locations of the multiple customers close to each other are aggregated. Aggregation is performed such that a single transporter delivers the goods to the multiple customers on a single trip. The aggregated transport requirement is further broadcasted as a single transportation opportunity on the cloud network. The transportation opportunity can also be referred to as transportation tender. The aggregated transport requirement, in one example, is sent in the form of an SMS to the transporters. The SMS, in one example, includes a pick-up location, multiple drop-off locations, time of pick-up, contact number for confirming shipping by the transporter, a time of delivery and price awarded for shipping. The transporters can view the aggregated transport requirements for providing transport services. In one example, transporters can be registered with the application for viewing the transport requirements in real-time. The transporters, upon viewing, can transmit a response message. The response message includes a willingness to ship the goods, by the transporters, to the multiple customers located close to each other. In another example, a transportation requirement can include multiple-hops. Multiple transporters can bid on the transportation requirement including the multiple-hops. Hence, multiple bids are obtained, for the transportation requirement, from the multiple transporters. The multiple bids are then used for selecting transportation cost that is optimal for transporting. Selection of the transportation cost that is optimal can also be referred to as combinatorial auction.

[0032] In one embodiment, the transportation cost is suggested by the vendor in contrary to the transporters bidding on the transportation requirement. The transportation cost suggested by the vendor is referred to as a combinatorial reverse-auction mechanism.

[0033] At step 135, one or more transporters are selected for one or more hops to deliver goods to the multiple customers located close to each other.

[0034] The transporters can be selected by the vendor. Further, the transporters are selected for one or more drop-off locations. The drop-off locations are also referred herein as hops. In one embodiment, the transporters can be system selected. The method of obtaining transporters for delivering the goods to the multiple customers located close to each other, by way of broadcasting the tender opportunity as an auction, or reverse-auction, to a plurality of transporters in the supply chain network,, is referred to as crowd sourced transportation.

[0035] In some embodiments the vendor can individually arrange one or more transporters for transporting the goods to the customers. In one example, arrangement of the transporters can be performed by placing a voice call to the transporters, by the vendor, for transporting the goods to the retailer. In another example, the vendor can transmit a SMS or data packet over Internet that includes a pick-up location to pick up the goods and a destination location to deliver the goods to the retailer.

[0036] At step 140, a three-way handshake is established between vendor-customer pair and selected one or more transporters.

[0037] Hence, the goods are delivered to multiple customers, located close to each other, using selected one or more transporters. Upon delivering the goods, the customer can confirm an order fulfillment. The order fulfillment indicates, to the vendor, the arrival of the goods to the customer. The order fulfillment can be confirmed through the application, via SMS or electronic mail.

[0038] Further, upon delivering the goods, payment is made to the selected transporters. Online payment mechanisms such as mobile money and net banking are used to complete the payment to the selected transporters.

[0039] In one embodiment, the customers, the vendors, the sales agents, manufacturers and transporters can be configured to form a network that includes multiple nodes and arcs. Each customer, vendor, sales agent, manufacturer and transporter is represented as a node. An arc represents a contractual relationship existing between any two nodes. The arc is also used, by a transporter, to determine transportation opportunity between a vendor and a customer along the arc. In one circumstance, the node can represent a vendor and in another circumstance the node can represent a customer. Each node is associated with multiple other nodes for fulfilling needs of the node. Further, the network can be reconfiguring, to alter representations, using one or more pre-defined rules. Furthermore, a set of nodes can be aggregated to form a super node, for example, a super node. The super node, including set of nodes, acts as a single entity in the context of contractual relationships with the others nodes.

[0040] FIG. 2 is a block diagram of an environment, in accordance with which various embodiments can be implemented.

[0041] The environment 200 includes a cloud network 205, multiple manufacturers, for example, a manufacturer 210, multiple consumers, for example, a consumer 215, multiple retailers, for example, a retailer 220, multiple transporters, for example, a transporter 225 and multiple vendors, for example, a vendor230. Examples of the vendor230 include, but are not limited to, a distributor, a channel partner and a dispatcher. Examples of the retailer 220 include, but are not limited to, a sales agent and a micro entrepreneur. In one example, the retailer 220 places an order. In another example, a sales agent of the vendor230 can also place the order on behalf of the retailer 220. One or more vendors can view the order placed and further bid on the order. The retailer or the sales agent can choose one vendor and the vendor chosen is considered as a winning bidder. The winning bidder ensures delivery of goods included in the order to be delivered to the retailer 220.

This phenomenon can also be referred to as a two-way handshake existing between the vendor230 and the retailer 220. Hence, the vendor230 and the retailer 220 can be referred to a vendor-customer pair. Similarly, multiple vendors can be servicing orders placed by multiple retailers located close to each other simultaneously. As a result multiple two-way handshakes are established between multiple vendor-customer pairs.

[0042] The orders placed by the multiple retailers are required to be delivered to appropriate retailers by the multiple vendors. Hence, a transport requirement, to deliver the goods to the appropriate retailers, is broadcasted on the cloud network 205 by each vendor. The transport requirement that is broadcasted by each vendor is aggregated and further a transporter, for example, the transporter 225 is assigned a task of delivering the goods included in the orders, to the appropriate retailers. The transporter being assigned the task of delivering the goods makes a single trip for delivering the goods, of the various vendors, to the appropriate retailers since the retailers are located close to each other. In one example, the retailers can be located at multiple remote areas that are close to each other. In such cases, the transporter makes a single trip, to the remote areas that are close to each other, carrying goods included in the orders placed by the retailers and subsequently delivers the goods. This phenomenon can also be referred to as a three-way handshake existing between the vendor230, the retailer 220 and the transporter 225.

[0043] In one embodiment, the transport requirements of the vendors servicing the orders placed by the retailers, located close to each other, is aggregated. The aggregated transport requirements are broadcasted to multiple transporters. The transporters can bid on the aggregated transport requirements. One transporter, for example, the transporter 225 of the multiple transporters wins the bid. The transporter 225 winning the bid delivers the goods included in the orders to appropriate retailers.

[0044] The three-way handshake allows the vendor230 to increase a market range in order to reach the remote areas by reducing the cost of transportation and also to optimize storage of the goods. Further, the manufacturer 210 optimizes production of the goods thereby reducing wastage. Furthermore, the three-way handshake ensures better quality of service to the consumer 215. The consumer 215 purchasing the goods from the retailer 220 can be referred to as another vendor-customer pair.

[0045] FIG. 3 is a schematic representation of a system300, in accordance with one embodiment. The system 300 includes a transaction management module 305, a data management module 310, a personalized order recommendation module 315 and an incentive management module 320.

[0046] The transaction management module 305 enables robust transactions over unreliable mobile networks. One or more modes of communication can be used for enabling transactions over mobile networks. Examples of the modes of communication include, but are not limited to, a Short Message Service (SMS) and a General Packet Radio Service (GPRS). The GPRS ensures large transaction data, in a given request, to be transmitted reliably. The transaction management module 305 maintains an order update and a stock update. One or more databases are required for storing the order update and the stock update. Examples of the order update include, but are not limited to, one or more orders placed by a retailer or a sales agent, the orders accepted by a vendor and goods received by the retailer. Examples of the stock update include, but are not limited to, sales performed by the retailer, sales purchased by a consumer, for example, the consumer 215, from the retailer, for example, the retailer 220 and sales performed by the vendor, for example, the vendor230. The transaction management module 305 retrieves the order update and the stock update and further transmits the order update and the stock update to the data management module 310.

[0047] The data management module 310 ensures high-quality data acquisition from one or more retailers or the vendors. The data management module 310 enables the retailer to enter data accurately. Examples of the data include, but are not limited to, a request including the order, number of goods purchased by the retailer or the sales agent and number of goods sold by the retailer within a specified time interval. The data entered by the retailer is used to forecast demand for the goods in future. The retailer further can stock the goods based on the demand forecast such that a stock-out condition for the goods is prevented. The data entered enables the retailer to maintain an optimized inventory of goods. The data entered by the retailer is further provided to the personalizedorder recommendation module 315 that enable the retailer take one or more purchase decisions such that the stock-out condition for the goods is prevented and maximum profit is gained by the retailer. The data management module 310 also ensures the retailer to enter the data consistently preventing erroneous entry of the data. The data management module 310 includes error correction mechanisms in case of erroneous entry. Further, the data management module 310 enables aggregation of the order update and the stock update for transacting and reporting purposes.

[0048] The personalized order recommendation module 315 enables creation of a personalized order recommendation that enable the retailer to take the purchase decisions.

The personalized order recommendation can be classified into two types namely an optimal order quantity recommendation and an optimal delivery route recommendation. The optimal order quantity recommendation is created based on a combination of historical transaction data, heuristic rules and statistical models. The optimal order quantity recommendation provides, to the retailers, recommendations that increase profits. Thereby, increasing quality of service to customers. The optimal delivery route recommendation provides an optimal transport route for transporting goods to multiple locations. The optimal transport route ensures reduced transport cost and transport time. Further, the optimal delivery route recommendation maximizes delivery of goods to the locations. The personalized order recommendation is delivered to the user 330 over, in one example, a text message or an electronic mail. Examples of the user 330 include the retailer 220, the vendor230, the transporter 225, the manufacturer 210 and the consumer 215. Various algorithms are used to provide the optimal order quantity recommendation and the optimal delivery route recommendation. Further, an opportunity cost algorithm determines an opportunity cost when the user 330 fails to place an order based on the recommendation. The opportunity cost determined is transmitted to the user 330 via, in one example, a text message or an electronic mail.

[0049] The incentive management module 320 provides one or more incentives to the user 330. The incentives can be a user specified incentive or a system generated incentive. The incentives are provided, to the user 330, based on past transactions performed, data entry, a reputation score and behavior of the user 330 within a community of the user 330. Examples of the incentives include, but are not limited to, an economic incentive and a social incentive. Examples of the economic incentives include, but are not limited to, providing discounts or gifts, by the vendors, when goods purchased exceeds a pre defined quantity, providing discounts when goods are purchased based on the personalized recommendation. The social incentive motivates better performance of the user 330 within the community. The social incentive is provided to the user 330 through, in one example, a text message or an electronic mail.

[0050] In one embodiment, the incentive management module 320 provides incentives to transporters for performing timely delivery of goods from the vendor to the customer.

[0051] The system 300 provides an opportunity for one or more transporters to deliver goods to multiple customers. By aggregating transport demands, a single transporter can deliver goods to multiple customers. Hence aggregation of the transport demands results in reduced transport cost. Also, aggregating the transport demands reduces fuel consumption since a single transporter delivers goods to multiple customers located close to each other instead of each customer arranging for a transport service individually. Further, aggregation enables the goods to be transported, to remote areas, in a timely manner, thereby increasing the quality of service to customers located in the remote areas.

[0052] FIG. 4 is a schematic representation of a transporter selection module 400for implementing crowd sourced transportation, in accordance with one embodiment.

[0053] The transporter selection module 400 includes a transport requirement module 405, an aggregator module 410 and an auctioning management module 415. The auctioning management module 415 includes a broadcasting module 420, a bidding module 425, a transporter reputation module 430 and a transporter selector module 435.

[0054] The transport requirement module 405 obtains transport requirements from multiple vendors. The transport requirements can be referred to as a transportation facility required for transporting goods from a vendor to a retailer. Transport requirements also include transporting the goods from the vendor to multiple retailers. The transport requirement can also include multiple-hops. The transport requirement module 405 identifies the transport requirement for each vendor-customer pair. A two-way handshake established between the vendor and the retailer can be referred to as a vendor-customer pair. The transport requirement module 405 further identifies location of the multiple vendors and retailers. Further, the transport requirement module 405 determines distance of transportation of goods for each vendor-customer pair.

[0055] The aggregator module 410 aggregates the transport requirements obtained from the vendors. The aggregator module 410 performs aggregation based on location of multiple retailers. In one example, the aggregator module 410 aggregates the transport requirements for transporting the goods multiple retailers located close to each other. The aggregator module 410 aggregates the transport requirements such that a single transporter can determine a shipping opportunity that includes the transport requirements of the multiple vendors, for transporting the goods to the multiple retailers close to each other.

[0056] The broadcasting module 420 broadcasts the transport requirements, of the multiple vendors that are aggregated by the aggregator module 410, to multiple transporters. In one example, the multiple transporters can be registered to an application. The broadcasting module 420 broadcasts the transport requirements using various modes of communication. Examples of the modes of communication, include, but are not limited to, a telephone call, a text message and an electronic mail. The transporters can bid on the transport requirements including the multiple-hops for transporting the goods to the multiple retailers located close to each other. In one example, a transporter travelling to a geographical area where the retailers are located can offer to transport the goods to the retailers. The process of transporters bidding on the transport requirements can be referred to as a combinatorial auction. Further, the vendors can also specify a maximum price that will be paid, to the transporter, for transporting the goods to the geographical area of the retailers. The process of vendors specifying the maximum price to the transporters can be referred to as a reverse combinatorial auction.

[0057] The bidding module 425 maintains bids of the multiple transporters. Further, the bidding module 425 also maintains the maximum price specified by the vendors for transporting the goods to the geographical area of the retailers. Further, the bidding module 425 enables the vendor to view the bids of the transporters such that the vendor can select one transporter offering a best bid. The bidding module 425 further enables the transporters to view the maximum price offered by the vendor, for transporting the goods to the geographical area, such that any transporter willing to transport the goods can receive the maximum price in response to transporting the goods to the geographical area of the retailers.

[0058] The transporter reputation module 430 provides and further maintains a reputation associated with each transporter. The transporter reputation module 430 provides the reputation based on various attributes. Examples of the various attributes include, but are not limited to, timely pick-up of the goods form the vendor, timely delivery of the goods to the retailer at various drop-off locations, best offer offered by the transporter and timely reporting, to the vendor, upon the delivery of the goods to the retailer. The reputation module 430 can also provide the reputation to the transporter based on a rating provided by the retailer. The retailer can provide a feedback for rating the transporter. The reputation associated with each transporter maintained by the transporter reputation module 430 is used to select best transporter, by the retailer, for transporting the goods.

[0059] The transporter selector module 435 is configured to select the best transporter of the multiple transporters. The transporter selector module 435 is operable to select the best transporter based on the reputation maintained by the transporter reputation module 430and one of auctions and reverse auctions. In one embodiment, one or more transporters are selected. The transporter selector module 435 also selects the best transporter based on best bid offered. The best transporter selected by the transporter selector module 435 is assigned the task of transporting the goods to the multiple retailers. The auctioning management module 415 including the broadcasting module 420, the bidding module 425, the transporter reputation module 430 and the transporter selector module 435 is operable to meet the transport requirements of multiple vendors such that the goods are delivered to the customers in a timely manner. Further, the auctioning management module 415 supports the combinatorial auction and the reverse combinatorial auction to meet the transport requirements. A method implementing crowd sourced transportation is explained in detail in conjunction with FIG. 5.

[0060] FIG. 5 is a schematic representation of a supply chain modeled as a network, in accordance with one embodiment.

[0061] The supply chain modeled as the network includes multiple nodes, for example, a node 505. The network further includes multiple arcs, for example, an arc 510 connecting any two nodes of the multiple nodes present in the network.

[0062] In one embodiment, a node, for example, the node 505 can represent the user 330. Examples of the user 330 include, but are not limited to, the retailer 220, the vendor230, the transporter 225, the manufacturer 210, the consumer 215, a sales agent and a sales operator. The user 330 in one circumstance can be a vendor and in another circumstance, the user 330 can be a customer. Roles of the vendor and the customer played by the user 330, based on the circumstance, can be altered in real time. Each node in the network can also represent an enterprise. The node, in one example, includes an inventory. The node, in another example, includes a demand. Multiple users can be associated with the node to fulfill needs of the node. The node can also be associated with a reputation. The reputation is obtained by an ability of the node to honor various contractual relationships with other nodes. The reputation associated with the node can also be obtained using one or more feedbacks provided by the other nodes. Further, the node can set permissions for viewing the inventory of the node by the other nodes.

[0063] An arc, for example, the arc 510 can represent a contractual relationship between any two nodes. The arc further represents the permissions for viewing the inventory of the node by other nodes. Further, the arc is associated with a degree of trust existing between two nodes. In one example, when a commercial activity occurs along the arc connecting any two nodes, then a two-way handshake is established between the two nodes. The two nodes thus represent a vendor-customer pair. Further, a transporter, for example, the transporter 225 ensures shipping of the goods from the vendor to the customer, thereby establishing a three-way handshake between the vendor, the customer and the transporter 225.

[0064] In one embodiment a set of nodes can be grouped together to form a super-node 515. The super-node 515 includes similar characteristics as the node 505. The super-node 515 can act as a single entity possessing a contractual relationship with the other nodes. Grouping can be performed based on one or more attributes. Examples of the one or more attributes include, but are not limited to, a location, inventory, interest and professional attributes. One or more counts, for example stock counts and user counts, of various nodes included in the set of nodes can be aggregated using pre-defined aggregation rules. Similarly, stock receipts and payment receipts of the set of nodes can be combined at the super-node 515. Further, other relationships can be defined between the super-node 515 and any other node.

[0065] Those skilled in the art will recognize that a wide variety of modifications, alterations, and combinations can be made with respect to the above described embodiments without departing from the scope of the present disclosure, and that such modifications, alterations, and combinations are to be viewed as being within the ambit of the inventive concept.

[0066] The foregoing description sets forth numerous specific details to convey a thorough understanding of embodiments of the present disclosure. However, it will be apparent to one skilled in the art that embodiments of the present disclosure may be practiced without these specific details. Some well-known features are not described in detail in order to avoid obscuring the present disclosure. Other variations and embodiments are possible in light of above teachings, and it is thus intended that the scope of present disclosure not be limited by this Detailed Description.

[0067]

CLAIMS

What is claimed is;

1. A computer-implemented method for crowd sourced transportation, the computer- implemented method comprising:

receiving orders by multiple vendors, the orders being placed by multiple customers;

establishing two-way handshakes between multiple vendor-customer pairs;

identifying transport requirements for each of the multiple vendor-customer pair;

aggregating the transport requirements for each of the multiple vendors;

broadcasting aggregated transport requirements of the multiple vendors to a plurality of transporters;

selecting one or more transporters from the plurality of transporters for one or more hops to deliver goods to the multiple customers located close to each other; and

establishing a three-way handshake between the vendor-customer pair and selected one or more transporters.

2. The computer-implemented method of claim 1, wherein the plurality of orders includes a combination of goods and a quantity associated with each good.

3. The computer-implemented method of claim 1, further comprising:

viewing multiple attributes by the plurality of vendors, wherein the multiple attributes includes the orders, a contact number of the customers and a location corresponding to the customers.

4. The computer-implemented method of claim 3, further comprising:

storing the contact number of the customers and the location corresponding to the customers in a database.

5. The computer-implemented method of claim 1, wherein selecting the one or more transporters is based on one of auctions and reverse-auctions along with reputation of the one or more transporters.

6. The computer-implemented method of claim 1, wherein establishing the two-way handshake further comprises:

selecting a vendor from the multiple vendors subsequent to the vendor bidding an order;

transmitting a status message to the customer by the vendor; and organizing a transportation facility for shipping goods to the customer.

7. The computer-implemented method of claim 1, wherein aggregating the transport requirements is based on a location of the plurality of customers.

8. The computer-implemented method of claim 1, wherein broadcasting the aggregated transport requirements further comprises:

viewing the aggregated transport requirements by the transporters for providing transport services; and transmitting a response message to the customers by the transporters.

9. The computer-implemented method of claim 1, further comprising: confirming fulfillment of the order by the customer.

10. A computer program product stored on a non-transitory computer-readable medium that when executed by a processor, performs a method for crowd sourced transportation, comprising:

receiving orders by multiple vendors, the orders being placed by multiple customers;

establishing two-way handshakes between multiple vendor-customer pairs;

identifying transport requirements for each of the multiple vendor-customer pair;

aggregating the transport requirements for each of the multiple vendors;

broadcasting the aggregated transport requirements of the multiple vendors to a plurality of transporters;

selecting one or more transporters from the plurality of transporters for one or more hops to deliver goods to the multiple customers located close to each other; and

establishing a three-way handshake between the vendor-customer pair and selected one or more transporters.

11. The computer program product of claim 10, wherein the plurality of orders includes a combination of goods and a quantity associated with each good.

12. The computer program product of claim 10, further comprising:

viewing multiple attributes by the plurality of vendors, wherein the multiple attributes includes the orders, a contact number of the customers and a location corresponding to the customers.

13. The computer program product of claim 12, further comprising:

storing the contact number of the customers and the location corresponding to the customers in a database.

14. The computer program product of claim 10, wherein selecting the one or more transporters is based on one or auctions and reverse-auctions along with reputation of the one or more transporters.

15. The computer program product of claim 10, wherein establishing the two-way handshake further comprises:

selecting a vendor from the multiple vendors subsequent to the vendor bidding an order;

transmitting a status message to the customer by the vendor; and organizing a transportation facility for shipping goods to the customer.

16. The computer program product of claim 10, wherein aggregating the transport requirements is based on a location of the plurality of customers.

17. The computer program product of claim 10, wherein broadcasting the aggregated transport requirements further comprises:

viewing the aggregated transport requirements by the transporters for providing transport services; and transmitting a response message to the customers by the transporters.

18. The computer program product of claim 10, further comprising: confirming fulfillment of an order by the customer.

19. A system for crowd sourced transportation, the system comprising:

a transaction management module to enable transactions over mobile networks;

a data management module to enable a plurality of retailers and vendors to input accurate data;

a personalized order recommendation module to enable the retailers to make purchase decisions; and

an incentive management module to provide one or more incentives to a user.

20. The system of claim 19, further comprising:

a transport requirement module to receive a plurality of orders placed from a plurality of customers by a plurality of vendors;

an aggregator module to aggregate the transport requirements obtained from the plurality of vendors; and

an auctioning management module.

21. The system of claim 19, wherein the auctioning management module further comprises:

a broadcasting module to broadcast the aggregated transport requirements of the plurality of vendors to a plurality of transporters;

a bidding module to select one transporter from the plurality of transporters for one or more hops to deliver goods to the plurality of customers located close to each other;

a transporter reputation module to provide and maintain a reputation associated with each transporter; and

a transporter selection module to select one or more transporters from the plurality of transporters for one or more hops to deliver goods to the plurality of customers located close to each other.

22. The system of claim 20, wherein the transport requirement module further obtains transport requirements from the plurality of vendor and identifies the transport requirements for each of the multiple vendor-customer pair.