Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

DOI10.1016/j.cor.2011.02.006zbMath1215.90014DBLPjournals/cor/SchildeDH11OpenAlexW1998816621WikidataQ39401914 ScholiaQ39401914MaRDI QIDQ547122

Richard F. Hartl, Karl F. Doerner, Michael Schilde

Publication date: 30 June 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.006

zbMATH Keywords

transportationmetaheuristicvariable neighborhood searchdial-a-ride problemmultiple plan approachmultiple scenario approachdynamic problemstochastic informationstochastic variable neighborhood search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (28)

An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Effective truckload dispatch decision methods with incomplete advance load information ⋮ Ambulance routing for disaster response with patient groups ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ Heuristics for dynamic and stochastic routing in industrial shipping ⋮ An adaptive large neighborhood search heuristic for the share-a-ride problem ⋮ Variable neighbourhood structures for cycle location problems ⋮ A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems ⋮ Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search ⋮ Typology and literature review for dial-a-ride problems ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ The school bus routing and scheduling problem with transfers ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ Optimization for dynamic ride-sharing: a review ⋮ Recent trends in metaheuristics for stochastic combinatorial optimization ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects ⋮ Recovery management for a dial-a-ride system with real-time disruptions

Cites Work

• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Variable neighborhood search
• A new extension of local search applied to the Dial-A-Ride problem
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
• Efficient feasibility testing for dial-a-ride problems
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• The Stochastic Inventory Routing Problem with Direct Deliveries
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Priori Optimization

This page was built for publication: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports