The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded b...The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded by the environmental regulations, consumer awareness and the prevailing social consciousness. In this context, this research work addresses a closed loop supply chain network problem of fashion leather goods industry, with an objective of minimizing the total cost of the entire supply chain and also reducing the total waste from the end of life product returns. The research work commenced with a literature review on the reverse and closed loop supply chain network design problems of fashion and leather goods industry dealt in the past. Then, the identified CLSCND problem is solved using a mathematical model based on Mixed Integer Non-Linear Programme (MINLP) and then a suitable Hybrid Genetic Algorithm (HGA) developed for the CLSCND is implemented for obtaining optimum solution. Both the MINLP model and HGA are customized as per the CLSCND problem chosen and implemented for the industrial case of an Indian Fashion Leather Goods Industry. Finally, the solutions obtained for MINLP model in LINGO 15 and for HGA in VB.NET platform are compared and presented. The optimum solution obtained from the suitable HGA is illustrated as an optimum shipment pattern for the closed loop supply chain network design problem of the fashion leather goods industry case.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the ma...This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances.展开更多
The two-stage hybridflow shop problem under setup times is addressed in this paper.This problem is NP-Hard.on the other hand,the studied problem is modeling different real-life applications especially in manufacturing...The two-stage hybridflow shop problem under setup times is addressed in this paper.This problem is NP-Hard.on the other hand,the studied problem is modeling different real-life applications especially in manufacturing and high performance-computing.Tackling this kind of problem requires the development of adapted algorithms.In this context,a metaheuristic using the genetic algorithm and three heuristics are proposed in this paper.These approximate solutions are using the optimal solution of the parallel machines under release and delivery times.Indeed,these solutions are iterative procedures focusing each time on a particular stage where a parallel machines problem is called to be solved.The general solution is then a concatenation of all the solutions in each stage.In addition,three lower bounds based on the relaxation method are provided.These lower bounds present a means to evaluate the efficiency of the developed algorithms throughout the measurement of the relative gap.An experimental result is discussed to evaluate the performance of the developed algorithms.In total,8960 instances are implemented and tested to show the results given by the proposed lower bounds and heuristics.Several indicators are given to compare between algorithms.The results illustrated in this paper show the performance of the developed algorithms in terms of gap and running time.展开更多
With the challenge of great growing of transport diversity for the automobile enterprises, the heterogeneous vehicle routing problem with multiple depots, multiple types of finished vehicles and multiple types of tran...With the challenge of great growing of transport diversity for the automobile enterprises, the heterogeneous vehicle routing problem with multiple depots, multiple types of finished vehicles and multiple types of transport vehicles in finished vehicle logistics(HVRPMD) is modelled and solved. A multi-objective optimization model for HVRPMD is presented considering loading constraints to minimize the total cost and minimize the number of transport vehicles. Then a hybrid heuristic algorithm based on genetic algorithm and particle swarm optimization(GA-PSO) is developed. Moreover, a case study is used to evaluate the effectiveness of this algorithm. By comparing the GA-PSO algorithm with the traditional GA algorithm, the simulation results demonstrate the proposed GA-PSO algorithm is able to better support the HVRPMD problem in practice. Contributions of the paper are the modelling and solving of a complex HVRPMD in logistics industry.展开更多
文摘The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded by the environmental regulations, consumer awareness and the prevailing social consciousness. In this context, this research work addresses a closed loop supply chain network problem of fashion leather goods industry, with an objective of minimizing the total cost of the entire supply chain and also reducing the total waste from the end of life product returns. The research work commenced with a literature review on the reverse and closed loop supply chain network design problems of fashion and leather goods industry dealt in the past. Then, the identified CLSCND problem is solved using a mathematical model based on Mixed Integer Non-Linear Programme (MINLP) and then a suitable Hybrid Genetic Algorithm (HGA) developed for the CLSCND is implemented for obtaining optimum solution. Both the MINLP model and HGA are customized as per the CLSCND problem chosen and implemented for the industrial case of an Indian Fashion Leather Goods Industry. Finally, the solutions obtained for MINLP model in LINGO 15 and for HGA in VB.NET platform are compared and presented. The optimum solution obtained from the suitable HGA is illustrated as an optimum shipment pattern for the closed loop supply chain network design problem of the fashion leather goods industry case.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金Supported by the National Natural Science Foundation of China(11071220,11001242,11201428)Zhejiang Provincial Natural Science Foundation of China(LY13A010015)Educational Commission of Zhejiang Province of China(Y201019076)
文摘This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances.
基金The authors would like to thank the Deanship of Scientific Research at Majmaah University for supporting this work under Project Number No.1439-19.
文摘The two-stage hybridflow shop problem under setup times is addressed in this paper.This problem is NP-Hard.on the other hand,the studied problem is modeling different real-life applications especially in manufacturing and high performance-computing.Tackling this kind of problem requires the development of adapted algorithms.In this context,a metaheuristic using the genetic algorithm and three heuristics are proposed in this paper.These approximate solutions are using the optimal solution of the parallel machines under release and delivery times.Indeed,these solutions are iterative procedures focusing each time on a particular stage where a parallel machines problem is called to be solved.The general solution is then a concatenation of all the solutions in each stage.In addition,three lower bounds based on the relaxation method are provided.These lower bounds present a means to evaluate the efficiency of the developed algorithms throughout the measurement of the relative gap.An experimental result is discussed to evaluate the performance of the developed algorithms.In total,8960 instances are implemented and tested to show the results given by the proposed lower bounds and heuristics.Several indicators are given to compare between algorithms.The results illustrated in this paper show the performance of the developed algorithms in terms of gap and running time.
基金Supported by the National Natural Science Foundation of China(No.51565036)。
文摘With the challenge of great growing of transport diversity for the automobile enterprises, the heterogeneous vehicle routing problem with multiple depots, multiple types of finished vehicles and multiple types of transport vehicles in finished vehicle logistics(HVRPMD) is modelled and solved. A multi-objective optimization model for HVRPMD is presented considering loading constraints to minimize the total cost and minimize the number of transport vehicles. Then a hybrid heuristic algorithm based on genetic algorithm and particle swarm optimization(GA-PSO) is developed. Moreover, a case study is used to evaluate the effectiveness of this algorithm. By comparing the GA-PSO algorithm with the traditional GA algorithm, the simulation results demonstrate the proposed GA-PSO algorithm is able to better support the HVRPMD problem in practice. Contributions of the paper are the modelling and solving of a complex HVRPMD in logistics industry.
