The Pickup and Delivery Problem with Time Windows and Incompatibility Constraints in Cold Chain Transportation

References

• Amorim P, Almada-Lobo B (2014) The impact of food perishability issues in the vehicle routing problem. Comput. Indust. Engrg. 67:223–233.Crossref, Google Scholar
• Baldacci R, Bartolini E, Mingozzi A (2011) 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 (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Battarra M, Monaci M, Vigo D (2009) An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput. Oper. Res. 36(11):3041–3050.Crossref, Google Scholar
• Bettinelli A, Cacchiani V, Crainic TG, Vigo D (2019) A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities. Eur. J. Oper. Res. 279(3):824–839.Crossref, Google Scholar
• Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transportation Sci. 43(1):56–69.Link, Google Scholar
• Chai X (2016) Barcode solutions help companies reduce food distribution losses. Logist. Material Handling 22(9):36–37.Google Scholar
• Chen HK, Hsueh CF, Chang MS (2009) Production scheduling and vehicle routing with time windows for perishable food products. Comput. Oper. Res. 36(7):2311–2319.Crossref, Google Scholar
• Cherkesly M, Desaulniers G, Laporte G (2015) Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transportation Sci. 49(4):752–766.Link, Google Scholar
• Cnwest (2015) Why is fresh online shopping “not fresh”? Cold chain distribution becomes a “pain point.” Accessed April 18, 2021, https://society.huanqiu.com/article/9CaKrnJMvlp.Google Scholar
• Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573–586.Link, Google Scholar
• Cordeau J-F, Laporte G, Ropke S (2008) Recent models and algorithms for one-to-one pickup and delivery problems. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 327–357.Crossref, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):380–396.Link, Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM (2005) Column Generation, vol. 5 (Springer, New York).Crossref, Google Scholar
• Factorovich P, Méndez-Díaz I, Zabala P (2020) Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113:104805.Crossref, Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Furtado MGS, Munari P, Morabito R (2017) Pickup and delivery problem with time windows: A new compact two-index formulation. Oper. Res. Lett. 45(4):334–341.Crossref, Google Scholar
• Gendreau M, Manerba D, Mansini R (2016) The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. Eur. J. Oper. Res. 248(1):59–71.Crossref, Google Scholar
• Goeke D (2019) Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. Eur. J. Oper. Res. 278(3):821–836.Crossref, Google Scholar
• Goksal FP, Karaoglan I, Altiparmak F (2013) A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput. Indust. Engrg. 65(1):39–53.Crossref, Google Scholar
• Gschwind T, Irnich S, Rothenbächer A-K, Tilk C (2018) Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266(2):521–530.Crossref, Google Scholar
• Hsu C-I, Hung S-F, Li H-C (2007) Vehicle routing problem with time-windows for perishable food delivery. J. Food Engrg. 80(2):465–475.Crossref, Google Scholar
• Li H, Lim A (2008) A metaheuristic for the pickup and delivery problem with time windows. Internat. J. Artificial Intelligence Tools 12(02):173–186.Crossref, Google Scholar
• Manerba D, Mansini R (2015) A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65:139–154.Crossref, Google Scholar
• Osvald A, Stirn LZ (2008) A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J. Food Engrg. 85(2):285–295.Crossref, Google Scholar
• Parragh SN, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems Part I: Transportation between customers and depot. J. Für Betriebswirtschaft 58(1):21–51.Crossref, Google Scholar
• Parragh SN, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems Part II: Transportation between pickup and delivery locations. J. Für Betriebswirtschaft 58(2):81–117.Crossref, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math. Programming 183(1):483–523.Crossref, Google Scholar
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Crossref, Google Scholar
• Qi C, Hu L (2020) Optimization of vehicle routing problem for emergency cold chain logistics based on minimum loss. Physical Comm., 1–7.Crossref, Google Scholar
• Qin H, Su X, Ren T, Luo Z (2021) A review on the electric vehicle routing problems: Variants and algorithms. Frontiers Engrg. Management 8(3):370–389.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
• Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267–286.Link, Google Scholar
• Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258–272.Crossref, Google Scholar
• Shanghai Municipal Quality and Technical Supervision Bureau (2007) Technology and management specification of cold chain logistics (DB 31/T 388-2007). Accessed April 18, 2021, http://www.bjqtwl.com/html/shejiguifan/2014/0417/76.html.Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Song BD, Ko YD (2016) A vehicle routing problem of both refrigerated- and general-type vehicles for perishable food products delivery. J. Food Engrg. 169:61–71.Crossref, Google Scholar
• Stellingwerf HM, Groeneveld LHC, Laporte G, Kanellopoulos, Bloemhof JM, Behdani B (2021) The quality-driven vehicle routing problem: Model and application to a case of cooperative logistics. Internat. J. Production Econom. 231:107849.Crossref, Google Scholar
• Tilk C, Rothenbächer A-K, Gschwind T, Irnich S (2017) Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur. J. Oper. Res. 261(2):530–539.Crossref, Google Scholar
• Veenstra M, Cherkesly M, Desaulniers G, Laporte G (2017) The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77:127–140.Crossref, Google Scholar
• Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows. Comput. Indust. Engrg. 83:111–122.Crossref, Google Scholar