Pages that link to "Item:Q976005"
From MaRDI portal
The following pages link to A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005):
Displaying 23 items.
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
- A parallel hybrid metaheuristic for bicluster editing (Q2811935) (← links)
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups (Q2840759) (← links)
- GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery (Q2840778) (← links)
- A parallel algorithm for the vehicle routing problem (Q2899121) (← links)
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups (Q3394022) (← links)
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
- (Q4656782) (← links)
- Parallel metaheuristics: recent advances and new trends (Q4921253) (← links)
- Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery (Q4933637) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)
- The road train optimization problem with load assignment (Q6164384) (← links)
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows (Q6164607) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)
