Pickup and delivery problems with autonomous vehicles on rings
From MaRDI portal
Publication:2670581
DOI10.1016/J.EJOR.2021.07.050zbMath1495.90033OpenAlexW3131079637MaRDI QIDQ2670581
Manuel Trotta, Dominique Feillet, Alain Quilliot, Claudia Archetti
Publication date: 11 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.07.050
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Graphs, networks and algorithms.
- Dynamic pickup and delivery problems
- Heuristics for the traveling salesman problem with pickup and delivery
- Routing a vehicle of capacity greater than one
- The stop number minimization problem: complexity and polyhedral analysis
- Typology and literature review for dial-a-ride problems
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- The uncapacitated swapping problem on a line and on a circle
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
- The dial-a-ride problem: Models and algorithms
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Vehicle Routing
- Euler Digraphs
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Exploring the complexity boundary between coloring and list-coloring
- The vehicle routing problem with pickups and deliveries on some special graphs
This page was built for publication: Pickup and delivery problems with autonomous vehicles on rings
