The capacitated vehicle routing problem with evidential demands
type: Item
instance of: scholarly article
title: The capacitated vehicle routing problem with evidential demands
zbMATH Open document ID: 1452.90228
author: Nathalie Helal
author: Frédéric Pichon
author: David Mercier
author: Éric Lefèvre
author: Daniel Cosmin Porumbel
published in: International Journal of Approximate Reasoning
publication date: 2018-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6890220
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: chance constrained programming
zbMATH Keywords: stochastic programming with recourse
zbMATH Keywords: belief function
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ijar.2018.02.003
OpenAlex ID: W2789789365
cites work: Joint propagation of probability and possibility in risk analysis: towards a formal framework
cites work: Theory and Applications of Robust Optimization
cites work: Introduction to Stochastic Programming
cites work: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
cites work: Independence concepts in evidence theory
cites work: Upper and Lower Probabilities Induced by a Multivalued Mapping
cites work: Extending stochastic ordering to belief functions on the real line
cites work: 40 years of Dempster-Shafer theory
cites work: Independence and 2-monotonicity: nice to have, hard to keep
cites work: Ranking of fuzzy intervals seen through the imprecise probabilistic lens
cites work: Idempotent conjunctive combination of belief functions: extending the minimum rule of possibility theory
cites work: Cautious label ranking with label-wise decomposition
cites work: Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
cites work: Random sets and fuzzy interval analysis
cites work: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
cites work: Stochastic vehicle routing
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach
cites work: A recourse approach for the capacitated vehicle routing problem with evidential demands
cites work: Optimization by Simulated Annealing
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
cites work: Belief linear programming
cites work: Relevance and truthfulness in information correction and fusion
cites work: Constrained optimization problems under uncertainty with coherent lower previsions
cites work: A Generalization of Some Distribution Aspects of Chance-Constrained Linear Programming
cites work: Q4131415
cites work: Q4532223
cites work: Decision making under uncertainty using imprecise probabilities
cites work: Q3999364
DOI: 10.1016/J.IJAR.2018.02.003
Recommended article: A recourse approach for the capacitated vehicle routing problem with evidential demands
Recommended article: The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach
Recommended article: On the capacitated vehicle routing problem
Recommended article: The robust capacitated vehicle routing problem under demand uncertainty
Recommended article: The capacitated vehicle routing problem with stochastic demands and time windows
Recommended article: Vehicle routing with probabilistic capacity constraints
Recommended article: Q4452962
Recommended article: Capacitated vehicle routing problem on line with unsplittable demands
Recommended article: The vehicle routing problem with demand range
Recommended article: On the vehicle routing problem with lower bound capacities
description: scientific article; zbMATH DE number 6890220