/*

* Santa Stolen Sleigh competition - greedy + Simulated Annealing algorithm

* Qi Liu, Mirsad Buljubasic

*/

/********************************************* SHORT ALGORITHM DESCRIPTION *****************************************************

-INPUT: Starting solution to the problem

-Local Search (Simulated Annealing) algorithm is performed starting from the input solution. No problem

decomposition is made.

-Only feasible moves considered during entire procedure

-Only moves between near trips (routes) are performed: defined by "lat_width" and "lon_width" parameters

-Moves inside a single route and moves between the routes

Moves inside a single route:

1) SWAP(i,i+1) - swap positions of 2 subsequent gifts i and i + 1

2) Permutation(i, N) - evaluate all possible permutations of gifts between positions i and i+N (N = 5 is used)

and take the best one

3) Shift(i,j) - shift a gift at position i to position j

Moves between the routes:

1) Shift - shift gift from one route to another: Gift to shift and route to shift to are chosen randomly

(respecting constraints and range) and the best position to shift to is chosen (in terms of objective function)

2) Swap - swap two gifts between the routes. Two routes and first gift are chosen randomly, while the second gift

is chosen to minimize the objective.

2) ShiftBlock (or ShiftN) - shift a block of gifts (gifts between positions i and i + N) from one route to another: routes and

beginning position i are chosen randomly as before.

3) SwapBest - choose two gifts g1 and g2 from routes r1 and r2 respectively, drop them from the current routes and then

insert g1 to best position in r2 and g2 to best position in r1 (can be seen as generalization of Swap move)

4) CROSS (or SwapTails) - exchange tail blocks between two trips

The last move is

CUT - cutting a single trip into two. Cutting is simply done by breaking the trip at the best position.

For Permutation(i, N) and Shift(i,j) only the moves improving the objective are accepted,

while all other moves are accepted according to the current state (temperature).

Initial temperature and cooling speed are chosen experimentally.

Moves evaluation is done in parallel, with "NMB_THREADS" being number of threads utilized

*****************************************************************************************************************/

#include "gift.h"

#include <ctime>

// list of all trips contained in solution

// filled initially by reading from the input solution file

vector<Trip> trips;

// data structure that stores all trip pairs

// local search move between two trips can be performed only if pair belongs to the list

// construction is based on mean longitude of the trips

vector<pair<int,int> > trip_pairs;

// local moves between two trips are allowed only if difference between mean latitudes of trips does not exceed given value (lat_width)

// this limitation has been made in order to speed up the search

// expressed in radians

double latitude_difference_threshold;

double longitude_difference_threshold;

//TODO

// indicate which moves will be performed

// will be set in main

vector<double> prob(4,1.0);

void parallel_job(void *sucp, int id)

}

int main(int argc, char *argv[])

}