UMR CNRS 7253

Site Tools

en:top

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
en:top [2012/08/01 18:13] – moukrimen:top [2013/03/01 12:46] (current) – dangducc
Line 1: Line 1:
 +~~NOCACHE~~
 +
 +
 ====== The Team Orienteering Problem ====== ====== The Team Orienteering Problem ======
  
Line 13: Line 16:
 === Available downloads === === Available downloads ===
    
-  * {{en:chao.zip|Instances of [2]}} and {{en:new_instances.zip|our new instances of [4]}} ({{en:format-top-instance.txt|format description}}). +  * {{en:chao.zip|Instances}} of [2] ({{en:format-top-instance.txt|format description}}) 
-  * {{en:hb_web_top.zip|Former website and detailed results of [1]}}. +  * {{en:hb_web_top.zip|Former website and detailed results}} of [1] 
-  * {{en:solution-psoia.zip|Detailed solutions of [4]}}.+  * {{en:new_instances.zip|Our new instances}}, {{en:other_tested_instances.zip|other tested instances}} and {{en:solutions-psoia.zip|detailed solutions}} of [4]
 \\ \\
 //Route length validation// //Route length validation//
  
-The euclidean distances are computed using **double** data type in C++ which is safe for a single computation within 18 decimal digits (GNU GCC 4.0+). Our rule to check if a route is valid is as follows: the travel length is computed in the order of clients that appear in the route and this value should be inferior or equal to the travel length limit (Tmax value in Chao's instances).+The euclidean distances are computed using **double** data type in C++ which is safe for a single computation within 18 decimal digits (GNU GCC 4.0+). Our rule to check if a route is valid is as follows: the travel length is computed in the order of clients that appear in the route and this value should be inferior or equal to the travel length limit (//tmax// value in Chao's instances).
  
 === People involved === === People involved ===
Line 33: Line 36:
 [2] I.-M. Chao, B. Golden, and E. A. Wasil. The team orienteering problem. European Journal of Operational Research, 88: p464-474, 1996. \\ [2] I.-M. Chao, B. Golden, and E. A. Wasil. The team orienteering problem. European Journal of Operational Research, 88: p464-474, 1996. \\
 [3] D-C. Dang, R. N. Guibadj, A. Moukrim: A PSO-based memetic algorithm for the team orienteering problem. EvoApplications (2) 2011: p471-480, 2011. \\ [3] D-C. Dang, R. N. Guibadj, A. Moukrim: A PSO-based memetic algorithm for the team orienteering problem. EvoApplications (2) 2011: p471-480, 2011. \\
-[4] D-C. Dang, R. N. Guibadj, A. Moukrim: An effective PSO-inspired algorithm for the team orienteering problem. //Under revision// \\+[4] D-C. Dang, R. N. Guibadj, A. Moukrim: An effective PSO-inspired algorithm for the team orienteering problem. {{en:paper-top-psoia.pdf|Preprint}} accepted for publication in European Journal of Operational Research. \\

Page Tools

User Tools

en/top.1343837617.txt.gz · Last modified: 2012/08/01 18:13 by moukrim
Mentions légales