The Gecode 6.1.1 solver is used in this problem. This project gives a travel plan within budget and time limit.
There is a list of Places you can visit. To explore each place properly, there is a time limit and cost to be spent. Every place has a satisfaction point. The goal is to maximise the satisfaction while staying within the limitations of travel time and budget the traveller has.
Addition of the constraints that certain places cannot be visited on the same day.
We added a list of Hotels that is generated from a hotel budget. It basically gives us a list of which hotels can the user stay in within the given budget.