JP2007008670A - Device and method for determining delivery order, program and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To perform the calculation in a short time by using a regular personal computer or the like by simplifying the delivery order determination processing; and to reduce the operational man-hour by reducing the data input. <P>SOLUTION: A CPU 21 groups delivery destinations based on delivery destination information and vehicle information. In the grouped delivery destinations, the delivery destination farthest from a delivery origin is defined as a first order determination point, and a delivery order non-determined point nearest from the first order determination point or a delivery non-determined point farthest from the delivery origin is defined as a next order determination point. Thereafter, the order non-determined point nearest from the order determination point immediately before or the order non-determined point farthest from the delivery origin is successively order-determined as the next order determination point. The order of each determined order determination point is defined as a cargo loading order, and the order opposite to this order is defined as a delivery order. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a delivery order determination device, a delivery order determination method, a program, and a recording medium that determine a delivery order when delivering a delivery product to a plurality of delivery destinations.

  In Japanese Patent Application Laid-Open No. 06-273181 (Patent Document 1), a road map including route data including a position, connection, and direction is created by converting the coordinates of road intersections and turning points, and delivering information and traffic conditions. A route determination method for determining an optimal route in consideration of the above is also disclosed.

  In addition, in JP 07-234997 A (Patent Document 2), an optimal genetic neuro process is performed based on delivery, actual results, and statistical data in consideration of fluctuations in road conditions, and sudden changes or cancellations of orders. A vehicle allocation plan planning method for selecting a vehicle allocation plan is disclosed.

  Further, in Japanese Patent Application Laid-Open No. 08-115495 (Patent Document 3), the entire area is dynamically divided into a plurality of blocks (divided areas) corresponding to the number of vehicles according to a predetermined condition, and further the shortest time in each block. An automatic vehicle allocation device for creating a delivery route is disclosed.

In Japanese Patent Laid-Open No. 2002-308439 (Patent Document 4), a vehicle having a loadable space or a loadable weight that is vacant is appropriately combined and dispatched, and a vehicle allocation plan is a combination of a plurality of vehicles such as regular flights and non-periodic flights A package delivery system for planning is disclosed.
Japanese Patent Laid-Open No. 06-273181 JP 07-234997 A JP 08-115495 A JP 2002-308439 A

As described above, in the conventional technology, the optimal route is calculated in consideration of traffic restrictions such as road intersections and one-way traffic and right-turn prohibition while taking delivery time into account. It takes a long time to calculate the target route. Moreover, if it is going to implement | achieve practical calculation time, the hardware provided with an appropriate specification will be needed, and a hardware cost will become high. Furthermore, the program becomes complicated and the cost of software increases.

  Further, in the conventional technique, it is necessary to provide traffic regulation and congestion status as basic data, which increases the operation cost.

  And no matter how detailed the data is input, the estimated delivery time will not match the actual delivery time due to sudden traffic jams (failed cars, accidents, emergency construction, event execution), etc. The reality is that there are many cases where this happens.

  Further, in the conventional technology, since time is specified finely for each delivery destination, the driver is stressed and irritated, which may cause a traffic accident. Furthermore, if the calculated route is adhered to, there are many problems that the flexible and optimal delivery route selection based on the road condition of the day becomes impossible.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to group delivery destinations based on delivery destination information and vehicle information, and deliver the grouped delivery destinations. The delivery destination farthest from the starting point is the first order determination point, the unordered point that is the shortest distance from the first order determination point or the order undecided point farthest from the delivery start point is the next order determination point, Hereinafter, the order is determined as the next order determination point, which is the order undecided point that is the shortest distance from the immediately preceding rank determination point or the farthest order undecided point from the delivery starting point, and the order of the determined order determination points Since the processing order is simple because the loading order is set and the reverse order of the order is the shipping order, the grouping of the delivery destinations, the vehicle allocation, and the delivery order are simply determined. Can be calculated in a short time using both the hardware and software at low cost, and there is no need to input detailed data such as route information, traffic regulations, congestion status, etc. As a result, the number of operation steps can be reduced compared to the conventional method, and the delivery order is determined with priority from a distant delivery destination, so that even if a time error occurs, it is easy to cover with other vehicles. It is to provide a delivery order determination device, a delivery order determination method, a program, and a recording medium.

  The present invention includes a delivery destination storage means for storing delivery destination information for specifying a delivery destination on the delivery day, an inter-delivery distance storage means for storing a linear distance between the delivery destinations on the delivery day, and the delivery destination. Delivery item storage means for storing delivery item information for specifying a delivery item to be delivered; vehicle information storage means for recording operating unit information including the number of operable vehicles on the day of delivery; the delivery destination information and the vehicle information; A delivery destination dividing means for grouping the delivery destinations based on the delivery destination, and the grouped delivery destination is a delivery destination farthest from the delivery origin as the first order determination point, and the shortest distance from the first order determination point An order undecided point or the farthest order undecided point from the delivery starting point is set as the next order determining point, and then the order undecided point that is the shortest distance from the immediately preceding rank determining point or the farthest from the delivery starting point. An order determining unit that sets an unordered point as a next order determining point, wherein the order of each order determining point determined by the order determining unit is a loading order, and the reverse order of the order is a delivery order. And

  According to the present invention, the delivery destinations are grouped on the basis of the delivery destination information and the vehicle information, and the grouped delivery destination is set as a delivery destination farthest from the delivery start point, and the first order is determined. Whether the order is an undecided point that is the shortest distance from the determined point, or is the order undecided point that is the shortest distance from the previous rank determining point Alternatively, the order undecided point farthest from the delivery starting point is determined as the next order determining point, the order of the determined order determining points is set as the loading order, and the reverse order of the order is set as the delivery order. Since only the process of determining the grouping, vehicle allocation, and delivery order is performed, the process is simple and can be calculated in a short time using a normal personal computer. Both it is possible to provide cheap cost.

  In addition, it is not necessary to input detailed data such as route information, traffic regulations, and congestion conditions, and the number of operation steps can be reduced as compared with the prior art.

  Furthermore, since the delivery order is determined with priority from a far delivery destination, even if a time error occurs, it is easy to cover with another vehicle.

  Moreover, since only the area division, vehicle allocation, and delivery order are determined, a flexible and optimum delivery route can be selected by the driver's judgment according to the road conditions on the day.

  In addition, as described above, priority is given to far-off destinations, so the only unassigned delivery destinations are those close to the distribution base (such as warehouses or stores), and vehicles that have finished far-away delivery quickly Can be loaded and delivered.

  In addition, it is sufficient to let a specific vehicle take charge of a severely specified delivery case.

  Furthermore, even if all the operating vehicles cannot be transported at one time, the area division is set to “operating vehicle + 1 vehicle”, so that it is decided by leaving the nearest area of the starting point for the overloaded baggage, and the distant delivery is finished quickly. The vehicle can be loaded and delivered promptly.

[First Embodiment]
FIG. 1 is a block diagram showing a hardware configuration of an information processing apparatus capable of providing a delivery order determining apparatus according to the first embodiment of the present invention.

  The information processing apparatus to which the delivery order determining apparatus of the present invention is applicable is a personal computer or the like. As shown in FIG. 1, the information processing apparatus includes, for example, a CPU 21, a RAM 22, a ROM 23, a LAN adapter 24, a video adapter 25, a keyboard 26, a pointing device such as a mouse 27, a hard disk 28, A recording medium drive (recording medium drive) such as a CD-ROM drive 29 and a DVD-ROM drive is provided, and these are connected to each other via a system bus 20.

  The CPU 21 controls the entire apparatus by reading out a program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22.

  The RAM 22 is used as a work area for the CPU 21. The LAN adapter 24 is a communication interface for connecting to a network. The hard disk 28 includes various masters and tables and transaction data (hereinafter abbreviated as Tran) shown in FIG. 2 and FIG. 3 and a product master (not shown) (unique product code, product name, product type (beer, whiskey, wine, Sake, shochu, sparkling liquor, etc.), purchase cost, supplier corporation code), etc. are stored and managed. A monitor 30 such as an LCD or CRT is connected to the video adapter 25 and controls display on the monitor 30.

  Hereinafter, in this embodiment, a case where a delivery route from a liquor store to a liquor store is determined will be described as an example. However, the delivery order determination device of the present invention is not limited to this example, and can be used to determine any delivery route. Applicable.

  Hereinafter, with reference to FIG. 2 and FIG. 3, various table information used in the delivery order determination apparatus of the present invention will be described.

  2 and 3 are diagrams showing information of various tables used in the delivery order determination device of the present invention.

  In FIG. 2A, reference numeral 601 denotes a category master, which stores information for classifying the delivery. The category master 601 is composed of columns such as a classification 1 CD (code), a classification 1 name, a classification 2 CD, a classification 2 name, a classification 3 CD, and a classification 3 name. For example, in classification 1, delivery destinations are classified into long, medium, and short distances based on the delivery source. In category 2, the azimuth block is set based on the delivery source, and the delivery destinations are separated. Furthermore, classification 3 is classification of a delivery destination according to the size of a store.

  Reference numeral 602 denotes a store master, which stores delivery source / recipient information. This store master 602 is composed of columns such as category 1 CD, category 2 CD, category 3 CD, store CD, store name, address, telephone number, delivery category, distance between starting points, geographic information, and the like. Class 1CD is, for example, the direction and direction of the store as viewed from the delivery source. Class 2CD means, for example, a relationship between stores (delivery is required at an earlier time than other stores). Class 3CD is, for example, an individual store. This means the circumstances (the delivery volume is always large, so a dedicated vehicle for the store is necessary).

  In FIG. 2B, reference numeral 603 denotes a distance master for storing the distance between the delivery source and each delivery destination. The distance master 603 includes columns such as a reference store CD, a store CD, a linear distance, a logical distance, a time specified distance 1, a time specified distance 2, a time specified distance 3, a time specified distance 4, and a time specified distance 5. In order to avoid duplication of the distance table, the store CD takes a larger value than the reference store CD.

  Reference numeral 604 denotes a vehicle master for registering delivery medium information. The vehicle master 604 includes columns such as a vehicle CD, a vehicle number, a maximum load capacity, a safe load capacity, an automatic / car train classification, an operational status FLG (flag), and a final inspection date.

  Reference numeral 605 denotes a package master for registering single item information of packages (products) to be delivered. The package master 605 is composed of columns such as a package CD, a package name, a unit weight, and a unit volume.

  In FIG. 3A, reference numeral 701 denotes an active dispatching transaction (meaning transaction data; the same applies hereinafter) for entering a delivery vehicle that can be operated at a certain point. This operation dispatching transaction 701 is composed of columns such as delivery date, delivery order, operation start time, operation end time, and vehicle CD.

  702 is a delivery store transaction for entering a store to be delivered at a certain point. This delivery store transaction 702 includes columns such as delivery date, delivery acceptance start time, delivery acceptance end time, order CD, store CD, vehicle CD, total weight, total volume, and the like. In the total weight, the total weight of the delivery item and the total weight of the collected item are stored. Further, the total volume amount stores the total volume of the delivered product and the total volume of the collected product.

  Reference numeral 703 denotes a delivery detail transaction for entry of package information for each store to be delivered at a certain point. This delivery detail transaction 703 includes columns such as delivery date, delivery acceptance start time, delivery acceptance end time, order CD, store CD, vehicle CD, unit weight, unit volume, quantity, weight, volume, and the like. This delivery detail transaction 703 stores not only delivery information but also receipt information. It should be noted that the delivery product and the pick-up product can be distinguished by the order number or the like.

  In FIG. 3B, 704 is a daily transport report for collecting and storing daily operation information in units of vehicles. This transportation daily report Tran 704 is composed of columns such as delivery date, operation start time, operation end time, vehicle CD, total travel distance, actual travel distance, total empty distance, actual empty distance, maximum loading capacity, maximum volume capacity, and the like. The

  Reference numeral 705 denotes a transportation route run, which stores details of daily operation results in units of vehicles. This transport route run 705 is composed of columns such as delivery date, departure time, arrival time, vehicle CD, delivery order, departure store CD, arrival store CD, linear distance, mounting distance, loading weight, volume amount, and the like.

  Reference numeral 706 denotes a control for storing condition settings for executing simulation. This control 706 includes a delivery date, an operation start time, an operation end time, a total delivery load amount, a total vehicle load amount, a total delivery volume amount, a total vehicle volume amount, a category priority 1, a category priority 2, a category priority 3 And so on.

  Hereinafter, the delivery order determination process in the first embodiment of the delivery order determination device of the present invention will be described with reference to FIGS.

  FIG. 4 is a flowchart showing an example of a first control processing procedure in the delivery order determination apparatus of the present invention, and corresponds to the delivery order determination process. The processing of this flowchart is realized by the CPU 21 of the delivery order determination device shown in FIG. 1 reading out the program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22. The In the figure, S301 to S317 indicate each step.

  Before starting the processing shown in this flowchart, a straight line distance between each delivery destination and other delivery destinations in the distance master 603 shown in FIG. 2, and a straight line from the delivery source to each delivery destination in the store master 602. Each table shown in FIG. 2 including the distance (distance between the starting points) and a product master (not shown) (unique product code, product name, product type (beer, whiskey, wine, sake, shochu, shochu, etc.), finish It is assumed that the data is registered in the hard disk 28 and is registered in the (cost of receipt, supplier corporation code).

  First, in step S301, the CPU 21 executes order information input processing. Specifically, the CPU 21 controls to display the order entry screen shown in FIG. 6 on the monitor 30 and accepts an order entry such as a delivery target store and package information.

  FIG. 6 is a diagram showing an example of an order entry screen in the delivery order determination device of the present invention.

  As shown in FIG. 6, delivery name 801, delivery specified date 802, product type 803, product name 1 (804), quantity 1 (805), product name 2 (806), quantity 2 (807), product name 3 (808) , 3 (809) can be input from the keyboard 25, mouse 27, and the like. Each input item on the order entry screen is acquired by the CPU 21 from the package master 605, the category master 601, the store master 602, and the like shown in FIG. When the registration button 810 is instructed from the keyboard 25, mouse 27, etc., the CPU 21 stores the input information on the order entry screen in the delivery details transaction 703, the delivery store transaction 704, etc. shown in FIG. 3, and step S302. The processing is transitioned to.

  Next, in step S302, the CPU 21 executes an operating vehicle input process. Specifically, the CPU 21 performs control so that an operating vehicle input screen (not shown) is displayed on the monitor 30 and receives inputs such as priority order of operating vehicles based on maintenance information and driver's attendance information. In addition, each input item on the operating vehicle input screen is acquired by the CPU 21 from the vehicle master 604 shown in FIG. When the registration button is instructed from the keyboard 25, mouse 27, etc., the CPU 21 stores the value based on the input information on the operating vehicle input screen in the operating dispatching truck 701 shown in FIG. Transition.

  Next, in step S303, the CPU 21 executes a simulation condition input process. Specifically, the CPU 21 controls to display a simulation condition input screen shown in FIG. 7 on the monitor 30 and accepts selection / input of simulation conditions.

  FIG. 7 is a diagram showing an example of a simulation condition input screen in the delivery order determination device of the present invention.

  As shown in FIG. 7, store classification designation 901, delivery date 902, hired car presence / absence 903, piston presence / absence 904, loading restriction presence / absence 905, provisional selection number designation 906 can be input from the keyboard 25, mouse 27, and the like. The store category designation 901 designates in which category the store that is the delivery destination is classified. Employed car presence / absence 903 designates whether or not to hire a car when there are not enough cars for delivery. Piston presence / absence 904 designates whether or not to deliver pistons when there are not enough vehicles for delivery. The loading limit presence / absence 905 designates whether the loading limit is “weight and volume”, “weight”, or “volume”. The provisional selection number designation 906 designates a provisional selection number described later.

  Then, when the store classification priority designation button 910 is instructed from the keyboard 25, mouse 27, etc., the CPU 21 stores the input information on the simulation condition input screen in the RAM 22, and shifts the processing to step S304.

  Next, in step S304, the CPU 21 executes store classification priority order input processing. The store classification is a grouping of stores to be delivered on that day. Specifically, the CPU 21 controls to display a priority order input screen (not shown) on the monitor 30 and simulates it according to the number of operating vehicles and the like. The number of stores classified at the time of execution and the priority order for the classification classified by the number of classifications are received. The number of classifications can be freely set regardless of the number of operating vehicles. When an unallocated store occurs according to the calculation result, the simulation can be performed any number of times in consideration of the number of vehicles. When the number of classifications is input with priority from the keyboard 25, the mouse 27, etc., the CPU 21 classifies the stores by the designated number of classifications, and follows the priority order of the store classification designated for each classification. The vehicles in the priority order input in step S302 are allocated. Store classification information and vehicle allocation information are stored in the hard disk 28. For example, if the user designates four categories of store classification as the number of store classifications, and the priority order is specified in the order of east → west → south → north, from the operating vehicle with the highest priority in order of east → west → south → north. Assigned. In addition, the CPU 21 calculates the total weight (total delivery load amount) and the total delivery volume amount of the ordered product on the day, and the CPU 21 calculates the theoretical value of the necessary number by applying the number of vehicles in the priority order input in step S302. Calculate (total vehicle load capacity, total vehicle volume). This number is the minimum number (theoretical value) that can be allocated. The CPU 21 obtains information necessary for the calculation process from the category master 601, the vehicle master 604 shown in FIG. 2, the active dispatching transaction 701 shown in FIG. 3, the delivery store transaction 702, and the like. Further, the CPU 21 stores in the control 706 the above-mentioned classification priority order and the calculated total delivery load amount, total delivery volume amount, total vehicle load amount, total vehicle volume amount, and the like, and the process in step S305. Transition. Note that the CPU 21 may be configured to set a new store classification based on the delivery items exceeding the loading weight and loading capacity of the operating vehicles in the priority order input in step S302.

  Next, in step S305, the CPU 21 executes a longest distance store allocation process. In this process, according to the priority order input in step S304, the stores are sequentially assigned from the store farthest from the shipping origin to the closest store in the classification unit of the store entered in step S301 to the vehicle entered in step S302. This is a process for determining the order of the stores. Details are shown in FIG.

  Next, in step S306, the CPU 21 executes a classified delivery store allocation process. In this process, according to the order of the store classification unit determined in step S305, the store-specific baggage is allocated until the maximum load amount or the maximum load weight of the allocated vehicle is reached. That is, this is a process of sequentially assigning the vehicles in the closest order to the stores in the same category entered in step S301 based on the one store assigned in step S305. In this case, the weight and volume of the ordered product are summarized for each vehicle, and the allocation ends with the maximum load capacity or maximum volume of the vehicle. Details are shown in FIG. In the longest distance store allocation process in step S305 and the delivery shop allocation process by category in step S306, the vehicle allocation is sequentially executed in the order of priority given by the priority order input.

  Next, in step S307, the CPU 21 determines whether or not there is an unallocated store. If it is determined that there is an unallocated store, the process proceeds to step S308.

  In step S308, the CPU 21 determines whether there is an unallocated operating vehicle. If it is determined that there is an unallocated operating vehicle, the process proceeds to step S309.

  In step S309, the CPU 21 performs reassignment according to the classification of the priority order next candidate. That is, the store classification of the next priority is set, and the process returns to step S305.

On the other hand, if the CPU 21 determines in step S308 that there is no unassigned working vehicle, the process proceeds to step S310. In step S310, the CPU 21 determines that the number of vehicles is insufficient, and in step S311,
Re-simulate notification alert processing is performed. Specifically, the CPU 21 controls to display unallocated store, weight, volume, and vehicle allocation information as an alarm on the monitor 30, and provides information necessary for the vehicle to encourage re-simulation. .

  In step S312, the CPU 21 determines whether or not re-simulation is instructed. If it is determined that re-simulation is instructed, the process returns to step S302 to re-simulate.

  On the other hand, if the CPU 21 determines in step S312 that the re-simulation has not been instructed, the process ends.

  On the other hand, if the CPU 21 determines in step S307 that there is no unallocated store, in step S313, the CPU 21 determines that the vehicle allocation is complete, and shifts the processing to step S314.

  Next, in step S314, the CPU 21 performs a delivery route determination process. More specifically, the delivery routes are determined in the order of distance from the wholesaler based on the dispatch results in steps S305 and S306 (that is, the reverse order of the order determined in S305 is determined as the delivery order), and the determined information is shown in FIG. It is stored in the transport daily report run 704 and the transport route run 705, and the delivery order display screen shown in FIG.

  FIG. 8 is a diagram showing an example of a delivery order display screen in the delivery order determination device of the present invention.

  As shown in FIG. 8, the delivery route determined in the delivery order display orchid 905 is displayed and controlled by the CPU 21. When each store name portion displayed on the delivery order display orchid 905 is instructed from the keyboard 25 or the mouse 27, the CPU 21 controls to acquire and display the store information from the store master 602. To do.

  When the re-simulation button 907 is instructed from the keyboard 25, mouse 27, etc., the CPU 21 returns the process to step S302 and controls to re-simulate. Further, when the next classification display 908 is instructed from the mouse 27 or the like, the CPU 21 controls the distribution order display orchid 905 to display the distribution route of the next priority classification.

  When the next vehicle display 909 is instructed from the mouse 27 or the like, the CPU 21 controls the delivery order display orchid 905 to display the delivery route assigned to the next priority vehicle. Then, when the instruction print button 910 is instructed from the keyboard 25, mouse 27, etc., the CPU 21 controls to print the delivery instruction shown in FIG. 9 by a printing device (not shown).

  FIG. 9 is a schematic diagram showing an example of a delivery instruction printed on the delivery route determined by the delivery order determination device of the present invention.

  Then, when the end button 906 is instructed from the keyboard 25, the mouse 27, etc. on the delivery order display screen of FIG. 8, the CPU 21 shifts the processing to step S315 and ends the simulation.

  After that, the user starts delivery based on the delivery instruction shown in FIG. Then, the actual vehicle distance is measured at the time of actual delivery. When the delivery is finished, the user instructs the execution of the actual vehicle distance input function from the keyboard 25, the mouse 27, etc. in the delivery order determination device.

  Then, in step S316, the CPU 21 performs control so as to display an actual vehicle distance input screen (not shown) on the monitor 30, and accepts an input of the actual vehicle distance.

  Then, when the user inputs the delivery distance (actual vehicle distance) for each vehicle based on the vehicle totalizer, the CPU 21 stores the input information in the transportation daily report Tran 704 and shifts the processing to step S317.

  Next, in step S317, the CPU 21 performs control so that the daily shipping report is printed by a printing device (not shown), and the process ends.

FIG. 10 is a flowchart showing an example of the second control processing procedure in the delivery order determination apparatus of the present invention, and corresponds to the longest distance store allocation processing shown in step S305 of FIG. Note that the processing of this flowchart is realized by the CPU 21 shown in FIG. 1 reading out a program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22. In the figure, S401 to S415 indicate each step.

  First, in step S401, the CPU 21 sorts the order information in descending order of the distance from the store classification and the delivery starting point according to the priority order of the operating vehicles specified in step S302 and the number of store classifications specified in step S304.

  Next, in step S <b> 402, the CPU 21 stores one category of the order information sorted in step S <b> 401 in the array C on the RAM 22. The array C stores a plurality of rows (for the number of delivery destinations) with the store classification number, the store code, and the selection flag corresponding to the delivery destination information in the order information as one delivery destination. All selection flags are initially unselected (selection flag = 0). When temporarily selected, the selection flag = 1, and when selected, the selection flag = 2.

  Next, in step S403, the CPU 21 selects a delivery destination that is farthest from the delivery start point.

  Next, in step S404, the CPU 21 determines whether or not the allocation process for all delivery destinations in the current store classification has been completed, and determines that the allocation process for all delivery destinations in the current store classification has been completed. In that case, the process is terminated as it is, and the process is returned to the flowchart of FIG. 4 (step S306).

  On the other hand, if the CPU 21 determines in step S404 that allocation processing for all delivery destinations in the current store classification has not yet been completed, the process proceeds to step S405.

  In step S405, the CPU 21 selects an unselected delivery destination that is at the shortest distance from the delivery destination selected immediately before. The delivery destination selected immediately before, for example, indicates the third delivery destination selected last when the delivery destinations from the farthest to the third are already selected.

  Next, in step S406, the CPU 21 determines that the unselected delivery destination selected in step S405 is the distance from the delivery start point to the unselected delivery destination, and the distance between the delivery start point and another unselected delivery destination. Are compared, it is determined whether or not they are farthest. If they are determined to be farthest, the process proceeds to step S407.

  In step S407, the CPU 21 updates the selection flag of the unselected delivery destination selected in step S405 from “0” to “2”, stores the delivery destination information in the array D on the RAM 22, and performs the processing in step S404. Return to. In this case, the unselected delivery destination selected in step S405 is selected. The array D stores a store classification number and a store code as delivery destination information.

  On the other hand, if the CPU 21 determines in step S406 that the unselected delivery destination selected in step S405 is not the farthest, the process proceeds to step S408.

  In step S408, the CPU 21 updates the selection flag of the unselected delivery destination selected in step S405 from “0” to “1”, and causes the process to transition to step S409. Thus, the unselected delivery destination selected in step S405 is provisionally selected. For convenience of explanation, this temporarily selected delivery destination is referred to as provisional selection (1).

  Next, in step S409, the CPU 21 provisionally selects two unselected delivery destinations that are in the shortest distance from the delivery destination that has been provisionally selected (1) in step S408. That is, the two delivery destination selection flags are updated from “0” to “1” (ie, “temporary selection”), and the process proceeds to step S410. The two provisionally selected delivery destinations are referred to as provisional selection (2) and provisional selection (3).

  In step S410, the CPU 21 determines that one of the provisional selection (2) and provisional selection (3) provisionally selected in step S409 is the distance from the delivery origin to the provisional delivery destination, the delivery origin and other When the distance with the unselected delivery destination is compared, it is determined whether or not it is the farthest.

  In step S410, if the CPU 21 determines that one of the temporary selection (2) and the temporary selection (3) temporarily selected in step S409 is the farthest, the process proceeds to step S411.

  In step S411, the CPU 21 changes the selection flags of the temporary selection (1), the temporary selection (2), and the temporary selection (3) selected in steps S408 and S411 from “1” to “2” (that is, “select”). ) And stored in the array D on the RAM 22 in the order of temporary selection (1), (2), (3), and the process returns to step S404. In this case, the three delivery destinations temporarily selected in step S408 and step S411 are updated to the “selected” state.

  On the other hand, if the CPU 21 determines in step S410 that neither the temporary selection (2) temporarily selected in step S409 nor the temporary selection (3) is farthest, the process proceeds to step S412.

  In step S412, the CPU 21 provisionally selects a delivery destination farthest from the delivery start point among the delivery destinations that have not been selected, except for provisional selections (1) to (3). The selection flag is updated from “0” to “1” (that is, “temporary selection”), and the process proceeds to step S413. This provisionally selected delivery destination is referred to as provisional selection (4).

  In step S413, the CPU 21 provisionally selects two unselected delivery destinations that are at the shortest distance from the delivery destination that has been provisionally selected (4) in step S412. That is, the two delivery destination selection flags are updated from “0” to “1”, and the process proceeds to step S414. These two provisionally selected delivery destinations are referred to as provisional selection (5) and provisional selection (6).

  Next, in step S414, the CPU 21 determines the delivery order in which the sum of the linear distances is the shortest by combining the delivery orders of the provisionally selected six delivery destinations of the provisional selections (1) to (6). .

  In step S415, the CPU 21 rearranges the temporary selections (1) to (6) in the order of delivery in step 414, and sets the six delivery destination selection flags from “1” to “2” (ie, “selection”). ”), Stored in the array D in the RAM 22 in the rearranged order, and the process returns to step S404.

  By performing the above processing until there is no unselected delivery destination (that is, until it is determined in step S404 that allocation processing of all delivery destinations in the current store classification is completed), the array D on the RAM 22 is stored. Delivery destinations are stored in order of the longest distance.

  In the description of this flowchart, it is assumed that the provisional selection number designation = “6” is designated on the simulation condition input screen shown in FIG. The number of provisional selections is not limited to “4” or “8”, and it is preferable to designate a maximum of about half of the delivery destination of one classification destination.

  FIG. 11 is a flowchart showing an example of a third control processing procedure in the delivery order determination device of the present invention, and corresponds to the classification-specific delivery store allocation processing shown in step S306 of FIG. Note that the processing of this flowchart is realized by the CPU 21 shown in FIG. 1 reading out a program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22. In the figure, S501 to S511 denote steps.

  In the array D on the RAM 22, store classification numbers and store codes calculated by the process of the flowchart shown in FIG. 10 are stored in order of the longest distance for each classification.

  Further, the array E secured on the RAM 22 by the processing of this flowchart stores a store classification number and a store code as a work array for one classification. Furthermore, in the array F secured on the RAM 22, store classification numbers and store codes in the delivery order (loading order) according to the classification of the final version are stored. In addition, in the array G secured on the RAM 22, store classification numbers and store codes for the remaining stack are stored.

  First, in step S <b> 501, the CPU 21 copies the store codes for one store classification in the array D to the array E on the RAM 22.

  Next, in step S502, the CPU 21 sets the values of the variable (WTTL) for recording the accumulated cumulative weight and the variable (CCTL) for recording the accumulated cumulative volume of the vehicle (vehicles assigned in priority order) to zero. initialize. Note that the variable WTTL and variable CCTL are held on the RAM 22.

  Next, in step S503, the CPU 22 sets the maximum load weight and the maximum load capacity of the vehicle assigned to the store classification as a variable WMAX indicating the maximum load weight and a variable CMAX indicating the maximum load capacity, respectively, held on the RAM 22. Remember.

  Next, in step S504, the CPU 21 determines whether or not all the delivery destinations in the store classification have been processed. If it is determined that the processing has been completed, the process proceeds to step S510.

  On the other hand, if the CPU 21 determines in step S504 that there is a delivery destination that has not yet been processed during the store classification, the process proceeds to step S505.

  In step S505, the CPU 21 reads one element of the array E (store classification number and store code), and receives the order information (delivery store transaction 702, delivery) using the store code and the date of simulation (delivery date) as a key. Reads the weight and volume of the delivery product to the delivery destination from the detailed transaction 703, etc., and the weight and volume of the picked-up product, and calculates the difference weight and volume as the loaded cumulative weight (variable WTTL) and the loaded cumulative volume (variable CTTL). Add to.

  Next, in step S506, the CPU 21 determines whether (1) the loaded cumulative weight does not exceed the maximum loaded weight or (2) the loaded cumulative volume does not exceed the maximum loaded capacity. This determination is made based on the stacking restriction designation information input on the simulation condition input screen shown in FIG. If the stacking restriction designation in FIG. 7 is “weight and volume”, if any one of the above (1) or (2) is exceeded, it is determined that the limit is over. Also, if the stacking limit designation in FIG. 7 is “weight”, it is determined that the limit is exceeded if the above (1) is exceeded. In addition, if the load limit designation is “capacity” in FIG. 7, it is determined that the limit is exceeded when the above (2) is exceeded.

  If the CPU 21 determines in step S506 that (1) the accumulated cumulative weight does not exceed the maximum loaded weight and (2) the loaded accumulated volume does not exceed the maximum loaded capacity, the process proceeds to step S507. Transition processing.

  In step S507, the CPU 21 copies the element (store classification number and delivery destination code) of the array E to the array F, and returns the process to step S504.

  On the other hand, if the CPU 21 determines in step S506 that (1) the accumulated cumulative weight exceeds the maximum loading weight, or (2) the loaded accumulated volume exceeds the maximum loading capacity, The process proceeds to S508.

  In step S508, the CPU 21 determines whether or not there is another vehicle that can be assigned to the parcel of the store classification. If it is determined that there is another vehicle that can be assigned to the baggage, the CPU 21 performs processing. It returns to step S502.

  On the other hand, if the CPU 21 determines in step S508 that there is no other vehicle that can be assigned to the store category, the CPU 21 advances the process to step S509. In step S509, the CPU 21 moves all the unprocessed elements (store classification number and store code) in the array E to the unallocated array G on the RAM 22.

  In step S510, the CPU 21 determines whether or not the unallocated array G is empty. If it is determined that the unallocated array G is empty, the CPU 21 ends the processing as it is, and the process shown in FIG. Return the processing to the flowchart.

  On the other hand, if the CPU 21 determines in step S510 that the unallocated array G is not empty, the process proceeds to step S511.

  In step S511, the CPU 21 adds all the elements of the unallocated array G to the array C. Since the unallocated portion added to the array C is not the store classification to be processed in the second and subsequent processes, the CPU 21 does not allocate in this simulation, and collects the unallocated portion as a non-allocated portion after the processing of all the store classifications. 28 is controlled so as to be saved with a file name with a date and a letter indicating that it is an unallocated portion.

  When the process of step S511 is completed, the CPU 21 ends the process and returns the process to the flowchart of FIG.

  As described above, in this embodiment, since the area division, vehicle allocation, and delivery order are only determined, calculation can be performed in a short time using a normal personal computer or the like, and both hardware and software are provided at low cost. be able to.

  In addition, it is not necessary to input detailed data such as route information, traffic regulations, and congestion conditions, and the number of operation steps can be reduced as compared with the prior art.

  Furthermore, since the delivery order is determined with priority from a far delivery destination, even if a time error occurs, it is easy to cover with another vehicle.

  Moreover, since only the area division, vehicle allocation, and delivery order are determined, a flexible and optimum delivery route can be selected by the driver's judgment according to the road conditions on the day.

  In addition, as described above, priority is given to far-off destinations, so the only unassigned delivery destinations are those close to the distribution base (such as warehouses or stores), and vehicles that have finished far-away delivery quickly Can be loaded and delivered.

  In addition, it is sufficient to let a specific vehicle take charge of a severely specified delivery case.

  Furthermore, even if all the operating vehicles cannot be transported at one time, the area division is set to “operating vehicle + 1 vehicle”, so that it is decided by leaving the nearest area of the starting point for the overloaded baggage, and the distant delivery is finished quickly. The vehicle can be loaded and delivered promptly.

[Second Embodiment]
In the first embodiment, the configuration in which the user classifies the store by inputting the number of store classifications with priority in step S302 of FIG. 4 has been described. However, the store is displayed on the map and the user selects a store category on the map. It may be configured to specify. The embodiment will be described below.

  Hereinafter, the delivery order determination process in the second embodiment of the delivery order determination device of the present invention will be described with reference to FIGS.

  FIG. 12 is a flowchart showing an example of a fourth control processing procedure in the delivery order determination apparatus of the present invention, and corresponds to the delivery order determination process in the second embodiment of the present invention. Note that the processing of this flowchart is realized by the CPU 21 shown in FIG. 1 reading out a program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22. In the figure, S1201 to S1211 indicate steps.

  First, in step S1201, the CPU 21 executes order information input processing. Since this process is the same as step S301 in FIG.

  Next, in step S1202, the CPU 21 executes an operating vehicle input process. This process is the same as step S302 in FIG.

  Next, in step S1203, the CPU 21 executes a simulation condition input process. This process is the same as step S303 in FIG.

  Next, in step S1204, the CPU 21 controls to display the store classification designation screen (including map information) shown in FIG. 13 on the monitor 30. In step S1205, the CPU 21 waits for input from the keyboard 25, the mouse 27, and the like. To do.

  FIG. 13 is a diagram showing an example of a store classification designation screen in the delivery order determination device of the present invention.

  In FIG. 13A, reference numeral 1501 denotes a store classification finger range designation area, which displays map information including a store position. In addition, the map information displayed here is enlarged and shown in FIG. 13B. In the map information shown in FIG. 13B, all the delivery destinations (stores) scheduled to be delivered on the delivery date 1502 and the delivery date 902 (FIG. 7) input in step S1203 are displayed as shown in 1503. In the store classification finger range specification area 1501, it is possible to input a store classification specification using a closed curve (not necessarily closed) 1504. That is, for example, when the screen of FIG. 13 is displayed on the touch panel, the store classification range is specified by drawing the closed curve 1504 by tracing with a finger. When the screen of FIG. 13 is displayed on a normal LCD, the store classification range is designated by drawing a closed curve 1504 with a mouse cursor. It is assumed that the priority order is added to the designated store classification in the designated order. A delivery order simulation button 1510 is used to instruct the start of simulation.

  Returning to the flowchart of FIG.

  In step S1206, if the CPU 21 determines that the store classification finger range is designated in the store classification finger range designation area 1501 in FIG. 13 and the delivery order simulation button 1510 is instructed, the CPU 21 performs the process in step S1207. Transition.

  In step S1207, the CPU 21 performs a closed curve recognition process based on the store classification finger range designation in step S1204, and classifies the store in step S1208.

  In step S1209, the CPU 21 executes the longest distance store allocation process. In this processing, for each store classification classified in step S1208, stores are assigned to the vehicles entered in step S302 from the store farthest from the shipping origin to the nearest store in order of store classification. Is a process for determining the order. Details are shown in FIG.

  Next, in step S1210, the CPU 21 executes a vehicle luggage allocation process for each classification. In this process, according to the order of the store classification units determined in step S1209, the store-specific baggage is allocated until the maximum load amount or the maximum load weight of the allocated vehicle is reached. Details are shown in FIG.

  Next, in step S1211, the CPU 21 performs vehicle loading / delivery order determination processing. Specifically, the delivery order is determined in the order of distance from the wholesaler based on the dispatch results in steps S1209 and S1210 (that is, the reverse order of the order determined in S1209 is determined as the delivery order), and the determined information is shown in FIG. It is stored in the transportation daily report transaction 704 and the transportation route transaction 705, and the delivery order display screen shown in FIG. Then, when the instruction print button 910 in FIG. 8 is instructed from the keyboard 25, mouse 27, etc., in step S1212, the CPU 21 controls to print the delivery instruction shown in FIG. 9 by a printing device (not shown). .

  Then, when the end button 906 is instructed from the keyboard 25, the mouse 27, etc. on the delivery order display screen of FIG. 8, the CPU 21 shifts the processing to step S315 and ends the simulation.

  FIG. 14 is a flowchart showing an example of a fifth control processing procedure in the delivery order determination device of the present invention, and corresponds to the longest distance store allocation processing shown in step S1209 of FIG. In FIG. 14, S1301 to S1316 indicate each step.

  FIG. 15 is a flowchart showing an example of a sixth control processing procedure in the delivery order determination device of the present invention, and corresponds to the vehicle package allocation processing for each classification shown in step S1210 of FIG. In FIG. 15, S1401 to S1413 indicate each step.

  The processing of these flowcharts is realized by the CPU 21 shown in FIG. 1 reading out the program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22.

  First, in step S1301, the CPU 21 sorts the order information in descending order of the distance from the store classification and the delivery starting point according to the priority order of the operating vehicle specified in step S1202 and the store classification divided in step S1208.

  Next, in step S1302, the CPU 21 determines whether or not all classifications have been processed. If it is determined that all classifications have been processed, the process proceeds to step S1501 in FIG.

  On the other hand, if the CPU 21 determines in step S1302 that there is a classification that has not yet been processed, the process proceeds to step S1303.

  In step S1303, the CPU 21 stores one category of the order information sorted in step S1301 in the array C on the RAM 22. The array C stores a plurality of rows (for the number of delivery destinations) with the store classification number, the store code, and the selection flag as one delivery destination. All selection flags are initially unselected (selection flag = 0). When temporarily selected, the selection flag = 1, and when selected, the selection flag = 2.

  Next, in step S1304, the CPU 21 selects a delivery destination farthest from the delivery start point.

  Next, in step S1305, the CPU 21 determines whether or not the allocation process for all delivery destinations in the current store classification has been completed, and determines that the allocation process for all delivery destinations in the current store classification has been completed. In that case, the process returns to step S1312.

  On the other hand, if the CPU 21 determines in step S1305 that allocation processing for all delivery destinations in the current store classification has not yet been completed, the process proceeds to step S1306.

  In step S1306, the CPU 21 selects an unselected delivery destination that is at the shortest distance from the delivery destination selected immediately before. The delivery destination selected immediately before, for example, indicates the third delivery destination selected last when the delivery destinations from the farthest to the third are already selected.

  Next, in step S1307, the CPU 21 determines that the unselected delivery destination selected in step S1306 is the distance from the delivery start point to the unselected delivery destination, and the distance between the delivery start point and another unselected delivery destination. Are compared, it is determined whether or not they are farthest. If they are determined to be farthest, the process proceeds to step S1308.

  In step S1308, the CPU 21 updates the selection flag of the unselected delivery destination selected in step S1306 from “0” to “2”, stores it in the array D for each classification on the RAM 22, and returns the process to step S1305. . In this case, the unselected delivery destination selected in step S1306 is selected. In addition, the array D for each category stores a store classification number and a store code.

  On the other hand, if the CPU 21 determines in step S1307 that the unselected delivery destination selected in step S1306 is not the farthest, the process proceeds to step S1309.

  In step S1309, the CPU 21 updates the selection flag of the unselected delivery destination selected in step S1306 from “0” to “1”, and causes the process to transition to step S1310. Thus, the unselected delivery destination selected in step S1306 is temporarily selected. For convenience of explanation, this temporarily selected delivery destination is referred to as provisional selection (1).

  Next, in step S1310, the CPU 21 provisionally selects two unselected delivery destinations that are at the shortest distance from the delivery destination that has been provisionally selected (1) in step S1309. That is, the two delivery destination selection flags are updated from “0” to “1” (that is, “temporary selection”), and the process proceeds to step S1311. The two provisionally selected delivery destinations are referred to as provisional selection (2) and provisional selection (3).

  In step S1311, the CPU 21 determines that one of the provisional selection (2) and provisional selection (3) provisionally selected in step S1310 is the distance from the delivery origin to the provisional delivery destination, the delivery origin and other When the distance with the unselected delivery destination is compared, it is determined whether or not it is the farthest.

  In step S1311, if the CPU 21 determines that one of the temporary selection (2) and the temporary selection (3) temporarily selected in step S1310 is the farthest, the process proceeds to step S1312.

  In step S1312, the CPU 21 changes the selection flags of the temporary selection (1), the temporary selection (2), and the temporary selection (3) selected in steps S1309 and S1312 from “1” to “2” (that is, “select”). ), And the temporary selection (1), (2), (3) is stored in the classification-specific array D on the RAM 22, and the process returns to step S1305. In this case, the three delivery destinations temporarily selected in step S1309 and step S1312 are updated to the “selected” state.

  On the other hand, if the CPU 21 determines in step S1311 that neither the temporary selection (2) temporarily selected in step S1310 nor the temporary selection (3) is farthest, the process proceeds to step S1313.

  In step S1313, the CPU 21 tentatively selects a delivery destination that is the farthest from the delivery start point among the delivery destinations that have not been selected, except for the provisional selections (1) to (3). The selection flag is updated from “0” to “1” (ie, “temporary selection”), and the process proceeds to step S1314. This provisionally selected delivery destination is referred to as provisional selection (4).

  In step S1314, the CPU 21 provisionally selects two unselected delivery destinations that are at the shortest distance from the delivery destination that was provisionally selected (4) in step S1313. That is, the two delivery destination selection flags are updated from “0” to “1”, and the process proceeds to step S1315. These two provisionally selected delivery destinations are referred to as provisional selection (5) and provisional selection (6).

  Next, in step S1315, the CPU 21 determines the delivery order that minimizes the sum of the linear distances by combining the delivery orders of the provisionally selected six delivery destinations of the provisional selections (1) to (6) in a round-robin manner. .

  In step S1316, the CPU 21 rearranges the temporary selections (1) to (6) in the order of delivery in step 1315 and sets the six delivery destination selection flags from “1” to “2” (ie, “selection”). ”) And stored in the sorted array D in the RAM 22 in the order of the rearrangement, and the process returns to step S1315.

  By performing the above processing until there is no unselected delivery destination (that is, until it is determined in step S1305 that the assignment processing of all delivery destinations in the current store classification is completed), the classification for each classification on the RAM 22 is performed. In the array D, the delivery destinations are stored in the order of the longest distance in the classification. Further, by performing this process for all the classifications, the delivery destinations are stored in order of the longest distance in all the classifications.

  In the description of this flowchart, it is assumed that the provisional selection number designation = “6” is designated on the simulation condition input screen shown in FIG. The number of provisional selections is not limited to “4” or “8”, and it is preferable to designate a maximum of about half of the delivery destination of one classification destination.

  Hereinafter, steps S1401 to S1412 in FIG. 15 will be described.

  In the array D for each category on the RAM 22, the store classification number and the store code calculated by the processing of the flowchart shown in FIG. 10 are stored for each category in the order of the longest distance.

  Further, the array E secured on the RAM 22 by the processing of this flowchart stores a store classification number and a store code as a work array for one classification. Furthermore, the store classification number and the store code of the delivery order (loading order) by classification of the final version are stored in the array F by classification secured on the RAM 22. In addition, in the array G secured on the RAM 22, store classification numbers and store codes for the remaining stack are stored. Further, the classification-specific array H secured on the RAM 22 stores the classification-specific array F in the reverse order.

  First, in step S <b> 1401, the CPU 21 copies the store codes for one store classification in the array D for each category to the array E on the RAM 22.

  Next, in step S1402, if the CPU 21 determines that there is a classification that has not yet been processed, the process proceeds to step S1403.

  Next, in step S1403, the CPU 22 sets the maximum load weight and the maximum load capacity of the vehicle assigned to the store classification as a variable WMAX indicating the maximum load weight and a variable CMAX indicating the maximum load capacity, respectively, held on the RAM 22. Remember.

  Next, in step S1404, the CPU 21 sets the values of the variable (WTTL) for recording the accumulated cumulative weight of the vehicle (the vehicle assigned in priority order) and the variable (CCTL) for recording the accumulated cumulative volume to zero. initialize. Note that the variable WTTL and variable CCTL are held on the RAM 22.

  Next, in step S1405, the CPU 21 determines whether or not all delivery destinations in the store classification have been processed. If it is determined that the processing has been completed, the CPU 21 returns the process to step S1401.

  On the other hand, if the CPU 21 determines in step S1405 that there is a delivery destination that has not yet been processed during the store classification, the process proceeds to step S1406.

  In step S1406, the CPU 21 reads one element of the array E (store classification number and store code), and receives order information (delivery store transaction 702, delivery) using the store code and the date (delivery date) for simulation as a key. Read the weight and volume of the delivery product to the delivery destination from the detailed transaction 703, etc., and the weight and volume of the picked-up product. Add to.

  Next, in step S1407, the CPU 21 determines whether (1) the loaded cumulative weight does not exceed the maximum loaded weight, or (2) the loaded cumulative volume does not exceed the maximum loaded capacity. This determination is made based on the stacking restriction designation information input on the simulation condition input screen shown in FIG. If the stacking restriction designation in FIG. 7 is “weight and volume”, if any one of the above (1) or (2) is exceeded, it is determined that the limit is over. Also, if the stacking limit designation in FIG. 7 is “weight”, it is determined that the limit is exceeded if the above (1) is exceeded. In addition, if the load limit designation is “capacity” in FIG. 7, it is determined that the limit is exceeded when the above (2) is exceeded.

  If the CPU 21 determines in step S1407 that (1) the accumulated cumulative weight does not exceed the maximum loaded weight and (2) the loaded accumulated volume does not exceed the maximum loaded capacity, the process proceeds to step S1408. Transition processing.

  In step S1408, the CPU 21 copies the element of the array E (store classification number and delivery destination code) to the array F for each classification, and returns the process to step S1405.

  On the other hand, if the CPU 21 determines in step S1407 that (1) the loaded cumulative weight exceeds the maximum loaded weight or (2) the loaded cumulative volume exceeds the maximum loaded capacity, The process proceeds to S1409.

  In step S1409, the CPU 21 moves all unprocessed elements (store classification number and store code) in the array E to the unallocated array G on the RAM 22, and returns the process to step S1401.

  In step S1402, the CPU 21 determines whether or not all classifications have been processed. If it is determined that all classifications have been processed, the process proceeds to step S1410.

  In step S1410, the CPU 21 determines whether or not the unallocated array G is empty. If the CPU 21 determines that the unallocated array G is not empty, the process proceeds to step S1412.

  In step S1412, the CPU 21 adds all elements of the unallocated array G to the array C. Since the unallocated portion added to the array C is not the store classification to be processed in the second and subsequent processes, the CPU 21 does not allocate in this simulation, and collects the unallocated portion as a non-allocated portion after the processing of all the store classifications. 28 is controlled so as to be saved with a file name with a date and a letter indicating that it is an unallocated portion. Then, when the process of step S1412 ends, the process transitions to step S1305 shown in FIG.

  On the other hand, if the CPU 21 determines in step S510 that the unallocated array G is empty, the reverse order of the array F for each classification is stored in the array H for each classification, and the process ends as it is. The process returns to the flowchart of FIG.

  As described above, in this embodiment, since the driver can intuitively perform the area division based on the experience while looking at the map, the practical area division based on the experience of the driver is more practical. Delivery order can be determined.

[Third Embodiment]
In this embodiment, a plurality of processes performed in the second embodiment are performed with different classification range designations, and the one with the smaller total delivery distance is determined as the delivery route from the determined delivery routes. The embodiment will be described below.

  Hereinafter, with reference to FIG. 16, a delivery order determination process in the third embodiment of the delivery order determination apparatus of the present invention will be described.

  FIG. 16 is a flowchart showing an example of a seventh control processing procedure in the delivery order determination apparatus of the present invention, and corresponds to the delivery order determination process in the third embodiment of the present invention. Note that the processing of this flowchart is realized by the CPU 21 shown in FIG. 1 reading out a program stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 and executing it on the RAM 22. In the figure, S1601 to S1606 indicate the respective steps.

  First, in step S1601, the CPU 21 first executes processing for determining a route in the first classification. That is, the process (first time) shown in FIG. 12 is executed.

  Next, in step S1602, the CPU 21 executes a process for determining a route with the second classification. That is, the process (second time) shown in FIG. 12 is executed. It is assumed that the classification range is changed between the first time and the second time.

  Next, in step S1603, the CPU 21 calculates the total of the delivery route distance determined in step S1601 (first classification distance) and the total of the delivery route distance determined in step S1602 (second classification distance). Compare. If the CPU 21 determines that the first classification distance is greater than the second classification distance, the process proceeds to step S1605 so that the route of the first classification determined in step S1601 is selected as the delivery route. Control is completed.

  On the other hand, if the CPU 21 determines in step S1604 that the first classification distance is less than or equal to the second classification distance, the process proceeds to step S1606 to select the second classification route as the delivery route. Control and end the process.

  Needless to say, the number of paths to be compared is not limited to two but may be three or more.

  With the above processing, the route is determined by dividing into multiple areas, and the shortest route is selected as the delivery route. Therefore, even with a simple configuration, it is possible to determine the optimum delivery route with more optimal area division. it can.

  In each of the above embodiments, the case where the present invention is applied to an information processing apparatus such as a personal computer has been described. However, the delivery order determining apparatus of the present invention may be applied to a multifunction machine. In this case, each screen described above is displayed on a display unit with a touch panel of the multi-function peripheral, and each input is performed from the touch panel.

  Since the delivery order determination device of the present invention only determines area division, vehicle allocation, and delivery order, even a device having a configuration such as a multi-function device can calculate a route in a short time. By using the multifunction device, even a user unfamiliar with the use of a personal computer or the like can easily operate using the touch panel of the multifunction device that is easy to get familiar with.

  The configuration and contents of the various data shown in FIGS. 2 and 3 are not limited to this, and it is needless to say that the various data and the contents are configured according to applications and purposes.

  Although one embodiment has been described above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or recording medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  The configuration of a data processing program that can be read by the delivery order determination device (computer, multifunction device, etc.) according to the present invention will be described below with reference to the memory map shown in FIG.

  FIG. 17 is a diagram for explaining a memory map of a recording medium (storage medium) that stores various data processing programs that can be read by the delivery order determination device (computer, multifunction machine, etc.) according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

4, 5, 10, 11, 12, 14, 15, and 15 in this embodiment.
The functions shown in FIG. 16 may be performed by the host computer by a program installed from the outside. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium in which a program code of software for realizing the functions of the above-described embodiments is recorded is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus is stored in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

  In addition, all the structures which combined each embodiment mentioned above and its modification are also included in this invention.

It is a block diagram which shows the hardware constitutions of the information processing apparatus which can provide the delivery order determination apparatus which shows 1st Embodiment of this invention. It is a figure which shows the information of the various tables used in the delivery order determination apparatus of this invention. It is a figure which shows the information of the various tables used in the delivery order determination apparatus of this invention. It is a figure which shows the information of the various tables used in the delivery order determination apparatus of this invention. It is a figure which shows the information of the various tables used in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 1st control processing procedure in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 1st control processing procedure in the delivery order determination apparatus of this invention. It is a figure which shows an example of the order entry screen in the delivery order determination apparatus of this invention. It is a figure which shows an example of the simulation condition input screen in the delivery order determination apparatus of this invention. It is a figure which shows an example of the delivery order display screen in the delivery order determination apparatus of this invention. It is a schematic diagram which shows an example of the delivery instruction | indication which printed the delivery route determined in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 2nd control processing procedure in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 3rd control processing procedure in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 4th control processing procedure in the delivery order determination apparatus of this invention. It is a figure which shows an example of the store classification designation | designated screen in the delivery order determination apparatus of this invention. It is a figure which shows an example of the store classification designation | designated screen in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 5th control processing procedure in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 6th control processing procedure in the delivery order determination apparatus of this invention. It is a flowchart which shows an example of the 7th control processing procedure in the delivery order determination apparatus of this invention. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read with the delivery order determination apparatus (computer, multifunction machine, etc.) based on this invention.

Explanation of symbols

21 CPU
22 RAM
23 ROM
26 Keyboard 27 Mouse 28 Hard disk

Claims (6)

A delivery destination storage means for storing delivery destination information for specifying a delivery destination on the day of delivery;
Inter-destination distance storage means for storing a straight-line distance between each delivery destination on the delivery day;
Delivery item storage means for storing delivery item information for specifying a delivery item to be delivered to the delivery destination;
Vehicle information storage means for recording operating unit information including the number of operable vehicles on the day of delivery;
A delivery destination dividing means for grouping the delivery destinations based on the delivery destination information and the vehicle information;
The grouped delivery destination is a delivery destination farthest from the delivery start point as an initial order determination point, and an order undecided point that is the shortest distance from the first order determination point or an order farthest from the delivery start point is not decided. An order determining means that sets a point as the next order determining point, and sequentially sets the next undecided point that is the shortest distance from the immediately preceding rank determining point or the unordered point farthest from the delivery starting point as the next order determining point. And
A delivery order determination device, wherein the order of each order determination point determined by the order determination means is a loading order, and a reverse order of the order is a delivery order. The vehicle information storage means records operating unit information including the number of operable vehicles on the day of delivery and vehicle information including the loading weight and loading capacity of each operating vehicle,
The order determining means determines the delivery order within a range not exceeding the loading weight and loading capacity of each operating vehicle,
2. The delivery order determining apparatus according to claim 1, wherein the delivery destination dividing unit sets a new delivery destination group based on a delivery item that exceeds the loading weight and loading capacity of each operating vehicle. The delivery destination dividing unit performs a plurality of groupings on the delivery destination,
The order determining means is for determining a delivery order according to each of the plurality of groupings;
Based on each delivery order corresponding to the plurality of groupings, the sum of the linear distances between the delivery destinations of each operating vehicle is calculated, and the delivery order corresponding to the grouping that minimizes each sum is selected. 4. The delivery order determination apparatus according to claim 1, further comprising selection means for performing the selection. Delivery destination storage means for storing delivery destination information for specifying the delivery destination on the day of delivery, inter-delivery distance storage means for storing the straight line distance between the delivery destinations on the delivery day, and delivery items delivered to the delivery destination A delivery order determination method in a delivery order determination apparatus, comprising: delivery item storage means for storing delivery item information for identifying the vehicle; and vehicle information storage means for recording operating unit information including the number of operable vehicles on the day of delivery. ,
A delivery destination dividing step of grouping the delivery destinations based on the delivery destination information and the vehicle information;
The grouped delivery destination is a delivery destination farthest from the delivery start point as an initial order determination point, and an order undecided point that is the shortest distance from the first order determination point or an order farthest from the delivery start point is not decided. An order determination step in which the point is set as the next order determination point, and the order determination point that is the shortest distance from the previous order determination point or the order undecided point farthest from the delivery start point is set as the next order determination point. When,
A delivery order determination method, wherein the order of each order determination point determined in the order determination step is a loading order, and a reverse order of the order is a delivery order.   A program for causing a computer to execute the delivery order determination method according to claim 4.   A recording medium storing a computer-readable program for causing a computer to execute the delivery order determination method according to claim 4.

Images