Pages that link to "Item:Q918421"

The following pages link to An efficient implementation of local search algorithms for constrained routing problems (Q918421):

Displaying 34 items.

• On an iterative procedure for solving a routing problem with constraints (Q483197) (← links)
• An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
• A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
• A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
• A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
• A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• Sequential and parallel local search for the time-constrained traveling salesman problem (Q1803676) (← links)
• Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• An iterated local search for solving a location-routing problem (Q2861505) (← links)
• Vehicle Routing Problems with Inter-Tour Resource Constraints (Q3564369) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• Constraint satisfaction, packet routing, and the lovasz local lemma (Q5495839) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)