Pages that link to "Item:Q3392004"

The following pages link to A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004):

Displaying 43 items.

• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← 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)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← links)
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
• A branch-and-price algorithm for a routing problem with inbound and outbound requests (Q2676292) (← links)
• The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
• A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips (Q2676410) (← links)
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← 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)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• Verification of Correctness of Parallel Algorithms in Practice (Q4609778) (← links)
• (Q4944966) (← links)
• Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876) (← links)
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
• Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
• A deterministic annealing local search for the electric autonomous dial-a-ride problem (Q6167858) (← links)
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
• Aesthetic considerations for the min-max \(K\)-windy rural postman problem (Q6496353) (← links)
• Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)
• Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control (Q6551066) (← links)
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
• Multi-day fair collaboration in demand-responsive transportation (Q6558646) (← links)
• The rich heterogeneous dial-a-ride problem with trip time prediction (Q6659104) (← links)