In this research, we study an extended version of the joint order batching and scheduling optimization for manual vegetable order picking and packing lines with consideration of workers’ fatiguing effect. This problem is faced by many B2C fresh produce grocers in China on a daily basis which could severely decrease overall workflow efficiency in distribution center and customer satisfaction. In this order batching and sequencing problem, the setup time for processing each batch is volume-dependent and similarity dependent, as less ergonomic motion is needed in replenishing and picking similar orders. In addition, each worker’s fatiguing effect, usually caused by late shift and repetitive operation, which affects order processing times, is assumed to follow a general form of logistic growth with respect to the start time of order processing. We develop a heuristic approach to solve the resultant NP-hard problem for minimization of the total completion time. For order batching, a revised similarity index takes into account not only the number of common items in any two orders but also the proportion of these items based on the vegetable order feature. To sequence batches, the genetic algorithm is adapted and improved with proposed several efficient initialization and precedence rules. Within each batch, a revised nondecreasing item quantity algorithm is used. The performance of the proposed heuristic solution approach is evaluated using numerical instances generated from practical warehouse operations of our partnering B2C grocer. The efficiency of the proposed heuristic approach is demonstrated.
Following rapid growth of distributed energy resources, localized peer-to-peer energy transactions are receiving more attention for multiple benefits. To promote distributed renewables locally, local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. A selfish upper level agent is assumed with privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on energy transaction amount and prices. Aiming at reducing the computational burden from classical KKT transformation and protecting the private information of each stakeholder, swarm intelligence based approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik's Cube topology is proposed based on further improvement of a two-dimensional square lattice model. Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed topology. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.
Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.