Computer Solutions of the Traveling Salesman Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The traveling salesman problem: An update of research
- Mapping DNA by stochastic relaxation
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- An improved heuristic for the period vehicle routing problem
- Interval estimation of a global optimum for large combinatorial problems
- The school bus routing problem: a review
- Challenges and Advances in A Priori Routing
- Solving a real case of rich vehicle routing problem with zone-dependent transportation costs
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Further results on the probabilistic traveling salesman problem
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Sequential and parallel local search for the time-constrained traveling salesman problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Ant colony optimization for the traveling purchaser problem
- Quasiabelian landscapes of the traveling salesman problem are elementary
- An adaptive memory programming method for risk logistics operations
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- Aggregation for the probabilistic traveling salesman problem
- The split delivery capacitated team orienteering problem
- Statistical mechanics methods and phase transitions in optimization problems
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- On using learning automata for fast graph partitioning
- On the complexity of incremental computation
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- The orienteering problem: a survey
- Fast local search algorithms for the handicapped persons transportation problem
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- Real-life vehicle routing with time windows for visual attractiveness and operational robustness
- Using simulated annealing to solve routing and location problems
- An optimization approach for communal home meal delivery service: A case study
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- Boosting ant colony optimization via solution prediction and machine learning
- Request evaluation strategies for carriers in auction-based collaborations
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Experimentation in optimization
- The production routing problem: a review of formulations and solution algorithms
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- scientific article; zbMATH DE number 6545534 (Why is no real title available?)
- Neighborhood Size in the Simulated Annealing Algorithm
- Tour recommendation for groups
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- The truck traveling salesman problem with drone and boat for humanitarian relief distribution in flood disaster: mathematical model and solution methods
- Integrated crew organization and work zone scheduling for network-wide daily road pavement rehabilitation
- Proposed theoretical value for TSP constant
- Optimal design of centralized computer networks
- Solving the vehicle routing problem with adaptive memory programming methodology
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
- Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Simulated annealing: An introduction
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- Pairs of Adjacent Hamiltonian Circuits with Small Intersection
- A matheuristic approach to the orienteering problem with service time dependent profits
- Local elimination in the traveling salesman problem
- A tabu search method for the truck and trailer routing problem
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Locating a cycle in a transportation or a telecommunications network
- On the complexity of the marriage problem
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- The traveling-salesman problem and minimum spanning trees: Part II
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem
- SDP-based bounds for graph partition via extended ADMM
- Symmetric traveling salesman problems
- Heuristics for the multi-period orienteering problem with multiple time windows
- Dynamics of local search trajectory in traveling salesman problem
- Networks and vehicle routing for municipal waste collection
- Genetic algorithms and traveling salesman problems
- On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
- The life span method -- a new variant of local search
- Combination of local search and CLP in the vehicle-fleet scheduling problem
- Future paths for integer programming and links to artificial intelligence
- The vehicle routing problem: An overview of exact and approximate algorithms
- The r‐interdiction selective multi‐depot vehicle routing problem
- Variable neighborhood search: Principles and applications
- Discrete optimization by optimal control methods. II: The static traveling salesman problem
- Combined location-routing problems: A synthesis and future research directions
- The influence of problem specific neighborhood structures in metaheuristics performance
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Extracting embedded generalized networks from linear programming problems
- Improving Christofides' lower bound for the traveling salesman problem
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A heuristic solution to the warehouse location-routing problem
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- A survey of very large-scale neighborhood search techniques
- An empirical study of a new metaheuristic for the traveling salesman problem
- On randomization and discovery
- Tabu search performance on the symmetric travelling salesman problem
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The Multi-Depot Routing Allocation Problem
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
- Decomposing SAT Instances with Pseudo Backbones
- Optimizing tabu list size for the traveling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
This page was built for publication: Computer Solutions of the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510390)
