Optimization algorithms can dramatically improve the efficiency of logistics operations. However, when complex tasks are involved, there is a significant lack of good models and optimized solutions. For instance, when it is necessary to perform more than one operation at each specific point in space, potentially depending on the outcome of others, finding optimal solutions for the operator movements may become extremely difficult. This work addresses such context, in which one operator is required to perform acquisition, elaboration and action tasks while visiting a set of positions, with complex sequential dependencies. An example could be an automatic operator, i.e., an unmanned ground vehicle (UGV), that is required to help in precision agriculture activities. For clarity’s sake, we will mostly focus on the precision agriculture scenario, but our model and results can be readily applied to the other contexts described in more details in the paper, e.g., scheduling of robot operations or repair companies. After formulating the general problem analytically as an integer linear programming problem, we propose an algorithm that is guaranteed to find the global minimum cost solution in terms of time needed to complete the operations. Tests on instances of the optimization problems with a different number of nodes show the efficiency of the proposed algorithms in terms of computational time.

Optimally Scheduling Complex Logistics Operations Involving Acquisition, Elaboration and Action Tasks / FOTIO TIOTSOP, Lohic; Servetti, Antonio; Masala, Enrico. - STAMPA. - (2019), pp. 149-154. (Intervento presentato al convegno IEEE 5th International Forum on Research and Technologies for Society and Industry (RTSI 2019) tenutosi a Florence (ITA) nel 09-12 September 2019) [10.1109/RTSI.2019.8895543].

Optimally Scheduling Complex Logistics Operations Involving Acquisition, Elaboration and Action Tasks

Lohic Fotio Tiotsop;Antonio Servetti;Enrico Masala
2019

Abstract

Optimization algorithms can dramatically improve the efficiency of logistics operations. However, when complex tasks are involved, there is a significant lack of good models and optimized solutions. For instance, when it is necessary to perform more than one operation at each specific point in space, potentially depending on the outcome of others, finding optimal solutions for the operator movements may become extremely difficult. This work addresses such context, in which one operator is required to perform acquisition, elaboration and action tasks while visiting a set of positions, with complex sequential dependencies. An example could be an automatic operator, i.e., an unmanned ground vehicle (UGV), that is required to help in precision agriculture activities. For clarity’s sake, we will mostly focus on the precision agriculture scenario, but our model and results can be readily applied to the other contexts described in more details in the paper, e.g., scheduling of robot operations or repair companies. After formulating the general problem analytically as an integer linear programming problem, we propose an algorithm that is guaranteed to find the global minimum cost solution in terms of time needed to complete the operations. Tests on instances of the optimization problems with a different number of nodes show the efficiency of the proposed algorithms in terms of computational time.
2019
9781728138145
File in questo prodotto:
File Dimensione Formato  
IEEE_RTSI2019_da_proceedings_ufficiali.pdf

non disponibili

Descrizione: Versione editoriale
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 2.73 MB
Formato Adobe PDF
2.73 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
PID6023691.pdf

accesso aperto

Descrizione: Versione autori, final draft post-refereeing
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 2.36 MB
Formato Adobe PDF
2.36 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2751558
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo