tsp_cs.h

/*****************************************************************************
 *   Copyright (C) 2004-2014 The PaGMO development team,                     *
 *   Advanced Concepts Team (ACT), European Space Agency (ESA)               *
 *                                                                           *
 *   https://github.com/esa/pagmo                                            *
 *                                                                           *
 *   act@esa.int                                                             *
 *                                                                           *
 *   This program is free software; you can redistribute it and/or modify    *
 *   it under the terms of the GNU General Public License as published by    *
 *   the Free Software Foundation; either version 2 of the License, or       *
 *   (at your option) any later version.                                     *
 *                                                                           *
 *   This program is distributed in the hope that it will be useful,         *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of          *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the           *
 *   GNU General Public License for more details.                            *
 *                                                                           *
 *   You should have received a copy of the GNU General Public License       *
 *   along with this program; if not, write to the                           *
 *   Free Software Foundation, Inc.,                                         *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.               *
 *****************************************************************************/

#ifndef PAGMO_PROBLEM_TSP_CS_H
#define PAGMO_PROBLEM_TSP_CS_H

#include <boost/array.hpp>
#include <vector>
#include <string>

#include "./base_tsp.h"
#include "../serialization.h"

namespace pagmo { namespace problem {


class __PAGMO_VISIBLE tsp_cs: public base_tsp
{
    public:

        tsp_cs();
        tsp_cs(const std::vector<std::vector<double> >&, const std::vector<double>&, const double, const base_tsp::encoding_type & = CITIES);

        base_ptr clone() const;

        const std::vector<std::vector<double> >& get_weights() const;
        const std::vector<double>& get_values() const;
        double get_max_path_length() const;

        std::string get_name() const;
        std::string human_readable_extra() const;
        double distance(decision_vector::size_type, decision_vector::size_type) const;

        void find_subsequence(const decision_vector &, double &, double &, decision_vector::size_type &, decision_vector::size_type &) const;

    private:
        static boost::array<int, 2> compute_dimensions(decision_vector::size_type n_cities, base_tsp::encoding_type);
        void check_weights(const std::vector<std::vector<double> >&) const;
        size_t compute_idx(const size_t i, const size_t j, const size_t n) const;

        void objfun_impl(fitness_vector&, const decision_vector&) const;
        void compute_constraints_impl(constraint_vector&, const decision_vector&) const;

        friend class boost::serialization::access;
        template <class Archive>
        void serialize(Archive &ar, const unsigned int)
        {
            ar & boost::serialization::base_object<base_tsp>(*this);
            ar & m_weights;
            ar & m_values;
            ar & const_cast<double &>(m_max_path_length);
                ar & m_max_edge_length;
        }

    private:
        std::vector<std::vector<double> > m_weights;
        std::vector<double> m_values ;
        const double m_max_path_length;
        double m_max_edge_length;
};

}}  //namespaces

BOOST_CLASS_EXPORT_KEY(pagmo::problem::tsp_cs)

#endif  //PAGMO_PROBLEM_TSP_CS_H