Risky traveling salesman problem

DOI10.1016/J.EJOR.2011.01.025MaRDI QIDQ418099zbMATH OpenOpenAlexFDO

Authors Nikolaos Papadakos, George Tzallas-Regas, Joanne Thoms, Berç Rustem

Publication date 14 May 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.01.025

zbMATH Keywords

uncertaintystochastic vehicle routingtravelling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• scientific article; zbMATH DE number 4066604
• scientific article; zbMATH DE number 1264413

Cites work

• scientific article; zbMATH DE number 1749232 (Why is no real title available?)
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• A Vehicle Routing Problem with Stochastic Demand
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Stochastic vehicle routing
• The Stochastic Vehicle Routing Problem for Minimum Unmet Demand
• The vehicle routing problem: An overview of exact and approximate algorithms

Cited in

(2)

• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Risky traveling salesman problem

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