Pages that link to "Item:Q4279046"
From MaRDI portal
The following pages link to Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows (Q4279046):
Displaying 16 items.
- A variable depth search branching (Q453047) (← links)
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- Single-vehicle scheduling with time window constraints (Q1297696) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← links)
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
