A generalized insertion heuristic for the travelling salesman problem with time windows
From MaRDI portal
Recommendations
- A new heuristic for the traveling salesman problem with time windows.
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A heuristic for the vehicle routing problem with time windows
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- A general VNS heuristic for the traveling salesman problem with time windows
Cited in
(54)- A stochastic dynamic traveling salesman problem with hard time windows
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Tabu search heuristics for the vehicle routing problem with time windows.
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- A metaheuristic for the delivery man problem with 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
- Finding efficient make-to-order production and batch delivery schedules
- Dynamic transportation of patients in hospitals
- Beam-ACO for the travelling salesman problem with time windows
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- A modified ant colony system for solving the travelling 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
- Fast local search algorithms for the handicapped persons transportation problem
- A new heuristic for the traveling salesman 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
- Scheduled penalty variable neighborhood search
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- An ant colony system approach for variants of the traveling salesman problem with time windows
- scientific article; zbMATH DE number 4057268 (Why is no real title available?)
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A general VNS heuristic for the traveling salesman problem with time windows
- The delivery man problem with time windows
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- The vehicle routing problem with floating targets: formulation and solution approaches
- Heuristic approaches to minimize tour duration for the TSP with multiple time windows
- scientific article; zbMATH DE number 2202185 (Why is no real title available?)
- The capacitated vehicle routing problem with stochastic demands and time windows
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Learn global and optimize local: a data-driven methodology for last-mile routing
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Traveling salesman problem with clustering
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A branch-and-cut-and-price algorithm for shared mobility considering customer satisfaction
- Traveling salesman problem with backend information processing
- Domain-independent dynamic programming
- Beware of the classical benchmark instances for the traveling salesman problem with time windows
- Exact methods for two vehicle routing problems with lockers in last-mile delivery
- Complete anytime decision diagram search with GPU-accelerated state expansion
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations
This page was built for publication: A generalized insertion heuristic for the travelling salesman problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781094)
