Pages that link to "Item:Q959510"
From MaRDI portal
The following pages link to A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510):
Displaying 23 items.
- A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Coordinating technician allocation and maintenance routing for offshore wind farms (Q1651656) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints (Q3002558) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
- Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)