scholarly journals Multi-Objective Production Programming to Systematic Sorting and Remanufacturing in Second-Hand Clothing Recycling Industry

Symmetry ◽  
2020 ◽  
Vol 12 (7) ◽  
pp. 1161
Author(s):  
Chun-Wei Remen Lin ◽  
Min Tsung Chen ◽  
Ming-Lang Tseng ◽  
Tatre Jantarakolica ◽  
Helen Xu
Keyword(s):  
Programming Model ◽  
Clothing Industry ◽  
Recycling Rate ◽  
Sorting Method ◽  
Recycling Industry ◽  
Multi Objective ◽  
Final Destination ◽  
Different Types ◽  
New Material ◽  
Recycle Rate

This study proposes a multi-objective production programming model which is established for systematic sorting and remanufacturing second-hand clothes and the objectives are twofold: (1) minimizing the remanufacturing cost to maintain the competitiveness of second-hand clothing industry and (2) maximizing the recycle rate to reduce the environmental impact from the disposed clothes. Previous studies are lacking to involve the features of second-hand clothing recycled from reuse to recycle in optimizing both the remanufacturing costs and recycle rate. The consequential final destination of consumers’ second-hand clothes is either resold, donated, or disposed of. This study applied sensitivity analysis by varying production cost and new material cost are conducted to evaluate the suitability of three different types of sorting methods for second-hand clothes before let them entering the remanufacturing processes on (1) categories the used clothes; (2) worn-out conditions (high, medium, low), and (3) clothes materials (cotton, linen, wool, silk, artificial fiber). The results show that the first sorting method by clothing categories outperforms the other two methods in maximizing the recycling rate. The second sorting method by worn-out condition generates a minimal remanufacturing cost. The recycling scenarios are simulated to verify the applicability of the proposed programming model with respect to the three sorting methods. The results show that Taiwan exhibited superior the recycle rates and Bangladesh had lower remanufacturing costs by adopting the sorting method by clothes materials.

scholarly journals Study on coloring method of airport flight-gate allocation problem

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hongyan Li ◽  
Xianfeng Ding ◽  
Jiang Lin ◽  
Jingyu Zhou
Keyword(s):  
Graph Coloring ◽  
Programming Model ◽  
Weight Vector ◽  
Multi Objective ◽  
Average Value ◽  
Two Factors ◽  
Minimum Number ◽  
First Come First Serve ◽  
Airport Terminals ◽  
Single Objective

Abstract With the development of economy, more and more people travel by plane. Many airports have added satellite halls to relieve the pressure of insufficient boarding gates in airport terminals. However, the addition of satellite halls will have a certain impact on connecting flights of transit passengers and increase the difficulty of reasonable allocation of flight and gate in airports. Based on the requirements and data of question F of the 2018 postgraduate mathematical contest in modeling, this paper studies the flight-gate allocation of additional satellite halls at airports. Firstly, match the seven types of flights with the ten types of gates. Secondly, considering the number of gates used and the least number of flights not allocated to the gate, and adding the two factors of the overall tension of passengers and the minimum number of passengers who failed to transfer, the multi-objective 0–1 programming model was established. Determine the weight vector $w=(0.112,0.097,0.496,0.395)$ w = ( 0.112 , 0.097 , 0.496 , 0.395 ) of objective function by entropy value method based on personal preference, then the multi-objective 0–1 programming model is transformed into single-objective 0–1 programming model. Finally, a graph coloring algorithm based on parameter adjustment is used to solve the transformed model. The concept of time slice was used to determine the set of time conflicts of flight slots, and the vertex sequences were colored by applying the principle of “first come first serve”. Applying the model and algorithm proposed in this paper, it can be obtained that the average value of the overall tension degree of passengers minimized in question F is 35.179%, the number of flights successfully allocated to the gate maximized is 262, and the number of gates used is minimized to be 60. The corresponding flight-gate difficulty allocation weight is $\alpha =0.32$ α = 0.32 and $\beta =0.40$ β = 0.40 , and the proportion of flights successfully assigned to the gate is 86.469%. The number of passengers who failed to transfer was 642, with a failure rate of 23.337%.

scholarly journals Healthcare Facility Location-Allocation Optimization for China’s Developing Cities Utilizing a Multi-Objective Decision Support Approach

2018 ◽  
Vol 10 (12) ◽  
pp. 4580 ◽  
Author(s):  
Li Wang ◽  
Huan Shi ◽  
Lu Gan
Keyword(s):  
Heuristic Algorithms ◽  
Programming Model ◽  
Rapid Development ◽  
Supply And Demand ◽  
Healthcare Facility ◽  
Allocation Model ◽  
Location Allocation ◽  
Multi Objective ◽  
Conflicting Objectives ◽  
Allocation Problems

With rapid development of the healthcare network, the location-allocation problems of public facilities under increased integration and aggregation needs have been widely researched in China’s developing cites. Since strategic formulation involves multiple conflicting objectives and stakeholders, this paper presents a practicable hierarchical location-allocation model from the perspective of supply and demand to characterize the trade-off between social, economical and environmental factors. Due to the difficulties of rationally describing and the efficient calculation of location-allocation problems as a typical Non-deterministic Polynomial-Hard (NP-hard) problem with uncertainty, there are three crucial challenges for this study: (1) combining continuous location model with discrete potential positions; (2) introducing reasonable multiple conflicting objectives; (3) adapting and modifying appropriate meta-heuristic algorithms. First, we set up a hierarchical programming model, which incorporates four objective functions based on the actual backgrounds. Second, a bi-level multi-objective particle swarm optimization (BLMOPSO) algorithm is designed to deal with the binary location decision and capacity adjustment simultaneously. Finally, a realistic case study contains sixteen patient points with maximum of six open treatment units is tested to validate the availability and applicability of the whole approach. The results demonstrate that the proposed model is suitable to be applied as an extensive planning tool for decision makers (DMs) to generate policies and strategies in healthcare and design other facility projects.

A fuzzy multi-objective programming optimization model for emergency resource dispatching under equitable distribution principle

2021 ◽  
pp. 1-10
Author(s):  
Zhaoping Tang ◽  
Wenda Li ◽  
Shijun Yu ◽  
Jianping Sun
Keyword(s):  
Optimization Model ◽  
Programming Model ◽  
Ideal Point ◽  
Optimal Solution ◽  
Multi Objective ◽  
Emergency Rescue ◽  
Satisfaction Degree ◽  
Multi Objective Programming ◽  
Parameter Interval ◽  
Objective Programming

In the initial stage of emergency rescue for major railway emergencies, there may be insufficient emergency resources. In order to ensure that all the emergency demand points can be effectively and fairly rescued, considering the fuzzy properties of the parameters, such as the resource demand quantity, the dispatching time and the satisfaction degree, the railway emergency resources dispatching optimization model is studied, with multi- demand point, multi-depot, and multi-resource. Based on railway rescue features, it was proposed that the couple number of relief point - emergency point is the key to affect railway rescue cost and efficiency. Under the premise of the maximum satisfaction degree of quantity demanded at all emergency points, a multi-objective programming model is established by maximizing the satisfaction degree of dispatching time and the satisfaction degree of the couple number of relief point - emergency point. Combined with the ideal point method, a restrictive parameter interval method for optimal solution was designed, which can realize the quick seek of Pareto optimal solution. Furthermore, an example is given to verify the feasibility and effectiveness of the method.

A Multi-Objective Programming Model of Dynamic Adjusting Flight Traffic

2014 ◽  
Vol 538 ◽  
pp. 127-133 ◽  
Author(s):  
Zhao Ning Zhang ◽  
Zhong Zhou Hao ◽  
Zheng Gao
Keyword(s):  
Load Balance ◽  
Optimal Allocation ◽  
Least Squares Method ◽  
Programming Model ◽  
Limiting Factors ◽  
Flight Delays ◽  
Traffic Demand ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Objective Programming

To alleviate the conflicts between the current flight traffic demand and the resource constraints of airspace, we need to improve the restrictions of flow allocation caused by the static air traffic flow allocation mode. The author analyzes the optimal allocation problem of dynamic adjusting flight flow and draws the conclusion that the problem should satisfy multiple targets, such as low flight delays, low flight cost and balancing the load of the route. Then consider a variety of limiting factors, such as the capacity of the route, flight planning, emergency situations, etc. Then establish multi-objective programming model of dynamic adjusting flight traffic. The objective function is determined by the flight cost, the flight delays and the value of the load balance. And the value of the load balance was first proposed according to the idea of least squares method. Then solve the model based on linear weighted technique. Finally the numerical result shows that the model can satisfy the multiple objectives and dynamic adjust the flight traffic optimally, that proves the rationality and validity of the model and the algorithm.

Sign in / Sign up

Export Citation Format

Share Document