Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,...Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.展开更多
The crane&shuttle-based storage and retrieval system(C&SBS/RS)is the first automated warehouse technology that supports pallet picking,case picking and item picking.In the C&SBS/RS,aisle-captive cranes per...The crane&shuttle-based storage and retrieval system(C&SBS/RS)is the first automated warehouse technology that supports pallet picking,case picking and item picking.In the C&SBS/RS,aisle-captive cranes perform pallet picking,while tier-captive shuttles handle cases and items picking.To balance picking tasks,we propose an order dividing algorithm to fulfil required specific picking sequences.The optimisation objective is to minimise the order line picking time.Therefore,we modelled and analyzed the C&SBS/RS and considered single and dual command cycles for each resource(i.e.cranes,rail-guided vehicles,shuttles and lifters)separately according to their respective operation processes.Finally,numerical experiments were conducted to analyze impact factors and a real case to verify the power of the proposed order dividing algorithm.展开更多
基金supported in part by the National Natural Science Foundation of China(61603169,61773192,61803192)in part by the funding from Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technologyin part by Singapore National Research Foundation(NRF-RSS2016-004)
文摘Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.
基金China Scholarship Council:[Grant Number 202006220116].
文摘The crane&shuttle-based storage and retrieval system(C&SBS/RS)is the first automated warehouse technology that supports pallet picking,case picking and item picking.In the C&SBS/RS,aisle-captive cranes perform pallet picking,while tier-captive shuttles handle cases and items picking.To balance picking tasks,we propose an order dividing algorithm to fulfil required specific picking sequences.The optimisation objective is to minimise the order line picking time.Therefore,we modelled and analyzed the C&SBS/RS and considered single and dual command cycles for each resource(i.e.cranes,rail-guided vehicles,shuttles and lifters)separately according to their respective operation processes.Finally,numerical experiments were conducted to analyze impact factors and a real case to verify the power of the proposed order dividing algorithm.
