Pages that link to "Item:Q4836837"
From MaRDI portal
The following pages link to The General Pickup and Delivery Problem (Q4836837):
Displaying 37 items.
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms (Q2664292) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks (Q2668623) (← links)
- A multi-tiered vehicle routing problem with global cross-docking (Q2669633) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
- Extension and Application of a General Pickup and Delivery Model for Evaluating the Impact of Bundling Goods in an Urban Environment (Q2806899) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- Pickup and delivery problem with split demand and transfers (Q2868783) (← links)
- Sequential resource allocation for nonprofit operations (Q2875600) (← links)
- A solution approach for log truck scheduling based on composite pricing and branch and bound (Q3044067) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- A near-exact method for solving the log-truck scheduling problem (Q3158011) (← links)
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems (Q3168926) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- Multidepot pickup and delivery problems in multiple regions: a typology and integrated model (Q4642119) (← links)
- Strong Coalitional Structure in an Open Vehicle Routing Game (Q4687470) (← links)
- Heuristics for electric taxi fleet management at Teo Taxi (Q5884393) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
- Distribution of waiting time for dynamic pickup and delivery problems (Q5963102) (← links)
- An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services (Q6047859) (← links)
- New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries (Q6065909) (← links)
- Optimal routing of multimodal mobility systems with ride‐sharing (Q6070497) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
- Diagnosis of intermittent faults in multi-agent systems: an SFL approach (Q6088307) (← links)
- Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← 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)
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network (Q6561217) (← links)