The time‐consistent dial‐a‐ride problem

DOI10.1002/net.22063zbMath1528.90044MaRDI QIDQ6065902

Fabien Lehuédé, Unnamed Author, Samuel Vercraene, Olivier Péton, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

consistencyvehicle routingdial-a-ride problemlarge neighborhood searchset partitioninghealth care logistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)

Cites Work

• On service consistency in multi-period vehicle routing
• The discrete time window assignment vehicle routing problem
• A branch-and-cut framework for the consistent traveling salesman problem
• Integrated timetabling and vehicle scheduling with balanced departure times
• A general heuristic for vehicle routing problems
• The school bus routing problem: a review
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• Typology and literature review for dial-a-ride problems
• Fair optimization and networks: a survey
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Unnamed Item

This page was built for publication: The time‐consistent dial‐a‐ride problem