A variable iterated greedy algorithm for the traveling salesman problem with time windows
type: Item
instance of: scholarly article
title: A variable iterated greedy algorithm for the traveling salesman problem with time windows
zbMATH Open document ID: 1354.90110
author: Korhan Karabulut
author: M. Fatih Tasgetiren
published in: Information Sciences
publication date: 2017-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6679231
zbMATH Keywords: traveling salesman problem with time windows
zbMATH Keywords: iterated greedy algorithm
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: heuristic optimization
describes a project that uses: TSPTW
MaRDI profile type: Publication
full work available at URL: j.ins.2014.03.127
OpenAlex ID: W2037164695
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
cites work: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
cites work: An exact constraint logic programming algorithm for the traveling salesman problem with time windows
cites work: A hybrid exact algorithm for the TSPTW
cites work: A generalized insertion heuristic for the travelling salesman problem with time windows
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A new heuristic for the traveling salesman problem with time windows.
cites work: A compressed-annealing heuristic for the traveling salesman problem with time windows
cites work: A modified ant colony system for solving the travelling salesman problem with time windows
cites work: Beam-ACO for the travelling salesman problem with time windows
cites work: A general VNS heuristic for the traveling salesman problem with time windows
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
cites work: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
cites work: Iterated greedy local search methods for unrelated parallel machine scheduling
cites work: Iterated greedy for the maximum diversity problem
cites work: Variable neighborhood search
cites work: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
cites work: An efficient constraint handling method for genetic algorithms
cites work: The Vehicle Routing Problem with Time Windows Part II: Genetic Search
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
DOI: 10.1016/J.INS.2014.03.127
description: scientific article; zbMATH DE number 6679231