Dynamic courier routing for a food delivery service

•First food delivery model allowing customers to order from multiple restaurants.•A future-looking heuristic improves overall system performance over a myopic one.•Non-split deliveries arrive no later than the latest split-delivery, on average.•Customers may be given accurate delivery estimates at n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research 2019-07, Vol.107, p.173-188
Hauptverfasser: Steever, Zachary, Karwan, Mark, Murray, Chase
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 188
container_issue
container_start_page 173
container_title Computers & operations research
container_volume 107
creator Steever, Zachary
Karwan, Mark
Murray, Chase
description •First food delivery model allowing customers to order from multiple restaurants.•A future-looking heuristic improves overall system performance over a myopic one.•Non-split deliveries arrive no later than the latest split-delivery, on average.•Customers may be given accurate delivery estimates at no cost to system efficiency. Services like Grubhub and UberEats have revolutionized the way that diners can find and order from restaurants. The standard business model for such services, however, allows diners to order from only one restaurant at a time. Inspired by a food delivery service in the southeastern United States, this paper proposes the framework for a more flexible business model in which multiple restaurants may be included in a single customer’s order. We formally define this new problem, the virtual food court delivery problem (VFCDP), and provide a mixed integer linear programming formulation. For implementation in a dynamic setting, an auction-based heuristic has also been developed. This so-called “proactive” heuristic anticipates future system states, and seeks solutions which are effective at both serving customers in the present and preparing couriers to handle future demand. This is facilitated through the calculation of metrics describing equity and dispersion. Furthermore, this heuristic is capable of handling both split and non-split delivery policies. An extensive numerical study is conducted in a simulation environment to examine characteristics of this new business model. This study reveals that the proactive heuristic is effective at improving system performance (over an entirely myopic heuristic) according to several customer experience-based metrics (e.g. freshness, earliness, etc.). Furthermore, a non-split delivery policy is shown to deliver all of a customer’s items no later than the last item would have arrived in the split-delivery case, on average. It does this while also avoiding any waiting time for the customer between deliveries, and while reducing the number of miles traveled by a courier fleet throughout the day. Additional managerial policies, such as the type of delivery window offered to customers, are also discussed.
doi_str_mv 10.1016/j.cor.2019.03.008
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2221790981</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054819300681</els_id><sourcerecordid>2221790981</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-cb2375a035ddb1b959cc07a3c9e80c695a07e97ec517c7c0391c951a8996183b3</originalsourceid><addsrcrecordid>eNp9kE1PwzAMhiMEEmPwA7hV4txiN6RpxAmNT2kSF5C4Ra3roVRbM5J20v49mcYZH-yD_dqvHyGuEQoErG77gnwoSkBTgCwA6hMxw1rLXFfq61TMQILKQd3V5-Iixh5S6BJnQj7uh2bjKCM_BcchC34a3fCdrXzImpR9l3W8djsO-yxy2DniS3G2ataRr_7qXHw-P30sXvPl-8vb4mGZk1R6zKktpVYNSNV1LbZGGSLQjSTDNVBlUkuz0UwKNWkCaZCMwqY2psJatnIubo57t8H_TBxH2yeTQzppy7JEbcDUmKbwOEXBxxh4ZbfBbZqwtwj2wMb2NrGxBzYWpE1skub-qOFkf5fetpEcD8SdC0yj7bz7R_0LKttq8w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2221790981</pqid></control><display><type>article</type><title>Dynamic courier routing for a food delivery service</title><source>Elsevier ScienceDirect Journals</source><creator>Steever, Zachary ; Karwan, Mark ; Murray, Chase</creator><creatorcontrib>Steever, Zachary ; Karwan, Mark ; Murray, Chase</creatorcontrib><description>•First food delivery model allowing customers to order from multiple restaurants.•A future-looking heuristic improves overall system performance over a myopic one.•Non-split deliveries arrive no later than the latest split-delivery, on average.•Customers may be given accurate delivery estimates at no cost to system efficiency. Services like Grubhub and UberEats have revolutionized the way that diners can find and order from restaurants. The standard business model for such services, however, allows diners to order from only one restaurant at a time. Inspired by a food delivery service in the southeastern United States, this paper proposes the framework for a more flexible business model in which multiple restaurants may be included in a single customer’s order. We formally define this new problem, the virtual food court delivery problem (VFCDP), and provide a mixed integer linear programming formulation. For implementation in a dynamic setting, an auction-based heuristic has also been developed. This so-called “proactive” heuristic anticipates future system states, and seeks solutions which are effective at both serving customers in the present and preparing couriers to handle future demand. This is facilitated through the calculation of metrics describing equity and dispersion. Furthermore, this heuristic is capable of handling both split and non-split delivery policies. An extensive numerical study is conducted in a simulation environment to examine characteristics of this new business model. This study reveals that the proactive heuristic is effective at improving system performance (over an entirely myopic heuristic) according to several customer experience-based metrics (e.g. freshness, earliness, etc.). Furthermore, a non-split delivery policy is shown to deliver all of a customer’s items no later than the last item would have arrived in the split-delivery case, on average. It does this while also avoiding any waiting time for the customer between deliveries, and while reducing the number of miles traveled by a courier fleet throughout the day. Additional managerial policies, such as the type of delivery window offered to customers, are also discussed.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2019.03.008</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Business models ; Computer simulation ; Customer satisfaction ; Dynamic vehicle routing ; Food ; Freshness ; Heuristic ; Heuristic algorithms ; Home delivery services ; Integer programming ; Linear programming ; Mathematical models ; Mixed integer ; Non-split deliveries ; Operations research ; Pickups and deliveries ; Policies ; Restaurants ; Split deliveries ; Time windows</subject><ispartof>Computers &amp; operations research, 2019-07, Vol.107, p.173-188</ispartof><rights>2019 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Jul 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-cb2375a035ddb1b959cc07a3c9e80c695a07e97ec517c7c0391c951a8996183b3</citedby><cites>FETCH-LOGICAL-c357t-cb2375a035ddb1b959cc07a3c9e80c695a07e97ec517c7c0391c951a8996183b3</cites><orcidid>0000-0001-6973-2937</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0305054819300681$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Steever, Zachary</creatorcontrib><creatorcontrib>Karwan, Mark</creatorcontrib><creatorcontrib>Murray, Chase</creatorcontrib><title>Dynamic courier routing for a food delivery service</title><title>Computers &amp; operations research</title><description>•First food delivery model allowing customers to order from multiple restaurants.•A future-looking heuristic improves overall system performance over a myopic one.•Non-split deliveries arrive no later than the latest split-delivery, on average.•Customers may be given accurate delivery estimates at no cost to system efficiency. Services like Grubhub and UberEats have revolutionized the way that diners can find and order from restaurants. The standard business model for such services, however, allows diners to order from only one restaurant at a time. Inspired by a food delivery service in the southeastern United States, this paper proposes the framework for a more flexible business model in which multiple restaurants may be included in a single customer’s order. We formally define this new problem, the virtual food court delivery problem (VFCDP), and provide a mixed integer linear programming formulation. For implementation in a dynamic setting, an auction-based heuristic has also been developed. This so-called “proactive” heuristic anticipates future system states, and seeks solutions which are effective at both serving customers in the present and preparing couriers to handle future demand. This is facilitated through the calculation of metrics describing equity and dispersion. Furthermore, this heuristic is capable of handling both split and non-split delivery policies. An extensive numerical study is conducted in a simulation environment to examine characteristics of this new business model. This study reveals that the proactive heuristic is effective at improving system performance (over an entirely myopic heuristic) according to several customer experience-based metrics (e.g. freshness, earliness, etc.). Furthermore, a non-split delivery policy is shown to deliver all of a customer’s items no later than the last item would have arrived in the split-delivery case, on average. It does this while also avoiding any waiting time for the customer between deliveries, and while reducing the number of miles traveled by a courier fleet throughout the day. Additional managerial policies, such as the type of delivery window offered to customers, are also discussed.</description><subject>Business models</subject><subject>Computer simulation</subject><subject>Customer satisfaction</subject><subject>Dynamic vehicle routing</subject><subject>Food</subject><subject>Freshness</subject><subject>Heuristic</subject><subject>Heuristic algorithms</subject><subject>Home delivery services</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Mathematical models</subject><subject>Mixed integer</subject><subject>Non-split deliveries</subject><subject>Operations research</subject><subject>Pickups and deliveries</subject><subject>Policies</subject><subject>Restaurants</subject><subject>Split deliveries</subject><subject>Time windows</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kE1PwzAMhiMEEmPwA7hV4txiN6RpxAmNT2kSF5C4Ra3roVRbM5J20v49mcYZH-yD_dqvHyGuEQoErG77gnwoSkBTgCwA6hMxw1rLXFfq61TMQILKQd3V5-Iixh5S6BJnQj7uh2bjKCM_BcchC34a3fCdrXzImpR9l3W8djsO-yxy2DniS3G2ataRr_7qXHw-P30sXvPl-8vb4mGZk1R6zKktpVYNSNV1LbZGGSLQjSTDNVBlUkuz0UwKNWkCaZCMwqY2psJatnIubo57t8H_TBxH2yeTQzppy7JEbcDUmKbwOEXBxxh4ZbfBbZqwtwj2wMb2NrGxBzYWpE1skub-qOFkf5fetpEcD8SdC0yj7bz7R_0LKttq8w</recordid><startdate>20190701</startdate><enddate>20190701</enddate><creator>Steever, Zachary</creator><creator>Karwan, Mark</creator><creator>Murray, Chase</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-6973-2937</orcidid></search><sort><creationdate>20190701</creationdate><title>Dynamic courier routing for a food delivery service</title><author>Steever, Zachary ; Karwan, Mark ; Murray, Chase</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-cb2375a035ddb1b959cc07a3c9e80c695a07e97ec517c7c0391c951a8996183b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Business models</topic><topic>Computer simulation</topic><topic>Customer satisfaction</topic><topic>Dynamic vehicle routing</topic><topic>Food</topic><topic>Freshness</topic><topic>Heuristic</topic><topic>Heuristic algorithms</topic><topic>Home delivery services</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Mathematical models</topic><topic>Mixed integer</topic><topic>Non-split deliveries</topic><topic>Operations research</topic><topic>Pickups and deliveries</topic><topic>Policies</topic><topic>Restaurants</topic><topic>Split deliveries</topic><topic>Time windows</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Steever, Zachary</creatorcontrib><creatorcontrib>Karwan, Mark</creatorcontrib><creatorcontrib>Murray, Chase</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers &amp; operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Steever, Zachary</au><au>Karwan, Mark</au><au>Murray, Chase</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic courier routing for a food delivery service</atitle><jtitle>Computers &amp; operations research</jtitle><date>2019-07-01</date><risdate>2019</risdate><volume>107</volume><spage>173</spage><epage>188</epage><pages>173-188</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><abstract>•First food delivery model allowing customers to order from multiple restaurants.•A future-looking heuristic improves overall system performance over a myopic one.•Non-split deliveries arrive no later than the latest split-delivery, on average.•Customers may be given accurate delivery estimates at no cost to system efficiency. Services like Grubhub and UberEats have revolutionized the way that diners can find and order from restaurants. The standard business model for such services, however, allows diners to order from only one restaurant at a time. Inspired by a food delivery service in the southeastern United States, this paper proposes the framework for a more flexible business model in which multiple restaurants may be included in a single customer’s order. We formally define this new problem, the virtual food court delivery problem (VFCDP), and provide a mixed integer linear programming formulation. For implementation in a dynamic setting, an auction-based heuristic has also been developed. This so-called “proactive” heuristic anticipates future system states, and seeks solutions which are effective at both serving customers in the present and preparing couriers to handle future demand. This is facilitated through the calculation of metrics describing equity and dispersion. Furthermore, this heuristic is capable of handling both split and non-split delivery policies. An extensive numerical study is conducted in a simulation environment to examine characteristics of this new business model. This study reveals that the proactive heuristic is effective at improving system performance (over an entirely myopic heuristic) according to several customer experience-based metrics (e.g. freshness, earliness, etc.). Furthermore, a non-split delivery policy is shown to deliver all of a customer’s items no later than the last item would have arrived in the split-delivery case, on average. It does this while also avoiding any waiting time for the customer between deliveries, and while reducing the number of miles traveled by a courier fleet throughout the day. Additional managerial policies, such as the type of delivery window offered to customers, are also discussed.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2019.03.008</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0001-6973-2937</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0305-0548
ispartof Computers & operations research, 2019-07, Vol.107, p.173-188
issn 0305-0548
1873-765X
0305-0548
language eng
recordid cdi_proquest_journals_2221790981
source Elsevier ScienceDirect Journals
subjects Business models
Computer simulation
Customer satisfaction
Dynamic vehicle routing
Food
Freshness
Heuristic
Heuristic algorithms
Home delivery services
Integer programming
Linear programming
Mathematical models
Mixed integer
Non-split deliveries
Operations research
Pickups and deliveries
Policies
Restaurants
Split deliveries
Time windows
title Dynamic courier routing for a food delivery service
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T17%3A05%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20courier%20routing%20for%20a%20food%20delivery%20service&rft.jtitle=Computers%20&%20operations%20research&rft.au=Steever,%20Zachary&rft.date=2019-07-01&rft.volume=107&rft.spage=173&rft.epage=188&rft.pages=173-188&rft.issn=0305-0548&rft.eissn=1873-765X&rft_id=info:doi/10.1016/j.cor.2019.03.008&rft_dat=%3Cproquest_cross%3E2221790981%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2221790981&rft_id=info:pmid/&rft_els_id=S0305054819300681&rfr_iscdi=true