Browse Prior Art Database

A method of dynamic delivery routing when the consumer is in a specified home location

IP.com Disclosure Number: IPCOM000243026D
Publication Date: 2015-Sep-09
Document File: 1 page(s) / 43K

Publishing Venue

The IP.com Prior Art Database

Abstract

This publication tackles the issue of delivery companies attempting to deliver a parcel to a customers home while they are out. This causes frustration to the customer as they then have to wait longer for their parcel or will have to collect the parcel from a depot. There is also a cost for the delivery company including driver salary, use of vehicle, fuel, loss of brand goodwill and the opportunity cost of the missed delivery. Proposed is a system to detect when a customer is in a specified home location using their mobile GPS, in order to optimise a delivery route such that all packages are delivered when the customer is home.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 96% of the total text.

Page 01 of 1

A method of dynamic delivery routing when the consumer is in a specified home location

The proposed system would detect when a customer is in a specified home location using their mobile GPS, in order to optimise a delivery route such that all packages are delivered when the customer is home. This would reduce time for signature only deliveries because the driver will be notified as soon as the user leaves the house and not actually reach the destination only to park, get out of the car, knock and wait for no reply then turn around and go to the next house.

The proposed method uses a dynamic map with nodes for each customer

who is identified as being at home at a given time.

A user's location is monitored using GPS from their mobile.

    If a customer leaves the location specified as their home location, a node representing their order will be removed from the map seen by the delivery company.

    If a customer returns to the location specified as their home location, a node representing their order will be added from the map seen by the delivery company. When there is a change to the dynamic map i.e. a node is either added or removed, the optimum route is re-calculated and optimised using an optimisation algorithm (e.g. travelling salesman problem).

EXAMPLE

    Many algorithms exist to solve the optimisation of a route between nodes, e.g. travelling salesman problem (https://simple.wikipedia.org/wiki/Travelling_salesman_problem)

    The drawback of these are that they are stat...