Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Conventional methods for simultaneous production scheduling and routing problem have hierarchical decomposition scheme where production scheduling problem and routing problem are separately solved due to computational complexity.  propose a novel decomposition method with cut generation. The entire problem is decomposed into a upper level subproblem for production scheduling and task assignment problem and a lor level subproblem for collision-free routing of multiple AGVs. The novel idea of the proposed method is the upper level subproblem which is solved by using Lagrangian relaxation technique incorporating cuts generated from a solution of the lor level subproblem. The algorithm solves successively the upper level problem and the lor level problem until a near-optimal solution for original problem is derived. The effectiveness of the proposed method is investigated from numerical experiments.
['Tatsushi Nishi', 'Yuichiro Hiranaka', 'Masahiro Inuiguchi', 'Ignacio E. Grossmann']
I am writing a research paper on a idea A Decomposition Method with Cut Generation for Simultaneous Production Scheduling and Routing for multiple AGVs
[{"from": "human", "value": "I am writing a research paper on a idea A Decomposition Method with Cut Generation for Simultaneous Production Scheduling and Routing for multiple AGVs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Conventional methods for simultaneous production scheduling and routing problem have hierarchical decomposition scheme where production scheduling problem and routing problem are separately solved due to computational complexity.  propose a novel decomposition method with cut generation. The entire problem is decomposed into a upper level subproblem for production scheduling and task assignment problem and a lor level subproblem for collision-free routing of multiple AGVs. The novel idea of the proposed method is the upper level subproblem which is solved by using Lagrangian relaxation technique incorporating cuts generated from a solution of the lor level subproblem. The algorithm solves successively the upper level problem and the lor level problem until a near-optimal solution for original problem is derived. The effectiveness of the proposed method is investigated from numerical experiments."}]