mixed_equ.cpp

#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include "func.h"
#include "data_struct.h"
#include "global_var.h"
#include "basic_util.h"
#include "shortest_path.h"
#include "dsd.h"
#include "frank_wolf.h"
#include "column_gen.h"
#include "save_data.h"
#include "load_data.h"
#include "show_status.h"
using namespace std;

static double trips[MAX_PAIR];

static void load_part_trip(double percent){
	int i;
	for(i=0; i<metadata.n_pair; i++)
		pairs[i].trip = percent*trips[i];
}

void search_mult_direction(){
	load_part_trip(metadata.stoch_part);
	logit_route_direction();
	load_part_trip(metadata.determ_part);
	search_path_direction();
}

static void init_mult_set(){
	printf("init_mult_set()\n");
	load_part_trip(metadata.stoch_part);
	init_route_set();
	load_part_trip(metadata.determ_part);
	init_path_set();
}

void init_mult_flow(){
	printf("init_mult_flow()\n");
	set_flow(0.0);
	set_route_flow(0.0);
	set_path_flow(0.0);
	update_route_cost();
	update_path_cost();
	search_mult_direction();

	set_direction(0.0);
	route_to_link_direction();
	path_to_link_direction();
	update_route_flow(1.0);
	update_path_flow(1.0);
	update_link_flow(1.0);
}

double master_problem_mixed(double criterion){
	double eps = INFINITE, e1, e2, step = 0.0;

	printf("master_porblem_mult()\n");
	while(eps > criterion){
		update_route_cost();
		update_path_cost();
		search_mult_direction();

		step = golden_section(metadata.line_search_eps, 0.0, 1.0, SUE_SO_mixed);
		e1 = update_route_flow(step);
		e2 = update_path_flow(step);
		eps = e1<e2? e2:e1;
		update_link_flow(step);
	}

	return SUE_SO_mixed(step);
}

static bool column_gen_mult(){
	bool new_gen = false;	
//	printf("column_gen_mult()\n");
	load_part_trip(metadata.stoch_part);
	new_gen = column_gen_route();
	load_part_trip(metadata.determ_part);
	new_gen = column_gen_path() || new_gen;

	return new_gen;
}

void mixed_equilibrium(double criterion){
	int i, r, p, l;
	bool new_route = true;
	double eps = INFINITE, _INT = INFINITE, INT;

	for(i=0; i<metadata.n_pair; i++)
		trips[i] = pairs[i].trip;
	metadata.stoch_part = 1.0 - metadata.determ_part;

	printf("\n ...initialize...\n");
//	init_link_length();
	init_mult_set();
	init_mult_flow();
	printf("\n ...mixed_equilibrium()...\n");
	while(new_route || eps > criterion){
		INT = master_problem_mixed(metadata.flow_converg_eps);
		new_route = column_gen_mult();
		eps = (_INT - INT)/INT;
		printf(" eps %e, _INT %e, INT %e\n\n", eps, _INT, INT);
//		printf("new route: %d\n\n", new_route);
		_INT = INT;
	}

	for(i=0; i<metadata.n_pair; i++)
		pairs[i].trip = trips[i];
	update_travel_time();
	for(p=0; p<metadata.n_pair; p++){
		for(r=0; r<pairs[p].n_path; r++){
			pairs[p].paths[r].cost = 0.0;
			for(i=0; i<pairs[p].paths[r].leng; i++){
				l = pairs[p].paths[r].links[i];
				pairs[p].paths[r].cost += links[l].cost;
			}
		}
	}
}

/*
int main(int argc, char *argv[]){
	string case_name(argv[1]);
//	freopen("debug\\out.txt","w",stdout);

//	load_case("TestNet");
//	load_case("SiouxFalls");
//	load_case("Braess");
	load_case("Barcelona");
	create_adj_list();

	cout<<"start MLT()\n";
	objective = SUE_mult_logit;
	theta = 1.0;
	lambda = 1.0;
	determ_part = .0;
	stoch_part = 1.0 - determ_part;
	mult_logit(obj_converg_eps);
	cout<<"end MLT()\n";

	save_data("Barcelona");
//	save_data("TestNet");
//	save_data("Braess");
//	save_data("SiouxFalls");
	
	return 0;
}
*/