Details
Matheuristics
Hybridizing Metaheuristics and Mathematical ProgrammingAnnals of Information Systems, Band 10
|
223,63 € |
|
| Verlag: | Springer |
| Format: | |
| Veröffentl.: | 18.09.2009 |
| ISBN/EAN: | 9781441913067 |
| Sprache: | englisch |
| Anzahl Seiten: | 270 |
Dieses eBook enthält ein Wasserzeichen.
Beschreibungen
<P>Metaheuristics support managers in decision-making with robust tools that provide high-quality solutions to important applications in business, engineering, economics, and science in reasonable time frames, but finding exact solutions in these applications still poses a real challenge. However, because of advances in the fields of mathematical optimization and metaheuristics, major efforts have been made on their interface regarding efficient hybridization.</P>
<P>This edited book will provide a survey of the state of the art in this field by providing some invited reviews by well-known specialists as well as refereed papers from the second Matheuristics workshop to be held in Bertinoro, Italy, June 2008. Papers will explore mathematical programming techniques in metaheuristics frameworks, and especially focus on the latest developments in Mixed Integer Programming in solving real-world problems.</P>
<P>This edited book will provide a survey of the state of the art in this field by providing some invited reviews by well-known specialists as well as refereed papers from the second Matheuristics workshop to be held in Bertinoro, Italy, June 2008. Papers will explore mathematical programming techniques in metaheuristics frameworks, and especially focus on the latest developments in Mixed Integer Programming in solving real-world problems.</P>
Metaheuristics: Intelligent Problem Solving.- Just MIP it#x0021;.- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics.- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms.- Decomposition Techniques as Metaheuristic Frameworks.- Convergence Analysis of Metaheuristics.- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines.- (Meta-)Heuristic Separation of Jump Cuts in a Branch#x0026;Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.- A Good Recipe for Solving MINLPs.- Variable Intensity Local Search.- A Hybrid Tabu Search for the -Peripatetic Vehicle Routing Problem.
<OL>
<LI>Metaheuristics: Intelligent Problem Solving</LI>
<P><EM>Marco Caserta and Stefan Voß</EM></P>
<P></P>
<P>
<LI>Just MIP it!</LI>
<P></P>
<P><EM>Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin</EM></P>
<P></P>
<P>
<LI>MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics</LI>
<P></P>
<P><EM>Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser</EM></P>
<P></P>
<P>
<LI>Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms</LI>
<P></P>
<P><EM>Irina Dumitrescu and Thomas Stützle</EM></P>
<P></P>
<P>
<LI>Decomposition Techniques as Metaheuristic Frameworks</LI>
<P></P>
<P><EM>Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli</EM></P>
<P></P>
<P>
<LI>Convergence Analysis of Metaheuristics</LI>
<P></P>
<P><EM>Walter J. Gutjahr</EM></P>
<P></P>
<P>
<LI>MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines</LI>
<P></P>
<P><EM>Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya</EM></P>
<P></P>
<P>
<LI>(Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</LI>
<P></P>
<P><EM>Martin Gruber and Günther R. Raidl</EM></P>
<P></P>
<P>
<LI>A Good Recipe for Solving MINLPs</LI>
<P></P>
<P><EM>Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic</EM></P>
<P></P>
<P>
<LI>Variable Intensity Local Search</LI>
<P></P>
<P><EM>Snežana Mitrovic-Minic and Abraham P. Punnen</EM></P>
<P></P>
<P>
<LI>A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem<BR><BR><EM>Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo</EM></LI></OL>
<LI>Metaheuristics: Intelligent Problem Solving</LI>
<P><EM>Marco Caserta and Stefan Voß</EM></P>
<P></P>
<P>
<LI>Just MIP it!</LI>
<P></P>
<P><EM>Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin</EM></P>
<P></P>
<P>
<LI>MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics</LI>
<P></P>
<P><EM>Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser</EM></P>
<P></P>
<P>
<LI>Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms</LI>
<P></P>
<P><EM>Irina Dumitrescu and Thomas Stützle</EM></P>
<P></P>
<P>
<LI>Decomposition Techniques as Metaheuristic Frameworks</LI>
<P></P>
<P><EM>Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli</EM></P>
<P></P>
<P>
<LI>Convergence Analysis of Metaheuristics</LI>
<P></P>
<P><EM>Walter J. Gutjahr</EM></P>
<P></P>
<P>
<LI>MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines</LI>
<P></P>
<P><EM>Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya</EM></P>
<P></P>
<P>
<LI>(Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</LI>
<P></P>
<P><EM>Martin Gruber and Günther R. Raidl</EM></P>
<P></P>
<P>
<LI>A Good Recipe for Solving MINLPs</LI>
<P></P>
<P><EM>Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic</EM></P>
<P></P>
<P>
<LI>Variable Intensity Local Search</LI>
<P></P>
<P><EM>Snežana Mitrovic-Minic and Abraham P. Punnen</EM></P>
<P></P>
<P>
<LI>A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem<BR><BR><EM>Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo</EM></LI></OL>
Presents the latest research on using mathematical programming in metaheuristics frameworks Represents a major advance in complex problem-solving methodologies Presents breakthroughs in using Mixed Integer Programming to solve real-world problems Includes supplementary material: sn.pub/extras
Diese Produkte könnten Sie auch interessieren:
Supply Chain Management: Models, Applications, and Research Directions
von: Joseph Geunes, Panos M. Pardalos, H. Edwin Romeijn
149,79 €
