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

DOI10.1016/J.COR.2010.12.014MaRDI QIDQ632696zbMATH OpenOpenAlexFDO

Authors Thierry Garaix, Christian Artigues, Dominique Feillet, Didier Josselin

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 generationdial-a-ride problemlinear fractional programon-demand transportationvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Modeling and optimizing dynamic dial-a-ride problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• A matheuristic for the dial-a-ride problem

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A dual ascent procedure for the set partitioning problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Column Generation
• Column Generation Methods for Probabilistic Logic
• DRIVE: Dynamic routing of independent vehicles
• scientific article; zbMATH DE number 1324130 (Why is no real title available?)
• scientific article; zbMATH DE number 680242 (Why is no real title available?)
• scientific article; zbMATH DE number 1749228 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Nonlinear Programming
• On Nonlinear Fractional Programming
• Programming with linear fractional functionals
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• The vehicle routing problem. Latest advances and new challenges.
• Vehicle routing problems with alternative paths: an application to on-demand transportation

Cited in

(5)

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

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632696)