Cargando…
The bi-objective stochastic covering tour problem
We formulate a bi-objective covering tour model with stochastic demand where the two objectives are given by (i) cost (opening cost for distribution centers plus routing cost for a fleet of vehicles) and (ii) expected uncovered demand. In the model, it is assumed that depending on the distance, a ce...
Autores principales: | Tricoire, Fabien, Graf, Alexandra, Gutjahr, Walter J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Pergamon Press
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3587456/ https://www.ncbi.nlm.nih.gov/pubmed/23471203 http://dx.doi.org/10.1016/j.cor.2011.09.009 |
Ejemplares similares
-
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
por: Parragh, Sophie N., et al.
Publicado: (2021) -
Description of the datasets for the experiments in the paper “solving the multi-vehicle multi-covering tour problem”
por: Pham, Tuan Anh, et al.
Publicado: (2018) -
Bi-objective facility location under uncertainty with an application in last-mile disaster relief
por: Nazemi, Najmesadat, et al.
Publicado: (2021) -
A set-covering based heuristic algorithm for the periodic vehicle routing problem
por: Cacchiani, V., et al.
Publicado: (2014) -
Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times
por: Yang, Xin, et al.
Publicado: (2016)