TSPTW

swMATH4709MaRDI QIDQ16877FDOQ16877

Author name not available (Why is that?)

Official website: http://www.or.deis.unibo.it/research_pages/ORcodes/CP.html

Described by source

• Embedding relaxations in global constraints for solving TSP and TSPTW

Cited In (48)

• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• Beam-ACO for the travelling salesman problem with time windows
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Title not available (Why is that?)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
• Title not available (Why is that?)
• The salesman and the tree: the importance of search in CP
• A time bucket formulation for the traveling salesman problem with time windows
• New state-space relaxations for solving the traveling salesman problem with time windows
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
• Constraint programming and operations research
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• A compressed-annealing heuristic for the traveling salesman problem with time windows
• Perspectives on integer programming for time-dependent models
• Improved filtering for weighted circuit constraints
• Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• Locating a cycle in a transportation or a telecommunications network
• A stochastic dynamic traveling salesman problem with hard time windows
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• An ant colony system approach for variants of the traveling salesman problem with time windows
• Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
• A global constraint for total weighted completion time for unary resources
• Title not available (Why is that?)
• A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
• LKH
• Cardinal
• bc-prod
• VRPLIB
• Beam-ACO
• SIMPL
• Optimal placement of valves in a water distribution network with CLP(FD)
• Exact and heuristic algorithms for routing AGV on path with precedence constraints
• A general VNS heuristic for the traveling salesman problem with time windows
• The delivery man problem with time windows
• Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
• A learning based algorithm for drone routing
• Bounding, filtering and diversification in CP-based local branching
• Semidefinite programming and constraint programming
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• Stand_and_Adapt_Bend
• A hybrid exact algorithm for the TSPTW
• A matheuristic for the generalized order acceptance and scheduling problem
• Enhanced mixed integer programming techniques and routing problems
• A variable iterated greedy algorithm for the traveling salesman problem with time windows

This page was built for software: TSPTW