Pages that link to "Item:Q5510390"
From MaRDI portal
The following pages link to Computer Solutions of the Traveling Salesman Problem (Q5510390):
Displayed 50 items.
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- The decomposition of a communication network considering traffic demand interrelations (Q679227) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- Markovian neural networks (Q757249) (← links)
- Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- Quasiabelian landscapes of the traveling salesman problem are elementary (Q834186) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- On randomization and discovery (Q867607) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- The Hamiltonian p-median problem (Q918861) (← links)
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing (Q919753) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- The multi-shift vehicle routing problem with overtime (Q976019) (← links)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree (Q1024512) (← links)
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
- Introducing possibilistic logic in ILP for dealing with exceptions (Q1028964) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
- The school bus routing problem: a review (Q1039772) (← links)
- Transgenetic algorithm for the traveling purchaser problem (Q1042095) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q1045171) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)