Pages that link to "Item:Q5295484"
From MaRDI portal
The following pages link to Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484):
Displaying 50 items.
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- Assignment formulation for the elevator dispatching problem with destination control and its performance analysis (Q322904) (← links)
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- A hybrid constraint programming approach to the log-truck scheduling problem (Q545549) (← links)
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Coordinating technician allocation and maintenance routing for offshore wind farms (Q1651656) (← links)
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain (Q1735180) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- Event-based MILP models for ridepooling applications (Q2140290) (← links)
- Feeder routing for air-to-air refueling operations (Q2171624) (← links)
- Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- 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)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search (Q2358876) (← links)
- A branch-and-price-and-check model for the vehicle routing problem with location congestion (Q2398439) (← 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)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design (Q2514794) (← links)
