scholarly journals An Integer Programming Model for Alternative Selection and Planning Stages for Cleaner Production Programs: a Case Study for Greenhouse Gases Reduction

2016 ◽  
Vol 19 (2) ◽  
pp. 5-17
Author(s):  
Thanh Van Tran ◽  
Hai Thanh Le
Keyword(s):  
Integer Programming ◽  
Greenhouse Gases ◽  
Programming Model ◽  
Electricity Consumption ◽  
Cleaner Production ◽  
Waste Reduction ◽  
Integer Programming Model ◽  
Proposed Model ◽  
Selection Of

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.

scholarly journals The unit train make-up scheme for loaded direction in the heavy haul railway

2019 ◽  
Vol 1 (1) ◽  
pp. 30-44 ◽  
Author(s):  
Yuqiang Wang ◽  
Yuguang Wei ◽  
Hua Shi ◽  
Xinyu Liu ◽  
Liyuan Feng ◽  
...  
Keyword(s):  
Integer Programming ◽  
Design Methodology ◽  
Arrival Time ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Content Type ◽  
Proposed Model ◽  
Heavy Haul ◽  
Heavy Haul Railway

Purpose The purpose of this paper is to study the unit train make-up scheme for loaded direction in the heavy haul railway. Design/methodology/approach A 0-1 nonlinear integer programming model with the aim of minimizing the idling period between actual train arrival time and expected train arrival time for all loaded unit trains are proposed. Findings The proposed model is applied into a case study based on Daqin heavy haul railway. Results show that the proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway. Originality/value The proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.

scholarly journals Transfer Coordination for Metro Networks during the Start- or End-of-Service Period

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Liqiao Ning ◽  
Peng Zhao ◽  
Wenkai Xu ◽  
Ke Qiao
Keyword(s):  
Integer Programming ◽  
Adverse Effects ◽  
Waiting Time ◽  
Programming Model ◽  
Mixed Integer ◽  
Service Period ◽  
Proposed Model ◽  
Transfer Success ◽  
Metro Networks

When travelling via metro networks during the start- or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.

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

2021 ◽  
Author(s):  
T. Andrade ◽  
R. Kelman ◽  
T. M. Cunha ◽  
L. R. Albuquerque ◽  
R. F. Calili
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Integer Programming Model ◽  
Selection Of
Sign in / Sign up

Export Citation Format

Share Document