Pages that link to "Item:Q1571039"
From MaRDI portal
The following pages link to A heuristic for the pickup and delivery traveling salesman problem (Q1571039):
Displaying 19 items.
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
- Collaborative transportation planning of less-than-truckload freight (Q2454368) (← links)
- Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)