Metraipolis › archive › dc_423f66da693f

Routes planning in a condominium company using mathematical optimization — arXiv:2610.20080

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20080
License (as archived)
CC0-1.0
Archived
2026-10-15T21:49:14.274Z
SHA-256 of the archived text
e207c3fffab383473e631c646d0efcf17a367c2e57cb1d424a0a014ea15252cb
Stable URL of this page
https://metraipolis.com/documento/dc_423f66da693f

How to cite

Routes planning in a condominium company using mathematical optimization — arXiv:2610.20080 — arXiv (en), https://arxiv.org/abs/2610.20080 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_423f66da693f (Metraipolis archive dc_423f66da693f, sha256 e207c3fffab383473e631c646d0efcf17a367c2e57cb1d424a0a014ea15252cb)
BibTeX
@misc{dc423f66da693f,
  title = {Routes planning in a condominium company using mathematical optimization — arXiv:2610.20080},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20080},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_423f66da693f; sha256 e207c3fffab383473e631c646d0efcf17a367c2e57cb1d424a0a014ea15252cb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20080. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This work focuses on planning daily routes for a group of employees of a condominium company. Given a set of employees and a set of customers with pre-scheduled visits, we want to build doubly-open routes to guarantee visits to all customers, ensuring that each customer is visited by an employee with the appropriate skills to carry out the required activity. The travel times between customers and the service time in each customer are known. The problem includes time windows for visiting customers, each employee has a maximum working time, and the daily working period is between 9 AM and 6:30 PM. The routes respect the lunch break period if they extend from morning to afternoon, which means that lunch break can be avoided if the route is fully completed in the morning or in the afternoon. The aim is to minimize the distance covered by all routes with a penalty for including lunch breaks. The distances and times between customers are collected via an API to Microsoft Azure; and the solutions are then displayed on Bing Maps. The results obtained show the operational advantages of an efficient and effective vehicle routing planning in a specific condominium management company. The model can be extended to other service provider companies.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.20080 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:35:59.439Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).