We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.

Paths and Matchings in an Automated Warehouse / M. Barbato, A. Ceselli, G. Righini (AIRO SPRINGER SERIES). - In: Advances in Optimization and Decision Science for Society, Services and Enterprises / [a cura di] M. Paolucci, A. Sciomachen, P. Uberti. - [s.l] : Springer, 2019. - ISBN 9783030349592. - pp. 151-159 (( convegno ODS tenutosi a Genova nel 2019 [10.1007/978-3-030-34960-8_14].

Paths and Matchings in an Automated Warehouse

M. Barbato;A. Ceselli;G. Righini
2019

Abstract

We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.
Scheduling; Combinatorial optimization; Dynamic programming
Settore MAT/09 - Ricerca Operativa
Settore INF/01 - Informatica
2019
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
10.1007_978-3-030-34960-8.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 7.7 MB
Formato Adobe PDF
7.7 MB Adobe PDF [it] Default value:   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I metadati presenti in AIR sono rilasciati con licenza CCO mentre i file delle pubblicazioni sono rilasciati con licenza CC BY-SA, salvo diversa indicazione. In caso di violazione di copyright, contattare l'assistenza di AIR

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/718316
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact