Pages that link to "Item:Q4032587"

The following pages link to New Insertion and Postoptimization Procedures for the Traveling Salesman Problem (Q4032587):

Displaying 50 items.

• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
• A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods (Q324315) (← links)
• A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level (Q336405) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
• Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
• A column generation-based heuristic algorithm for an inventory routing problem with perishable goods (Q375988) (← links)
• A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
• A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
• A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• A solution approach to the inventory routing problem in a three-level distribution system (Q541738) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← 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)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
• The traveling purchaser problem with budget constraint (Q1013406) (← links)
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
• Performance evaluation of distribution strategies for the inventory routing problem (Q1039784) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• Heuristics for the stochastic Eulerian tour problem (Q1043339) (← 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)
• Improved heuristic algorithms for the job sequencing and tool switching problem (Q1651541) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• The open vehicle routing problem with decoupling points (Q1681358) (← links)