This page has only limited features, please log in for full access.
The depletion of natural resources and the degradation of the ecosystem have led many countries to adopt closed-loop supply activities in both their industrial and service sectors. With the widespread use of Internet technology, these aspects motivate the incorporation of e-commerce with the classical closed-loop supply chain. This study suggests a novel mixed-integer linear programming (MILP) model that addresses the integration of e-commerce with a multi-echelon closed-loop supply chain with a multi-period planning time horizon by considering dual channels in manufacturing, and recovery facilities. To validate the model, we obtain optimal decision variables and examine the robustness and applicability of the model, and comprehensive computational experiments are performed. Moreover, sensitivity analysis is carried out to illustrate the efficacy of e-commerce integration by considering the two channels in the closed-loop supply chain. Accordingly, the total cost of the dual-channel CLSC decreases with an increase in customer demand via online retailers, the returned end of life (EOL) products, recycling ratio, and recovery ratio. Some useful managerial implications are provided based on the conducted analysis.
Essam Kaoud; Mohammad Abdel-Aal; Tatsuhiko Sakaguchi; Naoki Uchiyama. Design and Optimization of the Dual-Channel Closed Loop Supply Chain with E-Commerce. Sustainability 2020, 12, 10117 .
AMA StyleEssam Kaoud, Mohammad Abdel-Aal, Tatsuhiko Sakaguchi, Naoki Uchiyama. Design and Optimization of the Dual-Channel Closed Loop Supply Chain with E-Commerce. Sustainability. 2020; 12 (23):10117.
Chicago/Turabian StyleEssam Kaoud; Mohammad Abdel-Aal; Tatsuhiko Sakaguchi; Naoki Uchiyama. 2020. "Design and Optimization of the Dual-Channel Closed Loop Supply Chain with E-Commerce." Sustainability 12, no. 23: 10117.
Sheet metal processing is a popular machining technique. In sheet metal processing, as many parts as possible are cut from a metal sheet to effectively use the metal without waste. The parts cut from the sheet metal are processed by a specified due-date. To meet the due-date, scheduling is important. The optimizations of the cutting layout and schedule are called nesting and scheduling, respectively. The relation between them sometimes exhibits a trade-off. To enhance the efficiency of the entire manufacturing process, nesting and scheduling should be considered simultaneously. Therefore, in this study, we proposed an environment-adaptive genetic-algorithm-based nesting scheduling method for the simultaneous consideration of two related problems with different optimization targets. We treated the problems as different environments, and the cutting layout and processing order of the parts evolved in each environment using the genetic algorithm.
Tatsuhiko Sakaguchi; Ryo Ishii; Miyori Shirasuna; Naoki Uchiyama. Environment-Adaptive Genetic Algorithm-based Nesting Scheduling for Sheet-Metal Processing. Transactions of the Institute of Systems, Control and Information Engineers 2020, 33, 39 -48.
AMA StyleTatsuhiko Sakaguchi, Ryo Ishii, Miyori Shirasuna, Naoki Uchiyama. Environment-Adaptive Genetic Algorithm-based Nesting Scheduling for Sheet-Metal Processing. Transactions of the Institute of Systems, Control and Information Engineers. 2020; 33 (2):39-48.
Chicago/Turabian StyleTatsuhiko Sakaguchi; Ryo Ishii; Miyori Shirasuna; Naoki Uchiyama. 2020. "Environment-Adaptive Genetic Algorithm-based Nesting Scheduling for Sheet-Metal Processing." Transactions of the Institute of Systems, Control and Information Engineers 33, no. 2: 39-48.
In sheet metal processing, nesting and scheduling are important factors affecting the efficiency and agility of manufacturing. The objective of nesting is to minimize the waste of material, while that of scheduling is to optimize the processing sequence. As the relation between them often becomes a trade-off, they should be considered simultaneously for the efficiency of the total manufacturing process. In this study, we propose a co-evolutionary genetic algorithm-based nesting scheduling method. We first define a cost function as a fitness value, and then we propose a grouping method that forms gene groups based on the processing layout and processing time. Finally, we validate the effectiveness of the proposed method through computational experiments.
Tatsuhiko Sakaguchi; Kohki Matsumoto; Naoki Uchiyama. Nesting Scheduling in Sheet Metal Processing Based on Coevolutionary Genetic Algorithm in Different Environments. International Journal of Automation Technology 2018, 12, 730 -738.
AMA StyleTatsuhiko Sakaguchi, Kohki Matsumoto, Naoki Uchiyama. Nesting Scheduling in Sheet Metal Processing Based on Coevolutionary Genetic Algorithm in Different Environments. International Journal of Automation Technology. 2018; 12 (5):730-738.
Chicago/Turabian StyleTatsuhiko Sakaguchi; Kohki Matsumoto; Naoki Uchiyama. 2018. "Nesting Scheduling in Sheet Metal Processing Based on Coevolutionary Genetic Algorithm in Different Environments." International Journal of Automation Technology 12, no. 5: 730-738.
Kazuma Oguma; Tatsuhiko Sakaguchi; Naoki Uchiyama. A heuristic scheduling based on estimated processing time for hierarchical distributed manufacturing system. The Proceedings of Mechanical Engineering Congress, Japan 2017, 2017, S1420104 .
AMA StyleKazuma Oguma, Tatsuhiko Sakaguchi, Naoki Uchiyama. A heuristic scheduling based on estimated processing time for hierarchical distributed manufacturing system. The Proceedings of Mechanical Engineering Congress, Japan. 2017; 2017 ():S1420104.
Chicago/Turabian StyleKazuma Oguma; Tatsuhiko Sakaguchi; Naoki Uchiyama. 2017. "A heuristic scheduling based on estimated processing time for hierarchical distributed manufacturing system." The Proceedings of Mechanical Engineering Congress, Japan 2017, no. : S1420104.
Under growing concerns with sustainable society, green or low carbon logistic optimization is becoming a keen interest to provide a plausible solution aiming at qualified service in global and competitive distribution system. As a key technology for such deployment, this chapter proposes a hybrid method of simultaneous pickup and delivery VRP aiming at rational framework available for real world applications. In its general procedure, the initial solution is derived from a modified saving method that consider the cost accounting known as Weber model or a bi-linear model of distance and weight. Then, it is updated by a modified tabu search to improve the tentative solution as much as possible. The idea is further extended to a non-linear or generalized Weber model. Numerical experiments are taken place to validate effectiveness of the proposed method through comparison.
Yoshiaki Shimizu; Tatsuhiko Sakaguchi. A Meta-heuristic Approach for VRP with Simultaneous Pickup and Delivery Incorporated with Ton-Kilo Basis Saving Method. Happy City - How to Plan and Create the Best Livable Area for the People 2014, 597 -609.
AMA StyleYoshiaki Shimizu, Tatsuhiko Sakaguchi. A Meta-heuristic Approach for VRP with Simultaneous Pickup and Delivery Incorporated with Ton-Kilo Basis Saving Method. Happy City - How to Plan and Create the Best Livable Area for the People. 2014; ():597-609.
Chicago/Turabian StyleYoshiaki Shimizu; Tatsuhiko Sakaguchi. 2014. "A Meta-heuristic Approach for VRP with Simultaneous Pickup and Delivery Incorporated with Ton-Kilo Basis Saving Method." Happy City - How to Plan and Create the Best Livable Area for the People , no. : 597-609.
Yoshiaki Shimizu; Tatsuhiko Sakaguchi. Generalized Vehicle Routing Problem for Reverse Logistics Aiming at Low Carbon Transportation. Industrial Engineering & Management Systems 2013, 12, 161 -170.
AMA StyleYoshiaki Shimizu, Tatsuhiko Sakaguchi. Generalized Vehicle Routing Problem for Reverse Logistics Aiming at Low Carbon Transportation. Industrial Engineering & Management Systems. 2013; 12 (2):161-170.
Chicago/Turabian StyleYoshiaki Shimizu; Tatsuhiko Sakaguchi. 2013. "Generalized Vehicle Routing Problem for Reverse Logistics Aiming at Low Carbon Transportation." Industrial Engineering & Management Systems 12, no. 2: 161-170.