Pages that link to "Item:Q1836590"
From MaRDI portal
The following pages link to k-interchange procedures for local search in a precedence-constrained routing problem (Q1836590):
Displayed 12 items.
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems (Q3771951) (← links)