Title	Wasserstein Distance and the Distributionally Robust TSP
Creator	Carlsson, John Gunnar
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-03-06T17:01
Description	Motivated by a districting problem in multi-vehicle routing, we consider a distributionally robust version of the Euclidean travelling salesman problem in which we compute the worst-case spatial distribution of demand against all distributions whose Wasserstein distance to an observed demand distribution is bounded from above. This constraint allows us to circumvent common overestimation that arises when other procedures are used, such as fixing the center of mass and the covariance matrix of the distribution. Numerical experiments confirm that our new approach is useful when used in a decision support tool for dividing a territory into service districts for a fleet of vehicles when limited data is available.
Extent	32 minutes
Subject	Mathematics; Operations research, mathematical programming; Probability theory and stochastic processes; Operation research
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Southern California
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-09-03
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0371893
URI	http://hdl.handle.net/2429/67077
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos

Wasserstein Distance and the Distributionally Robust TSP Carlsson, John Gunnar

Description

Item Metadata

Item Media

Item Citations and Data

Rights