multiple traveling salesman problem

By admin 　

Evaluating an efficient heuristic for the multiple vehicle scheduling problem (Working paper series / Ohio State University, College of Administrative Science) Evaluating an efficient heuristic for the multiple vehicle scheduling problem (Working paper series / Ohio State University, College of Administrative Science)

...
A new approach to solving the multiple traveling salesperson problem using genetic algorithms [An article from: European Journal of Operational Research] A new approach to solving the multiple traveling salesperson problem using genetic algorithms [An article from: European Journal of Operational Research]
$7.95
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.Description: The multiple traveling salesperson problem (MTSP) involves scheduling m>1 salespersons to visit a set of n>m lo...
A note on the multiple traveling salesman problem (Working paper / College of Business Administration, University of Tennessee, Knoxville) A note on the multiple traveling salesman problem (Working paper / College of Business Administration, University of Tennessee, Knoxville)

...

Share and Enjoy:
  • Print this article!
  • Digg
  • Sphinn
  • del.icio.us
  • Facebook
  • Mixx
  • Google Bookmarks
This entry was written by admin, posted on September 6, 2009 at 10:36 am, filed under Uncategorized and tagged , , , , . Bookmark the permalink. Follow any comments here with the RSS feed for this post. Post a comment or leave a trackback: Trackback URL.

Post a Comment

Your email is never shared. Required fields are marked *

*
*