A general heuristic for vehicle routing problems
Computers and Operations Research
Location-Routing Problems with Distance Constraints
Transportation Science
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
Ant colony optimization for the traveling purchaser problem
Computers and Operations Research
Bi-dynamic constraint aggregation and subproblem reduction
Computers and Operations Research
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Computers and Operations Research
A Column Generation Algorithm for a Rich Vehicle-Routing Problem
Transportation Science
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Computers and Operations Research
The undirected capacitated arc routing problem with profits
Computers and Operations Research
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
INFORMS Journal on Computing
An ILP improvement procedure for the Open Vehicle Routing Problem
Computers and Operations Research
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Computers and Operations Research
INFORMS Journal on Computing
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
Computers and Operations Research
Computers and Operations Research
A novel column generation algorithm for the vehicle routing problem with cross-docking
INOC'11 Proceedings of the 5th international conference on Network optimization
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Operations Research
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Operations Research Letters
Interior point stabilization for column generation
Operations Research Letters
Solving the longest simple path problem with constraint-based techniques
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Computers and Operations Research
A column generation approach for a school bus routing problem with resource constraints
Computers and Operations Research
The Pickup and Delivery Problem with Cross-Docking
Computers and Operations Research
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows
Computers and Operations Research
Using the primal-dual interior point algorithm within the branch-price-and-cut method
Computers and Operations Research
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Transportation Science
A set-covering based heuristic algorithm for the periodic vehicle routing problem
Discrete Applied Mathematics
Combined location and routing problems for drug distribution
Discrete Applied Mathematics
Hi-index | 0.00 |
In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution procedures based on column generation for several important problems, such as vehicle routing and crew pairing. In many cases relaxing the restriction of an elementary path resulted in optimal solutions in a reasonable computation time. However, for a number of other problems, the elementary path restriction has too much impact on the solution to be relaxed or might even be necessary. We propose an exact solution procedure for the ESPPRC, which extends the classical label correcting algorithm originally developed for the relaxed (nonelementary) path version of this problem. We present computational experiments of this algorithm for our specific problem and embedded in a column generation scheme for the classical Vehicle Routing Problem with Time Windows. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(3), 216–229 2004