Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm

DOI10.1016/J.EJOR.2020.07.060MaRDI QIDQ2029308zbMATH OpenOpenAlexFDO

Authors Yves Molenbruch, Kris Braekers, Patrick Hirsch, Marco Oberscheider

Publication date 3 June 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2020.07.060

zbMATH Keywords

demand-dependent transportdial-a-ride problemintegrationlarge neighborhood searchpublic transportvehicle routing problem

Mathematics Subject Classification ID

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

Recommendations

• The dial-a-ride problem with private fleet and common carrier
• Modeling and optimizing dynamic dial-a-ride problems
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• An effective and fast heuristic for the dial-a-ride problem
• A matheuristic for the dial-a-ride problem

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A note on ``Efficient feasibility testing for dial-a-ride problems
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• Dynamic pickup and delivery problems
• Enhancing urban mobility: integrating ride-sharing and public transit
• scientific article; zbMATH DE number 1683924 (Why is no real title available?)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• On a routing problem
• Recovery management for a dial-a-ride system with real-time disruptions
• The dial-A-ride problem with transfers
• The pickup and delivery problem with time windows and scheduled lines
• Typology and literature review for dial-a-ride problems
• Variable neighborhood search for the dial-a-ride problem

Cited in

(8)

• Lexicographic multi-objective road pricing optimization considering land use and transportation effects
• The dial-a-ride problem with private fleet and common carrier
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
• Public transport for smart cities: recent innovations and future challenges
• Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles
• The rail-road dial-a-ride problem
• Optimal taxes and subsidies to incentivize modal shift for inner-city freight transport
• Optimizing transport operations in a hybrid mobility system for rural-urban transport

This page was built for publication: Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029308)