1QURESHI A G, TANIGUCHI E, YAMADA T. An exact solution approach for vehicle routing and scheduling problems with soft time windows [J].Transportation esearch, 2009,45(6):960-977.
2MATTHEW G,KEPAPTSOGLOU K.Containership routing with time deadlines and simultaneous deliceries and pick-ups[J].Transportation Research Part E,2009,45(1):210-221.
3LAPORTE G,LOUVEAUX F,MERCURE H.The vehicle routing problem with stochastic travel times[J].Transportation Science,1992,26(3):161-170.
4GENDREAU M,LAPORTE G,SEGUIN R.Stochastic vehicle routing[J].European Journal of Operational Research,1996,88(1):3-12.
5TATARAKIS A,MINIS I.Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns[J].European Journal of Operational Research,2009,197(2):557-571.
6TSIRIMPAS P,TATARAKIS A,MINIS I.Single vehicle routing with a predefined customer sequence and multiple depot returns[J].European Journal of Operational Research,2008,187(2):483-495.
7TEODOROVIC D,PAVKOVIC G.A simulated annealing technique approach to the vehicle routing in the case of stochastic demand[J].Transportation Planning and Technology,1992,16(4):261-273.
8JG Klincewicz,MB Rosenwein. Planning and consolidating shipments from a warehouse[J].Journal of the Operational Research Society,1997 ;48:241～246.
9GG Brown,D Ronen. Consolidation of customer orders into truckloads at a large manufacturer[J].Journal of the Operational Research Soci ety, 1997 ;48: 779～785.
10Dempe S. Foundations of Bilevel of Programming [ M ]. Volume 61 of Nonconvex optimization and its application Boston: Kluwer Academic Publisher, 2002.
