A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2892314
DOI10.1287/ijoc.1050.0145zbMath1241.90116MaRDI QIDQ2892314
Jeffrey W. Ohlmann, Barrett W. Thomas
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d26b3e00404fb031e5302ecd26c2909202c59b9c
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Scheduled penalty variable neighborhood search, A general VNS heuristic for the traveling salesman problem with time windows, Annealing a genetic algorithm for constrained optimization, An optimization approach for communal home meal delivery service: A case study, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, A stochastic dynamic traveling salesman problem with hard time windows, Operational aircraft maintenance routing problem with remaining time consideration, Beam-ACO for the travelling salesman problem with time windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, An efficient GVNS for solving Traveling Salesman Problem with Time Windows, Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems
Uses Software
