Fleet assignment and routing with schedule synchronization constraints
DOI10.1016/S0377-2217(98)00343-9zbMATH Open0934.90008OpenAlexW1998137802MaRDI QIDQ1806762FDOQ1806762
Authors: Irina Ioachim, Jacques Desrosiers, François Soumis, Nicolas Bélanger
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00343-9
Recommendations
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Advances in the Optimization of Airline Fleet Assignment
- Integrated airline scheduling
- Daily Aircraft Routing and Scheduling
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
dynamic programmingschedulingtime windowsbranch and boundroutingDantzig-Wolfe decompositionair transportationweekly aircraft fleet assignment
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- An exact algorithm for IP column generation
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Title not available (Why is that?)
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A reoptimization algorithm for the shortest path problem with time windows
- Integer Programming Formulation of Traveling Salesman Problems
- The fleet assignment problem: Solving a large scale integer program
- Branch-and-price: Column generation for solving huge integer programs
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Savings by Split Delivery Routing
- Decomposition Principle for Linear Programs
- Daily Aircraft Routing and Scheduling
- Scheduling School Buses
- A new branching strategy for time constrained routing problems with application to backhauling
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Title not available (Why is that?)
Cited In (29)
- The consistent vehicle routing problem with heterogeneous fleet
- Analyzing and exploiting the competitiveness of scenarios for negotiating convoy formation under time constraints
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Daily aircraft routing for amphibious ready groups
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- The vehicle routing problem with profits and consistency constraints
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- 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
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- Solving routing problems with pairwise synchronization constraints
- Linear formulations for the vehicle routing problem with synchronization constraints
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints
- Selective routing problem with synchronization
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- Network flow-based approaches for integrated aircraft fleeting and routing
- A time-indexed generalized vehicle routing model and stabilized column generation for military aircraft mission planning
- Column generation for vehicle routing problems with multiple synchronization constraints
- A convoy scheduling problem
- Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm
- The vehicle routing problem with time windows and temporal dependencies
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Exact algorithms for electric vehicle-routing problems with time windows
Uses Software
This page was built for publication: Fleet assignment and routing with schedule synchronization constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806762)