A comparison of column-generation approaches to the synchronized pickup and delivery problem
From MaRDI portal
Publication:319923
DOI10.1016/J.EJOR.2015.06.017zbMATH Open1346.90117OpenAlexW2215640555MaRDI QIDQ319923FDOQ319923
Authors: Timo Gschwind
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.017
Recommendations
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- scientific article; zbMATH DE number 680242
- A column generation approach for location-routing problems with pickup and delivery
- Column generation for vehicle routing problems with multiple synchronization constraints
- A column generation approach for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Integrated production scheduling and delivery routing: complexity results and column generation
- Column generation based approaches for combined routing and scheduling
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
branch-and-cut-and-pricevehicle routingpickup and deliverylabeling algorithmtemporal synchronization
Cites Work
- The pickup and delivery problem with time windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Title not available (Why is that?)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Fleet assignment and routing with schedule synchronization constraints
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- The vehicle routing problem with time windows and temporal dependencies
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Efficient feasibility testing for dial-a-ride problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- 2-path cuts for the vehicle routing problem with time windows
- Single liner shipping service design
- Modelling path flows for a combined ship routing and inventory management problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- An exact algorithm for the pickup and delivery problem with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Title not available (Why is that?)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A note on ``Efficient feasibility testing for dial-a-ride problems
Cited In (11)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Daily aircraft routing for amphibious ready groups
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics
- Title not available (Why is that?)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- A practical vehicle routing problem with desynchronized arrivals to depot
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- Typology and literature review for dial-a-ride problems
This page was built for publication: A comparison of column-generation approaches to the synchronized pickup and delivery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319923)