Tire noise optimization problem: a mixed integer linear programming approach

DOI10.1051/RO/2021147MaRDI QIDQ5034722zbMATH OpenOpenAlexFDO

Authors

Publication date 21 February 2022

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1809.05058

zbMATH Keywords

branch-and-cutmixed integer linear programmingtire shape optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Abstract: We present a Mixed Integer Linear Program (MILP) approach in order to model the nonlinear problem of minimizing the tire noise. We first take more industrial constraints into account than in a former work of the authors. Then, we associate a Branch-and-Cut algorithm to the MILP to obtain exact solutions. We compare our experimental results with those obtained by other methods.

Recommendations

• Optimization of pitch sequencing for pneumatic tire by tabu search method
• A DC Programming Approach for Mixed-Integer Linear Programs
• A novel MILP model for \(N\)-vehicle exploration problem
• Mixed integer linear models for the optimization of dynamical transport networks
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes

Cited in

(1)

• Optimization of pitch sequencing for pneumatic tire by tabu search method

This page was built for publication: Tire noise optimization problem: a mixed integer linear programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034722)