Pages that link to "Item:Q3770308"

The following pages link to A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308):

Displaying 43 items.

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• The pickup and delivery problem with time windows (Q1179004) (← links)
• Towards a decision support system for the ready concrete distribution system: a case of a Greek company. (Q1412756) (← links)
• Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• A two-phase heuristic for an in-port ship routing problem with tank allocation (Q1652535) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
• Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• A dial-a-ride problem for client transportation in a health-care organization (Q2433383) (← links)
• Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754) (← links)
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
• Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← 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)
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← 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)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem (Q2815449) (← links)
• Hybrid adaptive predictive control for a dynamic pickup and delivery problem including traffic congestion (Q2893347) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← 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)
• Solving min-max shortest-path problems on a network (Q4018281) (← links)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
• Ship scheduling with soft time windows: An optimisation based approach (Q5935388) (← links)
• Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems (Q6160203) (← links)