Optimal solver for multiobjectives ZenoTransportation problem.

CMake g++ >= 4.7 for C++11 features. (optional) doxygen for documentation

mkdir build && cd build cmake .. make -j

By default the build is in Release mode, with all optimisations. To activate the DEBUG build, in build folder, use:

cmake .. -DCMAKE_BUILD_TYPE=DEBUG make

As ZenoSolver handles only integers for cost and durations, it will cast generated vectors (or provided data) to integers. The adjustement factor (option -r) is a multiplicative constant in order to avoid some errors (for instance, obtaining more than once the value 0 because log(i) and log(i+1) have same floor value.

By default it is set to 1 but a better value for most of functions could be 100.

More information using ./zenoSolver -h.

• True Pareto Fronts for Multi-Objective AI Planning Instances. Alexandre Quemy, Marc Schoenauer. Francesco Chicano and Gabriela Ochoa. European Conference on Combinatorial Optimization - EvoCOP, Apr 2015, Copenhague, Denmark. LNCS 9026, Springer Verlag, pp.197-208, 2015.
• Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve. Alexandre Quemy, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant. Learning and Intelligent OptimizatioN - LION 9, Jan 2015, Lille, France. LNCS 8994, Springer Verlag, pp.262-267, 2015.