Pages that link to "Item:Q2571182"
From MaRDI portal
The following pages link to A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182):
Displaying 47 items.
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- A large neighbourhood search heuristic for ship routing and scheduling with split loads (Q709186) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
- A hybrid method based on linear programming and tabu search for routing of logging trucks (Q958445) (← links)
- A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows (Q974734) (← links)
- A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
- Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Integrated planning of loaded and empty container movements (Q1944871) (← links)
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
- The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search (Q2358876) (← links)
- Indirect search for the vehicle routing problem with pickup and delivery and time windows (Q2480796) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897194) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands (Q6164316) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
- Solving a pickup and delivery routing problem for fourth‐party logistics providers (Q6195030) (← links)
