The precedence-constrained asymmetric traveling salesman polytope
Mathematical Programming: Series A and B
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
The vehicle routing problem
Drive: Dynamic Routing of Independent Vehicles
Operations Research
Survey: Quality of service in dial-a-ride operations
Computers and Industrial Engineering
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers and Operations Research
Variable neighborhood search for the dial-a-ride problem
Computers and Operations Research
SIM-MADARP: An Agent-Based Tool for Dial-a-Ride Simulation
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
Decomposition approach to solve dial-a-ride problems using ant computing and constraint programming
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Impact of competition on quality of service in demand responsive transit
MATES'10 Proceedings of the 8th German conference on Multiagent system technologies
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Computers and Operations Research
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
Discrete Applied Mathematics
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Operations Research
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Transportation Science
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
INFORMS Journal on Computing
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Computers and Operations Research
One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio
International Journal of Decision Support System Technology
A Mechanism for Organizing Last-Mile Service Using Non-dedicated Fleet
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
| Hi-index | 0.00 |
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum-cost vehicle routes satisfying capacity, duration, time window, pairing, precedence, and ride-time constraints. This paper introduces a mixed-integer programming formulation of the problem and a branch-and-cut algorithm. The algorithm uses new valid inequalities for the dial-a-ride problem as well as known valid inequalities for the traveling salesman, the vehicle routing, and the pick-up and delivery problems. Computational experiments performed on randomly generated instances show that the proposed approach can be used to solve small to medium-size instances.