Second year University project on optimization problem of arranging people on wedding. Project is written in Java with counterintuitive input file organization: NAME SURNAME BRIDE_GROOM(Z,M) FAMILY_GUEST_NAME FAMILY_GUEST_SURNAME | FRIEND_GUEST_NAME FRIEND_GUEST_SURNAME
Idea is solving a Traveling salesman problem, without connecting first and last node. Used algorithm is ant colony optimization technique, also called MIN-MAX Ant colony algorithm.