The vehicle routing problem
Hybrid scheduling methods for paratransit operations
Computers and Industrial Engineering
Location-Routing Problems with Distance Constraints
Transportation Science
Selected Topics in Column Generation
Operations Research
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research
Dynamic Vehicle Routing Based on Online Traffic Information
Transportation Science
Decision Support for Consumer Direct Grocery Initiatives
Transportation Science
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
Dynamic vehicle routing using genetic algorithms
Applied Intelligence
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Computers and Operations Research
Vehicle Scheduling and Routing with Drivers' Working Hours
Transportation Science
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Survey: The vehicle routing problem: A taxonomic review
Computers and Industrial Engineering
Solving a rich vehicle routing and inventory problem using column generation
Computers and Operations Research
Simulation of a large scale dynamic pickup and delivery problem
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
INFORMS Journal on Computing
Truck Driver Scheduling in the European Union
Transportation Science
European Driver Rules in Vehicle Routing with Time Windows
Transportation Science
A column generation heuristic for the general vehicle routing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Computers and Operations Research
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Operations Research
Real-time management of vehicle breakdowns in urban freight distribution
Journal of Heuristics
Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Truck Driver Scheduling in the United States
Transportation Science
Heuristics for dynamic and stochastic routing in industrial shipping
Computers and Operations Research
Solving a robust airline crew pairing problem with column generation
Computers and Operations Research
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules
Transportation Science
Hi-index | 0.00 |
We present DRIVE (Dynamic Routing of Independent VEhicles), a planning module to be incorporated in a decision support system for the direct transportation at Van Gend and Loos BV. Van Gend and Loos BV is the largest company providing road transportation in the Benelux, with about 1400 vehicles transporting 160,000 packages from thousands of senders to tens of thousands of addressees per day. The heart of DRIVE is a branch-and-price algorithm. Approximation and incomplete optimization techniques as well as a sophisticated column management scheme have been employed to create the right balance between solution speed and solution quality. DRIVE has been tested by simulating a dynamic planning environment with real-life data and has produced very encouraging results.