Estimation-based metaheuristics for stochastic combinatorial optimization: case studies in sochastic routing problems

Estimation-based metaheuristics for stochastic combinatorial optimization: case studies in sochastic routing problems

Stochastic combinatorial optimization problems are combinatorial optimization problems where part of the problem data are probabilistic. The focus of this thesis is on stochastic routing problems, a class of stochastic combinatorial optimization problems that arise in distribution management. Stocha...

Full description

Bibliographic Details
Main Author: Balaprakash, Prasanna
Other Authors: Dorigo, Marco
Format: Doctoral Thesis
Language:fr
Published: Universite Libre de Bruxelles 2010
Subjects:
Informatique générale
Sciences de l'ingénieur
Combinatorial optimization
Computer algorithms
Stochastic processes
Estimation theory
Optimisation combinatoire
Algorithmes
Processus stochastiques
Théorie de l'estimation
Stochastic routing problems
Empirical estimation
Iterative improvement algorithms
Metaheuristics
Online Access:http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210179

Internet

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210179

Similar Items