The capacitated vehicle routing problem with evidential demands
From MaRDI portal
Publication:1642773
DOI10.1016/j.ijar.2018.02.003zbMath1452.90228OpenAlexW2789789365MaRDI QIDQ1642773
Nathalie Helal, Éric Lefèvre, Frédéric Pichon, David Mercier, Daniel Cosmin Porumbel
Publication date: 15 June 2018
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2018.02.003
vehicle routing problemstochastic programming with recoursebelief functionchance constrained programming
Related Items (7)
The vehicle routing problem with time windows and evidential service and travel times: a recourse model ⋮ On modelling and solving the shortest path problem with evidential weights ⋮ From Relations Between Sets to Relations Between Belief Functions ⋮ Optimization problems with evidential linear objective ⋮ Belief functions clustering for epipole localization ⋮ From set relations to belief function relations ⋮ A binary water wave optimization for feature selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Cautious label ranking with label-wise decomposition
- 40 years of Dempster-Shafer theory
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Relevance and truthfulness in information correction and fusion
- Idempotent conjunctive combination of belief functions: extending the minimum rule of possibility theory
- Belief linear programming
- Constrained optimization problems under uncertainty with coherent lower previsions
- Random sets and fuzzy interval analysis
- Independence concepts in evidence theory
- Decision making under uncertainty using imprecise probabilities
- Joint propagation of probability and possibility in risk analysis: towards a formal framework
- Extending stochastic ordering to belief functions on the real line
- The vehicle routing problem: An overview of exact and approximate algorithms
- Stochastic vehicle routing
- The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach
- Ranking of fuzzy intervals seen through the imprecise probabilistic lens
- Independence and 2-monotonicity: nice to have, hard to keep
- A recourse approach for the capacitated vehicle routing problem with evidential demands
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Theory and Applications of Robust Optimization
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Tabu Search—Part I
- Tabu Search—Part II
- Introduction to Stochastic Programming
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- A Generalization of Some Distribution Aspects of Chance-Constrained Linear Programming
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
This page was built for publication: The capacitated vehicle routing problem with evidential demands
