Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Other
Authors: Ceschia, Sara
Affiliations: DIEGM, University of Udine, Via delle Scienze 206, 33100 Udine, Italy. E-mail: sara.ceschia@uniud.it
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
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl