Neighborhood structures to solve the double TSP with multiple stacks using local search

World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference

Volumn , Issue , 2008, Pages 701-706

  Felipe, A ^a   Ortuno M T ^a   Tirado, G ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Variable neighborhood search; Vehicle routing

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); VEHICLE ROUTING;

LOCAL SEARCH; MULTIPLE STACKS; NEIGHBORHOOD STRUCTURE; TOTAL LENGTH; VARIABLE NEIGHBORHOOD SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 58049188907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9789812799470_0115     Document Type: Conference Paper

References (3)

1. H. L. Petersen, Heuristic Solution Approaches to the Double TSP with Multiple Stacks, (Centre for Traffic and Transport, Technical Report, Technical University of Denmark, 2006).
2. P. Toth and D. Vigo, The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, (Philadelphia: Society for Industrial and Applied Mathematics, 2002).
3. N. Mladenović and P. Hansen, Variable Neighbourhood Search, Computers and Operations Research 24, 1097-1100, (1997).