Mathematical Programming Solver Based on Local Search 1st Edition by Frédéric Gardi, Thierry Benoist, Julien Darlay, Bertrand Estellon, Romain Megel 9781306958295 1848216866

Mathematical Programming Solver Based on Local Search 1st Edition by Frédéric Gardi, Thierry Benoist, Julien Darlay, Bertrand Estellon, Romain Megel – Ebook PDF Instant Download/Delivery: 9781306958295, 1848216866

Full download Mathematical Programming Solver Based on Local Search 1st Edition after payment

 

Product details:

ISBN 10: 1848216866

ISBN 13: 9781306958295

Author: Frédéric Gardi, Thierry Benoist, Julien Darlay, Bertrand Estellon, Romain Megel

This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today’s end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors’ concern regarding industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces extra costs in development and maintenance in comparison with the direct use of mixed-integer linear programming solvers. The authors then move on to present the LocalSolver project whose goal is to offer the power of local search through a model-and-run solver for large-scale 0-1 nonlinear programming. They conclude by presenting their ongoing and future work on LocalSolver toward a full mathematical programming solver based on local search.

Table of contents:

1 Local Search: Methodology and Industrial Applications

1.1. Our methodology: back to basics

1.2. Car sequencing for painting and assembly lines

1.3. Vehicle routing with inventory management

2 Local Search for 0–1 Nonlinear Programming

2.1. The LocalSolver project

2.2. State-of-the-art

2.3. Enriching modeling standards

2.4. The core algorithmic ideas

2.5. Benchmarks

3 Toward an Optimization Solver Based on Neighborhood Search

3.1. Using neighborhood search as global search strategy

3.2. Extension to continuous and mixed optimization

3.3. Separating the computation of solutions and bounds

3.4. A new-generation, hybrid mathematical programming solver

People also search:

what is mathematical programming

mathematical programming examples

mathematical programming jobs

mathematical programming series b

math programming software

Tags: Frédéric Gardi, Thierry Benoist, Julien Darlay, Mathematical