Arthur Delarue

Arthur Delarue

Auto-generated profile, based on publicly available information

Arthur Delarue

Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2021 in Health Care Management Science
Verified
Journal Article
Closed access
PDF file
DBDimitris Bertsimas
Dimitris Bertsimas
LBLeonard Boussioux
Leonard Boussioux
RCRyan Cory-Wright
Ryan Cory-Wright
ADArthur Delarue
Arthur Delarue
VDVassilis Digalakis
Vassilis Digalakis
CZCynthia Zeng
Cynthia Zeng

12 March 2019 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
SMSebastien Martin
Sebastien Martin
Significance: Spreading start times allows school districts to reduce transportation costs by reusing buses between schools. However, assigning each school a time involves both estimating the impact on transportation costs and reconciling additional competing objectives. These challenges force many school districts to make myopic decisions, leading to an expensive and inequitable status quo. For instance, most American teenagers start school before 8:00 AM, despite evidence of significant associated health issues. We propose an algorithm to jointly solve the school bus routing and bell time selection problems. Our application in Boston led to $5 million in yearly savings (maintaining service quality despite a 50-bus fleet reduction) and to the unanimous approval of the first school start time reform in 30 years.

18 March 2019 in Operations Research
Verified
Journal Article
Closed access
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
PJPatrick Jaillet
Patrick Jaillet
SMSébastien Martin
Sébastien Martin
The need to understand complex city traffic patterns has led to an increase in the amount and the diversity of traffic data being collected. For instance, taxi companies in an increasing number of major cities have started recording metadata for every individual car ride, such as its origin, destination, and travel time. By leveraging network optimization insights, we can extract accurate travel time estimations from such origin–destination data. For example, we can reconstruct traffic patterns at the scale of Manhattan using only origin–destination information for a few hundred thousand taxi trips, without any information about vehicles’ individual paths. Twenty-first century urban planners have identified the understanding of complex city traffic patterns as a major priority, leading to a sharp increase in the amount and the diversity of traffic data being collected. For instance, taxi companies in an increasing number of major cities have started recording metadata for every individual car ride, such as its origin, destination, and travel time. In this paper, we show that we can leverage network optimization insights to extract accurate travel time estimations from such origin–destination data, using information from a large number of taxi trips to reconstruct the traffic patterns in an entire city. We develop a method that tractably exploits origin–destination data, which, because of its optimization framework, could also take advantage of other sources of traffic information. Using synthetic data, we establish the robustness of our algorithm to high variance data, and the interpretability of its results. We then use hundreds of thousands of taxi travel...

29 November 2024 in Management Science
Verified
Journal Article
Closed access
IBIdo Bright
Ido Bright
ADArthur Delarue
Arthur Delarue
ILIlan Lobel
Ilan Lobel
Marketplace companies rely heavily on experimentation when making changes to the design or operation of their platforms. The workhorse of experimentation is the randomized controlled trial (RCT), or A/B test, in which users are randomly assigned to treatment or control groups. However, marketplace interference causes the stable unit treatment value assumption to be violated, leading to bias in the standard RCT metric. In this work, we propose techniques for platforms to run standard RCTs and still obtain meaningful estimates despite the presence of marketplace interference. We specifically consider a generalized matching setting, in which the platform explicitly matches supply with demand via a linear programming algorithm. Our first proposal is for the platform to estimate the value of global treatment and global control via optimization. We prove that this approach is unbiased in the fluid limit. Our second proposal is to compare the average shadow price of the treatment and control groups rather than the total value accrued by each group. We prove that this technique corresponds to the correct first order approximation (in a Taylor series sense) of the value function of interest even in a finite-size system. We then use this result to prove that, under reasonable assumptions, our estimator is less biased than the RCT estimator. At the heart of our result is the idea that it is relatively easy to model interference in matching-driven marketplaces because, in such markets, the platform mediates the spillover. This paper was accepted by Itai Ashlagi, revenue management and market analytics. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2022.01881 .

1 March 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
CBCynthia Barnhart
Cynthia Barnhart
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
JYJulia Yan
Julia Yan
Problem definition: Physical distancing requirements during the COVID-19 pandemic have dramatically reduced the effective capacity of university campuses. Under these conditions, we examine how to make the most of newly scarce resources in the related problems of curriculum planning and course timetabling. Academic/practical relevance: We propose a unified model for university course scheduling problems under a two-stage framework and draw parallels between component problems while showing how to accommodate individual specifics. During the pandemic, our models were critical to measuring the impact of several innovative proposals, including expanding the academic calendar, teaching across multiple rooms, and rotating student attendance through the week and school year. Methodology: We use integer optimization combined with enrollment data from thousands of past students. Our models scale to thousands of individual students enrolled in hundreds of courses. Results: We projected that if Massachusetts Institute of Technology moved from its usual two-semester calendar to a three-semester calendar, with each student attending two semesters in person, more than 90% of student course demand could be satisfied on campus without increasing faculty workloads. For the Sloan School of Management, we produced a new schedule that was implemented in fall 2020. The schedule allowed half of Sloan courses to include an in-person component while adhering to safety guidelines. Despite a fourfold reduction in classroom capacity, it afforded two thirds of Sloan students the opportunity for in-person learning in at least half their courses. Managerial implications: Integer optimization can enable decision making at a large scale in a domain that is usually managed manually by university administrators. Our models, although inspired by the pandemic, are generic and could apply to any scheduling problem under severe capacity constraints.

1 January 2020 in INFORMS Journal on Applied Analytics
Verified
Journal Article
Closed access
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
WEWilliam Eger
William Eger
JHJohn Hanlon
John Hanlon
SMSebastien Martin
Sebastien Martin
The authors discuss how Boston Public Schools (BPS) and a team from Massachusetts Institute of Technology addressed the BPS bus routing problem. They developed an algorithm that decomposes and separately solves subproblems of assigning students to bus stops, assigning stops to bus trips, and connecting trips into an itinerary for each bus.