Introducing radiality constraints in capacitated location-routing problems
In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP) and for the Capacitated Location Routing Problem (CLRP), adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations a...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Brasil |
| Recursos: | Universidade Federal de Minas Gerais (UFMG) |
| Repositorio: | Repositório Institucional da UFMG |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.ufmg.br:1843/80149 |
| Acesso em linha: | https://doi.org/10.5267/j.ijiec.2017.3.004 http://hdl.handle.net/1843/80149 https://orcid.org/0000-0002-6333-0977 https://orcid.org/0000-0002-1000-2339 https://orcid.org/0000-0002-0160-8929 |
| Access Level: | acceso abierto |
| Palavra-chave: | Capacitated vehicle routing problem Capacitated location-routing problem Combinatorial optimization Radiality constraints Spanning tree Vehicle routing problem Engenharia elétrica Veículos Veículos elétricos Engenharia de computação |
| Resumo: | In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP) and for the Capacitated Location Routing Problem (CLRP), adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations already employed in electric power distribution networks, which requires a radial topology in its operation. The results show that the proposed formulation greatly improves the convergence of the solver. |
|---|