KR102082452B1 - Charger reservation system for electric vehicles - Google Patents

Abstract

A charging reservation system for an electric vehicle is disclosed. According to an embodiment, a charge reservation system may include electric vehicles transmitting reservation requests including an identifier and a preference list of an electric vehicle, the preference list being an identifier of a preferred charger, a preferred time slot with respect to the preferred charger, and At least one preference entry each including a bid amount, a charger comprising time slots indicating a charging schedule, the chargers charging an electric vehicle assigned to the time slots, and an identifier of each of the electric autonomous vehicles; Construct a first data set for each of the electric vehicles, based on a pointer for tracking matching between a preference list of each of the electric vehicles and at least one preference entry in each preference list of the electric vehicles, An identifier of each of the chargers, the time slots of the chargers, and A preference entry that composes a second data set for each of the chargers based on matching information indicating a matching state between at least one preference entry in the existing preference list, and competes when a plurality of preference entries are contended for the same charger; And a scheduler for updating the matching information based on a preference function comprising at least one criterion for selecting any one of the above.

Description

Charging reservation system for electric vehicles {CHARGER RESERVATION SYSTEM FOR ELECTRIC VEHICLES}

The embodiments below relate to a charge reservation system for an electric vehicle.

As the number of electric vehicles (EVs) increases, charging infrastructure for EVs is being built extensively in many countries. However, despite the recent significant improvements in battery technology, charging convenience is not yet competitive with existing fuel supply networks that service gasoline vehicles. The main problem stems from the fact that even a fast charger can produce a long charge time of several tens of minutes. In addition to lack of facilities, the driver spends a lot of time if the charger is already occupied by another vehicle. One of the most efficient ways to share these scarce resources is to use a reservation mechanism that supports prioritized access, such as First Come First Service (FCFS). Each priority policy has its own performance goals, such as fairness and processing time. EV charging is essentially a non-preemptive task.

The number of EVs and chargers is growing rapidly, and one charger can assign multiple time slots to an EV. It also enables hosting of many participants in the reservation process, when communication channels and mobile devices are available. This environment can increase the execution time of the reservation scheme explosively, it is necessary to develop an efficient matching algorithm between both parties. To make matters easier to manage here, the reservation process divides the time axis into fixed size slots. The slot length may preferably match the real-time price signal change and may be large enough to support the buffer distance. It relieves the EV driver from having to wait too much time to charge the battery and can modify the route of travel based on whether or not the reservation was successful on a particular charger.

There are currently about 300 DC chargers in operation on Jeju Island and about 10,000 EVs on the road. As a result of monitoring the real-time status of each charger, there is a state archive stored in the local database. Based on this data, it has been found that charging needs can be distorted at some place and time intervals for reasons such as EV density, low charging cost, easy access, sufficient alternative chargers, and the like. Here, spatial or temporal load concentration can lead to a sudden energy imbalance in the system grid to address long wait queues. As local governments are actively accelerating EV deployments, central coordinators supporting intelligent computers must manage charging requirements.

As an example of the reservation mechanism for EV charging, ChargePoint can set whether the charging station owner activates the reservation process and sets its own price individually. The authorized user by login authentication can then select the charging station and reserve the desired time slot if it can be used by itself. If not, try another station and time slot. Therefore, this mechanism follows the FCFS policy. In addition, cancellations must be canceled at least 24 hours in advance to avoid a show penalty. Another booking mechanism also proposes billing management for moving EVs, providing periodic booking updates to address travel uncertainties caused by changes in traffic conditions. The global aggregator continually estimates the fastest available time for each charger and assigns the appropriate charger taking into account the estimated time of arrival of the EV. More charging schedulers can be designed for EVs already parked in the charging station.

Jeju Island operates about 300 public DC chargers on an island area surrounded by a 200 km long coastline. According to the operational archive, about 50 chargers are concentrated on EVs and some are rarely used. In other words, a reservation mechanism of the charger is required to avoid or alleviate long waiting times. It is also possible to set different energy prices for chargers to increase revenue, distribute energy consumption and achieve other goals.

According to one embodiment, a method of operation of a scheduler that matches reservation requests of electric vehicles and time slots indicating a charging schedule of chargers, receives reservation requests including an identifier and a preference list of the electric vehicle from each of the electric vehicles. Step, wherein the preference list includes at least one preference entry each including an identifier of a preferred charger, a preferred time slot for the preferred charger, and a bid amount; For each of the electric vehicles, based on an identifier for each of the electric vehicles, a preference list for each of the electric vehicles, and a pointer for matching between at least one preference entry in each preference list of the electric vehicles. Constructing a first data set; Constructing a second data set for each of the chargers based on an identifier of each of the chargers, matching information indicating a matching state between the time slots of the chargers and at least one preference entry in the preference list; And updating the matching information based on a preference function comprising at least one criterion for selecting any one of the contending preference entries when a plurality of preference entries are contended for the same charger.

The preference function may include a first reference parameter indicating a bid amount, a second reference parameter indicating a number of preferred entries in a preference list, and a third reference parameter indicating an arrival time of a reservation request, and updating the matching information. The step may include selecting any one of the contending preference entries selected by sequentially considering the first reference parameter, the second reference parameter, and the third reference parameter when the plurality of preference entries conflict with respect to the same charger. Matching the same charger.

If there are a plurality of preference entries in the first preference list of the first electric vehicle, the value of the pointer for the first electric vehicle may change to the next preference entry as matching of the current preference entry among the plurality of preference entries fails. Incremented to indicate, and if the value of the pointer is greater than the number of the plurality of preference entries in the first preference list, the matching of the first electric vehicle may be treated as a failure.

The received reservation requests may include a first reservation request including a first preference list received from a first electric vehicle and a second reservation request including a second preference list received from a second electric vehicle, wherein If the first preference entry in the first preference list and the second preference entry in the second preference list contend with respect to the first charger, updating the matching information may include: first bid amount according to the first preference entry; Comparing a second bid amount according to the second preferred entry; Comparing the number of preferred entries in the first preference list and the number of preferred entries in the second preference list when the first bid amount and the second bid amount are the same; If the number of the preference entries in the first preference list and the number of the preference entries in the second preference list are different, a preference entry corresponding to the preference list having a higher number of preference entries in the first preference list and the second preference list is selected. Updating the matching information by matching the first charger; And updating the matching information by matching a preference entry corresponding to a reservation request having a faster arrival time among the first reservation request and the second reservation request to the first charger.

The operation method may be configured to update the matching information by matching a preference entry corresponding to a larger amount of a first preference entry and a second preference entry to the first charger when the first bid amount and the second bid amount are different. It may further comprise the step. The method may further include comparing arrival times of the first reservation request and the second reservation request when the number of preference entries in the first preference list and the number of preference entries in the second preference list are the same. Can be.

Receiving the reservation requests, configuring the first data set, configuring the second data set, and updating the matching information constitute a pre-booking stage, and the method of operation includes the pre-booking. If there is a reservation request in which the matching is not completed in the stage, the matching request may not further include matching the reservation request with the remaining time slots through a general reservation stage of a first come first service (FCFS) scheme. have.

According to one embodiment, a reservation system for reserving an electric vehicle charge comprises: electric vehicles transmitting reservation requests comprising an identifier and a preference list of the electric vehicle, the preference list being an identifier of a preferred charger, the preferred charger At least one preference entry each containing a preferred time slot and a bid amount; Chargers for charging an electric vehicle assigned to the time slots, the time slots indicating a charging schedule; And a pointer for tracking a match between an identifier of each of the electric vehicles, a preference list of each of the electric vehicles, and at least one preference entry in each of the preference lists of the electric vehicles, respectively. Construct a first data set for each of the chargers, based on matching information indicating an identifier of each of the chargers, the time slots of the chargers, and a matching state between at least one preference entry in the preference list; Update the matching information based on a preference function comprising a second data set and comprising at least one criterion for selecting any one of the contending preference entries when a plurality of preference entries are contended for the same charger; It includes a scheduler.

1 is an operational flow diagram illustrating a two stage charger reservation scheme according to one embodiment.
2 illustrates a reservation system for charging an EV according to an embodiment.
3 illustrates classes for reservation scheduling, according to an embodiment.
4 illustrates a reservation scheduling process, according to one embodiment.

Specific structural or functional descriptions of the embodiments according to the inventive concept disclosed herein are merely illustrated for the purpose of describing the embodiments according to the inventive concept, and the embodiments according to the inventive concept. These may be embodied in various forms and are not limited to the embodiments described herein.

Embodiments according to the inventive concept may be variously modified and have various forms, so embodiments are illustrated in the drawings and described in detail herein. However, this is not intended to limit the embodiments in accordance with the concept of the present invention to specific embodiments, and includes modifications, equivalents, or substitutes included in the spirit and scope of the present invention.

Terms such as first or second may be used to describe various components, but the components should not be limited by the terms. The terms are only for the purpose of distinguishing one component from another component, for example, without departing from the scope of the rights according to the inventive concept, the first component may be called a second component, Similarly, the second component may also be referred to as the first component.

When a component is said to be “connected” or “connected” to another component, it may be directly connected to or connected to that other component, but it may be understood that other components may exist in the middle. Should be. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that no other component exists in the middle. Expressions describing the relationship between components, such as "between" and "immediately between," or "directly neighboring to," should be interpreted as well.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this specification, the terms “comprise” or “have” are intended to designate that the stated feature, number, step, operation, component, part, or combination thereof exists, but includes one or more other features or numbers, It should be understood that it does not exclude in advance the possibility of the presence or addition of steps, actions, components, parts or combinations thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in the commonly used dictionaries should be construed as having meanings consistent with the meanings in the context of the related art, and are not construed in ideal or excessively formal meanings unless expressly defined herein. Do not.

Hereinafter, exemplary embodiments will be described in detail with reference to the accompanying drawings. However, the scope of the patent application is not limited or limited by these embodiments. Like reference numerals in the drawings denote like elements.

1 is a flowchart illustrating a two-step charger reservation scheme according to an embodiment.

The present invention proposes a two-stage charger reservation scheme to increase the revenue of the charging service provider and reduce the battery charging time of the EV. According to the present invention, prior to the general reservation stage 120 according to the customer-led First Come First Service (FCFS), all reservation requests of participating electric vehicles (EVs) are collected in advance and the pre-reservation stage 110 is performed. The EV specifies a preference list consisting of a different number of request entries including the charger, slot and bid fields. The present invention assigns the time slot of the charger to the appropriate requestor based on the Gale-Shapley algorithm. According to the present invention, higher priority may be given in order of higher bid, shorter list length, and faster request arrival.

The present invention provides an efficient reservation scheme for charging EVs in this regard. In particular, it is based on the Gale-Shapley algorithm developed for one-to-one matching between two parties with the same number of members. Unlike the original problem, called SMP (Stable Marriage Problem), the number of participants in the two groups can differ in EV charger matching. Moreover, entities belonging to the same group may select different numbers of entities from the opponent group and may define independent preference criteria. For some EVs, slot matching may fail.

Because of the large number of EVs, it is not possible to specify charger-side preferences individually for each EV. Therefore, preference metrics must be defined to choose the better. Here, the reservation application is collected by a specific time instant, such as a bidding process, and a slot allocation schedule is created to maximize a given performance goal. This process is very different from the normal reservation mechanism that typically works on FCFS.

2 is a diagram illustrating a reservation system for charging an EV, according to an exemplary embodiment. Referring to FIG. 2, the reservation system 200 includes EVs 210, chargers 220, and a scheduler 230.

The charging schedule of the chargers 220 may be managed in time slots. For convenience of management, the length of the time slot may be fixed. For example, one time slot may correspond to 30 minutes, and a total of 12 time slots may be used when a reservation for 6 hours is required.

In view of the EVs 210, reservation is performed in two stages, pre-reservation and general reservation. In the pre-booking stage, the EVs 210 can basically name any number of (charger, time slot) pairs desired in the reservation request. The reservation result is not generated whenever there is a reservation request of the EVs 210, and a reservation request set of the EVs 210 is collected by a certain deadline, and the chargers 220 set up the collected reservation request set. The time slots are matched to the EVs 210 according to the preference function and the preference of the EVs 210. If all request entries are preempted by another EV, the EV may fail to reserve the time slot. Conversely, if no reservation request is matched, the time slot cannot be allocated.

If there is a reservation request in which the matching is not completed in the pre-booking stage, the reservation request in which the matching is not completed may be matched to the remaining time slots through a general reservation stage of a first come first service (FCFS) scheme. In the normal reservation stage, the driver searches for the remaining slots after the pre-reservation stage, and selects the slot that best meets the driving schedule, as in the normal FCFS process.

The scheduler 230 constructs a first data set based on the collected information about the EVs 210 and the EV class, and generates a second data set based on the collected information and the charger class about the chargers 220. And schedule the reservation based on the first data set and the second data set. The scheduler 230 may allocate each time slot of the chargers 220 to the EVs 210 and notify the EVs 210 and the chargers 220 through the pre-booking stage and the general reservation stage. In the present specification, an operation related to the EV will be described as an operation of the EV for convenience. However, the operation of the EV described herein is the operation of the EV driver, or a device related to the EV, such as a smart phone used by the EV driver. May be an operation.

3 is a diagram illustrating classes for reservation scheduling according to an embodiment.

Each of the EVs may send a reservation request to the scheduler that includes its identifier and a preference list. The preference list may include at least one preference entry each including an identifier of a preferred charger, a preferred time slot for the preferred charger, and a bid amount. That is, the preference list may include one preference entry or two or more preference entries, and each preference entry may include information about a charger, a time slot, and a bid amount. Since in most cases a daily trip can be covered with one full charge, the present invention does not consider the case where a single EV intends to reserve more than two slots at the same time.

The scheduler may construct the first data set based on the collected information about the EV and the EV class. For example, the scheduler is configured to generate a first request for each of the EVs based on an identifier for each of the EVs, a preference list of each of the EVs, and a pointer for matching between at least one preference entry in the preference list of each of the EVs. One data set can be constructed. The pos field may include a pointer value. The pointer value may not exceed the number of preferred entries, and if the pointer value exceeds the number of preferred entries, the EV may not be allocated a slot and may be removed from the matching process.

The scheduler may construct a second data set based on the information gathered about the charger and the charger class. For example, the scheduler may construct a charger second data set for each of the chargers based on the identifier of each of the chargers, the time slots of the chargers, and the matching information indicating a matching state between the at least one preference entry in the preference list. Can be. The matching information may include a matching table in which identifiers of EVs matched for each time slot are recorded.

If the (charger, slot) according to the EV reservation request has not yet been matched, the corresponding (charger, slot) is allocated to the EV. That is, the matching field of the charger class is set to the corresponding EV. Otherwise, the current EV and the competitive EV compete on a predetermined basis. The winner of the competition takes place in the matching field, while the winner of the competition continues the competition with the next requested item. Where the pos pointers advance one by one. In other words, when there are a plurality of preference entries in the first preference list of the first electric vehicle, as the matching of the current preference entry among the plurality of preference entries fails, the value of the pointer for the first electric vehicle is the next preference entry. If the value of the pointer is greater than the number of the plurality of preference entries in the first preference list, the matching of the first electric vehicle may be treated as a failure.

If a plurality of preference entries contend for the same charger, the scheduler may update the matching information based on a preference function that includes at least one criterion for selecting any one of the contention preference entries. For example, the preference function may include a first reference parameter indicating the bid amount, a second reference parameter indicating the number of preference entries in the preference list, and a third reference parameter indicating the arrival time of the reservation request. The arrival time of the reservation request may indicate the time at which the reservation request was received at the scheduler. In this case, the scheduler may select any one of the contention-competitive preference items by sequentially considering the first reference parameter, the second reference parameter, and the third reference parameter, and match the selected preference entry to the time slot of the charger.

The EV driver may include a plurality of preference entries in the preference list in consideration of the number of various cases. If any of these preference entries match, then the EV may be removed from the task list. That is, the EV matching to the time slot of the charger may be understood as the preference entry matching the time slot of the charger. When the matching is completed, the identifier of the EV may be recorded in the matching information.

4 is a diagram illustrating a reservation scheduling process according to an embodiment.

Referring to FIG. 4, there are n chargers and m EVs, and each charger manages 0 to k time slots. For example, if the time shown in Fig. 4 is from 12 pm to 6 pm, the time slot is 30 minutes, and n is 50, the total number of slots that need to be matched is 600.

In the two-step matching process, the preferences of each party must be defined. Each EV lists pairs (charger, time slot) according to their preference rank. Unlike conventional matching schemes, the number of application items is much smaller than the total number of slots and may vary from EV to EV. On the other hand, on the charger side, you can give priority to EVs that want to pay more to increase their revenue. To this end, the EV decides the price to be paid, making the reservation item (charger, time slot, bid amount).

In the example of FIG. 4, the preference list of EV 0 includes two preference entries, the preference list of EV 1 includes one preference list, and the preference list of each EV 2 and EV m includes four preference entries. . [A-b-c] of FIG. 4 corresponds to (charger, time slot, bid amount). For example, the preferred entry of EV 1 indicates that the bid amount of A is presented for charger 5, time slot 4.

If contention occurs, the scheduler matches these requests with time slots based on the preference function. If two or more bid amounts are the same, a request with a short length of the preferred list is selected. This is because requests with short length of preference list are given less chance to be selected. The length of the preference list indicates the number of preference entries included in the preference list. If a tie occurs again, the reservation request that arrived first is selected.

For example, reservation requests received by the scheduler may include a first reservation request including a first preference list received from the first electric vehicle and a second reservation request including a second preference list received from the second electric vehicle. Assume to include

If the first preference entry in the first preference list and the second preference entry in the second preference list contend with respect to the first charger, the scheduler may determine the first bid amount according to the first preference entry and the first preference entry according to the second preference entry. We can compare 2 bid amounts of money. If the first bid amount and the second bid amount are different, the scheduler may update the matching information by matching a preference entry corresponding to a larger amount of the first preference entry and the second preference entry to the first charger.

If the first bid amount and the second bid amount are the same, the scheduler may compare the number of preference entries in the first preference list and the number of preference entries in the second preference list. If the number of preference entries in the first preference list and the number of preference entries in the second preference list are different, the scheduler selects a preference entry corresponding to the preference list corresponding to the smaller number of preference entries in the first preference list and the second preference list. The matching information may be updated by matching with a charger.

If the number of preference entries in the first preference list and the number of preference entries in the second preference list are the same, the scheduler compares the arrival times of the first reservation request and the second reservation request, and during the first reservation request and the second reservation request. The matching information may be updated by matching a preference entry corresponding to the reservation request with a faster arrival time to the first charger.

In FIG. 4, contention occurs between entry 410 and entry 420. Since the length of the preference list of EV 1 is shorter than the length of the preference list of EV 0, EV 1 matches time slot 4 of charger 5. After the match of entry 410 fails, the pointer to EV 0's preference list is incremented, and EV 0 attempts to make a reservation through entry 430. Entry 430 competes with entry 440. Assuming bid amount B is higher than bid amount C, entry 430 is selected from entries 430 and 440 such that EV 0 matches time slot 6 of charger 13.

After the match of entry 440 fails, the pointer to EV 2's preferred list is incremented, and EV 2 attempts to make a reservation through entry 450. Entry 450 contends with entry 460. Assuming that the reservation request of EV 2 arrives earlier than the arrival of the reservation request of EV m, entry 450 is selected between entries 450 and 460 so that EV 2 enters time slot 6 of charger 5; Matches. In this way the preference function on the charger side is completed.

The present invention proposes a two-stage EV charger reservation method. Mainly customizing stable marriage problems, we allowed different EV-side application entries and defined charger-side preference functions. Performance evaluations show that charging service providers can improve their revenue by up to 8.6% without sacrificing the number of matches compared to traditional FCFS.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the devices and components described in the embodiments are, for example, processors, controllers, Arithmetic Logic Units (ALUs), digital signal processors, microcomputers, field programmable gate arrays (FPGAs). May be implemented using one or more general purpose or special purpose computers, such as a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to the execution of the software. For convenience of explanation, one processing device may be described as being used, but one of ordinary skill in the art will appreciate that the processing device includes a plurality of processing elements and / or a plurality of types of processing elements. It can be seen that it may include. For example, the processing device may include a plurality of processors or one processor and one controller. In addition, other processing configurations are possible, such as parallel processors.

The software may include a computer program, code, instructions, or a combination of one or more of the above, and may configure the processing device to operate as desired, or process independently or collectively. You can command the device. Software and / or data may be any type of machine, component, physical device, virtual equipment, computer storage medium or device in order to be interpreted by or to provide instructions or data to the processing device. Or may be permanently or temporarily embodied in a signal wave to be transmitted. The software may be distributed over networked computer systems so that they may be stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to the embodiment may be embodied in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the media may be those specially designed and constructed for the purposes of the embodiments, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

Although the embodiments have been described by the limited embodiments and the drawings as described above, various modifications and variations are possible to those skilled in the art from the above description. For example, the described techniques may be performed in a different order than the described method, and / or components of the described systems, structures, devices, circuits, etc. may be combined or combined in a different form than the described method, or other components. Or, even if replaced or substituted by equivalents, an appropriate result can be achieved.

Therefore, other implementations, other embodiments, and equivalents to the claims are within the scope of the claims that follow.

Claims (8)

A method of operating a scheduler that matches reservation requests of electric vehicles and time slots indicating a charging schedule of chargers, the method comprising:
Receiving reservation requests from each of the electric vehicles, the reservation request comprising an identifier and a preference list of the electric vehicle, the preference list comprising an identifier of a preferred charger, a preferred time slot for the preferred charger, and a bid amount, respectively At least one preference entry;
For each of the electric vehicles, based on an identifier for each of the electric vehicles, a preference list of each of the electric vehicles and at least one preference entry in the preference list of each of the electric vehicles; Constructing a first data set;
Constructing a second data set for each of the chargers based on an identifier of each of the chargers, matching information indicating a matching state between the time slots of the chargers and at least one preference entry in the preference list; And
Updating the matching information based on a preference function comprising at least one criterion for selecting any one of the contending preference entries if a plurality of preference entries for the same charger contend.
Including,
The received reservation requests include a first reservation request including a first preference list received from a first electric vehicle and a second reservation request including a second preference list received from a second electric vehicle,
If the first preference entry in the first preference list and the second preference entry in the second preference list contend with respect to a first charger, updating the matching information may include:
Comparing a first bid amount according to the first preferred entry with a second bid amount according to the second preferred entry;
Comparing the number of preferred entries in the first preference list and the number of preferred entries in the second preference list when the first bid amount and the second bid amount are the same;
If the number of preference entries in the first preference list and the number of preference entries in the second preference list are different, a preference entry corresponding to a preference list having a smaller number of preference entries in the first preference list and the second preference list is selected. Updating the matching information by matching the first charger; And
If the number of preference entries in the first preference list and the number of preference entries in the second preference list are the same, the preference entry corresponding to the reservation request having a faster arrival time among the first reservation request and the second reservation request is recalled. Matching the first charger to update the matching information
Including, the method of operation. The method of claim 1,
The preference function
A first reference parameter indicative of the bid amount, a second reference parameter indicative of the number of preferred entries in the preference list, and a third reference parameter indicative of the arrival time of the reservation request,
The updating of the matching information
When the plurality of preference entries are contended with respect to the same charger, the same charger is selected from one of the contention preference entries selected by sequentially considering the first reference parameter, the second reference parameter, and the third reference parameter. And matching with,
How it works. The method of claim 1,
If there are a plurality of preference entries in the first preference list of the first electric vehicle,
As a match of a current preference entry of the plurality of preference entries fails, the value of the pointer for the first electric vehicle increases to indicate a next preference entry,
If the value of the pointer is greater than the number of the plurality of preference entries in the first preference list, the matching of the first electric vehicle is treated as a failure.
How it works. delete The method of claim 1,
If the first preference entry in the first preference list and the second preference entry in the second preference list contend with respect to a first charger, updating the matching information may include:
Updating the matching information by matching a preference entry corresponding to a larger amount of a first preference entry and a second preference entry to the first charger when the first bid amount and the second bid amount are different.
Further comprising, the operation method. The method of claim 1,
If the first preference entry in the first preference list and the second preference entry in the second preference list contend with respect to a first charger, updating the matching information may include:
Comparing arrival times of the first reservation request and the second reservation request when the number of preference entries in the first preference list and the number of preference entries in the second preference list are the same;
Further comprising, the operation method. The method of claim 1,
Receiving the reservation requests, constructing the first data set, constructing the second data set, and updating the matching information constitute a pre-reservation stage,
If there is a reservation request in which the matching is not completed in the pre-booking stage, matching the reservation request in which the matching is not completed to remaining time slots through a general reservation stage of a first come first service (FCFS) scheme;
Further comprising, the operation method. A reservation system for reserving electric vehicle charging,
Electric vehicles transmitting reservation requests comprising an identifier and a preference list of the electric vehicle, wherein the preference list includes at least one of an identifier of a preferred charger, a preferred time slot for the preferred charger, and a bid amount, respectively. Includes a preference entry;
Chargers for charging an electric vehicle assigned to the time slots, the time slots indicating a charging schedule; And
For each of the electric vehicles, based on an identifier for each of the electric vehicles, a preference list of each of the electric vehicles and at least one preference entry in the preference list of each of the electric vehicles; Construct a first data set and based on matching information indicative of a matching state between an identifier of each of the chargers, the time slots of the chargers, and at least one preference entry in the preference list; Constructing two data sets and updating the matching information based on a preference function comprising at least one criterion for selecting any one of the contending preference entries when a plurality of preference entries are contended for the same charger; Scheduler
Including,
The received reservation requests include a first reservation request including a first preference list received from a first electric vehicle and a second reservation request including a second preference list received from a second electric vehicle,
If a first preference entry in the first preference list and a second preference entry in the second preference list contend with respect to a first charger, the scheduler may update the matching information:
Compare a first bid amount according to the first preferred entry with a second bid amount according to the second preferred entry,
If the first bid amount and the second bid amount are the same, compare the number of preference entries in the first preference list with the number of preference entries in the second preference list,
If the number of preference entries in the first preference list and the number of preference entries in the second preference list are different, a preference entry corresponding to a preference list having a smaller number of preference entries in the first and second preference lists is selected. Update the matching information by matching the first charger;
When the number of the preference entries in the first preference list and the number of the preference entries in the second preference list are the same, the preference entry corresponding to the reservation request having a faster arrival time among the first reservation request and the second reservation request is recalled. Matching the first charger to update the matching information;
Reservation system.

Images