How to implement a simple task with OptaPlanner

[Yu Bing 于冰]

Hi all,

 

I’m a developer from the biggest China vehicle company SAIC. I’m trying to use OptaPlanner to implement a simple function like shortest path optimization. But from the the Opta examples which are quit splendid but that doesn't make it much easier for someone like me to extract the essence of OptaPlanner into its basic code fragments in a 30 minute code review.

 

Are there any simple demos or examples can help me to work this (shortest path optimization) task out?

 

Any suggestion would be very much appreciated!!!

 

Best Regards

于冰

Tel: 13816578635

威海路489号1806室，200041|上汽集团数据业务部

yubing01@saicmotor.com

 

邮件免责申明----- 该电子邮件中的信息是保密的，除收件人外任何人无权访问此电子邮件。 如果您不是收件人，公开、复制、分发或基于此封邮件的任何行动，都是禁止的，并可能是违法的。该邮件包含的任何意见与建议均应遵循上汽集团关于信息传递与保密的制度或规定。除经上汽集团信函以正式书面方式确认外，任何相关的内容或信息不得作为正式依据。 Email Disclaimer----- The information in this email is confidential and may be legally privileged. It is intended solely for the addressee. Access to this email by anyone else is unauthorized. If you are not the intended recipient, any disclosure, copying, distribution or any action taken or omitted to be taken in reliance on it, is prohibited and may be unlawful. Any opinions or advice contained in this email are subject to the terms and conditions expressed in the governing SAICMOTOR client engagement letter and should not be relied upon unless they are confirmed in writing on SAICMOTOR's letterhead.

[philip.jam...@googlemail.com]

Hi Yu,

If I understand correctly, you are wanting to solve a dijkstra-like problem: Find the shortest path between two nodes of a graph.

In my opinion, OptaPlanner is not the correct tool for such a problem. You should be looking at a dijkstra algorithms instead (which are, by the way, polynomial in the number of nodes, not exponential, as problems exposed to OptaPlanner usually are).

If you are wanting to find the shortest path using all nodes (like TSP, but home!=destination), you can use OptaPlanner. Have a look at the OptaPlanner TSP example.

Hope this helps.

Philip.

[Geoffrey De Smet]

Find the shortest path between two nodes of a graph.

+1 to Phil's answer.
dijkstra (or better yet A* search if that's possible).

With kind regards,
Geoffrey De Smet

--
You received this message because you are subscribed to the Google Groups "OptaPlanner development" group.
To unsubscribe from this group and stop receiving emails from it, send an email to optaplanner-d...@googlegroups.com.
To post to this group, send email to optapla...@googlegroups.com.
Visit this group at https://groups.google.com/group/optaplanner-dev.
For more options, visit https://groups.google.com/d/optout.