Fast Shapley value approximation through machine learning with application in routing problems
From MaRDI portal
Cites work
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- A learning based algorithm for drone routing
- A machine learning optimization approach for last-mile delivery and third-party logistics
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
- A Prescriptive Machine Learning Approach to Mixed-Integer Convex Optimization
- A review on cost allocation methods in collaborative transportation
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- A study of proxies for Shapley allocations of transport costs
- A unified cooperative model for environmental costs in supply chains: the Shapley value for the linear case
- Allocating cost of service to customers in inventory routing
- Applied Linear Regression
- Approximation of the Shapley value for the Euclidean travelling salesman game
- Collaborative operating room planning and scheduling
- Conference structures and fair allocation rules
- Cooperation and game-theoretic cost allocation in stochastic inventory models with continuous review
- Cooperation and sharing costs in a tandem queueing network
- Cores of convex games
- Cost allocation for horizontal carrier coalitions based on approximated Shapley values
- Cost allocation in collaborative forest transportation
- Cost allocation problems on highways with grouped users
- Feature Selection via Coalitional Game Theory
- Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game
- Game Theory and Cost Allocation Problems
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Horizontal cooperation among freight carriers: request allocation and profit sharing
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 7625196 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Learning to repeatedly solve routing problems
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Measuring players' importance in basketball using the generalized Shapley value
- Monotonic solutions of cooperative games
- On the nucleolus of the basic vehicle routing game
- Polynomial calculation of the Shapley value based on sampling
- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
- Random forests
- Scikit-learn: machine learning in Python
- Sharing costs in highways: a game theoretic approach
- Some properties of transportation network cooperative games
- The Egalitarian Shapley value: a generalization based on coalition sizes
- The Elements of Statistical Learning
- The many Shapley values for explainable artificial intelligence: a sensitivity analysis perspective
- The Nucleolus of a Characteristic Function Game
- The traveling salesman game: An application of cost allocation in a gas and oil company
This page was built for publication: Fast Shapley value approximation through machine learning with application in routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889356)
