Metaheuristic algorithms for combinatorial optimization problems

4OR

Volumn 3, Issue 2, 2005, Pages 163-166

  Iori, Manuel ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Metaheuristics; Packing; Scheduling; Transportation

Indexed keywords

EID: 27744471020     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0052-3     Document Type: Review

References (7)

1. max problem. Journal of Heuristics 10: 169-204
2. i -partitioning problem. European Journal of Operational Research (forthcoming)
3. Gendreau M, Iori M, Laporte G, Martello S (2004) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Technical Report OR/04/1, DEIS, University of Bologna, submitted for publication
4. Hadjiconstantinou E, Iori M (2004) A hybrid genetic algorithm for the two-dimensional knapsack problem. Technical Report OR/04/5, DEIS, University of Bologna, submitted for publication
5. Iori M (2004) Metaheuristic algorithms for combinatorial optimization problems. PhD thesis, DEIS, University of Bologna (Italy)
6. Iori M, Martello S, Monaci M (2003) Metaheuristic algorithms for the strip packing problem. In Pardalos P, Korotkich V (eds) Optimization and industry: New frontiers. Kluwer, Boston, pp 159-179
7. Iori M, Salazar González JJ, Vigo D (2004) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Technical Report OR/04/6, DEIS, University of Bologna, submitted for publication