A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

DOI10.1287/ijoc.1050.0145zbMath1241.90116MaRDI QIDQ2892314

Barrett W. Thomas, Jeffrey W. Ohlmann

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

zbMATH Keywords

simulated annealing; traveling salesman; time windows; penalty methods

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Unnamed Item, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, Scheduled penalty variable neighborhood search, A general VNS heuristic for the traveling salesman problem with time windows, A variable iterated greedy algorithm 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, Dynamic vehicle routing problems with enhanced ant colony optimization, A hybrid ant colony optimization for dynamic multidepot vehicle routing problem, A metaheuristic for the delivery man problem with time windows, Branch-and-refine for solving time-expanded MILP formulations, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, Improving the filtering of branch-and-bound MDD solver, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, The hybrid electric vehicle-traveling salesman problem with time windows, Operational aircraft maintenance routing problem with remaining time consideration, Beam-ACO for the travelling salesman problem with time windows, Influence maximization with deactivation in social networks, 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

• TSPTW