An integer programming model for the selection of pumped‐hydro storage projects

Author(s):  
T. Andrade ◽  
R. Kelman ◽  
T. M. Cunha ◽  
L. R. Albuquerque ◽  
R. F. Calili
2016 ◽  
Vol 19 (2) ◽  
pp. 5-17
Author(s):  
Thanh Van Tran ◽  
Hai Thanh Le

The selection of subjects (such as waste stream, process, apparatus, ect.) for improvement and development their alternatives when implementing cleaner production (CP) programs at the company in order to achieve the highest efficiency is a complex and timeconsuming process, especially in case when there are many subjects to be improved, and many alternatives for each subject. The problem in this case is which subject and its respective alternative is to be selected in order to obtain maximal waste reduction objective with minimization cost. To solve this problem, this article proposes an optimization mathematical model to support alternatives selection for CP programs. In this study, an integer programming model is applied for defining theselection steps of alternatives and setting the implementing plan within CP program. The proposed model is investigated in a real case study at a cassava starch factory in Tay Ninh, Vietnam (where is the most concentrated area of cassava processing in the country) with purpose to propose the measures for reduction of greenhouse gases (GHGs) and electricity consumption. The results show that this model can be considered as a new effective method for alternative CP selection and planning for CP implementation, especially in case of many subjects and alternatives. The solution of this model can be generalized to apply in any cases with unlimited number of subjects and alternatives.


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