A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2892314
DOI10.1287/ijoc.1050.0145zbMath1241.90116OpenAlexW2153565255MaRDI 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems ⋮ An optimization approach for communal home meal delivery service: A case study ⋮ Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows ⋮ Scheduled penalty variable neighborhood search ⋮ Decomposition-based algorithms for the crew scheduling and routing problem in road restoration ⋮ The hybrid electric vehicle-traveling salesman problem with time windows ⋮ Annealing a genetic algorithm for constrained optimization ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ Influence maximization with deactivation in social networks ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework ⋮ A general VNS heuristic for the traveling salesman problem with time windows ⋮ Unnamed Item ⋮ Dynamic vehicle routing problems with enhanced ant colony optimization ⋮ A hybrid ant colony optimization for dynamic multidepot vehicle routing problem ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Operational aircraft maintenance routing problem with remaining time consideration ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ Beam-ACO for the travelling salesman problem with time windows ⋮ A metaheuristic for the delivery man 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 ⋮ A stochastic dynamic traveling salesman problem with hard 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
Uses Software
This page was built for publication: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
