Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics

Volumn 15, Issue 3, 2009, Pages 283-312

  Boschetti, Marco ^a   Maniezzo, Vittorio ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Benders's decomposition; Combinatorial optimization; Lagrangean relaxation; Metaheuristic

Indexed keywords

COMBINATORIAL OPTIMIZATION; DECOMPOSITION;

BENDERS DECOMPOSITION; HEURISTIC SOLUTIONS; LAGRANGEAN RELAXATION; METAHEURISTIC; OPTIMIZATION PROBLEMS; RUN-TIME EVOLUTIONS; SOLUTION APPROACH; UPPER AND LOWER BOUNDS;

OPTIMIZATION;

EID: 64549099460     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9064-9     Document Type: Article

References (42)

1. M. Agar S. Salhi 1998 Lagrangean heuristics applied to a variety of large capacitated plant location problems J. Oper. Res. Soc. 49 1072 1084
2. Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutellà, M.G.: A multi-exchange heuristic for the single source capacitated facility location problem. Manag. Sci. 50 (2003)
3. F. Barahona R. Anbil 2000 The volume algorithm: producing primal solutions with a subgradient method Math. Program. 87 385 399
4. J. Barcelo J. Casanova 1984 A heuristic Lagrangean algorithm for the capacitated plant location problem Eur. J. Oper. Res. 15 212 226
5. Beasley, J.E.: Lagrangean relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 243-303. Blackwell Scientific, Oxford (1993)
6. J.F. Benders 1962 Partitioning procedures for solving mixed-variables programming problems Numer. Math. 4 280 322
7. Boschetti, M.A., Jelasity, M., Maniezzo, V.: A local approach to membership overlay design. Working paper, Department of Computer Science, University of Bologna (2006)
8. Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the res ource-constrained project scheduling problem. In: Barbarosoglu, G., Karabati, S., Ozdamar, L., Ulusoy, G. (eds.) Proceedings of the Sixth International Workshop on Project Management and Scheduling, pp. 1922. Bogazici University (1998)
9. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for a capacitated facility location problem. In: Proc. 10th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. S875-S876 (1999)
10. H. Delmaire J.A. Diaz E. Fernandez M. Ortega 1999 Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem INFOR 37 194 225
11. A. Drexl J. Grunewald 1993 Nonpreemptive multi-mode resource-constrained project scheduling IIE Trans. 25 5 74 81
12. Elmaghraby, S.E.: Activity Networks: Project Planning and Control by network Models. Wiley, New York (1977)
13. Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52(2) (February 2003)
14. F. Glover 1986 Future paths for integer programming and links to artificial intelligence Comput. Oper. Res. 13 533 549
15. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)
16. S. Hartmann 2001 Project scheduling with multiple modes: a genetic algorithm Ann. Oper. Res. 102 111 135
17. K. Holmberg M. Ronnqvist D. Yuan 1999 An exact algorithm for the capacitated facility location problems with single sourcing Eur. J. Oper. Res. 113 544 559
18. J. Holt M. Ronnqvist S. Tragantalerngsak 1999 A repeated matching heuristic for the single source capacitated facility location problem Eur. J. Oper. Res. 116 51 68
19. J. Jozefowska M. Mika R. Royzycki G. Waligora J. Weglarz 2001 Simulated annealing for multi-mode resource-constrained project scheduling Ann. Oper. Res. 102 137 155
20. J. Klincewicz H. Luss 1986 A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints J. Oper. Res. Soc. 37 495 500
21. Kolisch, R., Drexl, A.: Local search for nonpreemptive multi-mode resource constrained project scheduling. Technical Report 360, Institut fr Betriebswirtschaftslehre, Christian-Albrechts-Universitt zu Kiel, Kiel (1994)
22. R. Kolisch A. Sprecher A. Drexl 1995 Characterization and generation of a general class of resource constrained project scheduling problems Manag. Sci. 41 1693 1703
23. Maniezzo, V., Mingozzi, A.: A heuristic procedure for the multi-mode project scheduling problem based on benders decomposition. In: Weglarz, J. (ed.) Project Scheduling: Recent Models, Algorithms and Applications, pp. 179-196. Kluwer Academic, Dordrecht (1999)
24. Maniezzo, V., Boschetti, M., Jelasity, M., "An Ant Approach To Membership Overlay Design", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), p.37-48, Berlin, 2004
25. Maniezzo, V., Boschetti, M.A., Jelasity, M.: A fully distributed Lagrangean metaheuristic for a P2P overlay network design problem. In: Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria (2005)
26. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
27. A. Mingozzi V. Maniezzo S. Ricciardelli L. Bianco 1998 An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation Manag. Sci. 44 715 729
28. A. Neebe M. Rao 1983 An algorithm for the fixed-charge assigning users to sources problem J. Oper. Res. Soc. 34 1107 1113
29. Peersim: A peer-to-peer simulator, http://peersim.sourceforge.net/ (2006)
30. H. Pirkul 1987 Efficient algorithm for the capacitated concentrator location problem Comput. Oper. Res. 14 197 208
31. Planetlab: An open platform for developing, deploying, and accessing planetary-scale services, http://www.planet-lab.org/ (2006)
32. B.T. Polyak 1969 Minimization of unsmooth functionals USSR Comput. Math. Phys. 9 14 29
33. Saroiu, S., Krishna Gummadi, P., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN'02), San Jose, CA (2002)
34. H.D. Sherali G. Choi 1996 Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of liner programs Oper. Res. Lett. 19 105 113
35. M. Solomon 1987 Algorithms for the vehicle routing and scheduling problem with time window constraints Oper. Res. 35 254 365
36. A. Sprecher A. Drexl 1998 Solving multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm Eur. J. Oper. Res. 107 431 450
37. R. Sridharan 1991 A Lagrangian heuristic for the capacitated plant location problem with single source constraints Eur. J. Oper. Res. 66 305 312
38. B. Talbot 1982 Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case Manag. Sci. 28 1197 1210
39. G. Ulusoy L. Ozdamar 1994 A constraint-based perspective in resource constrained project scheduling Int. J. Prod. Res. 32 693 705
40. T.J. van Roy 1986 A cross decomposition algorithm for capacitated facility location Oper. Res. 34 1 145 163
41. Voss, S.: Meta-heuristics: The state of the art. In: Nareyek, A. (ed.) Local Search for Planning and Scheduling. LNAI, vol. 2148, pp. 1-23. Springer, Berlin (2001)
42. H. Zhang C.M. Tam H. Li 2006 Multimode project scheduling based on particle swarm optimization Comput. Aided Civ. Infrastruct. Eng. 21 93 103