Détail de l'autorité
|
ISPRS 2021, Commission 4, 24th ISPRS Congress, Imaging today foreseeing tomorrow 05/07/2021 09/07/2021 Nice on-line France OA Annals Commission 4
nom du congrès :
ISPRS 2021, Commission 4, 24th ISPRS Congress, Imaging today foreseeing tomorrow
début du congrès :
05/07/2021
fin du congrès :
09/07/2021
ville du congrès :
Nice on-line
pays du congrès :
France
site des actes du congrès :
|
Documents disponibles (2)
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externesvol V-4-2021 - July 2021 - [actes] XXIV ISPRS Congress "Imaging today, foreseeing tomorrow", Commission 4, 2021 edition, 5–9 July 2021 (Bulletin de ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences) / Nicolas Paparoditis
A framework to manage uncertainty in the computation of waste collection routes after a flood / Arnaud Le Guilcher in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol V-4-2021 (July 2021)
Titre : A framework to manage uncertainty in the computation of waste collection routes after a flood Type de document : Article/Communication Auteurs : Arnaud Le Guilcher Année de publication : 2021 Projets : 1-Pas de projet / Conférence : ISPRS 2021, Commission 4, 24th ISPRS Congress, Imaging today foreseeing tomorrow 05/07/2021 09/07/2021 Nice on-line France OA Annals Commission 4 Article en page(s) : pp 61 - 68 Note générale : biblographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] cadre conceptuel
[Termes IGN] calcul d'itinéraire
[Termes IGN] catastrophe naturelle
[Termes IGN] collecte des déchets
[Termes IGN] discrétisation spatiale
[Termes IGN] incertitude géométrique
[Termes IGN] inondation
[Termes IGN] programmation stochastique
[Termes IGN] variable aléatoireRésumé : (auteur) In this paper, we describe a framework to find a good quality waste collection tour after a flood, without having to solve a complicated optimization problem from scratch in limited time. We model the computation of a waste collection tour as a capacitated routing problem, on the vertices or on the edges of a graph, with uncertain waste quantities and uncertain road availability. Multiple models have been conceived to manage uncertainty in routing problems, and we build on the ideas of discretizing the uncertain parameters and computing master solutions that can be adapted to propose an original method to compute efficient solutions. We first introduce our model for the progressive removal of the uncertainty, then outline our method to compute solutions: our method first considers a low-dimensional set of random variables that govern the behaviour of the problem parameters, discretizes these variables and computes a solution for each discrete point before the flood, and then uses these solutions as a basis to build operational solutions when there are enough information about the parameters of the routing problem. We then give computational tools to implement this method. We give a framework to compute the basis of solutions in an efficient way, by computing all the solutions simultaneously and sharing information (that can lead to good quality solutions) between the different problems based on how close their parameters are, and we also describe how real solutions can be derived from this basis. Our main contributions are our model for the progressive removal of uncertainty, our multi-step method to compute efficient solutions, and our intrusive framework to compute solutions on the discrete grid of parameters. Numéro de notice : A2021-316 Affiliation des auteurs : UGE-LASTIG (2020- ) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.5194/isprs-annals-V-4-2021-61-2021 En ligne : https://doi.org/10.5194/isprs-annals-V-4-2021-61-2021 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97946
in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences > vol V-4-2021 (July 2021) . - pp 61 - 68[article]
