Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

References

• Aldaihani M, Dessouky M (2003) Hybrid scheduling methods for paratransit operations. Comput. Indust. Engrg. 45(1):75–96.Crossref, Google Scholar
• Baldacci R, Bartolini E, Mingozzi A (2011a) An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2):414–426.Link, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011b) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Cargo Tram (2012) Delivering goods by cargo tram in Amsterdam (Netherlands). www.eltis.org/index.php?id=13&study_id=1547.Google Scholar
• Cortes E-C, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200(3):711–724.Crossref, Google Scholar
• Dabia S, Demir E, Van Woensel T (2015) An exact approach for a variant of the pollution-routing problem. Transportation Sci. 51(2):607–628.Link, Google Scholar
• Demir E, Bektaş T, Laporte G (2014) A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3):775–793.Crossref, Google Scholar
• Demir E, Huang Y, Scholts S, Van Woensel T (2015) A selected review on the negative externalities of the freight transportation: Modeling and pricing. Transportation Res. Part E: Logist. Transportation Rev. 77:95–114.Crossref, Google Scholar
• Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387–404.Link, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
• DHL-Packstation (2015) DHL-Packstation. www.dhl.de/en/paket/pakete-empfangen/packstation.html.Google Scholar
• Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1):7–22.Crossref, Google Scholar
• Ghilas V, Demir E, Van Woensel T (2016a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72:12–30.Crossref, Google Scholar
• Ghilas V, Demir E, Van Woensel T (2016b) The pickup and delivery problem with time windows and scheduled lines. INFOR: Inform. Systems Oper. Res. 54(2):147–167.Crossref, Google Scholar
• Ghilas V, Demir E, Van Woensel T (2016c) A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands. Transportation Res. Part B: Methodological 91:34–51.Crossref, Google Scholar
• Häll CH, Andersson H, Lundgren JT, Varbrand P (2009) The integrated dial-a-ride problem. Public Transportation 1(1):39–54.Crossref, Google Scholar
• Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon M, eds. Column Generation (Springer, Boston), 33–65.Crossref, Google Scholar
• Liaw C-F, White C, Bander J (1996) A decision support system for the bimodal dial-a-ride problem. IEEE Trans. Systems, Man, Cybernetics, Part A 26(5):552–565.Crossref, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Marsten R, Hogan W, Blankenship J (1975) The boxstep method for large-scale optimization. Oper. Res. 23(3):389–405.Link, Google Scholar
• Masson R, Lehuede F, Peton O (2012) An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Sci. 47(3):1–12.Google Scholar
• Masson R, Lehuede F, Peton O (2014) The dial-a-ride problem with transfers. Comput. Oper. Res. 41:12–23.Crossref, Google Scholar
• Masson R, Trentini A, Lehuede F, Malhene N, Peton O, Tlahig H (2017) Optimization of a city logistics transportation system with mixed passengers and goods. Eur. J. Transportation Logist. 6(1):81–109.Crossref, Google Scholar
• Mues C, Pickl S (2005) Transshipment and time windows in vehicle routing. 8th Internat. Sympos. Parallel Architectures, Algorithms Networks, Las Vegas, NV, 113–119.Google Scholar
• Nanry W, Barnes W (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Res. Part B: Methodological 34(2):107–121.Crossref, Google Scholar
• Pessoa AA, Sadykov R, Uchoa E, Vanderbeck F (2013) In-out separation and column generation stabilization by dual price smoothing. Bonifaci V, Demetrescu C, Marchetti-Spaccamela A, eds. Experiment. Algorithms, SEA 2013, Lecture Notes Comput. Sci., Vol. 7933 (Springer, Berlin Heidelberg), 354–365.Google Scholar
• Rais A, Alvelos F, Carvalho MS (2013) New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur. J. Oper. Res. 235(3):530–539.Crossref, Google Scholar
• Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255–273.Crossref, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170.Crossref, Google Scholar
• Røpke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267–286.Link, Google Scholar
• Røpke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Røpke S, Pisinger D (2007) Complexity of shortest path problems arising in column generation for vehicle routing problems with pairing and precedence constraints. Technical report, Technical University of Denmark, Lyngby, Denmark.Google Scholar
• Savelsbergh M, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.Link, Google Scholar
• Sigurd M, Pisinger D, Sig M (2004) Scheduling transportation of live animals to avoid the spread of diseases. Transportation Sci. 38(2):197–209.Link, Google Scholar
• Trentini A, Malhene N (2010) Toward a shared urban transport system ensuring passengers and goods cohabitation. Trimestrale del Laboratorio Territorio Mobilita e Ambiente - TeMALab 4:37–44.Google Scholar
• Trentini A, Masson R, Lehuédé F, Malhéné N, Péton O, Tlahig H (2012) A shared “passenger and goods” city logistics system. 4th Internat. Conf. Inform. Systems, Logist. Supply Chain, Québec, Canada.Google Scholar
• Xu H, Chen Z-L, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transportation Sci. 37(3): 347–364.Link, Google Scholar