A variable iterated greedy algorithm for the traveling salesman problem with time windows
From MaRDI portal
Publication:506326
DOI10.1016/j.ins.2014.03.127zbMath1354.90110OpenAlexW2037164695MaRDI QIDQ506326
Korhan Karabulut, M. Fatih Tasgetiren
Publication date: 31 January 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.127
heuristic optimizationvariable neighborhood searchiterated greedy algorithmtraveling salesman problem with time windows
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
Uses Software
Cites Work
- A general VNS heuristic for the traveling salesman problem with time windows
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterated greedy local search methods for unrelated parallel machine scheduling
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Variable neighborhood search
- An efficient constraint handling method for genetic algorithms
- Beam-ACO for the travelling salesman problem with time windows
- Iterated greedy for the maximum diversity problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A modified ant colony system for solving the travelling salesman problem with time windows
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- A Hybrid Exact Algorithm for the TSPTW
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- State-space relaxation procedures for the computation of bounds to routing problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: A variable iterated greedy algorithm for the traveling salesman problem with time windows
