期刊文献+
共找到13篇文章
< 1 >
每页显示 20 50 100
Multi-Objective Genetic Algorithm to Design Manufacturing Process Line Including Feasible and Infeasible Solutions in Neighborhood
1
作者 Masahiro Arakawa Takumi Wada 《Journal of Mathematics and System Science》 2014年第4期209-219,共11页
This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ord... This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ordinarily assigned to each center. Here, infeasible solutions are easily generated by precedence relationship of work elements in process design. The number of infeasible solutions generated is ordinarily larger than that of feasible solutions generated in the process. Therefore, feasible and infeasible solutions are located in any neighborhood in solution space. It is difficult to seek high quality Pareto solutions in this problem by using conventional multi-objective evolutional algorithms. We consider that the problem includes difficulty to seek high quality solutions by the following characteristics: (1) Since infeasible solutions are resemble to good feasible solutions, many infeasible solutions which have good values of objective functions are easily sought in the search process, (2) Infeasible solutions are useful to select new variable conditions generating good feasible solutions in search process. In this study, a multi-objective genetic algorithm including local search is proposed using these characteristics. Maximum value of average operation times and maximum value of dispersion of operation time in all work centers are used as objective functions to promote productivity. The optimal weighted coefficient is introduced to control the ratio of feasible solutions to all solutions selected in crossover and selection process in the algorithm. This paper shows the effectiveness of the proposed algorithm on simple model. 展开更多
关键词 Process design process line feasible and infeasible solution multi-objective genetic algorithm mix production simulation
下载PDF
New Approach to Find Initial Basic Feasible Solution (IBFS) for Optimal Solution in Transportation Problem
2
作者 Shubham Raval 《Open Journal of Applied Sciences》 CAS 2023年第2期207-211,共5页
Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for tran... Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method. 展开更多
关键词 Transportation Problem New Approach for Transportation Problem Initial Basic feasible Solution Minimizing Transportation Time
下载PDF
Analysis of the Impact of Optimal Solutions to the Transportation Problems for Variations in Cost Using Two Reliable Approaches
3
作者 Abdur Rashid Md. Amirul Islam 《American Journal of Computational Mathematics》 2023年第4期607-618,共12页
In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to dif... In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to different factors. Finding optimal solutions to the transportation problem in the context of variations in cost is vital for ensuring cost efficiency, resource allocation, customer satisfaction, competitive advantage, environmental responsibility, risk mitigation, and operational fortitude in practical situations. This paper opens up new directions for the solution of transportation problems by introducing two key theorems. By using these theorems, we can develop an algorithm for identifying the optimal solution attributes and permitting accurate quantification of changes in overall transportation costs through the addition or subtraction of constants to specific rows or columns, as well as multiplication by constants inside the cost matrix. It is anticipated that the two reliable techniques presented in this study will provide theoretical insights and practical solutions to enhance the efficiency and cost-effectiveness of transportation systems. Finally, numerical illustrations are presented to verify the proposed approaches. 展开更多
关键词 Transportation Problem Initial Basic feasible Solution Optimal Solution Two Reliable Approaches (theorems) and Numerical Illustrations
下载PDF
An Effective Approach to Determine an Initial Basic Feasible Solution: A TOCM-MEDM Approach 被引量:1
4
作者 Md. Munir Hossain Mollah Mesbahuddin Ahmed +1 位作者 Md. Amirul Islam Shirajul Islam Ukil 《Open Journal of Optimization》 2020年第2期27-37,共11页
Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for findin... Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem. Number of numerical illustration is introduced and optimality of the result is also checked. Comparison of findings obtained by the new heuristic and the existing heuristics show that the method presented herein gives a better result. 展开更多
关键词 Initial Basic feasible Solution Total Opportunity Cost Matrix Pointer Cost Optimum Solution
下载PDF
A Comparative Study of Initial Basic Feasible Solution by a Least Cost Mean Method (LCMM) of Transportation Problem 被引量:1
5
作者 Md. Munir Hossain Mollah Mesbahuddin Ahmed 《American Journal of Operations Research》 2020年第4期122-131,共10页
Transportation Problems (TP), as is known, are a basic network problem which can be formulated as a Linear Programming Problem (LPP). Transportation networks are built up in order to save transportation cost. In the s... Transportation Problems (TP), as is known, are a basic network problem which can be formulated as a Linear Programming Problem (LPP). Transportation networks are built up in order to save transportation cost. In the solution procedure of a TP, finding an Initial Basic Feasible Solution (IBFS) is necessary to obtain the optimal solution. Optimality gives us the optimal route that prompts either most extreme benefit or least aggregate cost whichever is required. In this research paper, a new method named Least Cost Mean Method is proposed to obtain a better IBFS where row penalty and column penalty is brought out by the mean of lowest and next lowest cost of each row and each column of the cost matrix. The method is illustrated with numerical examples. To verify the performance of the proposed method, a comparative study is also carried out and observed that it is computationally easier and yielding comparatively better solution. 展开更多
关键词 Initial Basic feasible Solution Optimum Solution Penalty Cost
下载PDF
Bee Colony Optimization Algorithm for Routing and Wavelength Assignment Based on Directional Guidance in Satellite Optical Networks
6
作者 Mai Yang Qi Zhang +8 位作者 Haipeng Yao Ran Gao Xiangjun Xin Feng Tian Weiying Feng Dong Chen Fu Wang Qinghua Tian Jinxi Qian 《China Communications》 SCIE CSCD 2023年第7期89-107,共19页
With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical netwo... With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical networks,this paper proposes a bee colony optimization algorithm for routing and wavelength assignment based on directional guidance(DBCO-RWA)in satellite optical networks.In D-BCORWA,directional guidance based on relative position and link load is defined,and then the link cost function in the path search stage is established based on the directional guidance factor.Finally,feasible solutions are expanded in the global optimization stage.The wavelength utilization,communication success probability,blocking rate,communication hops and convergence characteristic are simulated.The results show that the performance of the proposed algorithm is improved compared with existing algorithms. 展开更多
关键词 routing and wavelength assignment satel-lite optical networks bee colony optimization algo-rithm directional guidance feasible solution extension
下载PDF
Hybrid optimization of dynamic deployment for networked fire control system 被引量:7
7
作者 Chen Chen Jie Chen Bin Xin 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第6期954-961,共8页
With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally... With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally destroy enemy targets from arbitrary angle in a limited time, the research on firepower nodes dynamic deployment becomes a key problem of command and control. Considering a variety of tactical indexes and actual constraints in air defense, a mathematical model is formulated to minimize the enemy target penetration probability. Based on characteristics of the mathematical model and demands of the deployment problems, an assistance-based algorithm is put forward which combines the artificial potential field (APF) method with a memetic algorithm. The APF method is employed to solve the constraint handling problem and generate feasible solutions. The constrained optimization problem transforms into an optimization problem of APF parameters adjustment, and the dimension of the problem is reduced greatly. The dynamic deployment is accomplished by generation and refinement of feasible solutions. The simulation results show that the proposed algorithm is effective and feasible in dynamic situation. 展开更多
关键词 deployment optimization artificial potential field (APF) constraint handling generation of feasible solutions memetic algorithm
下载PDF
Choice of discount rate in reinforcement learning with long-delay rewards 被引量:1
8
作者 LIN Xiangyang XING Qinghua LIU Fuxian 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2022年第2期381-392,共12页
In the world, most of the successes are results of longterm efforts. The reward of success is extremely high, but before that, a long-term investment process is required. People who are “myopic” only value short-ter... In the world, most of the successes are results of longterm efforts. The reward of success is extremely high, but before that, a long-term investment process is required. People who are “myopic” only value short-term rewards and are unwilling to make early-stage investments, so they hardly get the ultimate success and the corresponding high rewards. Similarly, for a reinforcement learning(RL) model with long-delay rewards, the discount rate determines the strength of agent’s “farsightedness”.In order to enable the trained agent to make a chain of correct choices and succeed finally, the feasible region of the discount rate is obtained through mathematical derivation in this paper firstly. It satisfies the “farsightedness” requirement of agent. Afterwards, in order to avoid the complicated problem of solving implicit equations in the process of choosing feasible solutions,a simple method is explored and verified by theoreti cal demonstration and mathematical experiments. Then, a series of RL experiments are designed and implemented to verify the validity of theory. Finally, the model is extended from the finite process to the infinite process. The validity of the extended model is verified by theories and experiments. The whole research not only reveals the significance of the discount rate, but also provides a theoretical basis as well as a practical method for the choice of discount rate in future researches. 展开更多
关键词 reinforcement learning(RL) discount rate longdelay reward Q-LEARNING treasure-detecting model feasible solution
下载PDF
Two-phase Method without Any Artificial Variable 被引量:1
9
作者 梁平 张旭利 张相斌 《Northeastern Mathematical Journal》 CSCD 2008年第5期395-398,共4页
A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear progr... A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear programming. Compared with the traditional two-phase method, it has advantages of saving the memories and reducing the computational efforts. 展开更多
关键词 initial basic feasible solution auxiliary linear programming two-phase method artificial variable
下载PDF
Incessant Allocation Method for Solving Transportation Problems 被引量:1
10
作者 Mollah Mesbahuddin Ahmed Aminur Rahman Khan +1 位作者 Faruque Ahmed Md. Sharif Uddin 《American Journal of Operations Research》 2016年第3期236-244,共9页
Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to a... Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to analyze and minimize transportation cost. This problem is well discussed in operation research for its wide application in various fields, such as scheduling, personnel assignment, product mix problems and many others, so that this problem is really not confined to transportation or distribution only. In the solution procedure of a transportation problem, finding an initial basic feasible solution is the prerequisite to obtain the optimal solution. Again, development is a continuous and endless process to find the best among the bests. The growing complexity of management calls for development of sound methods and techniques for solution of the problems. Considering these factors, this research aims to propose an algorithm “Incessant Allocation Method” to obtain an initial basic feasible solution for the transportation problems. Several numbers of numerical problems are also solved to justify the method. Obtained results show that the proposed algorithm is effective in solving transportation problems. 展开更多
关键词 Transportation Models Initial Basic feasible Solution Optimal Solution Incessant Allocation Method
下载PDF
Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs
11
作者 HAN You-pan CHEN Zhi-ping ZHANG Feng 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2015年第1期102-110,共9页
When all the involved data in indefinite quadratic programs change simultaneously, we show the locally Lipschtiz continuity of the KKT set of the quadratic programming problem firstly, then we establish the locally Li... When all the involved data in indefinite quadratic programs change simultaneously, we show the locally Lipschtiz continuity of the KKT set of the quadratic programming problem firstly, then we establish the locally Lipschtiz continuity of the KKT solution set. Finally, the similar conclusion for the corresponding optimal value function is obtained. 展开更多
关键词 quadratic program Lipschitz continuity value function feasible solution KKT solution set.
下载PDF
A New Approach to Solve Transportation Problems
12
作者 Mollah Mesbahuddin Ahmed Aminur Rahman Khan +1 位作者 Md. Sharif Uddin Faruque Ahmed 《Open Journal of Optimization》 2016年第1期22-30,共9页
Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution... Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples. 展开更多
关键词 Transportation Problem Transportation Cost Initial Basic feasible Solution Optimal Solution
下载PDF
A Note on a Generalized Network Flow Model for Manufacturing Process 被引量:1
13
作者 Hai-yan Lu En-yu Yao Bin-wu Zhang 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2009年第1期51-60,共10页
Manufacturing network flow (MNF) is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of differen... Manufacturing network flow (MNF) is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of different materials into one product and/or the distilling of one type of material into many different products. Though a network simplex method for solving a simplified version of MNF has been outlined in the literature, more research work is still needed to give a complete answer whether some classical duality and optimality results of the classical network flow problem can be extended in MNF. In this paper, we propose an algorithmic method for obtaining an initial basic feasible solution to start the existing network simplex algorithm, and present a network-based approach to checking the dual feasibility conditions. These results are an extension of those of the ordinary network flow problem. 展开更多
关键词 Minimum. cost network flow network simplex method initial basic feasible solution partiallyordered set extended cycle
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部