ISBN-10:
1848216866
ISBN-13:
9781848216860
Pub. Date:
06/30/2014
Publisher:
Wiley
Mathematical Programming Solver Based on Local Search / Edition 1

Mathematical Programming Solver Based on Local Search / Edition 1

Current price is , Original price is $78.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

This item is available online through Marketplace sellers.

Product Details

ISBN-13: 9781848216860
Publisher: Wiley
Publication date: 06/30/2014
Pages: 82
Product dimensions: 6.30(w) x 9.30(h) x 0.60(d)

About the Author

Frédéric Gardi is a Senior Expert and Vice President of Products at Innovation 24, a subsidiary of Bouygues in Paris, France, and Product Manager of LocalSolver. He specializes in the design and engineering of local search algorithms.

Thierry Benoist is a Senior Expert in charge of operations research projects at Innovation 24.

Julien Darlay is an Expert at Innovation 24. His fields of expertise include algorithmics, combinatory and numerical optimization, forecast, statistical and logical data analysis and simulation.

Bertrand Estellon is Professor in the IT Department and the Faculty of Science at Aix-Marseille University in France and a member of the combinatory and operational research team of the Laboratoire d'Informatique Fondamentale de Marseille.

Romain Megel is an Expert at Innovation 24. His fields of expertise include algorithmics, optimization, inference-based systems (constraint programming, expert systems), and business rule management.

Read an Excerpt

Click to read or download

Table of Contents

Acknowledgments vii

Preface ix

Introduction  xi

Chapter 1 Local Search: Methodology and Industrial Applications 1

1.1 Our methodology: back to basics 1

1.2 Car sequencing for painting and assembly lines 10

1.3 Vehicle routing with inventory management 17

Chapter 2 Local Search for 0-1 Nonlinear Programming 29

2.1 The LocalSolver project 29

2.2 State-of-the-art 32

2.3 Enriching modeling standards 33

2.4 The core algorithmic ideas 39

2.5 Benchmarks 44

Chapter 3 Toward an Optimization Solver Based on Neighborhood Search 53

3.1 Using neighborhood search as global search strategy 53

3.2 Extension to continuous and mixed optimization 56

3.3 Separating the computation of solutions and bounds 59

3.4 A new-generation, hybrid mathematical programming solver 62

Bibliography 65

Lists of Figures and Tables 79

Index 81

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews