Feasibility of the pickup and delivery problem with fixed partial routes : a complexity analysis
Year of publication: |
2012
|
---|---|
Authors: | Berbeglia, Gerardo ; Pesant, Gilles ; Rousseau, Louis-Martin |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 46.2012, 3, p. 359-373
|
Subject: | pickup and delivery problem | fixed partial routes | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Constraint-Programmierung | Constraint programming |
-
Liu, Xiaochang, (2023)
-
Ghilas, Veaceslav, (2016)
-
The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Sun, Peng, (2018)
- More ...
-
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis
Berbeglia, Gerardo, (2012)
-
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Berbeglia, Gerardo, (2011)
-
Checking the feasibility of dial-a-ride instances using constraint programming
Berbeglia, Gerardo, (2011)
- More ...