Routing with time windows by column generation
From MaRDI portal
Publication:3688124
DOI10.1002/net.3230140406zbMath0571.90088OpenAlexW2093952957MaRDI QIDQ3688124
François Soumis, Jacques Desrosiers, Martin Desrochers
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140406
column generationbranch-and-boundsimplextime windowsset partitioningshortest path algorithmm-traveling salesmanschool bus transportation problems
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving binary cutting stock problems by column generation and branch- and-bound, A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows, Lagrangean relaxation. (With comments and rejoinder)., Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, A column generation approach to job grouping for flexible manufacturing systems, Maximizing the value of a space mission, Column generation for a UAV assignment problem with precedence constraints, A generalization of column generation to accelerate convergence, A new approach for crew pairing problems by column generation with an application to air transportation, Vehicle routing with full loads, The vehicle allocation problem: alternative formulation and branch-and-price method, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Circulation of railway rolling stock: a branch-and-price approach, Arcs-states models for the vehicle routing problem with time windows and related problems, Pricing routines for vehicle routing with time windows on road networks, A branch and price algorithm for the pharmacy duty scheduling problem, Cluster analysis and mathematical programming, Routing problems: A bibliography, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost, Vehicles scheduling with sliding time windows, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, A reoptimization algorithm for the shortest path problem with time windows, Search-hide games on trees, A prototype column generation strategy for the multiple container loading problem, Column generation applied to linear programs in course registration, “Make no little plans”: Impactful research to solve the next generation of transportation problems, A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Loads scheduling for demand response in energy communities, Selective arc‐ng pricing for vehicle routing, A Column Generation Model for Truck Routing in the Chilean Forest Industry, Minimum time paths in a network with mixed time constraints., A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Air cargo scheduling: integrated models and solution procedures, A new mixed integer linear model for a rich vehicle routing problem with docking constraints, A GRASP with evolutionary path relinking for the truck and trailer routing problem, A branch-and-price approach for operational aircraft maintenance routing, A classification scheme for vehicle routing and scheduling problems, A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies, The pickup and delivery problem with time windows, Bi-dynamic constraint aggregation and subproblem reduction, A model to optimize placement operations on dual-head placement machines, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, Formulations and exact algorithms for the vehicle routing problem with time windows, Vehicle crew scheduling to complete specific tasks and bulk-tasks at depots, The vehicle routing problem: An overview of exact and approximate algorithms, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, A labeling method for dynamic driver-task assignment with uncertain task durations, A GRASP\(\times \)ELS approach for the capacitated location-routing problem, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Column generation based heuristic for learning classification trees, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Column-Generation in Integer Linear Programming, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, Dynamic control of multicommodity fleet management problems, School-bus routing for program scheduling, Cutting planes for branch-and-price algorithms, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems, Methods for routing with time windows, Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation, On compact formulations for integer programs solved by column generation, Logical processing for integer programming
Cites Work
