Pages that link to "Item:Q2644426"
From MaRDI portal
The following pages link to Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426):
Displayed 50 items.
- Synchronization in cross-docking networks: a research classification and framework (Q297360) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Heuristics for routes generation in pickup and delivery problem (Q300807) (← links)
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls (Q301395) (← links)
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q319010) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- A practical vehicle routing problem with desynchronized arrivals to depot (Q323484) (← links)
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
- Single liner shipping service design (Q336948) (← links)
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- A model and two heuristic approaches for a forage Harvester planning problem: a case study (Q611002) (← links)
- The ordered capacitated facility location problem (Q611009) (← links)
- Deterministic optimizational problems of transportation logistics (Q612223) (← links)
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
- Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms (Q666958) (← links)
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery (Q959519) (← links)
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
- Planning for agricultural forage harvesters and trucks: model, heuristics, and case study (Q993459) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)