We proposed models and metaheuristic search methods to solve complex real-world problems in the domain of computational logistics. In particular we focused on routing and loading problems, which have several practical applications in transportation, cutting, packing, and scheduling. We extended the problem formulations available in the literature to include several practical constraints, and we designed effective metaheuristic approaches based on large composite neighborhood structures. In addition, we made available to the community a set of challenging real-world instances provided by industrial partners. © 2013 - IOS Press and the authors. All rights reserved.
Local search algorithms for integrated logistics
Ceschia, Sara
2013-01-01
Abstract
We proposed models and metaheuristic search methods to solve complex real-world problems in the domain of computational logistics. In particular we focused on routing and loading problems, which have several practical applications in transportation, cutting, packing, and scheduling. We extended the problem formulations available in the literature to include several practical constraints, and we designed effective metaheuristic approaches based on large composite neighborhood structures. In addition, we made available to the community a set of challenging real-world instances provided by industrial partners. © 2013 - IOS Press and the authors. All rights reserved.| File | Dimensione | Formato | |
|---|---|---|---|
|
paper.pdf
non disponibili
Descrizione: Articolo principale
Tipologia:
Documento in Pre-print
Licenza:
Non pubblico
Dimensione
109.62 kB
Formato
Adobe PDF
|
109.62 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
