I am trying to solve a capacitated vehicle routing problem using AGVs. For example, I have 5 AGVs, and I want different AGVs to satisfy the demand of different set of nodes. Can you guide me on how to do it. Is this possible using AGV process flow templates?
Hi @prajwal-gudadoor, was anthony.johnson's answer helpful? If so, please click the "Accept" button at the bottom of their answer. Or if you still have questions, add a comment and we'll continue the conversation.
If we haven't heard back from you within 3 business days we'll auto-accept an answer, but you can always comment back to reopen your question.
Were you able to solve your problem? If so, please add and accept an answer to let others know the solution. Or please respond to the previous comment so that we can continue to help you.
If we don't hear back in the next 3 business days, we'll assume you were able to solve your problem and we'll close this case in our tracker. You can always comment back at any time to reopen your question, or you can contact your local FlexSim distributor for phone or email help.
See the following article:
Optimized AGV Dispatching with Google OR-Tools
It uses a different, non-capacitated version of the VRP, but it does give you the basic setup for connecting to a VRP solver.
I have connected to an external python code that returns the destination nodes that each AGV has to go to. Can you help me with the process flow with which I can instruct the AGVS to go to control point 1 pick up the load and unload them at destination nodes.
Thank you
16 People are following this question.
FlexSim can help you understand and improve any system or process. Transform your existing data into accurate predictions.
FlexSim is a fully 3D simulation software environment. FlexSim can be used to simulate any process in any industry.
FlexSim®, FlexSim Healthcare™, Problem Solved.®, the FlexSim logo, the FlexSim X-mark, and the FlexSim Healthcare logo with stylized Caduceus mark are trademarks of FlexSim Software Products, Inc. All rights reserved.
