Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation

DOI10.1016/j.cor.2010.12.014zbMath1208.90018OpenAlexW2082546575MaRDI QIDQ632696

Didier Josselin, Dominique Feillet, Thierry Garaix, Christian Artigues

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.014

zbMATH Keywords

column generationvehicle routingdial-a-ride problemlinear fractional programon-demand transportation

Mathematics Subject Classification ID

Fractional programming (90C32) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Algorithms and implementation of a set partitioning approach for modular machining line design, A concise guide to existing and emerging vehicle routing problem variants, A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints, Typology and literature review for dial-a-ride problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem. Latest advances and new challenges.
• A dual ascent procedure for the set partitioning problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• Drive: Dynamic Routing of Independent Vehicles
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Column Generation Methods for Probabilistic Logic
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Column Generation
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Programming with linear fractional functionals
• Nonlinear Programming
• On Nonlinear Fractional Programming