scholarly journals A Linear Integer Programming Model for Fault Diagnosis in Active Distribution Systems With Bi-Directional Fault Monitoring Devices Installed

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 106452-106463
Author(s):  
Chongyu Wang ◽  
Kaiyuan Pang ◽  
Yan Xu ◽  
Fushuan Wen ◽  
Ivo Palu ◽  
...  
2013 ◽  
Vol 12 (2) ◽  
pp. 1
Author(s):  
R. A. CAHYADI ◽  
A. AMAN ◽  
F. HANUM

Penjadwalan keberangkatan bus merupakan salah satu hal yang penting dalam pengelolaan perusahaan otobus untuk menekan biaya operasional. Masalah penjadwalan ini diformulasikan sebagai suatu model linear integer programming. Model ini bertujuan untuk mengatur banyaknya bus yang akan diberangkatkan dari masing-masing kota untuk memenuhi permintaan transportasi. Strategi yang digunakan untuk mengatur penjadwalan bus yaitu strategi deadheading. Strategi deadheading merupakan strategi penjadwalan bus yang dilakukan apabila terjadi ketidakseimbangan akan banyaknya penumpang di suatu kota dan adanya keterbatasan bus yang beroperasi. Model penjadwalan dengan deadheading ini merupakan salah satu upaya untuk menurunkan frekuensi keberangkatan bus sehingga dapat meningkatkan efisiensi biaya operasional.


Information ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 188
Author(s):  
ZhiJian Ye ◽  
YanWei Li ◽  
JingTing Bai ◽  
XinXin Zheng

The purpose of this study is to ascertain whether implementation difficulty can be used in a slot allocation model as a new mechanism for slightly weakening grandfather rights; according to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within the slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.


Author(s):  
ZhiJian Ye ◽  
YanWei Li ◽  
JingTing Bai ◽  
Xinxin Zheng

The purpose of this study is to ascertain the effect of weight setting of objectives on displacement and implementation difficulty in slot allocation model. Therefore, a linear integer programming model including three kinds of evaluation objectives with different weights is designed to compare and analyze displacement and implementation difficulty. Test results show that the difficulty of implementation can be significantly reduced to a certain extent by weight setting with a little increase of displacement under the condition of specific capacity setting. In addition, whether the movements are listed in order of descending priority or not has a great impact on displacement and implementation difficulty in the model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to proposing an index of implementation difficulty for comparing and selecting suitable weights of evaluation objectives which can help decision makers to upgrade slot allocation policies.


2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.


Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 219
Author(s):  
Dhananjay Thiruvady ◽  
Kerri Morgan ◽  
Susan Bedingfield ◽  
Asef Nazari

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames.


2013 ◽  
Vol 380-384 ◽  
pp. 4506-4510
Author(s):  
Miao Du ◽  
Yong Qin ◽  
Zi Yang Wang ◽  
Zhong Xin Zhao ◽  
Hong Fei Yu ◽  
...  

At present, there are many problems existing in railway stations, such as excessive numbers and over-crowded layout, which seriously affect the scale benefit generation and rapid expansion of rail freight capacity. Aimed at these problems, a Mixed Integer programming model is proposed. Taking Lanzhou train operation depot for example, applying lingo software, the layout of freight station is obtained.


Sign in / Sign up

Export Citation Format

Share Document