Pages that link to "Item:Q657060"
From MaRDI portal
The following pages link to Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060):
Displaying 22 items.
- Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- Finished-vehicle transporter routing problem solved by loading pattern discovery (Q893051) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
- The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming (Q2811317) (← links)
- Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation (Q2840788) (← links)
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (Q2893344) (← links)
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)