# The Maximum Feasible Scenario Approach for the Capacitated Vehicle Routing Problem with Uncertain Demands

### Zuzana BorÄinovÃ¡, Å tefan PeÅ¡ko

#### Abstract

This study deals with the Capacitated Vehicle Routing Problem where customer demands are uncertain with unknown probability distribution. We follow the robust optimization methodology to formulate and solve the Robust Vehicle Routing Problem with Demand Uncertainty. Since the robust solution is a route plan, which optimizes the worst case that could arise, our focus is concentrated on determining the worst-case demands to solve the robust optimization model. The computational experiments examined two proposed strategies to indicate their performance in terms of the extra cost and unmet demands.

Download#### Paper Citation

#### in Harvard Style

BorÄinovÃ¡ Z. and PeÅ¡ko Å . (2020). **The Maximum Feasible Scenario Approach for the Capacitated Vehicle Routing Problem with Uncertain Demands**.In *Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,* ISBN 978-989-758-396-4, pages 159-164. DOI: 10.5220/0008943801590164

#### in Bibtex Style

@conference{icores20,

author={Zuzana BorÄinovÃ¡ and Å tefan PeÅ¡ko},

title={The Maximum Feasible Scenario Approach for the Capacitated Vehicle Routing Problem with Uncertain Demands},

booktitle={Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},

year={2020},

pages={159-164},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0008943801590164},

isbn={978-989-758-396-4},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,

TI - The Maximum Feasible Scenario Approach for the Capacitated Vehicle Routing Problem with Uncertain Demands

SN - 978-989-758-396-4

AU - BorÄinovÃ¡ Z.

AU - PeÅ¡ko Å .

PY - 2020

SP - 159

EP - 164

DO - 10.5220/0008943801590164