The unilateral transportation problem

Ahuja, 1993 Baldacci, 2006, Exact methods based on node-routing formulations for undirected arc-routing problems, Networks, 47, 52, 10.1002/net.20091 Baldacci, 2008, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Math. Program., 115, 351, 10.1007/s10107-007-0178-5 Bartolini, 2013, An exact algorithm for the capacitated arc routing problem with deadheading demand, Oper. Res., 61, 315, 10.1287/opre.1120.1154 Belenguer, 2003, A cutting plane algorithm for the capacitated arc routing problem, Comput. Oper. Res., 30, 705, 10.1016/S0305-0548(02)00046-1 Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numer. Math., 4, 238, 10.1007/BF01386316 Birge, 1988, A multicut algorithm for two-stage stochastic linear programs, Eur. J. Oper. Res., 34, 384, 10.1016/0377-2217(88)90159-2 Bode, 2012, Cut-first branch-and-price-second for the capacitated arc-routing problem, Oper. Res., 60, 1167, 10.1287/opre.1120.1079 Caballini, 2016, Cooperation among truck carriers in seaport containerized transportation, Transp. Res. Part E: Logist. Transp. Rev., 93, 38, 10.1016/j.tre.2016.05.007 Chen, 2014, Optimizing road network daily maintenance operations with stochastic service and travel times, Transp. Res. Part E: Logist. Transp. Rev., 64, 88, 10.1016/j.tre.2014.02.002 Chen, 2016, A robust optimization approach for the road network daily maintenance routing problem with uncertain service time, Transp. Res. Part E: Logist. Transp. Rev., 85, 40, 10.1016/j.tre.2015.11.006 Chen, 2016, A hybrid metaheuristic approach for the capacitated arc routing problem, Eur. J. Oper. Res., 253, 25, 10.1016/j.ejor.2016.02.015 Eiselt, 1995, Arc routing problems, part i: the chinese postman problem, Oper. Res., 43, 231, 10.1287/opre.43.2.231 Eiselt, 1995, Arc routing problems, part ii: the rural postman problem, Oper. Res., 43, 399, 10.1287/opre.43.3.399 Ergun, 2007, Reducing truckload transportation costs through collaboration, Transp. Sci., 41, 206, 10.1287/trsc.1060.0169 Ergun, 2007, Shipper collaboration, Comput. Oper. Res., 34, 1551, 10.1016/j.cor.2005.07.026 Fisher, 1981, The lagrangian relaxation method for solving integer programming problems, Manage. Sci., 27, 1, 10.1287/mnsc.27.1.1 Frey, 2007, Comparing real-world fuel consumption for diesel-and hydrogen-fueled transit buses and implication for emissions, Transp. Res. Part D: Transp. Environ., 12, 281, 10.1016/j.trd.2007.03.003 Gao, 2019, Energy-saving operation approaches for urban rail transit systems, Front. Eng. Manag., 6, 139, 10.1007/s42524-019-0030-7 Golden, 1981, Capacitated arc routing problems, Networks, 11, 305, 10.1002/net.3230110308 Held, 1974, Validation of subgradient optimization, Math. Program., 6, 62, 10.1007/BF01580223 Hertz, 2001, A variable neighborhood descent algorithm for the undirected capacitated arc routing problem, Transp. Sci., 35, 425, 10.1287/trsc.35.4.425.10431 Hertz, 2000, A tabu search heuristic for the capacitated arc routing problem, Oper. Res., 48, 129, 10.1287/opre.48.1.129.12455 Krushinsky, 2015, An approach to the asymmetric multi-depot capacitated arc routing problem, Eur. J. Oper. Res., 244, 100, 10.1016/j.ejor.2015.01.005 Laporte, 2010, An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands, Transp. Sci., 44, 125, 10.1287/trsc.1090.0290 Longo, 2006, Solving capacitated arc routing problems using a transformation to the CVRP, Comput. Oper. Res., 33, 1823, 10.1016/j.cor.2004.11.020 Luo, 2017, Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost, Transp. Sci., 51, 668, 10.1287/trsc.2015.0666 Magnanti, 1981, Accelerating benders decomposition: algorithmic enhancement and model selection criteria, Oper. Res., 29, 464, 10.1287/opre.29.3.464 Mercier, 2005, A computational study of benders decomposition for the integrated aircraft routing and crew scheduling problem, Comput. Oper. Res., 32, 1451, 10.1016/j.cor.2003.11.013 Özener, 2011, Lane-exchange mechanisms for truckload carrier collaboration, Transp. Sci., 45, 1, 10.1287/trsc.1100.0327 Papadakos, 2008, Practical enhancements to the magnanti–wong method, Oper. Res. Lett., 36, 444, 10.1016/j.orl.2008.01.005 Pitney Bowes Inc., 2018. Pitney bowes parcel shipping index. https://www.pitneybowes.com/content/dam/pitneybowes/us/en/shipping-index/pitney-bowes-shipping-index-release-08-23-18.pdf (accessed on December 2018). Santos, 2010, An improved ant colony optimization based algorithm for the capacitated arc routing problem, Transp. Res. Part B: Methodol., 44, 246, 10.1016/j.trb.2009.07.004 Wolsey, 1998 Xiao, 2012, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Comput. Oper. Res., 39, 1419, 10.1016/j.cor.2011.08.013 Zhang, 2012, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, Eur. J. Oper. Res., 220, 295, 10.1016/j.ejor.2012.01.035