The cumulative cost pickup and delivery problem on rings
Authors:
- Manuel TrottaMTManuel Trotta
- Claudia ArchettiClaudia Archetti
- Dominique FeilletDominique Feillet
- Alain QuilliotAQAlain Quilliot
Open Access
- 1 December 2025
- journal article
- Published by KEAI Publishing in Autonomous Transportation Research
- Vol. 1 (1) , 97-115
Abstract
No abstract availableFunding Information
- French National Research Agency (ANR-10-LABX-0016)
- French National Research Agency (ANR-16-IDEX-0001)
This publication has 11 references indexed in Scilit:
- A hyper-heuristic algorithm-based automatic monorail shuttle system for material feeding optimization in mixed-model assembly linesSoft Computing, 2023
- Pickup and delivery problems with autonomous vehicles on ringsEuropean Journal of Operational Research, 2022
- Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehiclesEuropean Journal of Operational Research, 2017
- The uncapacitated swapping problem on a line and on a circleDiscrete Applied Mathematics, 2013
- A short proof of the NP-completeness of minimum sum interval coloringOperations Research Letters, 2005
- The vehicle routing problem with pickups and deliveries on some special graphsDiscrete Applied Mathematics, 2002
- Heuristics for the traveling salesman problem with pickup and deliveryComputers & Operations Research, 1999
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-CompleteSIAM Journal on Computing, 1999
- Routing a vehicle of capacity greater than oneDiscrete Applied Mathematics, 1998
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm TravelSIAM Journal on Computing, 1988