A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
From MaRDI portal
Publication:5382709
Recommendations
- A stochastic programming approach for the traveling purchaser problem
- scientific article; zbMATH DE number 4149903
- A stochastic dynamic traveling salesman problem with hard time windows
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- scientific article; zbMATH DE number 7368819
- A dynamic traveling salesman problem with stochastic arc costs
- scientific article; zbMATH DE number 1264413
- Traveling salesman problems with profits and stochastic customers
- Randomized progressive hedging methods for multi-stage stochastic programming
- scientific article; zbMATH DE number 4079184
Cited in
(9)- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT
- A progressive hedging method for the optimization of social engagement and opportunistic IoT problems
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
- Routing problem for unmanned aerial vehicle patrolling missions -- a progressive hedging algorithm
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- The risk-averse traveling repairman problem with profits
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- A machine learning optimization approach for last-mile delivery and third-party logistics
This page was built for publication: A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382709)
