scholarly journals Fuzzy programming for multi-choice bilevel transportation problem

2021 ◽  
Vol 31 (3) ◽  
Author(s):  
Ritu Arora ◽  
Kavita Gupta
Keyword(s):  
Transportation Problem ◽  
Hotel Industry ◽  
Fuzzy Programming ◽  
Decision Makers ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Demand And Supply ◽  
Bilevel Transportation ◽  
Mixed Integer Programming Problem ◽  
Solution Methodology

Multi-choice programming problems arise due to diverse needs of people. In this paper, multi-choice optimisation is applied to bilevel transportation problem. This problem deals with transportation at both the levels, upper as well as lower. There are multiple choices for demand and supply parameters. The multi-choice parameters at the respective levels are converted into polynomials which transmute the defined problem into a mixed integer programming problem. The objective of the paper is to determine a solution methodology for the transformed problem. The significance of the formulated model is exhibited through an example by applying it to a hotel industry. The fuzzy programing approach is employed to obtain the satisfactory solution for the decision makers at the two levels. A comparative analysis is presented in the paper by solving bilevel multi-choice transportation problem with goal programming mode as well as by the linear transformation technique proposed in the paper by Khalil et al. The example is solved using computing software.

scholarly journals A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Godfrey Chagwiza ◽  
Chipo Chivuraise ◽  
Christopher T. Gadzirayi
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Moringa Oleifera ◽  
Bat Algorithm ◽  
Mixed Integer ◽  
Poultry Feed ◽  
Integer Programming Problem ◽  
Optimum Solution ◽  
Mixed Integer Programming Problem ◽  
Number Of Iterations

In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

Scheduling of Yard Truck Considering Loading and Unloading Simultaneously in an Underground Container Logistics System

2021 ◽  
pp. 036119812110478
Author(s):  
Yinping Gao ◽  
Daofang Chang ◽  
Jun Yuan ◽  
Chengji Liang
Keyword(s):  
Genetic Algorithm ◽  
Container Terminals ◽  
Mixed Integer ◽  
Operating Efficiency ◽  
Adaptive Genetic Algorithm ◽  
Integer Programming Problem ◽  
Logistics System ◽  
Container Logistics ◽  
Loading And Unloading ◽  
Mixed Integer Programming Problem

With the rapid growth of containers and scarce of land, the underground container logistics system (UCLS) presents a logical alternative for container terminals to better protect the environment and relieve traffic pressure. The operating efficiency of container terminals is one of the competitive edges over other terminals, which requires UCLS to be well integrated with the handling process of the storage yard. In UCLS, yard trucks (YTs) serve different handling points dynamically instead of one fixed handling point, and yard cranes (YCs) perform loading and unloading simultaneously. To minimize the total time of handling all containers in UCLS, the mixed integer programming problem is described and solved using an adaptive genetic algorithm (AGA). The convergence speed and accuracy of AGA are demonstrated by comparison with conventional genetic algorithm (GA). Additionally, AGA and CPLEX are compared with different scale cases. Experimental results show that the proposed algorithm is superior to CPLEX in resulted solutions and calculation time. A sensitivity analysis is provided to obtain reasonable numbers of YTs for scheduling between handling points and the storage yard in UCLS.

The Optimal Controlled Partitioning Strategy for Power System Based on Master-Slave Problem

2013 ◽  
Vol 385-386 ◽  
pp. 999-1006
Author(s):  
Wei Wang ◽  
Ting Yu ◽  
Tian Jiao Pu ◽  
Ai Zhong Tian ◽  
Ji Keng Lin
Keyword(s):  
Large Scale ◽  
Optimization Method ◽  
Mixed Integer ◽  
Master Problem ◽  
Decomposition Algorithms ◽  
Integer Programming Problem ◽  
Complete Model ◽  
New Approach ◽  
Mixed Integer Programming Problem ◽  
Partitioning Strategy

Controlled partitioning strategy is one of the effective measures taken for the situation when system out-of-step occurs. The complete splitting model, mostly solved by approximate decomposition algorithms, is a large-scale nonlinear mixed integer programming problem. A new alternate optimization method based on master-slave problem to search for optimal splitting strategy is proposed hereby. The complete model was converted into master-slave problems based on CGKP (Connected Graph Constrained Knapsack Problem). The coupling between master problem and slave problem is achieved through load adjustment. A better splitting strategy can be obtained through the alternating iteration between the master problem and the salve problem. The results of the examples show that the method can obtain better splitting strategy with less shed load than other approximate algorithms, which verifies the feasibility and effectiveness of the new approach presented.

scholarly journals Distributionally robust chance constrained svm model with $\ell_2$-Wasserstein distance

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Qing Ma ◽  
Yanjun Wang
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Numerical Experiments ◽  
Wasserstein Distance ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Discrete Form ◽  
Svm Model ◽  
Distributionally Robust ◽  
Mixed Integer Programming Problem

<p style='text-indent:20px;'>In this paper, we propose a distributionally robust chance-constrained SVM model with <inline-formula><tex-math id="M1">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein ambiguity. We present equivalent formulations of distributionally robust chance constraints based on <inline-formula><tex-math id="M2">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein ambiguity. In terms of this method, the distributionally robust chance-constrained SVM model can be transformed into a solvable linear 0-1 mixed integer programming problem when the <inline-formula><tex-math id="M3">\begin{document}$ \ell_2 $\end{document}</tex-math></inline-formula>-Wasserstein distance is discrete form. The DRCC-SVM model could be transformed into a tractable 0-1 mixed-integer SOCP programming problem for the continuous case. Finally, numerical experiments are given to illustrate the effectiveness and feasibility of our model.</p>

scholarly journals MULTI-LEVEL OPTIMIZATION OF AN AUTOMOTIVE CLOSED-LOOP SUPPLY CHAIN NETWORK WITH INTERACTIVE FUZZY PROGRAMMING APPROACHES

2018 ◽  
Vol 24 (3) ◽  
pp. 1004-1028 ◽  
Author(s):  
Abdullah YILDIZBAŞI ◽  
Ahmet ÇALIK ◽  
Turan PAKSOY ◽  
Reza ZANJİRANİ FARAHANİ ◽  
Gerhard-Wilhelm WEBER
Keyword(s):  
Supply Chain ◽  
Automotive Industry ◽  
Closed Loop ◽  
Fuzzy Programming ◽  
Decision Makers ◽  
Mixed Integer ◽  
Closed Loop Supply Chain ◽  
Trade Offs ◽  
End Products ◽  
Multi Level

Closed-Loop Supply Chain (CLSC) management has attained appreciable attention over the last few years. CLSC management allows companies to manage their recovery and recycling activities of end products. Due to the latest developments in the world, producers are responsible for the collection, refurbishing, repairing and disassembly of end products at the end of their lives. This paper develops a mixed-integer CLSC model that is inspired by the automotive industry. In this model, we consider three Decision Makers (DM): Plant, Dismantler Center and Customer. Each DM has individual objectives and is responsible for only its own objective function under same constraints. In order to tackle the trade-offs among the objectives, we used four different Interac-tive Fuzzy Programming (IFP) approaches. The applications of the model and solution techniques are investigated in conjectural data. The paper ends with a conclusion and a call for future studies.

Sign in / Sign up

Export Citation Format

Share Document