CN108960634A - A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm - Google Patents

A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm Download PDF

Info

Publication number
CN108960634A
CN108960634A CN201810737569.4A CN201810737569A CN108960634A CN 108960634 A CN108960634 A CN 108960634A CN 201810737569 A CN201810737569 A CN 201810737569A CN 108960634 A CN108960634 A CN 108960634A
Authority
CN
China
Prior art keywords
shift
vehicle
chain
driver
shift chain
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
Application number
CN201810737569.4A
Other languages
Chinese (zh)
Inventor
郭建国
龙卫东
阎磊
雷炳友
田影
沈洋
靳冬冬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZHENGZHOU TIANMAI TECHNOLOGY Co Ltd
Original Assignee
ZHENGZHOU TIANMAI TECHNOLOGY Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZHENGZHOU TIANMAI TECHNOLOGY Co Ltd filed Critical ZHENGZHOU TIANMAI TECHNOLOGY Co Ltd
Priority to CN201810737569.4A priority Critical patent/CN108960634A/en
Publication of CN108960634A publication Critical patent/CN108960634A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a kind of vehicle based on people's vehicle binding pattern and arranges an order according to class and grade algorithm, and (1) construction vehicle dispatching model simultaneously solves, and obtains a vehicle scheduling scheme；(2) using vehicle scheduling scheme as driver's shifts arrangement initial solution, iteration carries out local search improvement；(3) it in local search procedure, introduces destruction method for reconstructing and current solution is disturbed.(4) iteration executes step (2) and arrives (3) NiterIt is secondary, NiterFor local search the number of iterations；(5) iteration executes step (1) and arrives (3) MstartIt is secondary, MstartFor the more numbers of starts of algorithm；(6) the feasible shift chain that step (2) obtain is improved, SCP model is established, more preferably shift chain is obtained and combines.The present invention introduces destruction method for reconstructing and disturbs to current solution by using Iterated Local Search algorithm, and in local search procedure.Solve the problems, such as that lower driver's labor efficiency present in tradition calculation, driver's higher cost, unbalanced, the possible vehicle number of driver task increase.

Description

A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm
Technical field
The present invention relates to a kind of vehicle algorithms of arranging an order according to class and grade specifically to relate to a kind of vehicle based on people's vehicle binding pattern It arranges an order according to class and grade algorithm.
Background technique
Public transport is the important mode of transportation of one kind of Public Traveling, and solves the important of Traffic Jam Problem in Cities Means.In public transport operation architecture, it is its important problem that vehicle, which is arranged an order according to class and grade, how this problem is efficiently solved, to public affairs Hand over to the collective or the state department operation benefits and service quality it is most important.
For bus dispatching problem, domestic and foreign scholars study public transport shifts arrangement, have some public transport at present The research achievement of shifts arrangement.The method for solving vehicle shifts arrangement can be divided into two kinds, i.e. optimal method and heuritic approach. Optimal method uses traditional optimal model such as linear programming model, and is calculated using column-generation technology, branch and bound method etc. Method, the scheduling scheme that advantage is is optimal, the disadvantage is that Riming time of algorithm is too long, it is difficult to bigger applied to scale Practical problem.Heuritic approach is the algorithm rule of thumb or intuitively constructed, under computational complexity, can obtain the suboptimum of problem Solution, common heuritic approach have tabu search algorithm, genetic algorithm, Lagrangian Relaxation Algorithm etc..
Foreign countries are relatively mature for the research of problems, and for problems, problem is generally divided into vehicle tune Degree and driver's two sub-problems of arranging an order according to class and grade solve stage by stage, first complete vehicle scheduling based on route timetable, then carry out driver's task Driver's work in shifts plan is finally worked out in distribution；Or consider that scheduling and driver are arranged an order according to class and grade simultaneously, make every effort to obtain more preferably public transport work Industry scheme.However, external existing solution and algorithm are difficult to adapt to vehicle scheduling and driver's shifts arrangement in China, Reason is: driver and vehicle relationship are not fixed in external enterprises of public transport, and a driver can drive multiple vehicles in one day；And Domestic enterprises of public transport generally use " binding of people's vehicle " mode, i.e. a driver drives same vehicle within the same working day. However, being also all made of optimization algorithm for the solution of problems at home, and obtain than manually arranging an order according to class and grade with certain optimization, But there are also deficiency, that is, the such algorithm used does not have versatility, does not take into account the cost of vehicle Hess base, can not Reflect the demand of practical application；It is essentially all rule of thumb to arrange an order according to class and grade to it that vehicle domestic at present, which is arranged an order according to class and grade, simultaneously, is not had There is science, and cause driver's labor efficiency lower, driver's higher cost, driver task is unbalanced, possible vehicle number Increase.
Summary of the invention
The purpose of the present invention is in view of the deficiencies of the prior art, to provide a kind of design science, Riming time of algorithm The short vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm.
Public traffic vehicles schedule and driver's shifts arrangement
Enable set D={ d1,d2,...,dmIndicate m parking lot, S={ s1,s2,...,spIndicate p public transport starting point or Terminal station, certain site can provide driver have dinner, the service such as Vehicular charging.Enable set V={ v1,v2,...,vnIndicate one N shift task on public bus network, task viWith circuit number, direction of traffic, start site, terminus point, dispatch a car when Between, end time, the attributes such as runing time.
Public traffic vehicles schedule and driver's shifts arrangement are that vehicle and driver is arranged to complete class as defined in public bus network timetable Subtask minimizes public transport operation cost under the premise of meeting vehicle drivers administrative provisions.First, each of set V Shift task must be completed by certain vehicle and some driver；Second, the institutes such as maintenance, oiling are provided, charges or changes battery for vehicle The time needed；Third, it is necessary to which sufficient time of having a rest and time for eating meals are provided for driver；4th, vehicle is used as few as possible, Reduce vehicle fixed cost and operating cost；Meanwhile driver's quantity and driver's working time needed for reducing as far as possible, to reduce The relevant expenditure of driver.
In order to solve public traffic vehicles schedule and driver's shifts arrangement, the technical scheme adopted by the invention is that:
A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm, comprising the following steps:
(1) it constructs vehicle dispatching model and solves, obtain a vehicle scheduling scheme；
(2) using vehicle scheduling scheme as driver's shifts arrangement initial solution, iteration carries out local search improvement；
(3) it in local search procedure, introduces destruction method for reconstructing and current solution is disturbed.
(4) iteration executes step (2) and arrives (3) NiterIt is secondary, NiterFor local search the number of iterations；
(5) iteration executes step (1) and arrives (3) MstartIt is secondary, MstartFor the more numbers of starts of algorithm；
(6) the feasible shift chain that step (2) obtain is improved, SCP model is established, more preferably shift chain is obtained and combines.
Based on above-mentioned, the vehicle shift chain uses public transport shift chain set B={ b1,b2,...,bkExpression vehicle scheduling It arranges an order according to class and grade scheme with driver, each shift chain biComprising a vehicle, place parking lot, shift number, outfit driver and its class's system are executed, Indicate that vehicle from parking lot, is sequentially completed several shift tasks, returns parking lot, each shift chain needs to be equipped with one or two A driver.
Based on above-mentioned, in step (1), vehicle dispatching model is established, and solves vehicle dispatching model and obtains vehicle shift chain Initial solution,
Wherein, vehicle dispatching model BSP is
Enable cijThe empty driving cost for reaching shift j or parking lot j from shift i terminal or parking lot i for vehicle, enables tijFor class The time interval of secondary i and j, tminMinimum time of having a rest, N between shiftiThe shift that can have been continued to execute after having executed for shift i is appointed Business set, i.e. Ni=j | j ∈ V, tij≥tmin,
In model, xki,xik,xijFor decision variable, xkiIndicate whether certain vehicle is left for executing shift i from parking lot k, xikIndicate whether return to parking lot k, x after certain vehicle completes shift iijIndicate after certain vehicle executes shift i the whether then class of execution Secondary j；M is a sufficiently large positive integer；
Solving model obtains the class for meeting that vehicle number as defined in driver's time of having a rest is minimum between shift or empty driving cost is minimum Secondary chain.
Based on above-mentioned, in step (2), iteration carries out local search to improve including 5 local searching operators:
Split run time is mobile, some shift in some shift chain i is deleted, and attempts to be inserted into other shift chains j；
Straight Run time is mobile, two adjacent shifts in some shift chain i is deleted, and attempt to be inserted into other shift chains j In；
Shift chain intersects, and two shift chains (i, j) are truncated respectively, reattempts and is combined to obtain shift chain (k, l)；
Shift chain merges, and two shifts (i, j) are merged, and attempts to generate a new shift chain K；
Shift chain is split, some shift chain i is truncated, and generates two new shift chains (j, k)；
When being iterated search, split run time movement, Straight Run time movement and shift chain crossover operator execute in order, and are holding Shift chain combined operators are called after row, shift chain fractionation operator is only when other operators are difficult for driver's offer time for eating meals It uses.
Based on above-mentioned, during each operator executes, first judgement adjustment obtains the feasibility of new shift chain, if new shift chain can not Row, abandons this adjustment；If feasible, infeasible shift chain is preferentially adjusted to feasible shift chain, secondly adjusting shift chain reduces Its cost, wherein the cost that shift chain is related to includes vehicle fixed cost, vehicle empty driving cost, driver's fixed cost and driver Variable cost.
Based on above-mentioned, the destruction method for reconstructing in the step (3) is splits some shift chain in Current protocols, generation 2 new shift chains, or two vehicle shift chains are destroyed, and recombinate and obtain new shift chain.
Based on above-mentioned, in the step (6), set omega={ b is enabled1,b2,...,bnOwned by what local search was found Shift chain, chain biTo meet the constraint condition that driver arranges an order according to class and grade, cost ci, establish SCP model are as follows:
Wherein, the shift chain combination that objective function (5) is used to select cost minimum, constraint condition (6) guarantee shift set In each shift by some selected shift chain cover.
The present invention has substantive distinguishing features outstanding and significant progress compared with the prior art, specifically:
The present invention introduces by using Iterated Local Search algorithm, and in local search procedure and destroys method for reconstructing pair Current solution is disturbed；For the diversity for increasing local search, a lot of mechanisms are introduced, multiple initial solutions are provided and carry out local search Rope；It is also sought using set covering problem model SCP after completing search for the limitation for avoiding local search approach " short-sighted " Look for scheme of more preferably arranging an order according to class and grade.It is able to solve lower driver's labor efficiency present in tradition calculation, driver's higher cost, drives Member task it is unbalanced, may vehicle number increase the problem of, suitable for China vehicle arrange an order according to class and grade people's vehicle binding pattern.
Specific embodiment
Below by specific embodiment, technical scheme of the present invention will be described in further detail.
A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm, comprising the following steps:
(1) it constructs vehicle dispatching model and solves, obtain a vehicle scheduling scheme；
(2) using vehicle scheduling scheme as driver's shifts arrangement initial solution, iteration carries out local search improvement；
(3) it in local search procedure, introduces destruction method for reconstructing and current solution is disturbed.
(4) iteration executes step (2) and arrives (3) NiterIt is secondary, NiterFor local search the number of iterations；
(5) iteration executes step (1) and arrives (3) MstartIt is secondary, MstartFor the more numbers of starts of algorithm；
(6) the feasible shift chain that step (2) obtain is improved, SCP model is established, more preferably shift chain is obtained and combines.
Specifically, the vehicle shift chain uses public transport shift chain set B={ b1,b2,...,bkExpression vehicle scheduling and Driver arranges an order according to class and grade scheme, each shift chain biComprising a vehicle, place parking lot, execute shift number, outfit driver and its class's system, table Show that vehicle from parking lot, is sequentially completed several shift tasks, returns parking lot, each shift chain needs to be equipped with one or two Driver.
In step (1), vehicle dispatching model is established, and solves vehicle dispatching model and obtains vehicle shift chain initial solution,
Wherein, vehicle dispatching model BSP is
Enable cijThe empty driving cost for reaching shift j or parking lot j from shift i terminal or parking lot i for vehicle, enables tijFor class The time interval of secondary i and j, tminMinimum time of having a rest, N between shiftiThe shift that can have been continued to execute after having executed for shift i is appointed Business set, i.e. Ni=j | j ∈ V, tij≥tmin,
In model, xki,xik,xijFor decision variable, xkiIndicate whether certain vehicle is left for executing shift i from parking lot k, xikIndicate whether return to parking lot k, x after certain vehicle completes shift iijIndicate after certain vehicle executes shift i the whether then class of execution Secondary j；M is a sufficiently large positive integer；
Solving model obtains the class for meeting that vehicle number as defined in driver's time of having a rest is minimum between shift or empty driving cost is minimum Secondary chain.
In step (2), Iterated Local Search algorithm is a kind of first heuristic algorithm based on neighborhood search, and having simply has It imitates, be easy to the advantages that other algorithms mixing.Vehicle scheduling scheme only meets driver's time of having a rest and requires, and is usually unsatisfactory for driver just Meal requires.Local searching operator will be adjusted to driver by shift chain and provide time for eating meals, and attempt reduce vehicle and driver it is total Cost.When local searching operator, which is difficult for driver, provides time for eating meals, attempt some shift chain being split as two shift chains, It has dinner demand to meet driver.
Wherein, iteration carries out local search to improve including 5 local searching operators:
Split run time is mobile, some shift in some shift chain i is deleted, and attempts to be inserted into other shift chains j；
Straight Run time is mobile, two adjacent shifts in some shift chain i is deleted, and attempt to be inserted into other shift chains j In；
Shift chain intersects, and two shift chains (i, j) are truncated respectively, reattempts and is combined to obtain shift chain (k, l)；
Shift chain merges, and two shifts (i, j) are merged, and attempts to generate a new shift chain K；
Shift chain is split, some shift chain i is truncated, and generates two new shift chains (j, k)；
When being iterated search, split run time movement, Straight Run time movement and shift chain crossover operator execute in order, and are holding Shift chain combined operators are called after row, shift chain fractionation operator is only when other operators are difficult for driver's offer time for eating meals It uses.
In the execution of each operator, first judgement adjustment obtains the feasibility of new shift chain, if new shift chain is infeasible, abandons This adjustment；If feasible, infeasible shift chain is preferentially adjusted to feasible shift chain, shift chain is secondly adjusted and reduces its cost, Wherein, the cost that shift chain is related to includes vehicle fixed cost, vehicle empty driving cost, driver's fixed cost and driver's variable cost (such as subsidy, bonus).
Destruction method for reconstructing in the step (3) is to split some shift chain in Current protocols, generates 2 new classes Secondary chain, or two vehicle shift chains are destroyed, and recombinate and obtain new shift chain.
Destroying reconstruction is to avoid falling into one of local optimum effective way during local search inspires.Iterated Local Search process In, scheduling scheme is easily trapped into local optimum, and searching operators is caused to be difficult to find better shift chain.To jump out local optimum, It introduces destruction method for reconstructing to disturb shift chain, attempts discovery more optimal solution.Using two destruction method for reconstructing；Shift Chain is split and shift chain intersects, and does not consider cost factor both.It destroys to rebuild to disturb and usually will increase scheme cost, but rear In continuous local search procedure, searching operators will be adjusted by shift chain reduces cost again, and is possible to discovery more preferably shift Chain combination.
In the step (6), local search algorithm has " short-sighted " limitation, and only record is current optimal in search process Solution.It is global from global angle Selection using set covering problem SCP model for the solution space for making full use of algorithm to explore Preferably solve.Feasible shift chain found in local search procedure is recorded, after completing local search procedure, from history shift Optimal combination of arranging an order according to class and grade is found in chain.Enable set omega={ b1,b2,...,bnAll shift chains for being found by local search, chain biTo meet the constraint condition that driver arranges an order according to class and grade, cost ci, establish SCP model are as follows:
Wherein, the shift chain combination that objective function (5) is used to select cost minimum, constraint condition (6) guarantee shift set In each shift by some selected shift chain cover.
Be applied in practice for the algorithm model, obtain a result for
Wherein Bus indicates vehicle number, and Updown indicates uplink and downlink, and shift indicates that morning and afternoon shift, Task indicate that shift is appointed Business number.
Finally it should be noted that: the above embodiments are merely illustrative of the technical scheme of the present invention and are not intended to be limiting thereof；To the greatest extent The present invention is described in detail with reference to preferred embodiments for pipe, it should be understood by those ordinary skilled in the art that: still It can modify to a specific embodiment of the invention or some technical features can be equivalently replaced；Without departing from this hair The spirit of bright technical solution should all cover within the scope of the technical scheme claimed by the invention.

Claims (7)

  1. The algorithm 1. a kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade, which comprises the following steps:
    (1) it constructs vehicle dispatching model and solves, obtain a vehicle scheduling scheme；
    (2) using vehicle scheduling scheme as driver's shifts arrangement initial solution, iteration carries out local search improvement；
    (3) it in local search procedure, introduces destruction method for reconstructing and current solution is disturbed.
    (4) iteration executes step (2) and arrives (3) NiterIt is secondary, NiterFor local search the number of iterations；
    (5) iteration executes step (1) and arrives (3) MstartIt is secondary, MstartFor the more numbers of starts of algorithm；
    (6) the feasible shift chain that step (2) obtain is improved, SCP model is established, more preferably shift chain is obtained and combines.
  2. The algorithm 2. vehicle according to claim 1 based on people's vehicle binding pattern is arranged an order according to class and grade, it is characterised in that: the vehicle class Secondary chain uses public transport shift chain set B={ b1,b2,...,bkExpression vehicle scheduling and driver arrange an order according to class and grade scheme, each shift chain bi Comprising a vehicle, place parking lot, shift number, outfit driver and its class's system are executed, indicates that vehicle from parking lot, is sequentially completed Several shift tasks, return parking lot, and each shift chain needs to be equipped with one or two driver.
  3. The algorithm 3. vehicle according to claim 2 based on people's vehicle binding pattern is arranged an order according to class and grade, it is characterised in that:
    In step (1), vehicle dispatching model is established, and solves vehicle dispatching model and obtains vehicle shift chain initial solution,
    Wherein, vehicle dispatching model BSP is
    Enable cijThe empty driving cost for reaching shift j or parking lot j from shift i terminal or parking lot i for vehicle, enables tijFor shift i and j Time interval, tminMinimum time of having a rest, N between shiftiThe shift set of tasks that can have been continued to execute after having been executed for shift i, That is Ni=j | j ∈ V, tij≥tmin,
    In model, xki,xik,xijFor decision variable, xkiIndicate whether certain vehicle is left for executing shift i, x from parking lot kikTable Show and whether returns to parking lot k, x after certain vehicle completes shift iijIndicate whether then execute shift j after certain vehicle executes shift i；M It is a sufficiently large positive integer；
    Solving model obtains the shift chain for meeting that vehicle number as defined in driver's time of having a rest is minimum between shift or empty driving cost is minimum.
  4. The algorithm 4. vehicle according to claim 2 based on people's vehicle binding pattern is arranged an order according to class and grade, which is characterized in that in step (2), Iteration carries out local search to improve including 5 local searching operators:
    Split run time is mobile, some shift in some shift chain i is deleted, and attempts to be inserted into other shift chains j；
    Straight Run time is mobile, two adjacent shifts in some shift chain i is deleted, and attempt to be inserted into other shift chains j；
    Shift chain intersects, and two shift chains (i, j) are truncated respectively, reattempts and is combined to obtain shift chain (k, l)；
    Shift chain merges, and two shifts (i, j) are merged, and attempts to generate a new shift chain K；
    Shift chain is split, some shift chain i is truncated, and generates two new shift chains (j, k)；
    When being iterated search, split run time movement, Straight Run time movement and shift chain crossover operator execute in order, and are executing Shift chain combined operators are called after finishing, shift chain splits operator and only is difficult for making when driver provides time for eating meals in other operators With.
  5. The algorithm 5. vehicle according to claim 4 based on people's vehicle binding pattern is arranged an order according to class and grade, it is characterised in that: each operator is held In row, first judgement adjustment obtains the feasibility of new shift chain, if new shift chain is infeasible, abandons this adjustment；If feasible, preferentially Infeasible shift chain is adjusted to feasible shift chain, shift chain is secondly adjusted and reduces its cost, wherein the cost that shift chain is related to Including vehicle fixed cost, vehicle empty driving cost, driver's fixed cost and driver's variable cost.
  6. The algorithm 6. vehicle according to claim 5 based on people's vehicle binding pattern is arranged an order according to class and grade, it is characterised in that: the step (3) the destruction method for reconstructing in is to split some shift chain in Current protocols, generates 2 new shift chains, or by two Vehicle shift chain destroys, and recombinates and obtain new shift chain.
  7. The algorithm 7. vehicle according to claim 4 based on people's vehicle binding pattern is arranged an order according to class and grade, which is characterized in that the step (6) in, set omega={ b is enabled1,b2,...,bnAll shift chains for being found by local search, chain biIt arranges an order according to class and grade to meet driver Constraint condition, cost ci, establish SCP model are as follows:
    Wherein, the shift chain combination that objective function (5) is used to select cost minimum, constraint condition (6) guarantee every in shift set One shift is covered by some selected shift chain.
CN201810737569.4A 2018-07-06 2018-07-06 A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm Pending CN108960634A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810737569.4A CN108960634A (en) 2018-07-06 2018-07-06 A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810737569.4A CN108960634A (en) 2018-07-06 2018-07-06 A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm

Publications (1)

Publication Number Publication Date
CN108960634A true CN108960634A (en) 2018-12-07

Family

ID=64483427

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810737569.4A Pending CN108960634A (en) 2018-07-06 2018-07-06 A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm

Country Status (1)

Country Link
CN (1) CN108960634A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109816279A (en) * 2019-03-22 2019-05-28 武汉大学 A kind of goods stock Contents in brief Intelligent Dynamic Scheduling method
CN111325483A (en) * 2020-03-17 2020-06-23 郑州天迈科技股份有限公司 Electric bus scheduling method based on battery capacity prediction
CN111382947A (en) * 2020-03-17 2020-07-07 郑州天迈科技股份有限公司 Vehicle shift scheduling algorithm based on greedy tabu search
CN111476490A (en) * 2020-04-08 2020-07-31 郑州天迈科技股份有限公司 Regional multi-line vehicle scheduling algorithm shared by resource pool
CN111667097A (en) * 2020-05-13 2020-09-15 郑州天迈科技股份有限公司 Multi-chain search-based scheduling method for drivers of vehicles in same dispatching room
CN112863166A (en) * 2021-01-25 2021-05-28 湖南智慧畅行交通科技有限公司 Newly-added train number algorithm based on coordinate search
CN113205239A (en) * 2021-03-17 2021-08-03 郑州天迈科技股份有限公司 Bus scheduling method and system with priority in task amount configuration
CN113901397A (en) * 2020-06-22 2022-01-07 南京行者易智能交通科技有限公司 New energy bus replacement method and generation device thereof

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140039986A1 (en) * 2012-07-31 2014-02-06 Xerox Corporation Identifying contributions to transportation system schedule deviation
CN106611229A (en) * 2015-12-04 2017-05-03 四川用联信息技术有限公司 Iterated local search algorithm by employing improved perturbation mode for solving job-shop scheduling problem
CN107025363A (en) * 2017-05-08 2017-08-08 中国人民解放军国防科学技术大学 A kind of adaptive big neighborhood search method of Agile satellite scheduling

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140039986A1 (en) * 2012-07-31 2014-02-06 Xerox Corporation Identifying contributions to transportation system schedule deviation
CN106611229A (en) * 2015-12-04 2017-05-03 四川用联信息技术有限公司 Iterated local search algorithm by employing improved perturbation mode for solving job-shop scheduling problem
CN107025363A (en) * 2017-05-08 2017-08-08 中国人民解放军国防科学技术大学 A kind of adaptive big neighborhood search method of Agile satellite scheduling

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
候彦娥等: "公交司机排班问题的混合元启发算法研究", 《交通运输系统工程与信息》 *
陈明明等: "多车场公交乘务排班问题优化", 《交通运输系统工程与信息》 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109816279A (en) * 2019-03-22 2019-05-28 武汉大学 A kind of goods stock Contents in brief Intelligent Dynamic Scheduling method
CN111325483A (en) * 2020-03-17 2020-06-23 郑州天迈科技股份有限公司 Electric bus scheduling method based on battery capacity prediction
CN111382947A (en) * 2020-03-17 2020-07-07 郑州天迈科技股份有限公司 Vehicle shift scheduling algorithm based on greedy tabu search
CN111325483B (en) * 2020-03-17 2024-01-26 郑州天迈科技股份有限公司 Electric bus scheduling method based on battery capacity prediction
CN111476490A (en) * 2020-04-08 2020-07-31 郑州天迈科技股份有限公司 Regional multi-line vehicle scheduling algorithm shared by resource pool
CN111667097A (en) * 2020-05-13 2020-09-15 郑州天迈科技股份有限公司 Multi-chain search-based scheduling method for drivers of vehicles in same dispatching room
CN111667097B (en) * 2020-05-13 2024-01-23 郑州天迈科技股份有限公司 Multi-chain search-based scheduling method for drivers of vehicles in same scheduling room
CN113901397A (en) * 2020-06-22 2022-01-07 南京行者易智能交通科技有限公司 New energy bus replacement method and generation device thereof
CN112863166A (en) * 2021-01-25 2021-05-28 湖南智慧畅行交通科技有限公司 Newly-added train number algorithm based on coordinate search
CN113205239A (en) * 2021-03-17 2021-08-03 郑州天迈科技股份有限公司 Bus scheduling method and system with priority in task amount configuration
CN113205239B (en) * 2021-03-17 2024-03-15 郑州天迈科技股份有限公司 Bus dispatching method and system with priority of task allocation

Similar Documents

Publication Publication Date Title
CN108960634A (en) A kind of vehicle based on people's vehicle binding pattern is arranged an order according to class and grade algorithm
CN111382947A (en) Vehicle shift scheduling algorithm based on greedy tabu search
Wang Routing and scheduling for a last-mile transportation system
CN110135755A (en) A kind of method of complex optimum section urban public transit timetable establishment and vehicle scheduling
Jäger et al. Agent-based simulation of a shared, autonomous and electric on-demand mobility solution
Venturini et al. Linking narratives and energy system modelling in transport scenarios: A participatory perspective from Denmark
CN107618381A (en) Automobile synthesis complementary energy system and method, storage medium based on mobile Internet
CN110288168B (en) Optimal compilation method and device for driver riding traffic routes of high-speed motor train unit
CN112488379B (en) Maintenance plan optimization method and system for high-speed railway motor train unit
CN111476490A (en) Regional multi-line vehicle scheduling algorithm shared by resource pool
CN111667097B (en) Multi-chain search-based scheduling method for drivers of vehicles in same scheduling room
Fores et al. TRACS II: a hybrid IP/heuristic driver scheduling system for public transport
CN113205239B (en) Bus dispatching method and system with priority of task allocation
Dauzère-Pérès et al. A Lagrangian heuristic framework for a real-life integrated planning problem of railway transportation resources
CN111079997A (en) Modeling and collaborative optimization method
CN103714396A (en) Rapid intelligent optimization method and system for motor train unit application and maintenance scheme
Chiu et al. A constraint-based interactive train rescheduling tool
CN110400003A (en) A kind of physical-distribution intelligent distribution scheduling method, apparatus and system
Gorman Santa Fe Railway uses an operating-plan model to improve its service design
Colonetti et al. A novel cooperative multi-search benders decomposition for solving the hydrothermal unit-commitment problem
Xinchao et al. DP-TABU: an algorithm to solve single-depot multi-line vehicle scheduling problem
CN112233451B (en) Intelligent traveling plan compiling system considering endurance mileage of pure electric bus
Zhao et al. Two-way vehicle scheduling approach in public transit based on Tabu search and dynamic programming algorithm
Kwan et al. Effective search space control for large and/or complex driver scheduling problems
CN110031018A (en) A kind of multi-destination multi-route method and system for planning

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: 20181207

RJ01 Rejection of invention patent application after publication