In many cases, companies face problems that seem apparently simple but are in fact quite hard and for which a solution, whether an optimal or feasible one, often means significant gains. Such a class of problems fall under the category of combinatorial optimization. To address these challenges, Sysmatch has created a set of ready to use tools under the name of PCPAC.
With PCPAC you can:
- Find the best routes in distribution with time and capacity constraints.
- Find the best sequence of jobs to be processed in multiple machines.
- Find how to optimally load a container with several package sizes.
- Find how to schedule shifts in hospitals or factories.
Under the hood, PCPAC has a set of algorithms, from linear programming to ant colony, each one targeted to solve a specific problem.
PCPAC enables you to take the journey from NP-Hard to NP-Easy.