A note on solving DiDi's driver-order matching problem

DOI10.1007/S11590-020-01590-3MaRDI QIDQ1996745zbMATH OpenOpenAlexFDO

Authors Yanchao Liu

Publication date 26 February 2021

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-020-01590-3

zbMATH Keywords

combinatorial optimizationmixed integer nonlinear programmingsubmodular welfare problemtransportation applications

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• A data-driven matching algorithm for ride pooling problem
• An incremental SAT-based approach for solving the real-time taxi-sharing service problem
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers

Cites work

• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 5066287 (Why is no real title available?)
• A convex envelope formula for multilinear functions
• A hybrid LP/NLP paradigm for global optimization relaxations
• A threshold of ln n for approximating set cover
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An algorithmic framework for convex mixed integer nonlinear programs
• An analysis of approximations for maximizing submodular set functions—I
• BARON: A general purpose global optimization software package
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• CONOPT—A Large-Scale GRG Code
• Combinatorial auctions with decreasing marginal utilities
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Interfaces to PATH 3.0: Design, implementation and usage
• Maximizing a monotone submodular function subject to a matroid constraint
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimal approximation for the submodular welfare problem in the value oracle model
• Some results on the strength of relaxations of multilinear functions
• The global solver in the LINDO API
• The multilinear polytope for acyclic hypergraphs

Cited in

(3)

• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• A data-driven matching algorithm for ride pooling problem
• An incremental SAT-based approach for solving the real-time taxi-sharing service problem

Describes a project that uses

Uses Software

• ANTIGONE
• SBB
• PATH Solver
• LINDOGlobal
• DICOPT
• Ipopt
• Bonmin
• LINDO
• CONOPT
• KNITRO
• BARON

This page was built for publication: A note on solving DiDi's driver-order matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996745)