The vehicle routing problem with time windows and temporal dependencies
From MaRDI portal
Publication:3113512
DOI10.1002/net.20472zbMath1231.90085OpenAlexW2005969524MaRDI QIDQ3113512
No author found.
Publication date: 18 January 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://orbit.dtu.dk/ws/files/3930103/rap1%2520samlet%25202009%25205t.pdf
integer programmingcolumn generationrelaxationset coveringbranch-and-pricebranch-and-cut-and-priceset partitioninggeneralized precedence constraintsvehicle routing with time windowstemporal dependencytime-window branching
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits ⋮ An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Tramp ship routing and scheduling with voyage separation requirements ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints ⋮ The home care crew scheduling problem: preference-based visit clustering and temporal dependencies ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ Flexible vehicle scheduling with precedence constraints for tourists ⋮ An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Solving routing problems with pairwise synchronization constraints ⋮ The multi-visit team orienteering problem with precedence constraints ⋮ A Time-Indexed Generalized Vehicle Routing Model for Military Aircraft Mission Planning ⋮ A metaheuristic algorithm to transporter scheduling for assembly blocks in a shipyard considering precedence and cooperating constraints ⋮ Scheduling truck drivers with interdependent routes under European Union regulations ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning
Uses Software
Cites Work
- The vehicle routing problem with coupled time windows
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
- Fleet assignment and routing with schedule synchronization constraints
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Branching rules revisited
- A new branching strategy for time constrained routing problems with application to backhauling
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- Vehicle routing problem with elementary shortest path based column generation
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Decomposition Principle for Linear Programs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Manpower allocation with time windows and job-teaming constraints
- Manpower allocation with time windows
- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
- Vehicle Routing Problem with Time Windows
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- Robust Inventory Ship Routing by Column Generation
This page was built for publication: The vehicle routing problem with time windows and temporal dependencies
