SCIP
Solving Constraint Integer Programs
Heur2opt.cpp File Reference
Detailed Description
2-Optimum - combinatorial improvement heuristic for TSP
Definition in file Heur2opt.cpp.
#include <cassert>#include <iostream>#include "objscip/objscip.h"#include "GomoryHuTree.h"#include "Heur2opt.h"#include "ProbDataTSP.h"Go to the source code of this file.
Functions | |
| static GRAPHEDGE * | findEdge (GRAPHNODE *nodes, GRAPHNODE *node1, GRAPHNODE *node2) |
| SCIP_DECL_HEURFREE (Heur2opt::scip_free) | |
| SCIP_DECL_HEURINIT (Heur2opt::scip_init) | |
| SCIP_DECL_HEUREXIT (Heur2opt::scip_exit) | |
| SCIP_DECL_HEURINITSOL (Heur2opt::scip_initsol) | |
| SCIP_DECL_HEUREXITSOL (Heur2opt::scip_exitsol) | |
| SCIP_DECL_HEUREXEC (Heur2opt::scip_exec) | |
| SCIP_DECL_HEURCLONE (scip::ObjCloneable *Heur2opt::clone) | |
Function Documentation
◆ findEdge()
method finding the edge going from the node with id index1 to the node with id index2
- Parameters
-
nodes all nodes of the graph node1 id of the node where the searched edge starts node2 id of the node where the searched edge ends
Definition at line 46 of file Heur2opt.cpp.
References GraphEdge::adjac, GraphNode::first_edge, GraphEdge::next, and NULL.
Referenced by SCIP_DECL_HEUREXEC().
◆ SCIP_DECL_HEURFREE()
| SCIP_DECL_HEURFREE | ( | Heur2opt::scip_free | ) |
destructor of primal heuristic to free user data (called when SCIP is exiting)
Definition at line 66 of file Heur2opt.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEURINIT()
| SCIP_DECL_HEURINIT | ( | Heur2opt::scip_init | ) |
initialization method of primal heuristic (called after problem was transformed)
Definition at line 73 of file Heur2opt.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEUREXIT()
| SCIP_DECL_HEUREXIT | ( | Heur2opt::scip_exit | ) |
deinitialization method of primal heuristic (called before transformed problem is freed)
Definition at line 80 of file Heur2opt.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEURINITSOL()
| SCIP_DECL_HEURINITSOL | ( | Heur2opt::scip_initsol | ) |
solving process initialization method of primal heuristic (called when branch and bound process is about to begin)
This method is called when the presolving was finished and the branch and bound process is about to begin. The primal heuristic may use this call to initialize its branch and bound specific data.
Definition at line 92 of file Heur2opt.cpp.
References capture_graph(), tsp::ProbDataTSP::getGraph(), NULL, SCIP_CALL, SCIP_OKAY, SCIPallocBlockMemoryArray, and SCIPgetObjProbData().
◆ SCIP_DECL_HEUREXITSOL()
| SCIP_DECL_HEUREXITSOL | ( | Heur2opt::scip_exitsol | ) |
solving process deinitialization method of primal heuristic (called before branch and bound process data is freed)
This method is called before the branch and bound process is freed. The primal heuristic should use this call to clean up its branch and bound data.
Definition at line 111 of file Heur2opt.cpp.
References release_graph(), SCIP_OKAY, and SCIPfreeBlockMemoryArray.
◆ SCIP_DECL_HEUREXEC()
| SCIP_DECL_HEUREXEC | ( | Heur2opt::scip_exec | ) |
execution method of primal heuristic 2-Opt
Definition at line 124 of file Heur2opt.cpp.
References GraphEdge::adjac, GraphEdge::back, findEdge(), GraphNode::first_edge, GraphEdge::length, GraphEdge::next, nnodes, NULL, SCIP_Bool, SCIP_CALL, SCIP_DIDNOTFIND, SCIP_DIDNOTRUN, SCIP_FOUNDSOL, SCIP_OKAY, SCIPaddSolFree(), SCIPallocBufferArray, SCIPcreateSol(), SCIPfreeBufferArray, SCIPgetBestSol(), SCIPgetSolVal(), SCIPsetSolVal(), SCIPvarGetLbGlobal(), SCIPvarGetUbGlobal(), and GraphEdge::var.
◆ SCIP_DECL_HEURCLONE()
| SCIP_DECL_HEURCLONE | ( | scip::ObjCloneable *Heur2opt::clone | ) |
clone method which will be used to copy a objective plugin
Definition at line 245 of file Heur2opt.cpp.