Pages that link to "Item:Q1302721"
From MaRDI portal
The following pages link to Heuristics for the traveling salesman problem with pickup and delivery (Q1302721):
Displayed 33 items.
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← 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 unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← 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)
- 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)
- 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)
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← 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)
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← 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)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← 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)
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
- Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) (← links)
- Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)