A variable iterated greedy algorithm for the traveling salesman problem with time windows
From MaRDI portal
Publication:506326
DOI10.1016/J.INS.2014.03.127zbMATH Open1354.90110OpenAlexW2037164695MaRDI QIDQ506326FDOQ506326
Authors: 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
Recommendations
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- A general VNS heuristic for the traveling salesman problem with time windows
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- On solving the time window assignment vehicle routing problem via iterated local search
- Variable neighborhood descent for solving the vehicle routing problem with time windows
variable neighborhood searchheuristic optimizationiterated greedy algorithmtraveling salesman problem with time windows
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- An efficient constraint handling method for genetic algorithms
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Variable neighborhood search
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- State-space relaxation procedures for the computation of bounds to routing problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Beam-ACO for the travelling salesman problem with time windows
- Iterated greedy for the maximum diversity problem
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- A compressed-annealing heuristic for the traveling salesman problem 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
- A general VNS heuristic for the traveling salesman problem with time windows
- Iterated greedy local search methods for unrelated parallel machine scheduling
- A new heuristic for the traveling salesman problem with time windows.
- A hybrid exact algorithm for the TSPTW
- A modified ant colony system for solving the travelling salesman problem with time windows
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
Cited In (9)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Generalised formulations for minimum distance trajectory in patrolling problems
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A general VNS heuristic for the traveling salesman problem with time windows
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- An efficient GVNS for solving traveling salesman problem with time windows
Uses Software
This page was built for publication: A variable iterated greedy algorithm for the traveling salesman problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506326)
