DOAJ Open Access 2021

Binary goal programming model for optimizing tire selection using branch and bound algorithm

Aly Shady

Abstrak

The problem of assessment and adoption of automotive tyre design specifications has not been addressed sufficiently in literature. This is in spite of its significance as a crucial component relevant to design and safety of the automobile. In this paper, a multi-objective optimization model of the tyre design trademark adoption decision is proposed. Multi-attribute or multi-criterion decision making techniques are heuristics providing good solution, but do not guarantee optimum solution. Up to date, there is no optimal yielding method for selection of vehicle tyre manufacturer or trademark based on prespecified design targets. The proposed model is formulated as a binary goal programming model for optimizing tyre trademark design selection decision by adopting an optimal tyre design trademark that best achieve design targets. The model is solved by the branch and bound algorithm. One advantage of the proposed model is flexibility to incorporate multiple design targets, tolerance limits and different constraints. The proposed model can support efficient and effective decision making concerning the adoption of tyre trademark design for new automobile or to re-adopt new design for new road vehicle operating conditions.

Penulis (1)

A

Aly Shady

Format Sitasi

Shady, A. (2021). Binary goal programming model for optimizing tire selection using branch and bound algorithm. https://doi.org/10.1051/smdo/2021008

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →
Lihat di Sumber doi.org/10.1051/smdo/2021008
Informasi Jurnal
Tahun Terbit
2021
Sumber Database
DOAJ
DOI
10.1051/smdo/2021008
Akses
Open Access ✓