Mathematical Programming Solver Based on Local Search

<p>Acknowledgments vii</p>
<p>Preface ix</p>
<p>Introduction&nbsp; xi</p>
<p>Chapter 1 Local Search: Methodology and Industrial Applications 1</p>
<p>1.1 Our methodology: back to basics 1</p>
<p>1.2 Car sequencing for painting and assembly lines 10</p>
<p>1.3 Vehicle routing with inventory management 17</p>
<p>Chapter 2 Local Search for 0–1 Nonlinear Programming 29</p>
<p>2.1 The LocalSolver project 29</p>
<p>2.2 State–of–the–art 32</p>
<p>2.3 Enriching modeling standards 33</p>
<p>2.4 The core algorithmic ideas 39</p>
<p>2.5 Benchmarks 44</p>
<p>Chapter 3 Toward an Optimization Solver Based on Neighborhood Search 53</p>
<p>3.1 Using neighborhood search as global search strategy 53</p>
<p>3.2 Extension to continuous and mixed optimization 56</p>
<p>3.3 Separating the computation of solutions and bounds 59</p>
<p>3.4 A new–generation, hybrid mathematical programming solver 62</p>
<p>Bibliography 65</p>
<p>Lists of Figures and Tables 79</p>
<p>Index 81</p>