Étude comparative de divers modèles pour le problème de transport à la demande
From MaRDI portal
Publication:6102816
DOI10.3138/infor.45.2.95MaRDI QIDQ6102816
Jean-François Cordeau, Unnamed Author, Gilbert Laporte
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
algorithme de recherche avec tabousarbitrage entre les coûts et le niveau de servicetransport à la demande
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A dial-a-ride problem for client transportation in a health-care organization
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- An effective and fast heuristic for the dial-a-ride problem
- Modeling and Optimizing Dynamic Dial-a-Ride Problems
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
