Planification des tournées dans le domaine de la messagerie rapide

DOI10.3138/infor.52.1.20OpenAlexW2033241398MaRDI QIDQ6160412

Unnamed Author, Unnamed Author, Jacques Renaud, Angel Ruiz

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.52.1.20

zbMATH Keywords

heuristiquescueillette et livraisonfenêtres de tempstournées de véhicules

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015

Cites Work

• Unnamed Item
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Dynamic pickup and delivery problems
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• A computer assistant for vehicle dispatching with learning capabilities
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Variable neighborhood search for the dial-a-ride problem
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• Vehicle Routing for Small Package Delivery and Pickup Services
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Planification des tournées dans le domaine de la messagerie rapide