• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem.

Nenad MladenovicDragan UrosevicSaïd HanafiAleksandar Ilic
Published in: Eur. J. Oper. Res. (2012)
Keyphrases
  • variable neighborhood search
  • neural network
  • special case
  • tabu search
  • traveling salesman problem
  • metaheuristic
  • minimum spanning tree
  • scheduling problem
  • computational efficiency
  • global optimization