Pages that link to "Item:Q4422622"

The following pages link to An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622):

Displaying 14 items.

• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
• Single-commodity vehicle routing problem with pickup and delivery service (Q1023173) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• Decentralized production-distribution planning in multi-echelon supply chain network using intelligent agents (Q1684329) (← links)
• Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking (Q2293789) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← 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)