A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
From MaRDI portal
Publication:3798494
DOI10.1080/03155986.1988.11732063zbMath0652.90097OpenAlexW2408262133MaRDI QIDQ3798494
François Soumis, Martin Desrochers
Publication date: 1988
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1988.11732063
Related Items (72)
The electric vehicle shortest-walk problem with battery exchanges ⋮ The discrete lot-sizing and scheduling problem with sequence-dependent setup costs ⋮ Maximizing the value of a space mission ⋮ Combining column generation and constraint programming to solve the tail assignment problem ⋮ Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows ⋮ Arcs-states models for the vehicle routing problem with time windows and related problems ⋮ Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation ⋮ An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing ⋮ A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs ⋮ Solving resource constrained shortest path problems with LP-based methods ⋮ A dynamical approach for optimizing the trajectories of \(n\) automated guided vehicles ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ Dynamic constraint and variable aggregation in column generation ⋮ On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Enhanced iterated local search for the technician routing and scheduling problem ⋮ Alternating Lagrangian decomposition for integrated airline crew scheduling problem ⋮ Primal column generation framework for vehicle and crew scheduling problems ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques ⋮ Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price ⋮ Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints ⋮ Minimum time paths in a network with mixed time constraints. ⋮ Air cargo scheduling: integrated models and solution procedures ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues ⋮ A branch-and-price approach for operational aircraft maintenance routing ⋮ Analysis of three mathematical models of the staff rostering problem ⋮ Visiting a network of services with time constraints. ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Bi-dynamic constraint aggregation and subproblem reduction ⋮ Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints ⋮ A model to optimize placement operations on dual-head placement machines ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ Best routes selection in international intermodal networks ⋮ An integer programming approach to generating airline crew pairings ⋮ Real-time vehicle rerouting problems with time windows ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Multi-phase dynamic constraint aggregation for set partitioning type problems ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ The first \(K\) shortest unique-arc walks in a traffic-light network ⋮ An efficient column-generation-based algorithm for solving a pickup-and-delivery problem ⋮ Network design formulations for scheduling U.S. air force channel route missions ⋮ Accelerating column generation for aircraft scheduling using constraint propagation ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ Creating very large scale neighborhoods out of smaller ones by compounding moves ⋮ Effective Algorithms for a Class of Discrete Valued Optimal Control Problems ⋮ Unnamed Item ⋮ Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ Lagrangian duality applied to the vehicle routing problem with time windows ⋮ Airline cockpit crew scheduling ⋮ Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem ⋮ Shortest path tour problem with time windows ⋮ The shortest path problem with forbidden paths ⋮ Modeling and solving a multimodal transportation problem with flexible-time and scheduled services ⋮ A column generation heuristic for a dynamic generalized assignment problem ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Fleet assignment and routing with schedule synchronization constraints ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs ⋮ Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem ⋮ Locomotive assignment with heterogeneous consists at CN North America ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ A generalized shortest path tour problem with time windows ⋮ Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems ⋮ Optimal-constrained multicast sub-graph over coded packet networks
This page was built for publication: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
