CN110175718A - A kind of berth allocation method and terminal device - Google Patents
A kind of berth allocation method and terminal device Download PDFInfo
- Publication number
- CN110175718A CN110175718A CN201910458918.3A CN201910458918A CN110175718A CN 110175718 A CN110175718 A CN 110175718A CN 201910458918 A CN201910458918 A CN 201910458918A CN 110175718 A CN110175718 A CN 110175718A
- Authority
- CN
- China
- Prior art keywords
- parking stall
- period
- card user
- demand
- parking
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
- G08G1/145—Traffic control systems for road vehicles indicating individual free spaces in parking areas where the indication depends on the parking areas
- G08G1/148—Management of a network of parking areas
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides a kind of berth allocation method and terminal device, and method includes the following steps: to provide the purchasing price and sale price of each period on parking stall；The service time section and the demander of supply number and the parking stall for obtaining the i.e. owner of provider on the parking stall face the required time section and demand number of card user and moon card user, and summarize to obtain aggregate supply and aggregate demand of the parking stall within each period；It constructs berth allocation model and solves and obtain the allocation result on the parking stall；The allocation result is informed to the provider on the parking stall and the demander on the parking stall.A kind of berth allocation method and terminal device are provided, after the supply-demand information of the demander of the provider and parking stall that have collected parking stall, the berth allocation decision of global optimization can be quickly carried out by model, provide allocation plan, total revenue is maximized, is had a distinct increment compared to traditional First Come First Served strategy.
Description
Technical field
The present invention relates to field of intelligent transportation technology more particularly to a kind of berth allocation method and terminal devices.
Background technique
In recent years, China's rapid economic development, in order to meet trip requirements and improve the quality of living, vehicle guaranteeding organic quantity is not
Disconnected to increase, congestion in road problem is got worse.For numerous commuters, parking is also more next near urban district or CBD
It is more difficult.Searching parking stall can occupy quite a few of travel time, and can aggravate traffic congestion.Investigation display, 30%
Traffic congestion be car owner pitch of the laps find parking stall and caused by, simultaneously because motor vehicle exhaust emission etc. also will cause air pollution.
For parking demand and unbalanced problem is supplied, can often increase parking stall supply using newly-built parking lot
Solution, but speed is built much than only motor vehicle speedup in parking lot, and due to time, fund, soil etc.
Limitation, not be long-term solution by new parking lot or enlarging road is constantly built.
It is mainly appeared near the CBD of urban district in view of parking stall is in short supply, and these nearby will also tend to residential quarter, because
Owner works outside the home or goes on a journey mostly daytime, and many private savings parking stalls of residential quarter are idle when daytime.Therefore
It is contemplated that these parking stalls are shared out, daytime rents for the office workers such as the office building on periphery or tourist, can protect in this way
Resource is made full use of under the premise of card common interest.
With the development trend of the diversification of urban land use, occur more and more including a variety of land characters
Area of mixed usage region, and often there is between heterogeneity land used different parking demand peaks in these area of mixed usage regions,
Such as residential customer and office building user.It therefore can be by, by parking of staggering the time, being realized with the parking stall of other type lands used
Parking stall is shared.
But lack a kind of sharing for effective berth allocation method and system realization parking stall in the prior art.
Summary of the invention
The present invention realizes parking stall to solve to lack in the prior art a kind of effective berth allocation method and system
Sharing problem provides a kind of berth allocation method and terminal device.
To solve the above-mentioned problems, the technical solution adopted by the present invention is as described below:
A kind of berth allocation method, includes the following steps: S1: providing the purchasing price of each period on parking stall and sells
Sell price；S2: service time section and supply number and the parking stall of the i.e. owner of provider on the parking stall are obtained
Demander is to face the required time section and demand number of card user and moon card user, and summarize to obtain the parking stall when each
Between aggregate supply and aggregate demand in section；S3: constructing berth allocation model and solution obtains the allocation result on the parking stall；
S4: the allocation result is informed to the provider on the parking stall and the demander on the parking stall.
Preferably, the contextual definition of the purchasing price and the supply number on the parking stall in a period of time
Are as follows: N=a*Pb-a*Pb0；Wherein, N is the supply amount on the parking stall in the period, PbIt is the purchase in the period
Price, Pb0It is that the provider on the parking stall in the period provides the minimum purchase prices that the parking stall is hired out,
Pb≥Pb0, a is the purchasing price P in the periodbIt is every increase unit the increased parking stall quantity.
Preferably, the contextual definition of the sale price and the demand number on the parking stall in a period of time
Are as follows: M=b*Ps0-b*Ps；Wherein, M is the demand for facing card user on the parking stall in the period, PsIt is described
In period to the sale price for facing card user, Ps0It is the Public parking area on the parking stall periphery in the period
The price on parking stall, Ps≤Ps0, b is the sale price P in the periodsIt is every increase that a unit reduced described stop
The quantity of parking stall.
It preferably, further include the supply matrix for obtaining the parking stall: S in step S2N×K=[snk]；And described stop
The requirement matrix of parking stall: RM×K=[rmk]；Wherein, n is the supply amount on the parking stall in each period；When m is each
Between in section the parking stall the quantity required for facing card user；K is k-th of period, daily including continuous phase etc. extremely
The number of few two periods, the period are K, and K is natural number；K=1 is enabled to indicate first alternative time
Section, and k=K indicates the last one alternative period；snk=1, to stop described in n-th of the provider on the parking stall
Parking stall is available k-th of period, otherwise snk=0；rmk=1, described for the parking stall faces card user to m-th
The demand on the parking stall includes k-th of period k, otherwise rmk=0.
Preferably, the berth allocation variable of the provider on the parking stall are as follows:Wherein, xmnIt is decision
Variable, xmn=1 indicates that the demand for facing card user on m-th of parking stall is received by n-th of parking stall supply,
Otherwise xmn=0；The berth allocation variable of the moon card user on the parking stall are as follows:Wherein, Q=α ×
Q0, Q0It is the monthly card amount of selling on the parking stall, Q is moon card user the turn out for work amount of the parking stall on the day of, and α is described
The rate of attendance of parking stall moon card user on the day of, 0≤α≤1, dqk=1 indicates that moon card user parking demand q includes the period
K, otherwise dqk=0；The requirement matrix of the moon card user on the parking stall is: DQ×K=[dqk], yqn=1 indicates the parking
The moon card user request demand q of position is received by n-th of parking stall supply, otherwise yqn=0.
Preferably, the model of berth allocation are as follows:
Wherein, C is control variable, is a positive number, PqIt is the moon card user conversion on the parking stall to daily
Parking price, PcIt is the cost of compensation of the refusal moon card user parking request, μ is the stealthy punishment for facing card user described in refusal
Coefficient；unk≤snk, znk≤snk-unk, xmn∈ { 0,1 }, yqn∈{0,1}。
Preferably, CPLEX solver is called to solve the model of the berth allocation with Matlab.
It is identical or different preferably for the purchasing price and the sale price of the different periods.
The present invention also provides a kind of berth allocation terminal device, including memory, processor and it is stored in the storage
In device and the computer program that can run on the processor, the processor are realized as above when executing the computer program
The step of any the method.
The present invention provides a kind of computer readable storage medium again, and the computer-readable recording medium storage has computer
Program, when the computer program is executed by processor realize as above any the method the step of.
The invention has the benefit that a kind of berth allocation method and terminal device are provided, in the confession for having collected parking stall
To after the supply-demand information of person and the demander on parking stall, can quickly be determined by the berth allocation that model carries out global optimization
Plan provides allocation plan, maximizes total revenue, has a distinct increment compared to traditional First Come First Served strategy.
Detailed description of the invention
Fig. 1 is the schematic diagram of berth allocation method in the embodiment of the present invention.
Fig. 2 is the model contrast schematic diagram in the embodiment of the present invention based on reservation information and First Come First Served premise.
Fig. 3 is the schematic diagram of berth allocation system in the embodiment of the present invention.
Specific embodiment
In order to which technical problem to be solved of the embodiment of the present invention, technical solution and beneficial effect is more clearly understood,
The present invention is further described in detail below with reference to the accompanying drawings and embodiments.It should be appreciated that specific implementation described herein
Example is only used to explain the present invention, is not intended to limit the present invention.
It should be noted that it can be directly another when element is referred to as " being fixed on " or " being set to " another element
On one element or indirectly on another element.When an element is known as " being connected to " another element, it can
To be directly to another element or be indirectly connected on another element.In addition, connection can be for fixing
Effect is also possible to act on for circuit communication.
It is to be appreciated that term " length ", " width ", "upper", "lower", "front", "rear", "left", "right", "vertical",
The orientation or positional relationship of the instructions such as "horizontal", "top", "bottom" "inner", "outside" is that orientation based on the figure or position are closed
System is merely for convenience of the description embodiment of the present invention and simplifies description, rather than the device or element of indication or suggestion meaning must
There must be specific orientation, be constructed and operated in a specific orientation, therefore be not considered as limiting the invention.
In addition, term " first ", " second " are used for descriptive purposes only and cannot be understood as indicating or suggesting relative importance
Or implicitly indicate the quantity of indicated technical characteristic.Define " first " as a result, the feature of " second " can be expressed or
Implicitly include one or more this feature.In the description of the embodiment of the present invention, the meaning of " plurality " is two or two
More than, unless otherwise specifically defined.
Embodiment 1
As shown in Figure 1, a kind of berth allocation method, includes the following steps:
S1: the purchasing price and sale price of each period on parking stall are provided；
S2: obtaining the service time section of the provider on the parking stall and supplies the demander on number and the parking stall
Required time section and demand number, and summarize to obtain aggregate supply and aggregate demand of the parking stall within each period
Amount；
S3: building berth allocation model and solve obtain the parking stall into allocation result；
S4: the allocation result is informed to the provider on the parking stall and the demander on the parking stall.
As a preferred embodiment, in the step S1, it is assumed that the purchasing price on parking stall is per period Pb, sell
Selling price is per period Ps。PbHeight will affect the supply amount on parking stall.Total parking stall supply amount is indicated with N.For an industry
For master, selling oneself parking stall may bring the trouble of some stealths (for example to rent while winning interests to oneself
The risk etc. that visitor does not leave at the appointed time), therefore the height of price will affect whether owner is ready to hire out determining for parking stall
Plan.According to economic theory, supply rule shows that the supply of commodity or service is often proportional to price.In view of reality
Situation, herein we assume that supply and price are in a linear relationship.Assuming that price PbAs soon as every increase unit (member), will increase
The parking stall supply of a unit (a), a indicates supply to the susceptibility of purchasing price here.Pb0Indicate that owner is ready to provide vehicle
The minimum purchase prices that position is hired out.
In an embodiment of the present invention, the supply on the purchasing price and the parking stall in a period of time
Several contextual definitions are as follows:
N=a*Pb-a*Pb0
Wherein, N is the supply amount on the parking stall in the period, PbIt is the purchase price of per period in the period
Lattice, Pb0It is that the provider on the parking stall in the period provides the minimum purchase price of per period hired out on the parking stall
Lattice, Pb≥Pb0, a is the purchasing price P in the periodbIt is every increase unit the increased parking stall number
Amount.
PsHeight will affect the demand on parking stall.It is indicated to face card user parking stall aggregate demand with M.Likewise, root
According to economic theory, herein we assume that linear relationship is presented in demand and price.Assuming that PsOne unit of every increase (member), demand
M will reduce b unit (a), and what b was indicated here is sensibility of the demand to price.The society of known residential neighborhood's office building
Meeting parking position price is Ps0, then work as Ps=Ps0When, M=0.
The contextual definition of the sale price and the demand number on the parking stall in a period of time are as follows:
M=b*Ps0-b*Ps
Wherein, M is that card user demand, P are faced in the parking stall in the periodsWhen being per in the period
Section sale price, Ps0It is the price of Public parking area parking stall per period on the parking stall periphery, Ps≤Ps0, when b is described
Between the sale price P in sectionsEvery quantity for increasing the parking stall that a unit is reduced.
Assuming that the period for sharing K continuous phase etc. daily on shared landing is available, k=1 indicates first
A alternative period (such as morning 9:00-10:00), and k=K indicate the last one can share the period (such as evening
Upper 19:00-20:00).Other times section should be theoretically the unshared period, i.e. parking stall is owner individual in this time
Possessed.
The case where each period, is summarized to the supply matrix for just obtaining parking stall: SN×K=[snk]；And the parking
The requirement matrix of position: RM×K=[rmk]。
Wherein, n is the supply amount on the parking stall in each period；M is the parking stall in each period
It is described to face card user quantity required；K is k-th of period, and at least two periods including continuous phase etc., described daily
The number of period is K, and K is natural number；K=1 is enabled to indicate first alternative period, and k=K indicates the last one
Alternative period；snk=1, n-th of parking stall for the provider on the parking stall is k-th of period can
, otherwise snk=0；rmk=1, it include k-th for the demand of the card user to m-th of parking stall of facing on the parking stall
Period k, otherwise rmk=0.
Further, the berth allocation variable of the provider on parking stall are as follows:
Wherein, xmnIt is decision variable, xmn=1 indicates the demand for facing card user on m-th of parking stall by described n-th
A parking stall supply is received, otherwise xmn=0；
The berth allocation variable of the monthly card user demand person on the parking stall are as follows:
Wherein, Q=α × Q0, Q0It is the parking stall monthly card amount of selling, the moon, card user was turned out for work on the day of Q is the parking stall
Amount, α are the rate of attendance of the moon on the parking stall same day card user, 0≤α≤1, dqkWhen=1 expression moon card user parking demand q includes
Between section k, otherwise dqk=0；The parking stall the moon card user requirement matrix be: DQ×K=[dqk], yqn=1 indicates the parking
The monthly card user demand person of position requests demand q to be received by n-th of parking stall supply, otherwise yqn=0.
It is understood that demand of the supply on parking stall firstly the need of the provider for meeting parking stall.
Further, the model of berth allocation are as follows:
Wherein, C is control variable, is a very big natural number, PqIt is that the parking stall month card user is converted to daily
Parking price, PcIt is the cost of compensation for refusing the parking request of moon card user, μ is the stealthy penalty coefficient that refusal faces card user；unk≤snk, znk≤snk-unk, xmn∈ { 0,1 }, yqn∈{0,1}。
Model based on berth allocation, car park operator can be solved according to model, can preferably be used
Matlab calls CPLEX solver to solve the model of the berth allocation.Obtain the parking stall into allocation result；
Allocation result is informed to the provider on the parking stall and the demander on the parking stall.
In an embodiment of the present invention, the purchasing price for the different periods and described valence is sold
Lattice are identical or different, and the value of a and b can be the same or different in section in different times.Its specific value can be preparatory
Setting can also feed back dynamic according to big data and adjust, obtain optimal purchasing price, presell price and a to continue to optimize
With the value of b.
Embodiment 2
In a kind of specific embodiment, it is known that the purchasing price on the parking stall that car park operator provides is Ps=5,
The Public parking area parking stall price P of residential neighborhood's office building is recognized by inquirys0=12, owner is ready that providing parking stall carries out
The minimum purchase prices P of taxib0=4.Assuming that selling valence PsVariation range be [9,12] ($/h).A=100, b=200 are taken,
It can thus be concluded that N=100 and M=2400-200 × Ps.The research period is morning 9:00- evening 21:00, and taking 1h is a period
(for example first period k=1 is 9:00-10:00a.m., the last one period k=12 is 20:00-21:00p.m.), i.e. K
=12.
In the step S2, it can be obtained according to the historical data that card user parking is faced in parking lot, in one day 12 period, often
The arrival probability that a period faces card user isAveragely stop
Thus vehicle duration T=5h produces the requirement matrix R of the demander on parking stallM×K=[rmk].Because refusing the demand on parking stall
Person and stealthy penalty coefficient μ=5 generated.For the supply situation of the provider on parking stall, parking stall supply is all from morning
The first or second period, to the interior end of last four periods at night, it can thus be concluded that supply matrix SN×K=[snk].It is known
The rate of attendance α of the provider on parking stall is concentrated mainly in (60%, 80%) section.And the provider on parking stall is when averagely stopping
Long TmtApproximation obeys N (5,12) be just distributed very much.Assuming that the moon on the parking stall of the of that month provider to parking stall having been sold out
Card quantity is Q0=40, rate of attendance α=70% of the provider on parking stall in current consecutive days is taken, i.e., has Q in current consecutive days0
=40 α=70%Q=α × Q0The parking demand of the provider on=0.7 × 40=28 parking stall.It enables monthly card sell valence conversion to arrive
It is daily Pq=4*Ps.It can thus be concluded that monthly card user demand matrix DQ×K=[dqk], q=1,2, Q；K=1,
2,···,K。
In the step S3, to selling valence PsIn [9,12] ($/h) in range the case where variation, i.e. M is in [0,600] model
The case where enclosing interior variation is analyzed, and gross profit is as shown in Figure 2 with the variation diagram of demand.
As shown in Fig. 2, solid line be model of the invention gross profit with parking stall demander demand M variation tendency,
Dotted line is in the prior art according to arriving first the gross profit of the non-reservation first stopped with the variation tendency of the demand M of parking stall demander.
As seen from Figure 2, with the continuous decline for valence of selling, the continuous rising of demand, gross profit all shows in the case of two kinds
First rapidly rise, then slowly rises, rear slow downward trend.And on the whole, proposed by the invention based on reservation information
Berth allocation decision model performs better than, and total revenue is higher.
In the step S4, the berth allocation result obtained according to model solution can be informed user by car park operator
And owner.
The working principle of the shared parking lot berth allocation decision-making technique based on yield management is: car park operator
Thing determines parking stall purchase price and sells valence, to obtain the provider i.e. parking supply of owner and the parking stall on parking stall
The parking demand of demander after summarizing these information, carries out berth allocation decision by the model of foundation, so that parking lot
Maximum revenue.
Embodiment 3
As shown in figure 3, the schematic diagram for the berth allocation terminal device that one embodiment of the invention provides.The berth of the embodiment
Distribution terminal equipment includes: processor, memory and storage in the memory and can run on the processor
Computer program, such as obtain the program of aggregate supply and aggregate demand.The processor executes real when the computer program
Step in existing above-mentioned each berth allocation embodiment of the method, such as step S1-S4 shown in FIG. 1.Alternatively, the processor is held
The function of each module/unit in above-mentioned each Installation practice is realized when the row computer program, such as: each of parking stall is provided
The purchasing price and sale price of a period；Obtain the provider on the parking stall service time section and supply number and
The required time section and demand number of the demander on the parking stall, and summarize to obtain the parking stall within each period
Aggregate supply and aggregate demand；Building berth allocation model and solve obtain the parking stall into allocation result；It will be described point
The provider on the parking stall and the demander on the parking stall are informed with result.
Illustratively, the computer program can be divided into one or more module/units, one or more
A module/unit is stored in the memory, and is executed by the processor, to complete the present invention.It is one or more
A module/unit can be the series of computation machine program instruction section that can complete specific function, and the instruction segment is for describing institute
State implementation procedure of the computer program in the berth allocation terminal device.For example, the computer program can be divided
At: price unit is provided, aggregate supply and aggregate demand unit are obtained, constructs berth allocation model, informs allocation result unit；
Each module concrete function is as follows: providing the purchasing price and sale price of each period on parking stall；Obtain the parking stall
Provider service time section and supply number and the parking stall demander required time section and demand number, and
Summarize to obtain aggregate supply and aggregate demand of the parking stall within each period；Building berth allocation model simultaneously solves
To the parking stall into allocation result；The allocation result is informed to the provider on the parking stall and the need on the parking stall
The person of asking.
The berth allocation terminal device can be desktop PC, notebook, palm PC and cloud server etc.
Calculate equipment.The berth allocation terminal device may include, but be not limited only to, processor, memory.Those skilled in the art can
To understand, the schematic diagram is only the example of berth allocation terminal device, does not constitute the limit to berth allocation terminal device
It is fixed, it may include perhaps combining certain components or different components, such as the pool than illustrating more or fewer components
Bit allocation terminal device can also include input-output equipment, network access equipment, bus etc..
Alleged processor can be central processing unit (Central Processing Unit, CPU), can also be it
His general processor, digital signal processor (Digital Signal Processor, DSP), specific integrated circuit
(Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-
Programmable Gate Array, FPGA) either other programmable logic device, discrete gate or transistor logic,
Discrete hardware components etc..General processor can be microprocessor or the processor is also possible to any conventional processor
Deng the processor is the control centre of the berth allocation terminal device, utilizes various interfaces and the entire berth of connection
The various pieces of distribution terminal equipment.
The memory can be used for storing the computer program and/or module, and the processor is by operation or executes
Computer program in the memory and/or module are stored, and calls the data being stored in memory, described in realization
The various functions of berth allocation terminal device.The memory can mainly include storing program area and storage data area, wherein deposit
Store up program area can application program needed for storage program area, at least one function (for example sound-playing function, image play function
Energy is equal) etc.；Storage data area, which can be stored, uses created data (such as audio data, phone directory etc.) etc. according to mobile phone.
Can also include nonvolatile memory in addition, memory may include high-speed random access memory, for example, hard disk, memory,
Plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card dodge
Deposit card (Flash Card), at least one disk memory, flush memory device or other volatile solid-state parts.
If the integrated module/unit of the berth allocation terminal device is realized in the form of SFU software functional unit and conduct
Independent product when selling or using, can store in a computer readable storage medium.Based on this understanding, originally
The all or part of the process in above-described embodiment method is realized in invention, and relevant hardware can also be instructed by computer program
It completes, the computer program can be stored in a computer readable storage medium, the computer program is by processor
When execution, it can be achieved that the step of above-mentioned each embodiment of the method.Wherein, the computer program includes computer program code,
The computer program code can be source code form, object identification code form, executable file or certain intermediate forms etc..Institute
State computer-readable medium may include: can carry the computer program code any entity or device, recording medium,
USB flash disk, mobile hard disk, magnetic disk, CD, computer storage, read-only memory (ROM, Read-Only Memory), arbitrary access
Memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..It needs
It is bright, the content that the computer-readable medium includes can according in jurisdiction make laws and patent practice requirement into
Row increase and decrease appropriate, such as do not include electric load according to legislation and patent practice, computer-readable medium in certain jurisdictions
Wave signal and telecommunication signal.
The above content is a further detailed description of the present invention in conjunction with specific preferred embodiments, and it cannot be said that
Specific implementation of the invention is only limited to these instructions.For those skilled in the art to which the present invention belongs, it is not taking off
Under the premise of from present inventive concept, several equivalent substitute or obvious modifications can also be made, and performance or use is identical, all answered
When being considered as belonging to protection scope of the present invention.
Claims (10)
1. a kind of berth allocation method, which comprises the steps of:
S1: the purchasing price and sale price of each period on parking stall are provided；
S2: obtaining the service time section of the i.e. owner of provider on the parking stall and supplies the demand on number and the parking stall
Person is the required time section and demand number for facing card user and moon card user, and summarizes to obtain the parking stall in each period
Interior aggregate supply and aggregate demand；
S3: building berth allocation model and solve obtain the parking stall into allocation result；
S4: the allocation result is informed to the provider on the parking stall and the demander on the parking stall.
2. berth allocation method as described in claim 1, which is characterized in that the purchasing price and institute in a period of time
State the contextual definition of the supply number on parking stall are as follows:
N=a*Pb-a*Pb0
Wherein, N is the supply amount on the parking stall in the period, PbIt is the purchasing price in the period, Pb0It is institute
The provider for stating the parking stall in the period provides the minimum purchase prices that the parking stall is hired out, Pb≥Pb0, a is institute
State the purchasing price P in the periodbIt is every increase unit the increased parking stall quantity.
3. berth allocation method as claimed in claim 2, which is characterized in that the sale price and institute in a period of time
State the contextual definition of the demand number on parking stall are as follows:
M=b*Ps0-b*Ps
Wherein, M is the demand for facing card user on the parking stall in the period, PsIt is pair in the period
The sale price for facing card user, Ps0It is the valence on the Public parking area parking stall on the parking stall periphery in the period
Lattice, Ps≤Ps0, b is the sale price P in the periodsEvery number for increasing the parking stall that a unit is reduced
Amount.
4. berth allocation method as claimed in claim 3, which is characterized in that further include obtaining the parking stall in step S2
Supply matrix: SN×K=[snk]；And the requirement matrix on the parking stall: RM×K=[rmk]；
Wherein, n is the supply amount on the parking stall in each period；M is the described of the parking stall in each period
Face the quantity required of card user；K is k-th of period, daily at least two periods including continuous phase etc., when described
Between section number be K, K is natural number；K=1 is enabled to indicate first alternative period, and k=K indicates that the last one can
The selective period；snk=1, it be n-th of parking stall of the provider on the parking stall k-th of period is available
, otherwise snk=0；rmk=1, it include kth to face demand of the card user to m-th of parking stall described in the parking stall
A period k, otherwise rmk=0.
5. berth allocation method as claimed in claim 4, which is characterized in that the berth allocation of the provider on the parking stall becomes
Amount are as follows:
Wherein, xmnIt is decision variable, xmn=1 indicates that the described of m-th of parking stall faces the demand of card user by described n-th
Parking stall supply is received, otherwise xmn=0；
The berth allocation variable of the moon card user on the parking stall are as follows:
Wherein, Q=α × Q0, Q0It is the monthly card amount of selling on the parking stall, Q is the moon card user of the parking stall on the day of
The amount of turning out for work, α are the rate of attendance of parking stall moon card user on the day of, 0≤α≤1, dqk=1 indicates the parking of moon card user
Demand q includes period k, otherwise dqk=0；The requirement matrix of the moon card user on the parking stall is: DQ×K=[dqk], yqn
=1 indicates that the moon card user request demand q on the parking stall is received by n-th of parking stall supply, otherwise yqn=
0。
6. berth allocation method as claimed in claim 5, which is characterized in that the model of berth allocation are as follows:
Wherein, C is control variable, is a positive number, PqIt is the moon card user conversion on the parking stall to daily parking valence
Lattice, PcIt is the cost of compensation of the refusal moon card user parking request, μ is the stealthy penalty coefficient for facing card user described in refusal；unk≤snk, znk≤snk-unk, xmn∈ { 0,1 }, yqn∈{0,1}。
7. berth allocation method as claimed in claim 6, which is characterized in that call CPLEX solver to institute with Matlab
The model for stating berth allocation is solved.
8. berth allocation method as claimed in claim 1, which is characterized in that for the institute of the different periods
It states purchasing price and the sale price is identical or different.
9. a kind of berth allocation terminal device, including memory, processor and storage are in the memory and can be described
The computer program run on processor, which is characterized in that the processor realizes such as right when executing the computer program
It is required that the step of 1-8 any the method.
10. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In being realized when the computer program is executed by processor such as the step of claim 1-8 any the method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910458918.3A CN110175718A (en) | 2019-05-29 | 2019-05-29 | A kind of berth allocation method and terminal device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910458918.3A CN110175718A (en) | 2019-05-29 | 2019-05-29 | A kind of berth allocation method and terminal device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110175718A true CN110175718A (en) | 2019-08-27 |
Family
ID=67696565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910458918.3A Pending CN110175718A (en) | 2019-05-29 | 2019-05-29 | A kind of berth allocation method and terminal device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110175718A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111653119A (en) * | 2020-04-30 | 2020-09-11 | 南京理工大学 | Shared parking space distribution system and method adapting to delay requirement |
| CN113380023A (en) * | 2021-05-21 | 2021-09-10 | 南京理工大学 | Mixed land sharing parking demand prediction method based on berth selection behavior |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104077925A (en) * | 2014-06-13 | 2014-10-01 | 牛力伟 | Stall sharing method, system and server |
| CN106023641A (en) * | 2016-06-23 | 2016-10-12 | 北京交通大学 | Parking space reservation and allocation method and system based on dynamic optimization |
-
2019
- 2019-05-29 CN CN201910458918.3A patent/CN110175718A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104077925A (en) * | 2014-06-13 | 2014-10-01 | 牛力伟 | Stall sharing method, system and server |
| CN106023641A (en) * | 2016-06-23 | 2016-10-12 | 北京交通大学 | Parking space reservation and allocation method and system based on dynamic optimization |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111653119A (en) * | 2020-04-30 | 2020-09-11 | 南京理工大学 | Shared parking space distribution system and method adapting to delay requirement |
| CN113380023A (en) * | 2021-05-21 | 2021-09-10 | 南京理工大学 | Mixed land sharing parking demand prediction method based on berth selection behavior |
| CN113380023B (en) * | 2021-05-21 | 2022-06-10 | 南京理工大学 | Mixed land sharing parking demand prediction method based on berth selection behavior |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sun et al. | Optimal pricing for ride-sourcing platforms | |
| Shao et al. | A simple reservation and allocation model of shared parking lots | |
| Cetin et al. | Regulation of taxis and the rise of ridesharing | |
| CN109523368B (en) | Electric power transaction system based on charging pile | |
| US10504366B1 (en) | Lotless storage of vehicle inventory and test drive vehicle delivery | |
| Guo et al. | Parking spaces repurchase strategy design via simulation optimization | |
| CN105225521A (en) | Based on parking management system and the method for Internet of Things | |
| CN105426997A (en) | Intelligent dispatching and application management system of urban public bicycles and implementation method thereof | |
| CN104933891A (en) | Information processing method, client and service platform | |
| CN105303882A (en) | Parking management system and method based on space-time dimension dynamic parking charging strategy | |
| CN109191694A (en) | A kind of electric car fast charge station charging segmentation charging method and device | |
| CN103413209A (en) | Method for selecting multi-user and multi-warehouse logistics distribution path | |
| EP2852924A1 (en) | System for making available for hire vehicles from a fleet aggregated from a plurality of vehicle fleets | |
| CN103247179A (en) | Community parking space sharing and use reserving service system based on vehicle identification | |
| CN102637358A (en) | Citizen-satisfaction-based public bicycle service system and scheduling and dispatching method | |
| Wang et al. | Electric vehicle car-sharing optimization relocation model combining user relocation and staff relocation | |
| CN110175718A (en) | A kind of berth allocation method and terminal device | |
| Gehrke et al. | Patterns and predictors of dockless bikeshare trip generation and duration in Boston’s suburbs | |
| Li et al. | A shared parking space optimization model to alleviate China’s parking problem considering travelers’ tiered credit risk | |
| CN115345702A (en) | Residential area private shared parking matching method and system considering user characteristics | |
| Bi et al. | Capturing the Characteristics of Car‐Sharing Users: Data‐Driven Analysis and Prediction Based on Classification | |
| Wang et al. | A user-based adaptive joint relocation model combining electric car-sharing and bicycle-sharing | |
| Tan et al. | A reverse Vickrey auction for physical internet (PI) enabled parking management systems | |
| Chou et al. | Models for effective deployment and redistribution of shared bicycles with location choices | |
| CN103229485B (en) | The implementation method that professional ability is shared and platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190827 |
|
| RJ01 | Rejection of invention patent application after publication |