The following pages link to (Q4532231):
Displaying 49 items.
- Operational transportation planning of freight forwarding companies in horizontal coalitions (Q296641) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- New neighborhood structures for the double traveling salesman problem with multiple stacks (Q839902) (← links)
- Reverse logistics: simultaneous design of delivery routes and returns strategies (Q850304) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
- Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- A distributed geographic information system for the daily car pooling problem (Q1886004) (← links)
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets (Q2057127) (← links)
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
- A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Collaborative transportation planning of less-than-truckload freight (Q2454368) (← links)
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments (Q2455616) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- A multi-tiered vehicle routing problem with global cross-docking (Q2669633) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
- (Q2861522) (← links)
- Competition and Cooperation in Pickup and Multiple Delivery Problems (Q2980177) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
- Supply Chain Optimization for the Liquefied Natural Gas Business (Q5850936) (← links)
- Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers (Q5879638) (← links)
- Ridesharing for emergency evacuation (Q5881511) (← links)
- Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm (Q6106573) (← links)
- Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
