Pages that link to "Item:Q1342068"
From MaRDI portal
The following pages link to The travelling salesman problem with pick-up and delivery (Q1342068):
Displayed 36 items.
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Single liner shipping service design (Q336948) (← links)
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- The traveling salesman problem with delivery and backhauls (Q1342089) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- Reference policies for non-myopic sequential network design and timing problems (Q2358056) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) (← links)
- The vehicle routing problem with pickups and deliveries on some special graphs (Q5957355) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)