Hybridized Neural Network and Genetic Algorithms for Solving Nonlinear Integer Programming Problem

1999 ◽  
pp. 421-429 ◽  
Author(s):  
Mitsuo Gen ◽  
Kenichi Ida ◽  
Chang-Yun Lee
Keyword(s):  
Neural Network ◽  
Genetic Algorithms ◽  
Integer Programming ◽  
Programming Problem ◽  
Nonlinear Integer Programming ◽  
Integer Programming Problem

A genetic algorithm for interval nonlinear integer programming problem

1996 ◽  
Vol 31 (3-4) ◽  
pp. 913-917 ◽  
Author(s):  
Takao Yokota ◽  
Mitsuo Gen ◽  
Yinxiu Li ◽  
Chang Eun Kim
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Programming Problem ◽  
Nonlinear Integer Programming ◽  
Integer Programming Problem

scholarly journals Planning of Aircraft Fleet Maintenance Teams

Aerospace ◽  
2021 ◽  
Vol 8 (5) ◽  
pp. 140
Author(s):  
Duarte P. Pereira ◽  
Isaias L. R. Gomes ◽  
Rui Melicio ◽  
Victor M. F. Mendes
Keyword(s):  
Information System ◽  
Integer Programming ◽  
Positive Integer ◽  
Programming Problem ◽  
Nonlinear Integer Programming ◽  
Mathematical Programming Problem ◽  
Aircraft Maintenance ◽  
Integer Programming Problem ◽  
Integer Variables ◽  
Support Information

This paper addresses a support information system for the planning of aircraft maintenance teams, assisting maintenance managers in delivering an aircraft on time. The developed planning of aircraft maintenance teams is a computer application based on a mathematical programming problem written as a minimization one. The initial decision variables are positive integer variables specifying the allocation of available technicians by skills to maintenance teams. The objective function is a nonlinear function balancing the time spent and costs incurred with aircraft fleet maintenance. The data involve technicians’ skills, hours of work to perform maintenance tasks, costs related to facilities, and the aircraft downtime cost. The realism of this planning entails random possibilities associated with maintenance workload data, and the inference by a procedure of Monte Carlo simulation provides a proper set of workloads, instead of going through all the possibilities. The based formalization is a nonlinear integer programming problem, converted into an equivalent pure linear integer programming problem, using a transformation from initial positive integer variables to Boolean ones. A case study addresses the use of this support information system to plan a team for aircraft maintenance of three lines under the uncertainty of workloads, and a discussion of results shows the serviceableness of the proposed support information system.

scholarly journals Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming

1988 ◽  
Vol 11 (4) ◽  
pp. 811-814
Author(s):  
Balasubramanian Ram ◽  
A. J. G. Babu
Keyword(s):  
Dynamic Programming ◽  
Integer Programming ◽  
Programming Problem ◽  
Nonlinear Integer Programming ◽  
Integer Programming Problem ◽  
Reduction Of Dimensionality ◽  
Single Constraint ◽  
Solution Methods ◽  
Dynamic Programming Problem ◽  
Constraint Problem

This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.

Sign in / Sign up

Export Citation Format

Share Document