Fleet assignment and routing with schedule synchronization constraints

DOI10.1016/S0377-2217(98)00343-9zbMath0934.90008OpenAlexW1998137802MaRDI QIDQ1806762

François Soumis, Jacques Desrosiers, Irina Ioachim, 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

zbMATH Keywords

schedulingdynamic programmingbranch and boundDantzig-Wolfe decompositiontime windowsroutingair transportationweekly aircraft fleet assignment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (22)

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits ⋮ Daily aircraft routing for amphibious ready groups ⋮ 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 aquaculture service vessel routing problem with time dependent travel times and synchronization constraints ⋮ Selective routing problem with synchronization ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ The home care crew scheduling problem: preference-based visit clustering and temporal dependencies ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues ⋮ Combined vehicle routing and scheduling with temporal precedence and synchronization constraints ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Network flow-based approaches for integrated aircraft fleeting and routing ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ The vehicle routing problem with profits and consistency constraints ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Solving routing problems with pairwise synchronization constraints ⋮ Linear formulations for the vehicle routing problem with synchronization constraints ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reoptimization algorithm for the shortest path problem with time windows
• An exact algorithm for IP column generation
• The fleet assignment problem: Solving a large scale integer program
• A new branching strategy for time constrained routing problems with application to backhauling
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition Principle for Linear Programs
• Integer Programming Formulation of Traveling Salesman Problems
• Scheduling School Buses
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Savings by Split Delivery Routing
• Daily Aircraft Routing and Scheduling
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

This page was built for publication: Fleet assignment and routing with schedule synchronization constraints