Local search algorithms for integrated logistics

Article type: Other

Authors: Ceschia, Sara

Affiliations: DIEGM, University of Udine, Via delle Scienze 206, 33100 Udine, Italy. E-mail: [email protected]

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.

Keywords: Local search, metaheuristics, logistics, routing, packing

DOI: 10.3233/AIC-130563

Journal: AI Communications, vol. 26, no. 3, pp. 325-326, 2013