/home/coin/SVN-release/CoinAll-1.1.0/Blis/examples/VRP/VrpSolution.h

Go to the documentation of this file.

/*===========================================================================*
 * This file is part of a solver for the Vehicle Routing Problem             *
 * developed using the BiCePS Linear Integer Solver (BLIS).                  *
 *                                                                           *
 * This solver is distributed under the Common Public License as part of     * 
 * the COIN-OR repository (http://www.coin-or.org).                          *
 *                                                                           *
 * Authors: Yan Xu, Lehigh University                                        *
 *          Ted Ralphs, Lehigh University                                    *
 *                                                                           *
 * Copyright (C) 2007 Yan Xu and Ted Ralphs.                                 *
 * All Rights Reserved.                                                      *
 *===========================================================================*/

#ifndef VrpSolution_h_
#define VrpSolution_h_

#include "BlisSolution.h"

#include "VrpModel.h"

//#############################################################################
//#############################################################################

class VrpSolution : public BlisSolution {

protected:

   _node *opt_;
    
public:
    
   VrpSolution() : BlisSolution(), opt_(0)
        {}

   VrpSolution(int s, const double *values, double objValue, VrpModel *vrp=0);
   
   virtual ~VrpSolution(){
      delete [] opt_;
   }

   void setOpt(_node *opt) { 
       if (opt_) delete opt_;
       opt_ = opt; 
   }
   
   virtual void print(std::ostream& os) const; 
   
   virtual AlpsEncoded* encode() const {
      AlpsEncoded* encoded = new AlpsEncoded(AlpsKnowledgeTypeSolution);
      encodeBcps(encoded);

      //Vrp part.
      int cur_vert = opt_[0].next, count = 1;  
      while (cur_vert != 0){
          cur_vert = opt_[cur_vert].next;
          ++count;
      }
      encoded->writeRep(count);
      for (int j = 0; j < count; ++j) {
          encoded->writeRep(opt_[j].next);
          encoded->writeRep(opt_[j].route);
      }

      return encoded;
   }
   
   virtual AlpsKnowledge* decode(AlpsEncoded& encoded) const {
      VrpSolution * sol = new VrpSolution();
      sol->decodeBcps(encoded);

      // Vrp part.
      int count;
      encoded.readRep(count);
      _node *opt = new _node [count];
      for (int j = 0; j < count; ++j) {
          encoded.readRep(opt[j].next);
          encoded.readRep(opt[j].route);
      }
      sol->setOpt(opt);
      
      return sol;
   }
   
};

//#############################################################################
//#############################################################################

#endif

---