Pages that link to "Item:Q4032587"
From MaRDI portal
The following pages link to New Insertion and Postoptimization Procedures for the Traveling Salesman Problem (Q4032587):
Displayed 50 items.
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- A partition approach to the inventory/routing problem (Q856272) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- Model and algorithm for inventory/routing decision in a three-echelon logistics system (Q932178) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem (Q1278083) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A generalized insertion algorithm for the seriation problem (Q1328867) (← links)
- A parallel tabu search algorithm for large traveling salesman problems (Q1329785) (← links)
- TSP ejection chains (Q1363749) (← links)
- Variable neighborhood search (Q1374041) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- The period traveling salesman problem: A new heuristic algorithm (Q1603331) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Routing heuristics for automated pick and place machines (Q1806942) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- Heuristics for the black and white traveling salesman problem (Q1869887) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- An improved heuristic for the period traveling salesman problem (Q1885978) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem (Q2378413) (← links)
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- A new tabu search algorithm for the vehicle routing problem with backhauls (Q2496076) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A threshold accepting approach to the Open Vehicle Routing problem (Q5693012) (← links)
- (Q5708509) (← links)