A method for interval 0–1 nonlinear programming problem using a genetic algorithm-Reference-Cited by-同舟云学术

A method for interval 0–1 nonlinear programming problem using a genetic algorithm

Published:1995-09 Issue:1-4 Volume:29 Page:531-535
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Yokota Takao,Gen Mitsuo,Taguchi Takeaki,Li Yinxiu

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference8 articles.

1. Formulation and Analysis of Linear Programming Problem with Interval coefficients;Ishibuchi;Journal of Japan Industrial Management Association,1989

2. A Method for Solving 0–1 Linear Programming Problem with Interval Coefficients;Nakahara;Journal of Japan Industrial Management Association,1991

3. An Effective Method for Large Scale 0–1 Linear Programming Problem with Interval Coefficients;Nakahara,1991

4. Order Relation between Intervals and Its Application to Shortest Path Problem;Okada,1993

5. Optimization of System Reliability Using 0–1 Linear Programming with Interval Coefficients;Okada;Journal of Japan Industrial Management Association,1993

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simulation-driven online scheduling algorithm for the maintenance and operation of wind farm systems;SIMULATION;2021-07-06

2. Mitigation of environmental noise in urban streets through lightweight transparent screens;Noise Mapping;2020-04-13

3. Large-scale Maintenance Scheduling of Wind Turbines;2019 Prognostics and System Health Management Conference (PHM-Qingdao);2019-10

4. Multi-objective reliability redundancy allocation in an interval environment using particle swarm optimization;Reliability Engineering & System Safety;2016-01

5. Minimum–Maximum regret redundancy allocation with the choice of redundancy strategy and multiple choice of component type under uncertainty;Computers & Industrial Engineering;2015-01