Manuel Iori – Main Publications and Research Material

   

Articles in International Journals

1.      Alonso MT, Alvarez-Valdes R, Iori M, Parreño F, Tamarit JM, “Mathematical Models for Multi Container Loading Problems”, technical report, OMEGA 66: 106-117 (2017).

(preliminary report, home page of the paper, slides)

2.      Cruz F, Subramanian A, Bruck PB, Iori M, “A heuristic algorithm for a single vehicle static bike sharing rebalancing problem”, Computers & Operations Research 79: 19-33 (2017).

(preliminary report, home page of the paper)

3.      Delorme M, Iori M, Martello S, “Logic Based Benders' Decomposition for Orthogonal Stock Cutting Problems”, Computers & Operations Research 78: 290-298 (2017).

(home page of the paper, preliminary report, slides)

4.      Ciscal-Terry W, Dell'Amico M, Hadjidimitriou S, Iori M, “An analysis of drivers route choice behaviour using GPS data and optimal alternatives”, Journal of Transport Geography 51: 119-129 (2016).

5.      Dell’Amico M, Díaz Díaz JC, Hasle G, Iori M, “An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem”, Transportation Science 5: 1223-1238 (2016).

(home page of the paper, extended abstract, slides, material in the SINTEF web page)

6.      Dell’Amico M, Fuellerer G, Hoefinger G, Iori M, Novellani S, “A decision support system for highway construction: the Autostrada Pedemontana Lombarda”, Interfaces 46: 245-263 (2016).

(home page of the paper)

7.      Dell'Amico M, Iori M, Novellani S, Stützle T, “A Destroy and Repair Algorithm for the Bike sharing Rebalancing Problem”, Computers & Operations Research 71: 149-162 (2016).

(home page of the paper)

8.      Delorme M, Iori M, Martello S, “Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms”, European Journal of Operational Research 255: 1-20 (2016).

(slides, preliminary report, instances, and computational results on the BPPLIB)

9.      Bogenberger C, Dell’Amico M, Fuellerer G, Hoeflinger G, Iori M, Novellani S, Panicucci B, “Two-Phase Earthwork Optimization Model for Highway Construction”, Journal of Construction Engineering and Management 141: 05015003-1 – 05015003-11 (2015).

(home page of the paper, slides)

10.  Caprara A, Dìaz Dìaz JC, Dell’Amico M, Iori M, Rizzi R, “Friendly Bin Packing Instances without Integer Round-up Property”, Mathematical Programming Series A and B 150: 5-17 (2015).

(home page of the paper, slides, problem instances)

11.  Cordeau J-F, Dell’Amico M, Falavigna S, Iori M, “A Rolling Horizon Algorithm for Auto-Carrier Transportation”, Transportation Research Part B 76: 68-80 (2015).

(preliminary report, home page of the paper)

12.  Dell’Amico M, Falavigna S, Iori M, “Optimization of a Real-World Auto-Carrier Transportation Problem”, Transportation Science 49: 402-419 (2015).

(technical report, problem instances, slides, home page of the paper)

13.  Furini F, Iori M, Martello S, Yagiura M, “Heuristic and exact algorithms for the interval min-max regret knapsack problem”, INFORMS Journal on Computing 27: 392-405 (2015).

(technical report, slides, problem instances)

14.  Iori M, Riera-Ledesma J, “Exact Algorithms for the Double Vehicle Routing Problem with Multiple Stacks”, Computers & Operations Research 63: 83-101 (2015).

(slides, home page of the paper)

15.  Clautiaux F, Dell’Amico M, Iori M, Khanafer A, “Lower and Upper Bounds for the Bin Packing Problem with Fragile Objects”, Discrete Applied Mathematics 163: 73-86 (2014).

(home page of the paper, problem instances)

16.  Coté J-F, Dell’Amico M, Iori M, “Combinatorial Benders’ Cuts for the Strip Packing Problem”, Operations Research 62: 643-661 (2014).

(technical report + detailed computational results + graphical description of the solutions, problem instances, slides)

17.  Dell’Amico M, Hadjiconstantinou E, Iori M, Novellani S, “The Bike Sharing Rebalancing Problem: Mathematical formulations and benchmark instances”, OMEGA 45: 7-19 (2014).

(home page of the paper, problem instances, slides)

18.  Alba Martìnez MA, Clautiaux F, Dell’Amico M, Iori M, “Exact Algorithms for the Bin Packing Problem with Fragile Objects”, Discrete Optimization 10: 210-233 (2013).

(home page of the paper, problem instances, slides)

19.  Alba Martìnez MA, Cordeau J-F, Dell’Amico M, Iori M, “A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks”, INFORMS Journal on Computing 25: 41-55 (2013).

(home page of the paper, problem instances)

20.  Fernandes Muritiba AE, Iori M, Martello S, Negreiros Gomes MJ. “Optimal design of fair layouts”, Flexible Services and Manufacturing Journal 25: 443-461 (2013).

(home page of the paper)

21.  Iori M, Martello S, “An Annotated Bibliography of Combined Routing and Loading Problems”, Yugoslav Journal of Operations Research 23 (3): 311-326 (2013).

(home page of the paper)

22.  Dell’Amico M, Dìaz Dìaz JC, Iori M, “The Bin Packing Problem with Precedence Constraints”, Operations Research 60: 1491-1504 (2012).

(home page of the paper, problem instances + detailed computational results, slides)

23.  Dell’Amico M, Iori M, Martello S, Monaci M, “A note on exact and heuristic algorithms for the identical parallel machine scheduling problem”, Journal of Heuristics 18: 939-942 (2012).

(home page of the paper)

24.  Tricoire F, Doerner K, Hartl R, Iori M, “Heuristic and Exact Algorithms for the Multi-Pile Vehicle Routing Problem”, OR Spectrum 33: 931-959 (2011).

(home page of the paper, problem instances + detailed computational results, slides)

25.  Cordeau J-F, Dell’Amico M, Iori M, “Branch-and-Cut for the Pickup and Delivery Traveling Salesman Problem with FIFO Loading”, Computers & Operations Research 37: 970-980 (2010).

(home page of the paper, slides)

26.  Cordeau J-F, Iori M, Laporte G, Salazar Gonzalez JJ, “A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading”, Networks 55: 46-59 (2010).

(home page of the paper, slides)

27.  Fernandes Muritiba AE, Iori M, Malaguti E, Toth P. “Algorithms for the Bin Packing Problem with Conflicts”, INFORMS Journal on Computing 22 (3): 401 – 415 (2010).

(home page of the paper, problem instances + detailed computational results, slides)

28.  Fernandes Muritiba AE, Iori M, Martello S, Negreiros Gomes MJ. “Models and Algorithms for Fair Layout Optimization Problems”, Annals of Operations Research 179: 5 – 14 (2010).

(home page of the paper)

29.  Fuellerer G, Doerner K, Hartl R, Iori M, “Metaheuristics for Vehicle Routing Problems with Three-Dimensional Loading Constraints”, European Journal of Operational Research 201: 751-759 (2010).

(home page of the paper, problem instances)

30.  Iori M, Martello S. “Routing Problems with Loading Constraints”, TOP 18: 4 – 27 (2010).

(home page of the paper, preliminary report, mini course in freight transportation – part I, part II)

31.  Iori M, Martello S. “Rejoinder on: Routing Problems with Loading Constraints”, TOP 18: 41 – 42 (2010).

(home page of the paper, preliminary report)

32.  Iori M, Martello S, Pretolani D. “An Aggregate Label Setting Policy for the Multi-Objective Shortest Path Problem”, European Journal of Operational Research 207: 1489— 1496 (2010).

(home page of the paper, extended abstract, slides)

33.  Dell’Amico M, Dìaz Dìaz JC, Iori M, Montanari R, “The single-finger keyboard layout problem”, Computers & Operations Research 36: 3002 – 3012 (2009).

(home page of the paper, preliminary report, problem instances + detailed computational results, slides)

34.  Fuellerer G, Doerner K, Hartl R, Iori M, “Ant Colony Optimization for the Two-Dimensional Loading Vehicle Routing Problem”, Computers & Operations Research 36: 655 – 673 (2009).

(home page of the paper, preliminary report with detailed computational results, problem instances)

35.  Dell'Amico M, Iori M, Martello S, Monaci M, “Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem”, INFORMS Journal on Computing 20 (3): 333-344 (2008).

(home page of the paper, problem instances and detailed computational results, slides)

36.  Dell’Amico M, Iori M, Pretolani D, “Shortest Paths in Piecewise Continuous Time-Dependent Networks”, Operations Research Letters 36: 688-691 (2008).

(home page of the paper)

37.  Gendreau M, Iori M, Laporte G, Martello S, “A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints”, Networks 51 (1): 4-18 (2008).

(home page of the paper, problem instances)

38.  Doerner K, Fuellerer G, Gronalt M, Hartl R, Iori M, “Metaheuristics for the Vehicle Routing Problem with Loading Constraints”, Networks 49 (4): 294-307 (2007).

(home page of the paper, preliminary report, problem instances + detailed computational results, slides)

39.  Hadjiconstantinou E, Iori M, “A hybrid genetic algorithm for the two-dimensional single large object placement problem”, European Journal of Operational Research 183: 1150-1166, (2007).

(home page of the paper)

40.  Iori M, Salazar Gonzalez JJ, Vigo D, “An exact approach for the vehicle routing problem with two-dimensional loading constraints”, Transportation Science 41 (2): 253-264 (2007).

(home page of the paper, preliminary report, problem instances)

41.  Dell'Amico M, Iori M, Martello S, Monaci M, “Lower Bounds and Heuristic Algorithms for the ki Partitioning Problem”, European Journal of Operational Research 171: 725-742 (2006).

(home page of the paper, slides)

42.  Gendreau M, Iori M, Laporte G, Martello S, “A tabu search algorithm for a routing and container loading problem”, Transportation Science 40: 342-350 (2006).

(home page of the paper)

43.  Iori M, “Metaheuristic algorithms for combinatorial optimization problems”. 4OR 3: 163-166 (2005).

(home page of the paper, complete PhD thesis, slides)

44.  Dell'Amico M, Iori M, Martello S, “Heuristic Algorithms and Scatter Search for the Cardinality Constraint P||Cmax Problem”, Journal of Heuristics 10: 169-204 (2004).

(home page of the paper, preliminary report, slides)

 

International Volumes with Referee Process

45.  Battarra M, Cordeau J-F, Iori M, “Pickup and Delivery Problems for Goods Transportation”, in Toth P, Vigo D editors, Vehicle Routing: Problems, Methods, and Applications, 2nd edition, SIAM, Monographs on Discrete Mathematics and Applications (to appear).

(home page of the paper)

46.  Yamasaki Y, Schiavoni R, Iori M, Yagiura M, Martello S. “Efficient computation of upper bounds for the disjunctively constrained knapsack problem”, in The evolution of optimization models and algorithms, Research Institute for Mathematical Sciences, RIMS Kôkyûroku, n. 1726, Kyoto, Japan, edited by Shunji Umetani, ISSN 1880-2818, pp. 139-154 (2011).

(paper, slides)

47.  Fernandes Muritiba AE, Iori M, Martello S, Negreiros Gomes MJ. “Fair layout optimization”, in Proceedings of MOSIM’10, ISBN 9782743013301, Hammamet, Tunisia, pp. 1301-1307 (2010).

(slides, home page of the paper)

48.  Iori M, Martello S, “Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems”, in Xhafa F, Ajith A editors, Metaheuristics for Scheduling in Industrial and Manufacturing Applications, Springer, Studies in Computational Intelligence 128: 41-59 (2008).

(paper)

49.  Iori M, Martello S, Monaci M, “Metaheuristic Algorithms for the Strip Packing Problem”, in Pardalos P, Korotkich V editors, Optimization and Industry: New Frontieres, pp. 159-179, Kluwer Academic Publisher (2003).

(paper, slides)

 

Works Submitted to Publication

50.  Kramer R, Dell'Amico M, Iori M, “A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints”, technical report (2016).

(slides, instances and detailed computational results)

51.  Bruck PB, Cordeau J-F, Iori M, “A Practical Time Slot Management and Routing Problem in Attended Home Delivery”, technical report (2016).

(slides)

52.  Coté J-F, Iori M, “The Meet-in-the-Middle Principle for Cutting and Packing Problems”, technical report (2016).

(technical report, slides)

53.  Bartolini E, Dell’Amico M, Iori M, “Scheduling Cleaning Activities on Trains by Minimizing Idle Times”, technical report (2015).

54.  Bruck PB, Incerti V, Iori M, Vignoli M, “Minimizing CO2 emissions in a practical daily carpooling problem”, technical report (2015).

(preliminary report, slides)

55.  Wu W, Iori M, Martello S, Yagiura, M, “Exact and Heuristic Algorithms for the Min-Max Regret Generalized Assignment Problem with Interval Data”, technical report (2015).

56.  Bruck BP, Iori M, “Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries”, technical report, DISMI, University of Modena and Reggio Emilia (2014).

(slides, slides 2)

 

Works in Progress

57.  Delorme M, Iori M, “Pseudo-polynomial formulations for bin packing and cutting stock problems”, work in progress (2016).

(slides)

 

Back to my personal page

 

Last Update: November 2016

 

free hit counter