Pages that link to "Item:Q1038370"

The following pages link to Dynamic pickup and delivery problems (Q1038370):

Displaying 50 items.

• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• Measures of dynamism and urgency in logistics (Q323225) (← links)
• A practical vehicle routing problem with desynchronized arrivals to depot (Q323484) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
• Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
• Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives (Q339640) (← links)
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• A stochastic model for a vehicle in a dial-a-ride system (Q613349) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Generalised pickup and delivery problem with dynamic time windows (Q973446) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands (Q1653371) (← links)
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search (Q1695780) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• A unified framework for stochastic optimization (Q1719609) (← links)
• Dynamic courier routing for a food delivery service (Q1738833) (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
• Complexity of routing problems with release dates and deadlines (Q1754053) (← links)
• A probabilistic approach to pickup and delivery problems with time window uncertainty (Q1755385) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
• Economic model predictive inventory routing and control (Q1788929) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
• Planning station capacity and fleet size of one-way electric carsharing systems with continuous state of charge functions (Q2023996) (← links)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
• A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
• TLHSA and SACA: two heuristic algorithms for two variant VRP models (Q2084658) (← links)
• Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery (Q2099865) (← links)
• A multi-objective humanitarian pickup and delivery vehicle routing problem with drones (Q2108785) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• Equilibrium network design of shared-vehicle systems (Q2256243) (← links)
• The dynamic multi-period vehicle routing problem (Q2270447) (← links)
• An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time (Q2294298) (← links)
• An exact solution method for the capacitated item-sharing and crowdshipping problem (Q2312351) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)