SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE

A system for allocating attendees is provided. The system includes a memory that stores instructions and a processor configured to execute the instructions to perform operations. The operations may comprise: retrieving a plurality of delivery routes and a plurality of delivery sub-routes, wherein th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: KIM SUNG HAN, LEE SUN SEUNG, QIN YING, REHN ERIK
Format: Patent
Sprache:eng ; kor
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator KIM SUNG HAN
LEE SUN SEUNG
QIN YING
REHN ERIK
description A system for allocating attendees is provided. The system includes a memory that stores instructions and a processor configured to execute the instructions to perform operations. The operations may comprise: retrieving a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are a part of the delivery routes; counting the number of packages assigned to the delivery sub-routes; receiving the number and type of workers available for delivery, wherein the type includes at least one of a classification characteristic or an efficiency characteristic; allocating multiple workers to multiple sub-routes with additional deliveries, wherein the allocation of sub-routes is based on the number of criteria assigned to a plurality of operators and the difficulty of the route; generating a plurality of candidate routes on the basis of the received first input and route difficulty; and delivering at least one of the modified delivery sub-routes to an electronic device. Delivery is optimized. 출근자 할당을 위한 시스템. 시스템은 명령어를 저장하는 메모리 및 동작을 수행하기 위해 명령어를 실행하도록 구성된 프로세서를 포함한다. 동작은 복수의 배송 루트 및 복수의 배송 서브-루트를 검색하는 것 - 배송 서브-루트는 배송 루트의 부분임 -, 배송 서브-루트에 할당된 패키지의 개수를 계산하는 것, 배송을 위해 이용 가능한 작업자의 수 및 타입을 수신하는 것 - 타입은 분류 특성 또는 효율 특성 중 적어도 하나를 포함함 -, 추가적인 배송을 갖는 복수의 서브-루트에 복수의 작업자를 할당하는 것 - 서브-루트의 할당은 복수의 작업자에 할당된 기준 개수 및 루트 난이도를 기초로 함 -, 수신된 제1 입력 및 루트 난이도를 기초로, 복수의 후보 루트를 생성하는 것; 및 수정된 배송 서브-루트 중 적어도 하나를 전자 디바이스에 전달하는 것을 포함할 수 있다.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_KR20210158836A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>KR20210158836A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_KR20210158836A3</originalsourceid><addsrcrecordid>eNqNy80KwjAQBOBePIj6Dgs9C_1B6TUmWxtsEtlshXopReJJtFDfH4P4AJ5mYL5ZJoPvPaPxIKwCg9w45aF2BNKZc8dI-ooKDqIVVsaisNUXpB7IxRGE9_poDVr-_nU0liMAz9RJ7gjXyeI-Puaw-eUqSWtk2WzD9BrCPI238Azv4URFVuRZvquqci_K_9QHWPs0ig</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE</title><source>esp@cenet</source><creator>KIM SUNG HAN ; LEE SUN SEUNG ; QIN YING ; REHN ERIK</creator><creatorcontrib>KIM SUNG HAN ; LEE SUN SEUNG ; QIN YING ; REHN ERIK</creatorcontrib><description>A system for allocating attendees is provided. The system includes a memory that stores instructions and a processor configured to execute the instructions to perform operations. The operations may comprise: retrieving a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are a part of the delivery routes; counting the number of packages assigned to the delivery sub-routes; receiving the number and type of workers available for delivery, wherein the type includes at least one of a classification characteristic or an efficiency characteristic; allocating multiple workers to multiple sub-routes with additional deliveries, wherein the allocation of sub-routes is based on the number of criteria assigned to a plurality of operators and the difficulty of the route; generating a plurality of candidate routes on the basis of the received first input and route difficulty; and delivering at least one of the modified delivery sub-routes to an electronic device. Delivery is optimized. 출근자 할당을 위한 시스템. 시스템은 명령어를 저장하는 메모리 및 동작을 수행하기 위해 명령어를 실행하도록 구성된 프로세서를 포함한다. 동작은 복수의 배송 루트 및 복수의 배송 서브-루트를 검색하는 것 - 배송 서브-루트는 배송 루트의 부분임 -, 배송 서브-루트에 할당된 패키지의 개수를 계산하는 것, 배송을 위해 이용 가능한 작업자의 수 및 타입을 수신하는 것 - 타입은 분류 특성 또는 효율 특성 중 적어도 하나를 포함함 -, 추가적인 배송을 갖는 복수의 서브-루트에 복수의 작업자를 할당하는 것 - 서브-루트의 할당은 복수의 작업자에 할당된 기준 개수 및 루트 난이도를 기초로 함 -, 수신된 제1 입력 및 루트 난이도를 기초로, 복수의 후보 루트를 생성하는 것; 및 수정된 배송 서브-루트 중 적어도 하나를 전자 디바이스에 전달하는 것을 포함할 수 있다.</description><language>eng ; kor</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2021</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211231&amp;DB=EPODOC&amp;CC=KR&amp;NR=20210158836A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211231&amp;DB=EPODOC&amp;CC=KR&amp;NR=20210158836A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>KIM SUNG HAN</creatorcontrib><creatorcontrib>LEE SUN SEUNG</creatorcontrib><creatorcontrib>QIN YING</creatorcontrib><creatorcontrib>REHN ERIK</creatorcontrib><title>SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE</title><description>A system for allocating attendees is provided. The system includes a memory that stores instructions and a processor configured to execute the instructions to perform operations. The operations may comprise: retrieving a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are a part of the delivery routes; counting the number of packages assigned to the delivery sub-routes; receiving the number and type of workers available for delivery, wherein the type includes at least one of a classification characteristic or an efficiency characteristic; allocating multiple workers to multiple sub-routes with additional deliveries, wherein the allocation of sub-routes is based on the number of criteria assigned to a plurality of operators and the difficulty of the route; generating a plurality of candidate routes on the basis of the received first input and route difficulty; and delivering at least one of the modified delivery sub-routes to an electronic device. Delivery is optimized. 출근자 할당을 위한 시스템. 시스템은 명령어를 저장하는 메모리 및 동작을 수행하기 위해 명령어를 실행하도록 구성된 프로세서를 포함한다. 동작은 복수의 배송 루트 및 복수의 배송 서브-루트를 검색하는 것 - 배송 서브-루트는 배송 루트의 부분임 -, 배송 서브-루트에 할당된 패키지의 개수를 계산하는 것, 배송을 위해 이용 가능한 작업자의 수 및 타입을 수신하는 것 - 타입은 분류 특성 또는 효율 특성 중 적어도 하나를 포함함 -, 추가적인 배송을 갖는 복수의 서브-루트에 복수의 작업자를 할당하는 것 - 서브-루트의 할당은 복수의 작업자에 할당된 기준 개수 및 루트 난이도를 기초로 함 -, 수신된 제1 입력 및 루트 난이도를 기초로, 복수의 후보 루트를 생성하는 것; 및 수정된 배송 서브-루트 중 적어도 하나를 전자 디바이스에 전달하는 것을 포함할 수 있다.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNy80KwjAQBOBePIj6Dgs9C_1B6TUmWxtsEtlshXopReJJtFDfH4P4AJ5mYL5ZJoPvPaPxIKwCg9w45aF2BNKZc8dI-ooKDqIVVsaisNUXpB7IxRGE9_poDVr-_nU0liMAz9RJ7gjXyeI-Puaw-eUqSWtk2WzD9BrCPI238Azv4URFVuRZvquqci_K_9QHWPs0ig</recordid><startdate>20211231</startdate><enddate>20211231</enddate><creator>KIM SUNG HAN</creator><creator>LEE SUN SEUNG</creator><creator>QIN YING</creator><creator>REHN ERIK</creator><scope>EVB</scope></search><sort><creationdate>20211231</creationdate><title>SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE</title><author>KIM SUNG HAN ; LEE SUN SEUNG ; QIN YING ; REHN ERIK</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_KR20210158836A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; kor</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>KIM SUNG HAN</creatorcontrib><creatorcontrib>LEE SUN SEUNG</creatorcontrib><creatorcontrib>QIN YING</creatorcontrib><creatorcontrib>REHN ERIK</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>KIM SUNG HAN</au><au>LEE SUN SEUNG</au><au>QIN YING</au><au>REHN ERIK</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE</title><date>2021-12-31</date><risdate>2021</risdate><abstract>A system for allocating attendees is provided. The system includes a memory that stores instructions and a processor configured to execute the instructions to perform operations. The operations may comprise: retrieving a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are a part of the delivery routes; counting the number of packages assigned to the delivery sub-routes; receiving the number and type of workers available for delivery, wherein the type includes at least one of a classification characteristic or an efficiency characteristic; allocating multiple workers to multiple sub-routes with additional deliveries, wherein the allocation of sub-routes is based on the number of criteria assigned to a plurality of operators and the difficulty of the route; generating a plurality of candidate routes on the basis of the received first input and route difficulty; and delivering at least one of the modified delivery sub-routes to an electronic device. Delivery is optimized. 출근자 할당을 위한 시스템. 시스템은 명령어를 저장하는 메모리 및 동작을 수행하기 위해 명령어를 실행하도록 구성된 프로세서를 포함한다. 동작은 복수의 배송 루트 및 복수의 배송 서브-루트를 검색하는 것 - 배송 서브-루트는 배송 루트의 부분임 -, 배송 서브-루트에 할당된 패키지의 개수를 계산하는 것, 배송을 위해 이용 가능한 작업자의 수 및 타입을 수신하는 것 - 타입은 분류 특성 또는 효율 특성 중 적어도 하나를 포함함 -, 추가적인 배송을 갖는 복수의 서브-루트에 복수의 작업자를 할당하는 것 - 서브-루트의 할당은 복수의 작업자에 할당된 기준 개수 및 루트 난이도를 기초로 함 -, 수신된 제1 입력 및 루트 난이도를 기초로, 복수의 후보 루트를 생성하는 것; 및 수정된 배송 서브-루트 중 적어도 하나를 전자 디바이스에 전달하는 것을 포함할 수 있다.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; kor
recordid cdi_epo_espacenet_KR20210158836A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
title SYSTEMS AND METHODS FOR COMPUTERIZED BALANCED DELIVERY ROUTE ASSIGNMENT AND INCENTIVE STRUCTURE
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T12%3A53%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=KIM%20SUNG%20HAN&rft.date=2021-12-31&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EKR20210158836A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true