An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
From MaRDI portal
Publication:4651933
DOI10.1002/net.20033zbMath1056.90014OpenAlexW2029341065MaRDI QIDQ4651933
Michel Gendreau, Dominique Feillet, Cyrille Gueguen, Pierre Dejax
Publication date: 23 February 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20033
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times, Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses, A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows, Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, Freight railway operator timetabling and engine scheduling, A column generation approach for a multi-attribute vehicle routing problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Ant colony optimization for the traveling purchaser problem, Optimization in Designing Complex Communication Networks, Column generation based heuristic for tactical planning in multi-period vehicle routing, Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment, Vehicle routing problems with alternative paths: an application to on-demand transportation, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints, An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits, Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time, A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations, The joint network vehicle routing game with optional customers, An exact solution approach for the inventory routing problem with time windows, The rainbow Steiner tree problem, An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs, Algorithms for non-linear and stochastic resource constrained shortest path, A branch-and-price algorithm for a routing problem with inbound and outbound requests, The rendezvous vehicle routing problem, A multi‐vehicle covering tour problem with speed optimization, Multi‐objective optimization of the maritime cargo routing and scheduling problem, Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows, Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, The Steiner bi-objective shortest path problem, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, A survey of attended home delivery and service problems with a focus on applications, A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup, New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, New Refinements for the Solution of Vehicle Routing Problems with Branch and Price, A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints, Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, A novel greedy adaptive ant colony algorithm for shortest path of irrigation groups, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Combined location and routing problems for drug distribution, Branch-and-Bound for Bi-objective Integer Programming, A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies, Bi-dynamic constraint aggregation and subproblem reduction, Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Interior point stabilization for column generation, A robust optimization approach with probe-able uncertainty, Formulations and exact algorithms for the vehicle routing problem with time windows, The Split Delivery Vehicle Routing Problem: A Survey, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics, A column generation approach for the split delivery vehicle routing problem, Comparison of bundle and classical column generation, An exact algorithm for team orienteering problems, Resource extension functions: properties, inversion, and generalization to segments, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, The distance constrained multiple vehicle traveling purchaser problem, Integer programming models for the multidimensional assignment problem with star costs, Vehicle routing problem with elementary shortest path based column generation, Lagrangian duality applied to the vehicle routing problem with time windows, Exact solution of the soft-clustered vehicle-routing problem, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Optimal routing with failure-independent path protection, A rollout algorithm for the resource constrained elementary shortest path problem, Bidirectional labeling for solving vehicle routing and truck driver scheduling problems, On the shortest path problem with negative cost cycles, Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach, A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, A survey of resource constrained shortest path problems: Exact solution approaches, The Fixed-Charge Shortest-Path Problem, An efficient exact approach for the constrained shortest path tour problem, The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking, Column Generation for Extended Formulations, Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times, The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm, The vehicle routing problem with time windows and temporal dependencies, Cutting planes for branch-and-price algorithms, Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems, A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows, A branch-and-cut algorithm for the capacitated profitable tour problem, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Dynamic programming algorithms for the elementary shortest path problem with resource constraints, Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types, Solving the shortest path tour problem, A heuristic for cumulative vehicle routing using column generation, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, Task assignment with start time-dependent processing times for personnel at check-in counters, The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem, A priori orienteering with time windows and stochastic wait times at customers, Efficient elementary and restricted non-elementary route pricing, Two exact algorithms for the traveling umpire problem, The discrete time window assignment vehicle routing problem, A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times, Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows, Integer programming formulations for the elementary shortest path problem, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows, Arcs-states models for the vehicle routing problem with time windows and related problems, Lifted and local reachability cuts for the vehicle routing problem with time windows, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Pricing routines for vehicle routing with time windows on road networks, A new formulation and approach for the black and white traveling salesman problem, Solving the orienteering problem with time windows via the pulse framework, A branch-and-price approach for a multi-period vehicle routing problem, Empirical analysis for the VRPTW with a multigraph representation for the road network, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints, Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows, A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs, Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price, Models and hybrid methods for the onshore wells maintenance problem, A branch-price-and-cut algorithm for the workover rig routing problem, A branch-price-and-cut method for a ship routing and scheduling problem with split loads, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, A profit-maximization location-routing-pricing problem: a branch-and-price algorithm, An exact algorithm for a single-vehicle routing problem with time windows and multiple routes, Time-dependent routing problems: a review, A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, A general heuristic for vehicle routing problems, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, Arc routing problems with time-dependent service costs, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, The home care crew scheduling problem: preference-based visit clustering and temporal dependencies, Integer linear programming models for a cement delivery problem, The time-dependent capacitated profitable tour problem with time windows and precedence constraints, A note on branch-and-cut-and-price, An efficient and general approach for the joint order batching and picker routing problem, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, A set-covering based heuristic algorithm for the periodic vehicle routing problem, The aircraft routing problem with refueling, Resource constrained routing and scheduling: review and research prospects, A survey of the standard location-routing problem, A computational study of solution approaches for the resource constrained elementary shortest path problem, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, A tutorial on column generation and branch-and-price for vehicle routing problems, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, The orienteering problem with stochastic travel and service times, Column generation for extended formulations, A column generation-based heuristic for the split delivery vehicle routing problem with time windows, Branch-and-price for a multi-attribute technician routing and scheduling problem, The time-dependent vehicle routing problem with time windows and road-network information, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration, The dynamic-demand joint replenishment problem with approximated transportation costs, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, A branch and bound method for the job-shop problem with sequence-dependent setup times, Pruning in column generation for service vehicle dispatching, A new warmstarting strategy for the primal-dual column generation method, Column generation based approaches for combined routing and scheduling, A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities, Finding the nucleolus of the vehicle routing game with time windows, Exact methods for solving the elementary shortest and longest path problems, A branch-and-price algorithm for a vehicle routing with demand allocation problem, Column generation for vehicle routing problems with multiple synchronization constraints, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, Route relaxations on GPU for vehicle routing problems, The traveling purchaser problem and its variants, Branch-and-price approaches for the multiperiod technician routing and scheduling problem, Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, Real-time vehicle rerouting problems with time windows, A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation, A column generation algorithm for the vehicle routing problem with soft time windows, Range-constrained traffic assignment with multi-modal recharge for electric vehicles, An efficient column-generation-based algorithm for solving a pickup-and-delivery problem, Minimum makespan vehicle routing problem with compatibility constraints, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, The undirected capacitated arc routing problem with profits, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, The EMS vehicle patient transportation problem during a demand surge, A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments, An ILP improvement procedure for the open vehicle routing problem, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, A column generation approach for an emission-oriented vehicle routing problem on a multigraph, A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints, Exact and hybrid methods for the multiperiod field service routing problem, Scheduling heterogeneous delivery tasks on a mixed logistics platform, An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles, The orienteering problem with time windows applied to robotic melon harvesting
