CN114118868A - Scheduling system and method - Google Patents

Scheduling system and method Download PDF

Info

Publication number
CN114118868A
CN114118868A CN202111491931.2A CN202111491931A CN114118868A CN 114118868 A CN114118868 A CN 114118868A CN 202111491931 A CN202111491931 A CN 202111491931A CN 114118868 A CN114118868 A CN 114118868A
Authority
CN
China
Prior art keywords
service
customer
service personnel
information
scheme
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
CN202111491931.2A
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.)
Fushoukang Shanghai Medical And Pension Service Co ltd
Original Assignee
Fushoukang Shanghai Medical And Pension Service 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 Fushoukang Shanghai Medical And Pension Service Co ltd filed Critical Fushoukang Shanghai Medical And Pension Service Co ltd
Priority to CN202111491931.2A priority Critical patent/CN114118868A/en
Publication of CN114118868A publication Critical patent/CN114118868A/en
Pending legal-status Critical Current

Links

Images

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/06316—Sequencing of tasks or work
    • 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
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services

Landscapes

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

Abstract

The invention discloses a scheduling system, which comprises an order module, a customer information module, a service staff information module and a control center. The order module is used for determining customer information according to a customer order, wherein the customer information comprises a customer address, a service required by the customer and expected service time. The customer information module is used for storing the customer information determined by the order module. The service personnel information module is used for storing service personnel information, wherein the service personnel information comprises transportation means adopted by each service personnel. And the control center is used for determining the arrangement scheme with the shortest total service time of the service personnel according to the customer information and the service personnel information.

Description

Scheduling system and method
Technical Field
The present invention relates to the field of trip planning technologies, and in particular, to a scheduling system and method.
Background
With the increasing demand for home services, the number of service orders that a single service person needs to complete is increasing. The service sequence of the service personnel is reasonably planned, so that the effective working time of the service personnel can be prolonged on one hand, and the waiting time of the serviced personnel can be reduced on the other hand.
The existing scheduling system is designed for industries such as take-out, express delivery, cargo delivery or vehicle utilization. These industries are characterized by the absence of fixed service times, which are mostly point-to-point mobile processes. Therefore, the key of the scheduling system is path planning.
However, for the home services industry, the scheduling system adopted by the home services industry needs to plan the moving path of the service personnel among a plurality of service objects. However, the existing scheduling system does not consider the required visiting service duration of each client during scheduling, so that the scheduling result has difficulty in ensuring that the total working duration of the service staff in one day is within a predetermined range. There is a need for an improved scheduling system and method.
Disclosure of Invention
To address some or all of the problems in the prior art, an aspect of the present invention provides a scheduling system, including:
the order module is used for receiving a customer order and determining customer information according to the customer order, wherein the customer information comprises a customer address, service required by the customer and expected service time;
the customer information module is used for storing the customer information determined by the order module;
the service personnel information module is used for storing service personnel information, wherein the service personnel information comprises transportation means adopted by each service personnel; and
and the control center is used for determining the scheduling scheme with the shortest total service time of the service personnel according to the client information and the service personnel information.
Further, the service person information further includes a desired working hour of each service person.
Further, the scheduling system further comprises a message center module, which is communicably connected to the control center, and is used for sending the schedule planning and order information to the service staff.
The invention also provides a method for scheduling service personnel, which is used for sequencing the order of each service personnel, and the scheduling method comprises the following steps:
firstly, exhausting the sequencing schemes of all orders of the service personnel;
next, calculating the total distance that the service personnel need to move in each sequencing scheme, and taking the sequencing scheme with the minimum total distance as a final sequencing scheme;
next, exhausting the traffic scheme of the service personnel in the final sequencing scheme, wherein the traffic scheme comprises the vehicles used by the service personnel in each section of the moving path; and
and finally, calculating the total working time of the service personnel in each traffic scheme, wherein the total working time comprises the customer service time and the movement time, and taking the traffic scheme with the shortest total working time as a final scheduling scheme.
Further, the final scheduling scheme satisfies: the working time of each service staff does not exceed a preset value.
Further, the final scheduling scheme satisfies: the service person arrives at the customer no later than the time the customer desires service.
Further, the scheduling method further includes:
and when a new order appears, rescheduling the new order and the rest orders to be served.
Further, when determining the transportation scheme, a part of the transportation means is excluded according to the service personnel information.
The scheduling system and method provided by the invention are based on the urban road network layout structure, adopt many-to-many distance matrix calculation, comprehensively consider the home service time required by the customer, the distance between each home service place and the possible transportation means, optimize the scheduling, and finally obtain the optimal order service sequence of the service personnel. The system and the method shorten the moving distance of the service personnel, can effectively reduce the fragmentation time of the service personnel, and can reduce the waiting time of customers.
Drawings
To further clarify the above and other advantages and features of embodiments of the present invention, a more particular description of embodiments of the present invention will be rendered by reference to the appended drawings. It is appreciated that these drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. In the drawings, the same or corresponding parts will be denoted by the same or similar reference numerals for clarity.
FIG. 1 is a schematic diagram of a scheduling system according to an embodiment of the present invention; and
fig. 2 is a flowchart illustrating a method for scheduling service staff according to an embodiment of the present invention.
Detailed Description
In the following description, the present invention is described with reference to examples. One skilled in the relevant art will recognize, however, that the embodiments can be practiced without one or more of the specific details, or with other alternative and/or additional methods. In other instances, well-known operations have not been shown or described in detail to avoid obscuring aspects of the invention. Similarly, for purposes of explanation, specific configurations are set forth in order to provide a thorough understanding of the embodiments of the invention. However, the invention is not limited to these specific details. Further, it should be understood that the embodiments shown in the figures are illustrative representations and are not necessarily drawn to scale.
Reference in the specification to "one embodiment" or "the embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase "in one embodiment" in various places in the specification are not necessarily all referring to the same embodiment.
It should be noted that the embodiment of the present invention describes the operation steps in a specific order, however, this is only for illustrating the specific embodiment, and does not limit the sequence of the steps. On the contrary, in different embodiments of the present invention, the sequence of the steps can be adjusted according to the adjustment of actual requirements.
In the present invention, the term "scheduling" refers to scheduling a service for a service person, including scheduling a service time and a service route.
The present invention is based on the following insight of the inventors: the fundamental reason that the existing scheduling, ordering systems and/or methods are not suitable for the home services industry is that they do not take into account the service duration of the home services. Specifically, existing scheduling, dispatching systems and/or methods mainly include four major categories:
the network appointment vehicle pick-up and order dispatching system uses a distance calculation mode from multiple starting points to the same terminal point, namely from multiple vehicles to the same client, firstly searches vehicles within a range of 1 kilometer of a peripheral straight line of a passenger, obtains the direction of a vehicle head through a GPS (global positioning system), further determines the road where the vehicles are located, calculates the pick-up distance, and dispatches the order in real time, if no vehicle is within the range of 1 kilometer, the searching range can be expanded after waiting for a specified time, for example, the distance is matched with the vehicles beyond 3 kilometers;
the method comprises the steps that firstly, orders with car sharing possibility are screened, specifically, orders with similar peripheral starting points and the same direction are searched as alternative car sharing orders according to a starting point and a finishing point of starting car sharing, then the distance between each passenger and each destination in the alternative orders is calculated by using a many-to-many matrix type, and the car sharing orders are obtained;
and the distributor dispatching system can calculate the distance between points to be distributed by adopting a many-to-many matrix type according to the riding mode and obtain the optimal sequence by sequencing. The distribution station or the distributor has a set working range, and the alternative orders are all orders in the working range; and
the takeaway guy pickup and dispatch system is similar to the dispatcher dispatching system, but since the pickup location is not fixed, the distance between pickup locations needs to be calculated by using a riding distance matrix, so that the forward and dispatch sequence is calculated. Because the more orders are, the higher the probability of splicing the order, the order can be accumulated to a certain extent and then the order relation is calculated to reasonably dispatch the order.
In summary, it can be seen that, the existing service system has no specific fixed service time or short service time, belongs to fast food service, and cannot take into account both service time and distance. For example, a net appointment car and a windward vehicle can receive orders according to the distance, a distributor can send orders according to the range of an area, and a takeaway guy can be delivered within a reasonable time. In addition, customer waiting times cannot be determined for dispatch systems such as net appointments and windmills.
Based on this, in order to meet the requirement of the home service for the service time, the inventor proposes a new scheduling system and method, which comprehensively consider the time length of the home service, the expected service time of the client, the distance between clients, and other factors, and calculate the optimal home service sequence. Wherein the door-to-door services include, but are not limited to: the home care and old care system is characterized in that a client can reserve expected service starting time, and meanwhile, the service duration of the same service project is fixed.
The solution of the invention is further described below with reference to the accompanying drawings of embodiments.
Fig. 1 is a schematic structural diagram of a scheduling system according to an embodiment of the present invention. As shown in fig. 1, a scheduling system includes an order module 101, a customer information module 102, a service person information module 103, and a control center 104.
The order module 101 is configured to receive a customer order and determine customer information according to the customer order, where the customer information at least includes a customer address, a service required by the customer, and expected service time. In addition, in order to provide more detailed services, the customer information may further include, for example, a customer name, an age, and/or personalized requirements, such as requirements for a sex, an age, and the like of a service person, personal preferences, and the like.
The client information module 102 is communicably connected to the order module 101, and is mainly used for storing the client information determined in the order module 101.
The service personnel information module 103 is used for storing service personnel information, wherein the service personnel information at least comprises transportation means adopted by each service personnel. The vehicle may be one or more, including but not limited to: self-driving, electric vehicles, motorcycles, public transportation, bicycles, walking, and the like. In one embodiment of the invention, the attendant information may also set a preferred transportation scheme, for example, during a day trip, no vehicle or vehicles are used, and for example, during a day trip, when a vehicle is used, no other vehicles are considered to be replaced, and the like. In order to provide better service, in one embodiment of the present invention, the service personnel information may further include information of name, gender, age, and characteristics of the service personnel to better match the customer needs. In addition, according to the service contents of different industries, part of service industries may require 24 hours to arrange the service personnel to go to the door for service, but the working time of each service personnel per day is limited, so in these industries, shift is usually arranged, which makes the starting working time of each service personnel different, therefore, in another embodiment of the invention, the service personnel information may also include the starting working time expected by the service personnel.
The control center 104 is communicably connected to the customer information module 102 and the service person information module 103, and is mainly used for determining service persons corresponding to the orders and scheduling the orders for each service person according to the customer information and the service person information.
The method of allocation of the order is not within the scope of the present disclosure and the control center 104 may allocate the order to the various service personnel using various allocation methods known to those skilled in the art. For example, the distribution is performed according to the order sequence, the distribution is performed according to the address of the client, and the like. After the order allocation is completed, the order allocated by each service person needs to be scheduled.
Fig. 2 is a flowchart illustrating a method for scheduling service staff according to an embodiment of the present invention. As shown in fig. 2, the method performs the following operations for each order of the service person:
first, at step 201, an order ordering is determined. Exhausting all possible ordering schemes of all orders of the service personnel, then calculating the total distance which needs to be moved by the service personnel in each ordering scheme, and taking the ordering scheme with the minimum total distance as a final ordering scheme:
Figure BDA0003398715100000051
wherein D isijThe distance between the client i and the client j is referred, and the client 0 is referred to as a starting point of a service person, such as a residence or a service station of the service person;
q is the total number of the orders which need to be completed by the service personnel;
next, at step 202, a traffic plan is enumerated. Exhausting possible traffic schemes of the service personnel in the final sequencing scheme, wherein the traffic schemes comprise traffic tools used by the service personnel in each section of moving path; according to the service personnel information, in one embodiment of the invention, when the traffic schemes are exhausted, part of the schemes can be eliminated according to the setting of the service personnel, for example, some or several kinds of vehicles are not adopted, and for example, when some kind of vehicles are adopted, other vehicles are not considered to be replaced, and the like; and
finally, in step 203, a scheduling scheme is determined. Calculating the total working time of the service personnel in each traffic scheme listed in the step 202, wherein the total working time comprises the customer service time and the mobile time, and taking the traffic scheme with the shortest total working time as a final scheduling scheme:
Figure BDA0003398715100000061
wherein, tkThe service duration required at customer k, and tij_nThe time period required for adopting the vehicle n from the customer i to the customer j. The vehicle may be self-driving, for exampleVehicles, electric vehicles, motorcycles, public transportation, bicycles, walking, etc., in which the vehicles used for each movement may be the same or different.
In order to ensure that the total working time of the service personnel in one day does not exceed a preset value, in one embodiment of the present invention, when determining the scheduling scheme, the following should be also satisfied:
Figure BDA0003398715100000062
wherein, tδThe time consumed by the uncertainty factors in the journey, which may include, for example, traffic jams, refuelling, vehicle failure, etc., H is a preset value, for example eight hours.
To ensure that the service personnel arrive at the customer no later than the time the customer desires to service, in one embodiment of the invention, when determining the scheduling scheme, it is also sufficient to: the service end time of the client i plus the time length from the client i to the client j plus the time consumed by the uncertain factor is not later than the expected service start time of the client j.
In an embodiment of the present invention, the scheduling method further includes a processing method for the newly added order. Specifically, when a service person receives a new order, the new order and the remaining orders to be serviced by the service person are rescheduled, and the specific scheduling method is the same as the scheduling method.
The allocation of the new order is not within the scope of the present discussion and may be allocated using any allocation method known to those skilled in the art. For example, the allocation may be based on the number of remaining orders for each service person and/or the current location and/or the time of day's vacancy, etc.
In one embodiment of the present invention, to facilitate notifying the service personnel of the scheduling result, the scheduling system may further include a message center module 105. The message center module 105 is communicatively connected to the control center 104 for sending trip planning and order information to service personnel.
The scheduling system and method provided by the invention are based on the urban road network layout structure, adopt many-to-many distance matrix calculation, comprehensively consider the home service time required by the customer, the distance between each home service place and the possible transportation means, optimize the scheduling, and finally obtain the optimal order service sequence of the service personnel. The system and the method shorten the moving distance of the service personnel, can effectively reduce the fragmentation time of the service personnel, and can reduce the waiting time of customers.
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various combinations, modifications, and changes can be made thereto without departing from the spirit and scope of the invention. Thus, the breadth and scope of the present invention disclosed herein should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims (8)

1. A scheduling system, comprising:
an order module configured to determine customer information from the customer order, wherein the customer information includes a customer address, a service required by the customer, and a desired service time;
a customer information module configured to store the customer information determined by the order module;
a service personnel information module configured to store service personnel information, wherein the service personnel information includes a vehicle employed by each service personnel; and
a control center configured to perform the following actions:
and determining a scheduling scheme with the shortest total service duration for the service personnel according to the customer information and the service personnel information.
2. The scheduling system of claim 1 wherein the attendant information further comprises a desired work hours for each attendant.
3. The scheduling system of claim 1 further comprising a message center module communicatively coupled to the control center and configured to send trip plan and order information to service personnel.
4. A method for scheduling service personnel, comprising:
exhausting the sequencing scheme of all orders of the service personnel;
calculating the total distance that the service personnel need to move in each sequencing scheme, and taking the sequencing scheme with the minimum total distance as a final sequencing scheme;
exhausting a traffic scheme in the final sequencing scheme, wherein the traffic scheme comprises vehicles used by service personnel in each section of moving path; and
and calculating the total working time of the service personnel in each traffic scheme, wherein the total working time comprises the customer service time and the movement time, and taking the traffic scheme with the shortest total working time as a final scheduling scheme.
5. The method of claim 4, wherein the final scheduling scheme satisfies: the working time of each service staff does not exceed a preset value.
6. The method of claim 4, wherein the final scheduling scheme satisfies: the service person arrives at the customer no later than the time the customer desires service.
7. The method of claim 4, further comprising:
and when a new order appears, rescheduling the new order and the rest orders to be served.
8. The method of claim 4, wherein a portion of the vehicles are excluded based on attendant information when determining the transportation scheme.
CN202111491931.2A 2021-12-08 2021-12-08 Scheduling system and method Pending CN114118868A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111491931.2A CN114118868A (en) 2021-12-08 2021-12-08 Scheduling system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111491931.2A CN114118868A (en) 2021-12-08 2021-12-08 Scheduling system and method

Publications (1)

Publication Number Publication Date
CN114118868A true CN114118868A (en) 2022-03-01

Family

ID=80363442

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111491931.2A Pending CN114118868A (en) 2021-12-08 2021-12-08 Scheduling system and method

Country Status (1)

Country Link
CN (1) CN114118868A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114819819A (en) * 2022-04-15 2022-07-29 电子科技大学 Path planning implementation method under instant logistics scene
CN115631064A (en) * 2022-12-21 2023-01-20 成都秦川物联网科技股份有限公司 Intelligent gas installation management method, internet of things system and storage medium

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114819819A (en) * 2022-04-15 2022-07-29 电子科技大学 Path planning implementation method under instant logistics scene
CN114819819B (en) * 2022-04-15 2023-03-14 电子科技大学 Path planning implementation method under instant logistics scene
CN115631064A (en) * 2022-12-21 2023-01-20 成都秦川物联网科技股份有限公司 Intelligent gas installation management method, internet of things system and storage medium
CN115631064B (en) * 2022-12-21 2023-03-28 成都秦川物联网科技股份有限公司 Intelligent gas installation management method, internet of things system and storage medium

Similar Documents

Publication Publication Date Title
Vansteenwegen et al. A survey on demand-responsive public bus systems
CN110598908B (en) Path planning method based on multiple tasks and multiple vehicles
US8386177B2 (en) Vehicle-dispatching method and vehicle-dispatching system
US5604676A (en) System and method for coordinating personal transportation
US20190108468A1 (en) Method and apparatus to operate smart mass transit systems with on-demand rides, dynamic routes and coordinated transfers
CN114118868A (en) Scheduling system and method
US9026454B2 (en) System for procuring services
CN108960976B (en) Method, device and storage medium for processing reservation order
CN107563683A (en) Passenger and goods collaboration transportation resources and system in a kind of city
US20110137699A1 (en) Method and system for cab management
US20130231965A1 (en) Transport booking management
US20190114595A1 (en) Systems and Methods for Joint Control of Multi-Modal Transportation Networks
US20090312947A1 (en) Method and apparatus for generating routes using real-time public transportation information
WO2019197854A1 (en) Vehicle dispatch management device and vehicle dispatch management method
CN111882107B (en) Driver and passenger matching method based on automatic driving shared taxi system
WO2020263177A1 (en) Transportation system and method for passenger and route scheduling
CN116307306A (en) Intelligent scheduling method, device, equipment and storage medium based on big data
CN111932040A (en) Method and system for planning car sharing route
US20150248638A1 (en) Methods and arrangement for freight transportation management
JP7359083B2 (en) Vehicle allocation planning device, vehicle allocation planning system, and vehicle allocation planning program
US20200202715A1 (en) Method, Device, Computer Program and Computer Program Product for Route Planning for a Vehicle
CN112906980A (en) Order processing method, device and system and readable storage medium
CN110598985A (en) Vehicle path planning method
CN111738646A (en) Distribution arrangement system and distribution arrangement method
CN113808381B (en) Public transport scheduling method, server and storage medium

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