EP2630620A1 - Procédé et dispositif de planification des tournées - Google Patents

Procédé et dispositif de planification des tournées

Info

Publication number
EP2630620A1
EP2630620A1 EP11782569.5A EP11782569A EP2630620A1 EP 2630620 A1 EP2630620 A1 EP 2630620A1 EP 11782569 A EP11782569 A EP 11782569A EP 2630620 A1 EP2630620 A1 EP 2630620A1
Authority
EP
European Patent Office
Prior art keywords
distances
locations
tour
memory
determined
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.)
Withdrawn
Application number
EP11782569.5A
Other languages
German (de)
English (en)
Inventor
Boris Paul
Verena Wild
Keith Ulrich
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.)
Deutsche Post AG
Original Assignee
Deutsche Post AG
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 Deutsche Post AG filed Critical Deutsche Post AG
Publication of EP2630620A1 publication Critical patent/EP2630620A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips

Definitions

  • the invention relates to the planning of tours, in particular tours of postal delivery.
  • the invention relates to a method and a system for planning tours that each lead along a plurality of locations and for each of which an order of locations in accordance with distances between the locations is determined.
  • Tour planning is done in a variety of areas associated with the delivery of goods and / or visits to a plurality of sites, and includes determining an optimal order in which to serve locations where certain jobs are to be done.
  • An example of an area in which tour planning is of great importance is the delivery and collection of parcels and other mail for which deliverers make tours one or more times a day, containing alternate addresses.
  • the tour planning is made in particular taking into account the addresses to be used on the tours.
  • the input variables of the tour planning are, in particular, the distances between the locations which, for example, can be specified in a distance matrix and calculated before the actual tour planning is carried out.
  • DE 10 2004 019 232 B4 discloses a method for touring and route planning, in which, in particular, the determination of the order of addresses at which objects are to be delivered and / or picked up is carried out for the tours to be planned in each case in accordance with geographical data becomes.
  • the distances between the addresses to be served are to be determined from the data.
  • the distances between the addresses to be served are to be determined from the data.
  • addresses typically during tour planning for the Delivery of packages and / or other mail items are to be considered, this, however, each involves a high computational and time-consuming.
  • the invention proposes a method for planning tours, each of which leads along a plurality of locations, and for each of which a sequence of locations is determined according to distances between the locations.
  • the distances between first locations of a first tour are stored in memory in connection with the determination of the first tour.
  • a subsequent second tour is determined in accordance with stored in the memory distances between locations of the second tour and in accordance with other distances between locations of the second tour, the other distances are supplemented in the memory.
  • an apparatus for scheduling tours that each lead along a plurality of locations.
  • the device comprises a route planning device which is designed to determine, for the tours, respectively an order of the locations in accordance with distances between the locations, and which is connected to a memory device.
  • the route planning device is configured to store distances between first locations of a first tour in connection with the determination of the first tour in the memory unit and a subsequent second tour in accordance with distances stored in the memory unit between locations of the second tour and according to distances between to determine other places.
  • the route planning device is further configured to supplement the distances to the further locations in the memory unit.
  • the distances between locations of the second tour which are stored in the memory or the storage unit, were advantageously already determined in connection with the planning of the first tour, ie, it is in the places of the second tour, which are also part of the first tour.
  • the places included in the memory are also relevant for the planning of tours, as they are considered at least once during a tour. Distances for irrelevant places that are not visited on the planned tours, however, need not be determined. This is a further advantage of the demand-dependent determination of distances provided in the method and in the device.
  • stored distances between the locations of the second tour are used to determine the second tour, as far as they are present in the memory.
  • only distances that are not already stored in the memory are redetermined to perform the planning of the second tour.
  • an embodiment of the method and the device provides that, in connection with the determination of the second tour, the further locations of the second tour are determined for which no associated distances are contained in the memory, and distances are determined with respect to these further locations and be supplemented in the store.
  • the determination of the other places of the second tour, for the in Memory are no associated distances can be made by comparing the locations of the second tour with the locations for which distances are stored in the memory. This check can be made, for example, when the locations of the second tour are reported to the tour planning facility.
  • the distances which are determined and supplemented in the memory are distances between the further locations and / or distances between the further locations and the locations already taken into account in the memory. These can be places that are also part of the second tour. Likewise, the distances to other locations which are taken into account in the memory can also be determined additionally. As a result, distances that are related to locations that are not visited on the second tour can also be determined and supplemented. The addition, however, is made in view of possible subsequent route planning in which these distances can be used.
  • the distances stored in the memory can represent different sizes. Preferably, the tours are scheduled so that a predetermined size, such as the distance to be traveled and / or the time to perform one or more (simultaneously scheduled) tours, is minimized as much as possible.
  • the distances stored in the memory can be adapted to the size to be optimized.
  • the distances are time distances between the locations. That is, the distance between a first and a second location indicates a time required to get from the first to the second location. The time distances can be used in particular to plan tours in which the time required is minimized.
  • an embodiment of the method and the device provides that the distances between the locations are determined as a function of ascertained routes between the locations.
  • the routes can be determined so that they at least after an optimization criterion Possibility to fulfill. In particular, it may be the shortest or fastest routes.
  • the traffic situation has an influence on the distances actually to be covered, since distances can be increased by traffic impairments, such as traffic jams or blockages.
  • a development of the method and the device includes that the distances stored in the memory are determined and / or updated as a function of traffic information. By updating distances already stored in the memory, changes in the traffic situation and resulting changes in the distances can be taken into account in particular.
  • the distances are determined on the basis of measured values acquired during the execution of the tour and updated in the memory.
  • the actually traveled distances can be stored in the memory. This is preferably done by updating distances that have been calculated, for example, before the tour is carried out.
  • the measured values can be, for example, recorded positions and times from which time distances between the locations of the tour can be determined.
  • an embodiment of the method and the device is characterized in that for at least two locations a plurality of distances between the locations in the memory are stored and the distances are valid for different periods.
  • the periods may, in particular, be time of day intervals and / or days of the week.
  • a further embodiment of the method and the device includes depositing a plurality of distances between the locations in the memory for at least two locations and the distances being valid for different means of transport. This allows for the fact that not all tours with the same traffic be carried out medium and that the distances between the locations for different means of transport, for example, due to the achievable speed and / or the usable ways differ.
  • An embodiment associated with the two aforementioned embodiments provides that the first and / or second tour is determined according to the distance that is valid for the period in which one of the locations is reached and / or that for the means of transport to be used is valid.
  • the planned tours are tours for the delivery and / or collection of mailpieces and at the addresses are locations at which mailpieces are to be delivered and / or picked up.
  • the tour planning preferably includes the determination of the order in which the addresses are visited by the deliverers and may also include the assignment of mailpieces to be delivered and / or pickup orders to the available deliverers.
  • the invention proposes a computer program comprising a software code with instructions for executing the method and its variants on a data processing system.
  • 1 is a schematic representation of a delivery depot with associated planning device and a delivery depot associated delivery vehicle
  • Fig. 2a is a schematic illustration of a distance matrix in a first
  • Version and Fig. 2b is a schematic illustration of a distance matrix in another version.
  • the delivery of postal items takes place in a geographical area 102 assigned to the delivery depot 101.
  • the delivery stations assigned to the delivery depot 101 pick up mailpieces from senders within the geographical area 102 when the senders submit appropriate pickup orders to the delivery depot 101 or other entity of the postal company.
  • the mailpieces may be packages or other mailings, such as letters.
  • the delivery depot 101 has a fixed or variable number of deliverers to whom delivery vehicles 103 can be assigned, which are used by the delivery and / or collection of mailpieces.
  • a plurality of deliverers each having an associated delivery vehicle 103 are used (in FIG. 1, however, only one delivery vehicle 103 is shown by way of example).
  • the delivery vehicles 103 may be configured as four- or multi-wheeled passenger or truck. In principle, all deliverers of the delivery depot 101 can use such a delivery vehicle 103. However, provision may also be made for at least some of the delivery agents to use other means of transport for the delivery and / or collection of mailpieces, such as, for example, two-wheeled motor vehicles, bicycles or trolleys for on-foot delivery.
  • the delivery vehicles or delivery vehicles 103 used in the delivery depot 101 carry out at least one tour daily for the delivery and collection of mail items. Likewise, at least some of the deliverers can also carry out several tours in one day.
  • the tours start and end respectively at the delivery depot 101 and include visits to the addresses associated with the deliverer to which mail is to be delivered and / or picked up. These addresses are also referred to below as stops of the tours or routes of the deliverers.
  • a planning device 105 is provided which can be arranged in the delivery depot 101 or separately, as shown by way of example in FIG.
  • the planning device 105 is equipped as a data processing system with a computer program for executing tour planning.
  • the tour planning carried out in the planning device 105 preferably comprises the division of the mailpieces to be delivered onto the delivery service or the delivery vehicles 103 available in the delivery depot 101.
  • the present collection orders are also distributed among the delivery agents.
  • the planning device 105 determines for the individual deliverers an order in which the addresses are to be served, at which mailpieces are to be delivered and / or picked up.
  • the deliverers are able to communicate wirelessly to the delivery depot 101 associated planning device 105. This happens, for example, via a mobile radio network 108, as shown in FIG.
  • the delivery vehicles 103 may include a communication device not shown in the figure.
  • carriers may also use portable communication devices, such as smart phones or notebook computers, to establish data connections to scheduler 105.
  • tour data such as information about the items to be delivered, pickup orders and the sequence of stops determined in the planning device 105, can be transmitted to the delivery or delivery vehicles 105 via the communication connection. This can also be done in particular when redesigning a tour, which can be done to integrate pickups in the tour, which are commissioned after the tour.
  • the deliverers preferably each have a locating unit 107 for determining their position, which may be permanently installed in a delivery vehicle or may be carried by the deliverer as a mobile device.
  • the locating unit 107 may be formed as a satellite-based locating unit 107, which determines the position of the delivery vehicle 103 in a manner known to those skilled in the art based on signals from a satellite navigation system, for example the Global Positioning System (GPS).
  • GPS Global Positioning System
  • the determined positions of the delivery vehicle 103 can be transmitted to the planning device 105 so that it also has the current position of the delivery vehicle 103 during a tour. In an embodiment explained below, these position data also be used to track the route of the deliverer.
  • the locating unit 107 may also be part of a portable or permanently installed navigation device that is capable of determining a route in a road network of the area 102 from a position of the delivery vehicle 103 to a destination point and the driver of the delivery vehicle 103 by acoustic and / or or guide optical navigation instructions along the route to the destination, which may be in particular a stop address.
  • Mail items to be delivered in the geographic area 102 are conveyed to the delivery depot 101 via a postal system logistics system 104. This can happen, for example, once or several times a day.
  • the logistics system 104 comprises a plurality of sorting centers for mail items, not shown in the figure, in which mailpieces are sorted and forwarded on the way from their sender to the recipient (the delivery depot 101 can likewise be a sorting center or one of several separate delivery depots, which are jointly assigned to a sorting center of the logistics system 104).
  • the addresses of the mailpieces to be delivered can already be detected in the logistics system 104 and transmitted to the planning device 105, or the addresses are detected on receipt of the mail in the delivery depot 101 and reported to the planning device 105.
  • the delivery addresses of the mail items that reach the delivery depot 101 prior to the start of the tours are taken into account in one embodiment.
  • Collection orders are transmitted by the senders to the postal company and recorded, for example, in a central facility.
  • the transmission can take place by telephone, online, for example via a website, or by means of an electronically transmitted message, such as an e-mail.
  • the pickup orders for addresses in the geographic area 102 associated with the delivery depot 101 may be transmitted to the scheduler 105.
  • the scheduler 105 considers the pickup orders in the planning of tours that have been received up to a certain time prior to the start of the tours. Likewise, provision may be made to take account of incoming pickup requests later in the planning device 105 and to integrate them into already planned tours. This can also be done after starting a tour become.
  • the orderer as well as possibly changed tour data due to the order are transmitted via the mobile radio network 108 to the deliverer.
  • the trip planning in the scheduler 105 is made based on the addresses to be served by the carriers and the distances between the addresses.
  • the assignment of the stops to the deliverers is carried out according to one or more optimization criteria, such that a uniform utilization of the deliverer is achieved, the total duration or length of the tours is minimized.
  • the tour planning also includes the determination of the stop order for the tours of the individual deliverer.
  • a heuristic algorithm is preferably used in the planning device 105, which can be carried out in a manner known to the person skilled in the art.
  • the distances used for route planning are determined prior to the calculation of the tours and stored in non-volatile memory unit 109 of planning device 105.
  • the scheduler 105 reads the distances between the addresses to be served from the storage unit 109 and uses them as input to the route planning algorithm. In each case distances to all other addresses to be served are provided for each address to be used and to be taken into account during tour planning. As a result, distances from the other addresses to this address can be taken into account in particular for each address.
  • the distances are preferably distances in time which indicate the time required to get from one address to another. Alternatively, however, the distances may also indicate the distances between the addresses or other quantities. Preferably, the size to which the distances relate, adapted to the optimization criterion that underlies the tour planning. In particular, the distances can be values of a variable to be optimized.
  • the distances are stored in a predetermined data structure, preferably in a distance matrix. This contains entries d, each of which specifies the distance from an address i to an address j. The entries on the main diagonal of the distance matrix, ie the entries d , have the value zero.
  • the distance matrix is generally not symmetric, since the distance from an address i to an address j does not necessarily correspond to the distance from the address j to the address i. For example, a reason for differences in these distances may be that a route from the address i to the address j due to one-way streets or the like can not be reversed.
  • the distance matrix it is envisaged not to redetermine the distance matrix before each route planning process carried out in the planning computer 105. Instead, once computed distances remain basically stored in memory unit 109 and can be used for multiple tour computation operations (however, in one embodiment, the distances may be updated as will be described). The determination of the distances is preferably carried out when the associated addresses are to be used for the first time. If new addresses are to be served, which are not taken into account in the distance matrix, it is intended to determine distances between the new addresses as well as distances between the new and the remaining andresses of the distance matrix and to add them to the distance matrix.
  • the distance matrix can be determined in preparation for a specific route calculation process on the basis of the addresses to be taken into account and then stored in the memory unit 109.
  • FIG. 2 a shows a schematic representation of a distance matrix which may arise as a result of the first determination.
  • N addresses Ai, A N are considered, on the basis of which the route planning process is carried out, for which the first-time calculation of the distance matrix is undertaken.
  • the distance-value-containing entries of the distance matrix are shown hatched in FIG. 2a. If the planning device 105 is notified of one or more further addresses that are to be taken into account in subsequent route calculation processes, the planning device 105 checks whether these addresses are already taken into account in the version of the distance matrix in the memory unit 109.
  • the distances stored in the memory unit 109 are used with respect to this address. If the scheduler 105 determines that one or more of the received addresses are not included in the stored version of the distance matrix, distances between the respective addresses and between the new addresses and the addresses already considered in the distance matrix are determined and stored in the distance matrix. This results in a new version of the distance matrix, which is stored in the memory unit 109.
  • FIG. 2b shows a schematic representation of a version of the distance matrix which has been determined on the basis of the version shown in FIG. 2a, after the planning device 105 has been notified of further addresses.
  • among the other addresses M are addresses Bi,..., B M which do not correspond to any of the addresses Ai,..., A N and have therefore not been considered in the previous version of the distance matrix.
  • the planning device 105 adds distances between the addresses Bi,..., B M and between the addresses Bi, B M and the addresses Ai,... AN in the distance matrix.
  • the supplemented entries are identified in FIG. 2b by a hatching changed with respect to that of the original entries.
  • the distance matrix is always supplemented when addresses are reported to the planning device which are to be served by the deliverers of the delivery depot 101 and have to be taken into account in the planning device 105 during tour planning.
  • distances in relation to addresses at which mailpieces are to be delivered and / or fetched are continuously added to the distance matrix. The increase in distances is thereby steadily lower, since with time fewer and fewer addresses of the delivery depot 101 associated geographical area 102 remain, which are not taken into account in the distance matrix.
  • the distance matrix After a certain period of time, the distance matrix has in this way grown to a circumference in which substantially all or a multiplicity of addresses to be taken into account in the delivery and / or collection of mailpieces have found their way into the distance matrix. Addresses on which mail is never delivered and / or picked up, for example because the associated plots are unused, are not taken into account in the distance matrix. This is an advantage of the intended demand-dependent addition of the distance matrix, which means that only distances between addresses that are relevant for the delivery and / or collection of postal items need to be determined.
  • An alternative embodiment differs from the embodiment explained above in that for new addresses which are transmitted for a route planning process, the distances to all addresses already taken into account in the distance matrix are not calculated, but only those addresses already considered in the distance matrix also to be considered in the tour planning.
  • the distances between a new and a further address, which already takes into account in the distance matrix, are preferably determined by the planning device when the two addresses are to be considered together in the tour planning.
  • the planning device 105 checks whether distances between the addresses to be considered are stored in the distance matrix.
  • the distances which are not included are supplemented by the planning device 105 and remain stored in the memory unit 109 even after the route planning process for carrying out further route planning processes.
  • the check can be made in particular when an address is reported, which must be taken into account in the tour planning. In this case, it is determined whether distances between the reported address and the addresses already received, which are to be considered in the tour planning, are stored in the memory unit 109. If this is not the case for one or more existing addresses, the distances are added. Also in this embodiment, distances are added continuously in the distance matrix, which are not included, and the gain becomes steadily smaller.
  • the computational power required in terms of planning a single tour is less in the alternative embodiment described above because fewer distances need to be determined. If, on the other hand, distances are also determined to addresses which are not to be taken into account in the current route planning, in particular to all other addresses considered in the distance matrix, the distance matrix fills faster with distances that can later be used without further calculations.
  • the planning device 105 calculates a route from the first to the second address within the route network of the geographic region 102 in one embodiment.
  • a route calculation device 106 is provided.
  • the route is calculated such that it satisfies one or more predetermined optimization criteria.
  • the fastest or shortest route can be calculated.
  • the optimization criterion that is used in the route calculation is adapted to the optimization criterion on which the route planning carried out in the planning device 105 is based. In particular, the same optimization criterion can be used.
  • the distance resulting from the optimal route is entered by the planning device 105 in the distance matrix.
  • the calculated optimal routes, on which the distance determination is based, is transmitted in one embodiment to the delivery vehicles 103, which are guided on the tour based on the routes.
  • the routes can be loaded, for example, into the navigation systems of the delivery vehicles 103 in order to navigate the delivery vehicles by means of navigation instructions along the routes.
  • routes between the individual stops in the delivery vehicles 103 take place independently of the route determination for determining the distances.
  • the navigation devices of the deliverers can determine the routes independently of specifications of the planning device 105 and / or the deliverers determine the routes between the stops on the basis of their local knowledge.
  • the determination of the optimum route is performed in the scheduler 105 using stored map data of the road network of the geographical area 102.
  • the map data may contain, for example, path sections of the road network to which distances are respectively assigned or for which the distances can be calculated on the basis of data assigned to the route sections. For example, a length and an average speed can be specified for the route sections, from which the planning device 105 can calculate an average time interval for covering the route.
  • a route from a first to a second address individual sections of the route network will be linked to one another in such a way that an optimal route results from the first to the second address.
  • algorithms can be used which are known per se to the person skilled in the art.
  • traffic information is also used to calculate the routes from which the distances entered into the distance matrix are determined.
  • long-term traffic impairments can be taken into account, such as blockages and / or diversions, as well as comparatively short-term impairments, such as congestion. Due to the aforementioned longer-term traffic impairments, for example, certain routes can be excluded in the route calculation. The aforementioned short-term traffic impairments lead to an increase in the distance for locomotion on the stretches and are therefore taken into account in the distance determination. For example, in the route calculation on which the distance determination is based, greater distances can be used for individual routes if a traffic jam has been reported for these routes.
  • the distances calculated on the basis of the traffic information are updated in the distance matrix.
  • the update can be made, for example, in the event of a change in the traffic situation, which can be reported to the planning device 105 within the traffic information.
  • the Distan zen as soon as the planning device 105 has detected a change in the traffic situation based on the obtained traffic information.
  • a recalculation of the route between the addresses is preferably carried out on the basis of the changed traffic information or traffic situation.
  • the distances are determined by a detection and evaluation of the movement of the deliverer on the tours performed. On the basis of acquired position information and recorded times at which the positions are reached, it can be determined when the deliverer has reached the stops of his tour and which time distances have been traveled between the stop addresses. If the distance values represent another quantity, additional or other measured values which are detected during the execution of the tours, such as the distances traveled between the stops, can be taken into account.
  • the position information and optionally further data can be transmitted from the deliverers or the delivery vehicles 103 to the planning device 105, so that they can track the deliverers and evaluate the traveled route. Likewise, it may be provided that the positions of the delivery vehicle 103 as well as the associated newspaper and possibly further information are logged in the location units and, for example, transmitted to the planning device 105 each time a tour is completed.
  • distances between a first and second address are entered which have actually been covered by the deliverers on a traveled route from the first to the second address.
  • very realistic values can be provided in the matrix. If the same route is traveled several times, it may also be provided to calculate average values of the distances actually traveled and to record them as distance values in the distance matrix. to reduce the influence of special circumstances on individual delivery routes.
  • the registration of distance values which have been determined on the basis of actually traveled distances is preferably carried out by updating calculated distances contained in the distance matrix. That is, before a deliverer has traveled a route between two addresses and there are associated position data, a calculated distance is entered in the distance matrix. This is then replaced by the distance determined on the basis of acquired data after a route between the addresses has been completed by a deliverer.
  • the distances between the addresses considered in the distance matrix usually change with the time of day and / or the day of the week when traffic information is considered in the distance matrix.
  • the reason for this is the usually fluctuating traffic density, which is higher, for example, in the so-called rush hour than at other times.
  • the individual entries of the distance matrix each comprise a plurality of components that are valid for different periods of time.
  • the distance matrix may be configured higher dimensionally with more than two dimensions.
  • the distances assigned to the different periods are preferably average distances typically required in the validity periods for the routing of the routes between the respective addresses. They can be determined depending on traffic information and / or acquired measured values.
  • a plurality of distance matrices which are each assigned to a means of transport, are stored in the memory unit 109, or, alternatively, the entries. ge of the distance matrix comprise several components, each associated with a means of transport.
  • all distance values are preferably supplemented when the associated location is reported to the planning device 105. However, it may also be provided that the determination takes place as required, i. then, if the distance values are needed for the tour planning.
  • the required distances are also available when a quick re-planning of one or more tours is to be made.
  • Such re-planning can be provided, for example, to integrate pick-up orders that are received in the planning device 105 after the start of a delivery route in the delivery tour. If the address of the pick-up order was not previously included in the distance matrix, only the distances between this address and the other addresses considered in the distance matrix have to be determined for the new planning of the tour. If the address was already taken into account in the distance matrix, no distance calculation is necessary at all to be able to re-plan the delivery route.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Navigation (AREA)
  • Sorting Of Articles (AREA)

Abstract

L'invention concerne un procédé pour planifier des tournées qui passent respectivement par une pluralité de lieux et pour lesquelles une succession de lieux est déterminée en fonction de la distance entre lieux. Les distances entre des premiers lieux d'une première tournée sont stockées dans une mémoire conjointement avec la destination de la première tournée et une deuxième tournée suivante sera déterminée en fonction des distances entre lieux de la deuxième tournée enregistrées dans la mémoire et en fonction d'autres distances entre lieux de la deuxième tournée, les autres distances étant complétées dans la mémoire. L'invention concerne également un dispositif qui est approprié pour mettre en œuvre le procédé. L'invention peut être utilisée en particulier pour la planification de tournées pour distribuer et/ou enlever des envois postaux.
EP11782569.5A 2010-10-22 2011-10-20 Procédé et dispositif de planification des tournées Withdrawn EP2630620A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102010042813A DE102010042813A1 (de) 2010-10-22 2010-10-22 Verfahren und Vorrichtung zur Tourenplanung
PCT/EP2011/068294 WO2012052495A1 (fr) 2010-10-22 2011-10-20 Procédé et dispositif de planification des tournées

Publications (1)

Publication Number Publication Date
EP2630620A1 true EP2630620A1 (fr) 2013-08-28

Family

ID=44983498

Family Applications (1)

Application Number Title Priority Date Filing Date
EP11782569.5A Withdrawn EP2630620A1 (fr) 2010-10-22 2011-10-20 Procédé et dispositif de planification des tournées

Country Status (8)

Country Link
US (1) US20140025295A1 (fr)
EP (1) EP2630620A1 (fr)
JP (1) JP2013543123A (fr)
CN (1) CN103154981A (fr)
DE (1) DE102010042813A1 (fr)
MX (1) MX2013004247A (fr)
SG (1) SG189416A1 (fr)
WO (1) WO2012052495A1 (fr)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014190947A (ja) * 2013-03-28 2014-10-06 Denso It Laboratory Inc ナビゲーションシステム
CN103248769B (zh) * 2013-05-20 2015-10-14 南京邮电大学 一种基于iPhone手机进行路径优化的配送系统及其方法
DE102015204140A1 (de) 2015-03-09 2016-09-15 Robert Bosch Gmbh Verfahren zur Ermittlung mindestens einer Streckenentfernung
US11055801B2 (en) 2016-01-29 2021-07-06 Omnitracs, Llc Vehicle driver activity level determinations and analysis in a fleet management system
WO2017187482A1 (fr) * 2016-04-25 2017-11-02 株式会社日立物流 Système et procédé de création de plan de livraison
US11157866B2 (en) * 2016-10-27 2021-10-26 International Business Machines Corporation Intelligent package delivery
CN110785626B (zh) * 2017-06-30 2023-05-30 Oppo广东移动通信有限公司 出行方式推荐方法、装置、存储介质及终端
CN109961162B (zh) * 2017-12-22 2023-04-07 株式会社日立制作所 路径规划方法和路径规划装置
US20220067640A1 (en) * 2018-12-20 2022-03-03 Sony Group Corporation A method for controlling a management system and related electronic device
KR102213896B1 (ko) * 2020-06-24 2021-02-08 쿠팡 주식회사 배송 관리를 위한 전자 장치 및 그 제어 방법
EP4232967A4 (fr) * 2020-10-23 2024-10-16 Entanglement Inc Procédé et appareil de gestion logistique utilisant un calcul quantique
CN112241497B (zh) * 2020-12-18 2021-06-04 盛威时代科技集团有限公司 一种到达站点区域标准化数据处理方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10031834C2 (de) * 2000-06-30 2002-09-26 Ffg Flensburger Fahrzeugbau Gm Routenplanungsverfahren und -vorrichtung
SE0003526L (sv) * 2000-09-29 2001-10-01 Thoreb Ab Förfarande för att automatiskt upprätta och uppdatera en avståndstabell
DE102004019232B4 (de) * 2004-04-16 2006-04-06 Deutsche Post Ag Verfahren und Vorrichtung zum Befördern einer Vielzahl von physischen Objekten
DE102009023711A1 (de) * 2009-06-03 2010-12-16 Navigon Ag Verfahren und Navigationseinrichtung zur Ermittlung und Ausgabe einer Route

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2012052495A1 *

Also Published As

Publication number Publication date
DE102010042813A1 (de) 2012-04-26
WO2012052495A1 (fr) 2012-04-26
JP2013543123A (ja) 2013-11-28
MX2013004247A (es) 2013-08-21
SG189416A1 (en) 2013-05-31
US20140025295A1 (en) 2014-01-23
CN103154981A (zh) 2013-06-12

Similar Documents

Publication Publication Date Title
WO2012052495A1 (fr) Procédé et dispositif de planification des tournées
EP1026649B1 (fr) Procédé et dispositif de préparation d'information de circulation
EP0988508A1 (fr) Procede et dispositif pour produire, reunir et actualiser des fichiers de parcours
EP2313742B1 (fr) Procédé et dispositif pour fournir des données de navigation, appareil de navigation
EP3655726A1 (fr) Procédé de détermination d'un lieu de destination différent d'un lieu défini, système et véhicule automobile équipé dudit système
WO2017134299A1 (fr) Procédé de transport d'un grand nombre d'objets entre des endroits spécifiques aux objets
DE102012215447A1 (de) Zentralisierte Routenbestimmung
EP2224408B1 (fr) Système de détection de trafic
DE202021004309U1 (de) Verwendung einer mobilen Depoteinrichtung und System geeignet zur Übergabe einer Vielzahl von Paketen an mehrere Empfänger
EP3163520A9 (fr) Coordination d'un apport de prestation
DE102017217131B3 (de) Verfahren zur Unterstützung einer Parkplatzsuche für einen Fahrzeugführer eines Lastkraftwagens sowie ein System, welches dazu eingerichtet ist, ein solches Verfahren durchzuführen
EP3224774A1 (fr) Création d'un itinéraire de livraison
EP4323726A1 (fr) Procédé et système de détermination d'un point de départ entre des entités
DE102017114875B3 (de) Verfahren zum Ausliefern von mit einer Zieladresse versehenen Objekten unter Verwendung eines Transportfahrzeugs
DE202022103709U1 (de) Logistiksystem zur Übergabe einer Vielzahl von Paketen an mehrere Empfänger und/oder zur Entgegennahme einer Vielzahl von Paketen von mehreren Einlieferern
EP1804226B1 (fr) Procédé pour transmettre des informations routières
DE19830777A1 (de) Verfahren zur Datenübermittlung und -verarbeitung im Zusammenhang mit der Beförderung von Gütern
DE102009027544A1 (de) Verfahren und Vorrichtung zur Ermittlung einer Verkehrsprognose
AT526096B1 (de) Verfahren zum Steuern von Entleerungsfahrzeugen zum Entleeren von Wertstoffbehältern
WO2012045620A1 (fr) Service d'enlèvement à domicile d'envois postaux
DE102021207567A1 (de) Verfahren und System zum Übergeben von zumindest einem Objekt von einem Versorgungsfahrzeug an ein Zustellungsfahrzeug
DE112021007651T5 (de) Informationsverarbeitungseinrichtung, informationsverarbeitungssystem, informationsverarbeitungsverfahren und informationsverarbeitungsprogramm
DE102017003546A1 (de) Verfahren zur Auslieferung von Warensendungen
DE102012200578A1 (de) Verfahren und Vorrichtung zum Transportieren von Gegenständen in zwei Auslieferungsvorgängen
DE112021006920T5 (de) Anpassbare erfahrung mit autonomen fahrzeugen für grossveranstaltungen

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20130522

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20131217