• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    A GA approach to vehicle routing problem with time windows considering loading constraints①

    2017-03-28 09:49:15LiuJiansheng劉建勝LuoZhiwenDuanDuanzhiLaiZhihuiHuangJiali
    High Technology Letters 2017年1期

    Liu Jiansheng (劉建勝), Luo Zhiwen, Duan Duanzhi, Lai Zhihui, Huang Jiali

    (*School of Mechanical and Electronic Engineering, Nanchang University, Nanchang 330031, P.R.China) (**School of Management, Shandong University, Jinan 250100, P.R.China)

    A GA approach to vehicle routing problem with time windows considering loading constraints①

    Liu Jiansheng (劉建勝)*, Luo Zhiwen*, Duan Duanzhi②*, Lai Zhihui*, Huang Jiali**

    (*School of Mechanical and Electronic Engineering, Nanchang University, Nanchang 330031, P.R.China) (**School of Management, Shandong University, Jinan 250100, P.R.China)

    As a new variant of vehicle routing problem (VRP), a finished vehicle routing problem with time windows in finished vehicle logistics (FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with the objective of scheduling multiple transport routes considering loading constraints along with time penalty function to minimize the total cost. Then a genetic algorithm (GA) is developed. The specific encoding and genetic operators for FVRPTW are devised. Especially, in order to accelerate its convergence, an improved termination condition is given. Finally, a case study is used to evaluate the effectiveness of the proposed algorithm and a series of experiments are conducted over a set of finished vehicle routing problems. The results demonstrate that the proposed approach has superior performance and satisfies users in practice. Contributions of the study are the modeling and solving of a complex FVRPTW in logistics industry.

    finished vehicle logistics (FVL), vehicle routing problem (VRP), genetic algorithm (GA), time windows

    0 Introduction

    The automobile industry plays an important role in the world economy. According to statistical data from the Chinese Association of Automobile Manufacturers (http://www.caam.org.cn), 24.5 million vehicles were produced and 24.6 million vehicles were sold in China in 2015. Every year finished vehicles are transported from manufacturers to dealers in China. Finished vehicle logistics (FVL) has become a key component of the automobile industry, which can be characterized as follows: the dealers’ orders of finished vehicles are from manufacturers, and then some finished vehicle logistics companies are assigned to transport these finished vehicles. Vehicle loading and routing schedules consider packing feasibility and routing cost. As a variant of the vehicle routing problem (VRP), the finished vehicle routing problem (FVRP) is a practical routing problem with some constraints. Different from the traditional VRP, both the finished vehicles and transport vehicles are irregular three-dimensional shapes considered as geometry constraints. Especially, dealers pay more attention to knowing if the ordered vehicles would be arrived in time, which leads to that time window constraint with penalty function becomes an important factor in FVRP. To the best of our knowledge there are considerable researches reported on VRP. However there is a little published research on FVRP. In practice, FVRP is done by a scheduler’s experience or through simple heuristics. However, some factors involved make it difficult to be achieved by personal experience or simple heuristics. Meanwhile, increasing industry competition makes the problem more challenging. This research contributes to this complex problem by a practical solution in FVL.

    1 Problem overview

    The basic FVRP consists of known customers that require a number of finished vehicles to be delivered. Transport vehicles dispatched from a main depot must deliver all the ordered finished vehicles, and then return to the original depot. Each transport vehicle can carry a limited weight, and be only allowed to visit each customer one time. The objective is to find a set of vehicle routes satisfying these demands with minimal total cost. In practice, this is often taken to be equivalent to minimizing both the number of transport vehicles and their total distance.

    Here the optimized solution is to select ordered finished vehicles to load and the transport vehicles into which to load them, and determine a set of routes satisfying all customers within given time. Otherwise, there will be a penalty, such as delay fee. The problem is called finished vehicle routing problems with time windows constraint (FVRPTW).

    (1)

    s.t.

    where m: The number of transport vehicles

    Cj: Transport cost of transport vehicle j

    Tj: Time cost of transport vehicle j

    (1) Weight limitation: It is assumed that any type of finished vehicles can be loaded in any type of transport vehicles. For the same reason, any type of transport vehicles can transport any kind of finished vehicles. However, the loading weight capacity of each fleet vehicle is limited. The total loaded weight of all finished vehicles must not exceed an upper limit of the loading weight capacity of the selected transport vehicles.

    (2) Volume limitation: The same with the weight constraint above, the total volume of all the loaded finished vehicles cannot exceed the total allowed volume of the transport vehicles. Different from the traditional VRP, both the shape of the finished vehicles and the loading space of the transport vehicle are irregular, the volume constraint is specified as a 3D constraint, including length constraint, width constraint and height constraint.

    (3) Order splitting rule: Small scale orders must not be split and only be serviced by one transport vehicle in order to minimize the routing cost. However, large scale orders can be split among multiple transport vehicles if their transport tasks exceed the limit of any transport vehicle. After fully loaded by several transport vehicles, the remained small tasks of the large scale orders are still required to be delivered by only one vehicle.

    (4) Time windows: It is assumed that each transport vehicle moves at a constant speed, and each customer has a requirement to delivery time. If the transport vehicle arrives early, it must wait or may incur an early fee. Conversely, if the transport vehicle arrives late, it will incur a delay fee.

    (5) Loading sequence: When a customer is visited, it should be possibly easy to unload. The finished vehicles of customers earlier on the route should be placed close to the rear of the transport vehicle. This is similar to LIFO.

    2 Literature review

    2.1 VRP problem

    As a variant of VRP, when the loaded finished vehicle is the same style, that is the length is equal or almost equal, it can be determined by bin packing approaches (Hopper & Turton[1]; Lesh, et al.[2]; Fuellerer, et al.[3]; Leung, et al.[4]; Hu, et al.[5]). When the sizes of the finished vehicles vary widely but the loading spaces of transport vehicles are regular, 3D bin packing algorithms can be applied (Pisinger & Sigurd[6]; Tarantilis, et al.[7]; Bortfeldt[8]).When both the shape of finished vehicles and the spaces of transport vehicles are regular, many useful research results are available (Iori, et al.[9]; Gendreau, et al.[10]; Moura and Oliveira[11]; Zachariadis, et al.[12]; Lai, et al.[13]; Vidal, et al.[14]).

    Different from traditional VRP, both the shape of the finished vehicles and loading space of the transport vehicles are irregular, which leads to more complex constraints in FVRPTW.

    2.2 FVRP problem

    As a pioneering study on operations optimization and management of FVL, Holweg and Miemczyk[15]assessed whether an FVL system could support a “build-to order” business. Mattfeld & Kopfer[16]developed an automated planning and scheduling system to support operations to transport finished vehicles from a transshipment hub by integrating the manpower planning and inventory control using a hierarchical approach. Wu[17]analyzed the development trend of FVL in China and a strategy of resource integration was put forward. Jing[18]analyzed why the finished vehicle logistics costs in China were high and discussed how to lower the costs. Kim, et al.[19]presented an approach for RFID-enabled finished vehicle deployment planning at a shipping yard. Hu[5]addressed the finished vehicle transporter routing problem and designed an evolutionary algorithm to solve medium and large scale problems. However the time window constraint was not considered.

    In conclusion, there are not existing methodologies that can be directly used to solve the problem without substantial modification. To the best of our knowledge, this is exploratory research work to consider both time windows and penalty factors in FVRP. Furthermore, FVRPTW is NP-hard since it can be reduced to the general VRP which is a well-known NP-hard problem (Tasan & Gen[20]), and a small FVRPTW could create significant complexity, calling for substantial amount of time to solve. Therefore, an enhanced genetic algorithm is developed to solve the problem.

    3 Solution modeling

    In the model, all known customers are supplied from a main depot. Only one transport vehicle is allowed to supply each customer in the time windows [et, lt]. Moreover, any transport vehicle is subject to a loading weight limit Gi, loading length Li, and height Hi. The optimization is to determine a set of routes satisfying all customer orders at minimal cost by a fleet of transport vehicles for a given time interval. Here assumptions are as follows:

    (1) Every customer can be serviced only one time by one transport vehicle, and then the transport vehicle will return to the original depot.

    (2) A linear relationship exists between vehicle travel cost and distance.

    (3) Each customer’s order must be delivered by only one vehicle.

    (4) In order to minimize the inconvenience of goods receipts and customers’ service cost, no customer’s order can be split.

    (5) There are enough available transport vehicles. The number of transport vehicles is expected to be minimized since the upfront cost of a transport vehicle is assumed to be very large.

    (6) All customers should be served within given time, otherwise, an early/delay fee is imposed.

    Let customer cibe supplied with different types of finished vehicles with quantity, weight, length, width and so on. The optimization model of the FVRPTW is proposed as follows:

    F=min(F1+F2+F3)

    (2)

    (3)

    (4)

    (5)

    s.t.

    (6)

    (7)

    (8)

    (9)

    (10)

    eti

    (11)

    (12)

    (13)

    (14)

    (15)

    Notation:

    M: The number of transport vehicles

    cij: The cost from customer i to customer j

    Pe(t): Early penalty factor

    Pl(t): Late penalty factor

    tj: The actual time of the transport vehicle arriving to node j

    [etj, ltj]: The time windows of the transport vehicle arriving to node j

    gi: The total weight of finished vehicle at the node i

    Gk: Standard loading weight of vehicle k

    li: The total length of finished vehicle at the node i

    Lk: Standard loading length of vehicle k

    Objective Eq.(2) minimizes the total cost. Constraint (6) is the weight limitation of the transport vehicle. Constraint (7) is the length limitation of the transport vehicle. Constraint (8) ensures that only one transport vehicle is allowed to supply each customer. Constraint (9) limits that only one transport vehicle is allowed to visit one customer. Constraint (10) limits that only one transport vehicle is allowed to leave one customer. Constraint (11) enforces every customer’s order must be serviced in given time. Constraint (12) and Constraint (13) ensure the transport vehicle starts and returns to the main depot. Constraint (14) and Constraint (15) limit the value range.

    4 Proposed algorithm

    Genetic algorithms (GA) have been used for VRP incorporating time windows (Baker & Ayechew[21]). In this work, a GA algorithm is devised for this complex problem.

    1) Encoding

    Encoding is to convert the vehicle routes into the chromosome. In detail, the string of the customers in N=(1, 2,…, n) is used as chromosome for encoding, in which each gene represents a customer and their sequence represents the vehicle routing. Because there exist some constraints of the transport vehicle, such as total loading weight limit, 3D size limit, time windows and so on, and the transport vehicles must return back to the main depot, it is needed to insert ‘0’ into the customer’s sequence when the fitness value is evaluated and ‘0’ represents the main depot. For example, the sequence (0,1,2,3,0) means that the transport vehicle starts from the main depot and visits customer 1, customer 2, and customer 3 sequentially and then returns back to the main depot. So each ‘0’ in the string shows there are multiple transport vehicles and routes. For example, the chromosome “012308760” represents two routing. The first routing is 0-1-2-3-0, and the second routing is 0-8-7-6-0.

    2) Initialization

    Initial population is the origin of genetic algorithm, and its composition structure has a great impact on the consequence of its evolution. All finished vehicles in each customer’s order are assigned to the first transport vehicle according to chromosome sequence. When the maximum loading weight is greater than the sum weight of a1, a2,……, ai, and less than the sum weight of a1, a2, …, ai, ai+1, the substring “a1, a2, …, ai” is attained to represent the customers served by the first transport vehicle. The customers (a1, a2,…, ai) served by the first vehicle will no longer be considered. Start with the Noi+1customer. Repeating as above, the No.2 substring (ai+1, ai+2, …, ai+m) can also be attained for the second vehicle. Finally, all finished vehicles are loaded into the transport vehicles. By the way the initial chromosome can be gained continually until the number of chromosome equals to the scale s of initial population.

    3) Fitness function

    The objective is to minimize the total cost over multiple routes. So the total cost is directly taken as the fitness function. Because there are additional constraints, including time windows, loading weight and penalty factors, the fitness function is adjusted.

    For the time windows constraint, if it is a hard time window problem, when arrival time is not in the given time window, the value of fitness function is set as ∞ (death penalty). If it is a soft time windows problem, the delay is allowed and penalized.

    4) Selection operator

    The top twenty percent of the population is double duplicated to the next generation. The middle sixty percent of the population is copied to the next generation. And the last twenty percent is abandoned.

    5) Crossover operator

    Offspring is produced from the parent solutions using a standard crossover procedure with point crossover, in which one point in the chromosome is chosen randomly. One offspring consists of the gene values from the second parent gene which are to the right of the point along with the gene values from the first parent gene. And then the duplicated existing members of the population are discarded. The crossover method is as follows:

    A=1 2 3 4 5 6 7|8 9 10 11 12 13 14 15

    B=15 14 13 12 11 10 9|8 7 6 5 4 3 2 1

    First, move all the number after the crossover number ‘8’ in B to the front of A, and then A is:

    A=8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

    Second, because one customer can only be served by one transport vehicle, the gene number must not be repeated in chromosome coding. Then the repetition number in A should be discarded, that is ‘1 2 3 4 5 6 7 8’,and then A is:

    A=8 7 6 5 4 3 2 1 9 10 11 12 13 14 15

    The same with A, B is:

    B=8 9 10 11 12 13 14 15 7 6 5 4 3 2 1

    6) Mutation operator

    Mutation operator is realized by swapping position randomly. For example, 10 and 4 are swapped:

    A=1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

    Then it will turn to be as follows after random exchanging position.

    A=1 2 3 10 5 6 7 8 9 4 11 12 13 14 15

    7) Improved termination condition

    In general, the termination condition is the maximum iteration time. Here a new termination is provided, that is the algorithm will be terminated after the same optimization result is repeated twenty times. To prevent the next generation being worse than parent generation, the optimal individual strategy can be adopted, which is to keep the parent generation with the best value of fitness function to the next generation. By the way the search process is on the way to the optimal solution. Moreover, two convergence rules are adopted, total evolutionary times and the optimization results are the same for many times. When each convergence rule is satisfied, it will be thought convergence. It will save much calculation time by two convergence rules.

    5 Computational experience

    The presented algorithm is coded in Matlab R2010b and tested on a PC with an Intel 3.7 GHz processor, 4.00 GB RAM, and the Microsoft Windows 7 operating system. To our knowledge, there are no instances publicly available, and therefore a real situation in China is given to illustrate the approach.

    The finished vehicles and available transport vehicle are listed in Tables 1 and 2. Here, let the loading weight of the transport vehicles be 30t, and the transport cost be 5RMB/km, and the transport velocity (v) be 50km/h. Let the main depot be located at the coordinate point (92, 51). Fourteen orders from the depot to dealers are listed in Table 3. Each order includes ordered finished vehicles, the customer’s coordinates, and time windows.

    Table 1 Finished vehicle information

    Table 2 Transport vehicle information

    Table 3 Customer orders information

    If an early or delay arrival is allowed (soft time windows) and Constraint (11) is inactive, an additional penalty fee will be created, which will be calculated into the total cost. In this case, penalty factors (Pe(t), Pl(t)) both are 400 RMB/h. Here initial population size is 100, the iteration time is 300, crossover rate is 0.7 and the mutation rate is 0.1. Then the total minimum routing cost is 4665 RMB and total run time is about 2s. There are four routing schedules, which are shown in Table 4.

    If all transport vehicles must arrive in time (hard time windows), no delay is allowed. Then there are still four routing schedules, while the total minimum routing cost is 4750 RMB. Compared with soft time window, the No.1 route, No.3 route and No.4 route are the same; however the difference is No.2 route, shown in Table 5.

    In Table 4, there is a penalty cost of the No.2 route. In order to avoid the penalty, the No.2 route changes its routing schedule in Table 5 (hard time windows). It is clear that this is early penalty, so the improved routing schedule in hard time windows has more distance to avoid early arrival penalty. In this early arrival case, the number of transport vehicle is the same between soft time windows and hard time windows. But, if it is a delay penalty, maybe another transport vehicle should be added to avoid delay penalty and minimize the total cost in hard time times. In the case above, it seems there is only a little cost difference between soft time windows and hard time windows. In fact the cost difference depends on many factors, such as Cej, Pe(t), Pl(t), v and so on. It will vary with the values of these factors. It is possible that there are a large difference between hard time windows and soft time windows. If the penalty cost turns larger, it will be considered to add another transport vehicle to avoid the large penalty cost. Every finished vehicle logistics company can set these factors according to their practice and decide which solution is better.

    Table 4 The optimization vehicle routing results (soft time windows)

    Table 5 The optimization vehicle routing results (hard time windows)

    In order to fully evaluate the proposed algorithm, more experiments are conducted. As the problem size increases, the computational time of the GA algorithm is modest and can work well in practice. In Table 6, there are 100 orders. After a series of tests, the control parameters for the algorithm are set. The population size is 100, crossover probability is 0.7, and mutation probability is 0.2. After 1000 iteration times, the computation results with soft time windows are shown as Fig.1. There are 18 routes and the total minimum routing cost is 20120RMB, shown as follows.

    Table 6 Customer orders information

    Fig.1 The optimization routes of soft time windows with penalty

    The No. 1 Route: 0→70→40→88→67→30→83→0

    The No. 2 Route: 0→27→13→55→95→18→74→68→29→0

    The No. 3 Route: 0→46→16→2→58→86→72→0

    The No. 4 Route: 0→7→36→22→50→66→0

    The No. 5 Route: 0→19→42→28→14→17→3→0

    The No. 6 Route: 0→47→26→12→51→93→9→0

    The No. 7 Route: 0→82→90→76→39→11→53→0

    The No. 8 Route: 0→48→34→6→25→81→0

    The No. 9 Route: 0→33→78→31→37→23→0

    The No. 10 Route: 0→5→73→38→80→52→0

    The No. 11 Route: 0→20→32→4→62→60→44→0

    The No. 12 Route: 0→41→49→35→77→69→100→0

    The No. 13 Route: 0→98→61→59→65→79→0

    The No. 14 Route: 0→89→84→57→1→96→0

    The No. 15 Route: 0→91→45→87→43→99→85→0

    The No. 16 Route: 0→97→63→21→94→10→0

    The No. 17 Route: 0→54→56→75→71→15→0

    The No. 18 Route: 0→92→64→8→24→0

    6 Conclusion

    This study addresses a real transportation problem in finished vehicle logistics, and develops a finished vehicle routing model by considering not only the minimum routing cost but also the time windows with penalty function. To test the validity of the proposed genetic algorithm, an example is conducted. From the view of a practical contribution, a method with high performance is developed to simultaneously consider total routing cost of the vehicle fleet, specified geometry restrictions on transport vehicle availability, time windows and penalty function. Moreover, the cost difference depending on penalty factors, transport cost, and transport velocity is compared. In fact maybe there are relative relationships among these parameters. In the future building experience formulation based on these factors will be focused in the finished vehicle routing problem, and schedulers will benefit from it. Other optimization algorithms will be exploved to solve the FVLTW problem, meanwhile the random traffic jam will be considered.

    [1] Hopper E, Turton B C H. An empirical study of meta-heuristics applied to 2D rectangular bin packing. Communications of the Acm, 2002, 35(8):66-80

    [2] Lesh N, Marks J, McMahon A, et al. Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters, 2004, 90(1): 7-14

    [3] Fuellerer G, Doerner K F, Hartl R F, et al. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers and Operations Research, 2009, 36(3): 655-673

    [4] Leung S C H, Zhou X, Zhang D, et al. Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers and Operations Research, 2011, 38(1):205-215

    [5] Hu Q, Lim A, Zhu, W. The two-dimensional vector packing problem with piecewise linear cost function. Omega, 2014,50: 43-53

    [6] Pisinger D, Sigurd M. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization, 2005,2(2):154-167

    [7] Tarantilis C D, Zachariadis E E, Kiranoudis C T. A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems, 2009, 10(2):255-271

    [8] Bortfeldt A. A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Computers and Operations Research, 2012,39(9): 2248-2257

    [9] Iori M, Salazar-González J J, Vigo D. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science, 2007,41(2): 253-264

    [10] Gendreau M, Iori M, Laporte G, et al. A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks, 2008, 51(1):4-18

    [11] Moura A, Oliveira J F. An integrated approach to the vehicle routing and container loading problems. OR Spectrum, 2009,31(4): 775-800

    [12] Zachariadis E E, Tarantilis C D, Kiranoudis C T. A guided tabu search for the vehicle routing problem with two dimensional loading constraints. European Journal of Operational Research, 2009, 195(3): 729-743

    [13] Lai M, Tong X. A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search. Journal of Industrial & Management Optimization, 2012,8(2):469-484

    [14] Vidal T, Crainic T G, Gendreau M, et al. Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 2013, 231(1):1-21

    [15] Holweg M, Miemczyk J. Logistics in the “three-day car” age: Assessing the responsiveness of vehicle distribution logistics in the UK. International Journal of Physical Distribution and Logistics Management, 2002,32(10):829-850

    [16] Mattfeld D C, Kopfer H. Terminal operations management in vehicle transshipment. Transportation Research Part A: Policy and Practice, 2003, 37(5): 435-452

    [17] Wu B F, Liu Z Y. A study on finished vehicle logistics in China: Its development trend and resource integration. Automotive Engineering, 2005, 27(3):367-371

    [18] Jing L I, Zhang B X. Study on the cause and countermeasures of high-cost finished vehicle logistics in China. Logistics Technology, 2007, 8: 015

    [19] Kim J, Ok C S, Kumara S, et al. Amarket-based approach for dynamic vehicle deployment planning using radio frequency identification (RFID) information. International Journal of Production Economics, 2010,128(1):235-247

    [20] Tasan A S, Gen M. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering, 2012, 62(3): 755-761

    [21] Baker B M, Ayechew M A. A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 2003,30(5):787-800

    Liu Jiansheng, born in 1978. He received his Ph.D degree from Nanchang University in 2009.He studied in Auburn University in USA as a visiting scholar granted by Chinese Scholarship Council. His research interests focus on digital & intelligent manufacturing, facility layout and logistics management and optimization.

    10.3772/j.issn.1006-6748.2017.01.008

    ②To whom correspondence should be addressed. E-mail: dzduan@163.com Received on Sep. 20, 2016

    ①Supported by the National Natural Science Foundation of China (No. 51565036).

    videos熟女内射| 日韩伦理黄色片| 欧美中文综合在线视频| 不卡av一区二区三区| 晚上一个人看的免费电影| 国产不卡av网站在线观看| 国产免费福利视频在线观看| 一本—道久久a久久精品蜜桃钙片| 丁香六月欧美| 日韩制服丝袜自拍偷拍| 国产一区二区激情短视频 | 99精品久久久久人妻精品| 国产激情久久老熟女| netflix在线观看网站| 在线亚洲精品国产二区图片欧美| 亚洲av美国av| 两性夫妻黄色片| 欧美中文综合在线视频| 老鸭窝网址在线观看| 少妇人妻 视频| 亚洲精品久久午夜乱码| 国产高清视频在线播放一区 | 一区二区三区精品91| 又粗又硬又长又爽又黄的视频| 亚洲欧美一区二区三区久久| 丝袜喷水一区| 少妇裸体淫交视频免费看高清 | 色综合欧美亚洲国产小说| 黄色毛片三级朝国网站| 久久精品国产a三级三级三级| 国产在线视频一区二区| 女警被强在线播放| 久久精品国产综合久久久| 天天躁夜夜躁狠狠躁躁| 天天添夜夜摸| 日韩大片免费观看网站| 在线 av 中文字幕| 成人午夜精彩视频在线观看| 十八禁人妻一区二区| 国产精品欧美亚洲77777| 久久精品亚洲熟妇少妇任你| 国产在线观看jvid| av网站免费在线观看视频| 大码成人一级视频| 午夜福利影视在线免费观看| 美女午夜性视频免费| 久久人妻熟女aⅴ| 桃花免费在线播放| 五月天丁香电影| 国产精品麻豆人妻色哟哟久久| 成人亚洲欧美一区二区av| 亚洲欧洲国产日韩| 91精品国产国语对白视频| 国产高清视频在线播放一区 | 亚洲欧美成人综合另类久久久| xxxhd国产人妻xxx| 另类精品久久| 国产免费现黄频在线看| 一本—道久久a久久精品蜜桃钙片| 一级毛片我不卡| 国产福利在线免费观看视频| 菩萨蛮人人尽说江南好唐韦庄| 黄色毛片三级朝国网站| 亚洲欧美色中文字幕在线| 一级毛片黄色毛片免费观看视频| 国产精品三级大全| 在线观看www视频免费| 国产伦理片在线播放av一区| 在线观看免费午夜福利视频| 脱女人内裤的视频| 国产亚洲av片在线观看秒播厂| 久久国产精品大桥未久av| 别揉我奶头~嗯~啊~动态视频 | 国产精品久久久久久精品古装| 久久av网站| 免费人妻精品一区二区三区视频| 啦啦啦中文免费视频观看日本| 老汉色∧v一级毛片| 精品少妇黑人巨大在线播放| 亚洲av成人精品一二三区| 国产免费视频播放在线视频| av在线老鸭窝| 久久99一区二区三区| 中文精品一卡2卡3卡4更新| 老司机影院成人| 天天影视国产精品| 亚洲精品久久久久久婷婷小说| av天堂久久9| 国产无遮挡羞羞视频在线观看| 国产成人一区二区在线| 日本一区二区免费在线视频| 中文字幕精品免费在线观看视频| 午夜福利一区二区在线看| 久久天躁狠狠躁夜夜2o2o | 成人免费观看视频高清| 精品久久蜜臀av无| 又紧又爽又黄一区二区| 亚洲国产日韩一区二区| e午夜精品久久久久久久| 不卡av一区二区三区| 亚洲精品久久成人aⅴ小说| 美女大奶头黄色视频| 欧美另类一区| 欧美日韩亚洲高清精品| 叶爱在线成人免费视频播放| 美女扒开内裤让男人捅视频| 久热爱精品视频在线9| kizo精华| 国产欧美日韩综合在线一区二区| 亚洲自偷自拍图片 自拍| 搡老岳熟女国产| 天天操日日干夜夜撸| 国产亚洲欧美精品永久| 啦啦啦啦在线视频资源| 99国产综合亚洲精品| 少妇的丰满在线观看| 亚洲国产精品合色在线| 天堂动漫精品| 国产成人av教育| 久久久久免费精品人妻一区二区 | 久久久精品国产亚洲av高清涩受| 国产精品亚洲美女久久久| 韩国精品一区二区三区| 少妇裸体淫交视频免费看高清 | 可以在线观看毛片的网站| 男人舔女人的私密视频| 国产成人精品无人区| 国内久久婷婷六月综合欲色啪| 熟女电影av网| videosex国产| 亚洲国产中文字幕在线视频| 国产成人欧美| 黄频高清免费视频| 久久伊人香网站| 日韩中文字幕欧美一区二区| 一个人免费在线观看的高清视频| 国产精品 欧美亚洲| 亚洲熟女毛片儿| 亚洲熟妇熟女久久| 欧美另类亚洲清纯唯美| ponron亚洲| 中文字幕另类日韩欧美亚洲嫩草| 高清在线国产一区| 成人国产一区最新在线观看| 夜夜爽天天搞| www.自偷自拍.com| 欧美激情 高清一区二区三区| 国产色视频综合| 日日摸夜夜添夜夜添小说| av中文乱码字幕在线| 亚洲精品中文字幕一二三四区| 国产成人啪精品午夜网站| 黄网站色视频无遮挡免费观看| 哪里可以看免费的av片| 亚洲成a人片在线一区二区| 岛国在线观看网站| 黄色女人牲交| 精品欧美国产一区二区三| 国产成人精品久久二区二区免费| 久久国产乱子伦精品免费另类| 午夜亚洲福利在线播放| 国产在线精品亚洲第一网站| 日韩欧美国产一区二区入口| 欧美zozozo另类| 最近最新中文字幕大全电影3 | 一区二区三区精品91| 成人精品一区二区免费| 亚洲第一av免费看| 欧美色视频一区免费| 国产成+人综合+亚洲专区| 国产主播在线观看一区二区| 亚洲人成伊人成综合网2020| 亚洲三区欧美一区| 久久久精品欧美日韩精品| 欧美另类亚洲清纯唯美| 日韩欧美国产一区二区入口| 一区二区三区精品91| 色播在线永久视频| 国产91精品成人一区二区三区| 黄色片一级片一级黄色片| 不卡av一区二区三区| 欧美黄色片欧美黄色片| 成年女人毛片免费观看观看9| 麻豆成人av在线观看| 亚洲熟妇熟女久久| 午夜福利成人在线免费观看| www.自偷自拍.com| 国产精华一区二区三区| 欧美性长视频在线观看| 在线天堂中文资源库| 国产精品亚洲av一区麻豆| 一级黄色大片毛片| 18禁美女被吸乳视频| 国产在线精品亚洲第一网站| 国产又色又爽无遮挡免费看| 国内精品久久久久久久电影| 日韩中文字幕欧美一区二区| av视频在线观看入口| 免费观看精品视频网站| 国产高清激情床上av| 国产精品亚洲美女久久久| 在线永久观看黄色视频| 国产精品亚洲av一区麻豆| 精品国产亚洲在线| 亚洲一码二码三码区别大吗| 欧美最黄视频在线播放免费| 国产主播在线观看一区二区| 久久久久久亚洲精品国产蜜桃av| 国内少妇人妻偷人精品xxx网站 | 欧美性猛交╳xxx乱大交人| 欧美中文综合在线视频| 亚洲自拍偷在线| 桃红色精品国产亚洲av| 手机成人av网站| 亚洲成av片中文字幕在线观看| 久久精品国产99精品国产亚洲性色| 久久久久国产精品人妻aⅴ院| 国产精品二区激情视频| 国产成人啪精品午夜网站| 99久久久亚洲精品蜜臀av| 一夜夜www| 午夜免费鲁丝| 午夜影院日韩av| 99久久无色码亚洲精品果冻| 成人永久免费在线观看视频| 亚洲男人天堂网一区| e午夜精品久久久久久久| 中文亚洲av片在线观看爽| 成在线人永久免费视频| 国产精品野战在线观看| 亚洲精品色激情综合| 国产成人欧美在线观看| 亚洲精品在线美女| 欧美黑人巨大hd| 男男h啪啪无遮挡| 久久99热这里只有精品18| 无人区码免费观看不卡| 国产精品亚洲一级av第二区| 欧美成人性av电影在线观看| 免费在线观看日本一区| 免费av毛片视频| 亚洲欧美激情综合另类| 丝袜在线中文字幕| 嫁个100分男人电影在线观看| 91在线观看av| 变态另类丝袜制服| 91大片在线观看| 午夜影院日韩av| 99在线视频只有这里精品首页| 欧美国产精品va在线观看不卡| 哪里可以看免费的av片| 亚洲在线自拍视频| 国产免费av片在线观看野外av| 两人在一起打扑克的视频| 日本黄色视频三级网站网址| 亚洲av熟女| 国产成人精品久久二区二区免费| 在线天堂中文资源库| 亚洲第一电影网av| 国产在线观看jvid| 两人在一起打扑克的视频| 999久久久精品免费观看国产| 亚洲aⅴ乱码一区二区在线播放 | 亚洲国产精品sss在线观看| 国产熟女午夜一区二区三区| 亚洲三区欧美一区| 久久精品成人免费网站| 日韩精品中文字幕看吧| 听说在线观看完整版免费高清| 制服人妻中文乱码| 男人舔女人下体高潮全视频| 精品午夜福利视频在线观看一区| 午夜福利在线在线| 操出白浆在线播放| 国产一区二区三区视频了| 亚洲七黄色美女视频| 99精品在免费线老司机午夜| 国产又色又爽无遮挡免费看| 亚洲第一欧美日韩一区二区三区| 欧美一区二区精品小视频在线| 18禁裸乳无遮挡免费网站照片 | 国产亚洲欧美在线一区二区| 制服人妻中文乱码| 两个人免费观看高清视频| 亚洲成a人片在线一区二区| 一区二区三区高清视频在线| 欧美乱妇无乱码| 少妇熟女aⅴ在线视频| 啦啦啦 在线观看视频| 国内久久婷婷六月综合欲色啪| 国产精品久久久av美女十八| 精品一区二区三区四区五区乱码| 亚洲国产高清在线一区二区三 | 精品久久久久久久人妻蜜臀av| 草草在线视频免费看| 亚洲人成伊人成综合网2020| 日韩欧美国产一区二区入口| 1024手机看黄色片| 亚洲中文字幕一区二区三区有码在线看 | 一区二区三区激情视频| 精品人妻1区二区| 免费看十八禁软件| 成人国产综合亚洲| 亚洲七黄色美女视频| 精品一区二区三区av网在线观看| 18禁国产床啪视频网站| 午夜成年电影在线免费观看| 久热这里只有精品99| 成年免费大片在线观看| 午夜免费成人在线视频| 亚洲成人久久爱视频| 午夜两性在线视频| 日本 欧美在线| 搞女人的毛片| 色综合站精品国产| 欧美最黄视频在线播放免费| 国产黄a三级三级三级人| 女人被狂操c到高潮| 少妇粗大呻吟视频| 最近在线观看免费完整版| 麻豆成人av在线观看| 51午夜福利影视在线观看| 99精品在免费线老司机午夜| 99热只有精品国产| 国产高清videossex| 久久人人精品亚洲av| 男人操女人黄网站| 色哟哟哟哟哟哟| 中亚洲国语对白在线视频| 亚洲国产日韩欧美精品在线观看 | 人人妻人人看人人澡| 一二三四社区在线视频社区8| 国产久久久一区二区三区| 国产男靠女视频免费网站| 亚洲色图 男人天堂 中文字幕| 国产黄片美女视频| 欧美黑人巨大hd| 欧美精品啪啪一区二区三区| 国产伦人伦偷精品视频| 老司机深夜福利视频在线观看| 露出奶头的视频| 国产在线精品亚洲第一网站| 亚洲男人天堂网一区| 国产aⅴ精品一区二区三区波| 日韩 欧美 亚洲 中文字幕| 久久久精品国产亚洲av高清涩受| 亚洲一区二区三区色噜噜| 91国产中文字幕| 亚洲一区中文字幕在线| 国产精品久久久久久人妻精品电影| 成人精品一区二区免费| 国产一区二区三区在线臀色熟女| 人人澡人人妻人| 两个人免费观看高清视频| 99热这里只有精品一区 | 日日摸夜夜添夜夜添小说| 黄片小视频在线播放| 精品久久久久久久久久久久久 | 美女 人体艺术 gogo| 日本黄色视频三级网站网址| 国产欧美日韩一区二区精品| 亚洲电影在线观看av| 色播亚洲综合网| 熟妇人妻久久中文字幕3abv| 极品教师在线免费播放| 色播在线永久视频| 极品教师在线免费播放| 欧美国产精品va在线观看不卡| 黄色视频,在线免费观看| 久久青草综合色| 亚洲精品美女久久av网站| 亚洲人成网站高清观看| 日韩 欧美 亚洲 中文字幕| 午夜福利成人在线免费观看| 国产又色又爽无遮挡免费看| 老司机福利观看| 亚洲欧美日韩无卡精品| 特大巨黑吊av在线直播 | 丰满人妻熟妇乱又伦精品不卡| 午夜a级毛片| 精品午夜福利视频在线观看一区| 国产又爽黄色视频| 特大巨黑吊av在线直播 | 午夜免费鲁丝| 国产午夜精品久久久久久| 国产精品电影一区二区三区| 一二三四社区在线视频社区8| 淫妇啪啪啪对白视频| 亚洲男人天堂网一区| 中文字幕最新亚洲高清| 一进一出好大好爽视频| 中文字幕最新亚洲高清| 久久精品影院6| 50天的宝宝边吃奶边哭怎么回事| 丁香六月欧美| 久久精品国产99精品国产亚洲性色| 丁香六月欧美| 精品人妻1区二区| 精品欧美国产一区二区三| 少妇熟女aⅴ在线视频| 国产免费av片在线观看野外av| 午夜精品在线福利| 国产亚洲精品av在线| 亚洲美女黄片视频| 1024视频免费在线观看| 精品第一国产精品| 久久欧美精品欧美久久欧美| 久久亚洲真实| 91九色精品人成在线观看| 99热只有精品国产| 特大巨黑吊av在线直播 | 久久中文字幕一级| 精品第一国产精品| www日本黄色视频网| 免费在线观看黄色视频的| 曰老女人黄片| 国产精品日韩av在线免费观看| 欧美成人免费av一区二区三区| 此物有八面人人有两片| a在线观看视频网站| 亚洲专区字幕在线| 成人免费观看视频高清| 人人澡人人妻人| 波多野结衣av一区二区av| 夜夜夜夜夜久久久久| 波多野结衣av一区二区av| 欧美成人免费av一区二区三区| 黄色女人牲交| 国产99久久九九免费精品| 国产黄a三级三级三级人| 男男h啪啪无遮挡| 精品国产乱码久久久久久男人| 在线十欧美十亚洲十日本专区| 99国产精品一区二区蜜桃av| 久热爱精品视频在线9| 免费看十八禁软件| 日本免费一区二区三区高清不卡| a在线观看视频网站| 一级黄色大片毛片| 真人一进一出gif抽搐免费| 日本免费一区二区三区高清不卡| 免费在线观看亚洲国产| 久久精品夜夜夜夜夜久久蜜豆 | 免费一级毛片在线播放高清视频| or卡值多少钱| 超碰成人久久| 久久精品91无色码中文字幕| 亚洲精品在线美女| 操出白浆在线播放| 精品久久久久久,| 国产久久久一区二区三区| 黄片小视频在线播放| 看片在线看免费视频| 欧美日韩亚洲综合一区二区三区_| 少妇熟女aⅴ在线视频| www.www免费av| 精品国产超薄肉色丝袜足j| 99在线视频只有这里精品首页| 成人国产一区最新在线观看| 首页视频小说图片口味搜索| 国产精品久久久久久精品电影 | 精品久久久久久久毛片微露脸| 91九色精品人成在线观看| 午夜亚洲福利在线播放| 一级黄色大片毛片| 黄色片一级片一级黄色片| 亚洲最大成人中文| www.www免费av| 一级a爱视频在线免费观看| 俺也久久电影网| 久久婷婷成人综合色麻豆| 18禁黄网站禁片午夜丰满| 亚洲真实伦在线观看| 老司机福利观看| 亚洲激情在线av| 99精品在免费线老司机午夜| 免费看美女性在线毛片视频| 欧美日韩精品网址| 制服诱惑二区| 好男人电影高清在线观看| x7x7x7水蜜桃| 一区福利在线观看| 一本精品99久久精品77| 亚洲精品粉嫩美女一区| 亚洲自偷自拍图片 自拍| 一个人观看的视频www高清免费观看 | 久久亚洲真实| 亚洲精品在线美女| 在线av久久热| 国产蜜桃级精品一区二区三区| 国内精品久久久久精免费| 日韩视频一区二区在线观看| 欧美性长视频在线观看| 大香蕉久久成人网| 欧美一区二区精品小视频在线| 欧美色欧美亚洲另类二区| 国产av一区二区精品久久| 精品一区二区三区av网在线观看| 极品教师在线免费播放| 久久香蕉精品热| av福利片在线| 18禁黄网站禁片免费观看直播| 国产片内射在线| 欧美激情极品国产一区二区三区| 一本大道久久a久久精品| 色精品久久人妻99蜜桃| 999久久久国产精品视频| 精品久久蜜臀av无| 免费高清视频大片| 免费在线观看视频国产中文字幕亚洲| 99riav亚洲国产免费| 好男人电影高清在线观看| 国产激情久久老熟女| 国产精品二区激情视频| 日韩国内少妇激情av| 欧美乱妇无乱码| 最好的美女福利视频网| 九色国产91popny在线| 国产精品爽爽va在线观看网站 | 久久久久久大精品| 日本熟妇午夜| 午夜精品久久久久久毛片777| 午夜影院日韩av| 久久国产精品人妻蜜桃| 精品久久久久久久毛片微露脸| 黄色成人免费大全| 一级作爱视频免费观看| 国产精品香港三级国产av潘金莲| 免费观看精品视频网站| 久久精品国产亚洲av高清一级| 欧美亚洲日本最大视频资源| 很黄的视频免费| 草草在线视频免费看| 怎么达到女性高潮| 女性生殖器流出的白浆| 在线观看66精品国产| 老司机午夜十八禁免费视频| 搡老岳熟女国产| 黄色a级毛片大全视频| 日韩欧美免费精品| 欧美成人午夜精品| 成人国语在线视频| 国产91精品成人一区二区三区| 精品卡一卡二卡四卡免费| 久久天躁狠狠躁夜夜2o2o| 久久久久久免费高清国产稀缺| 久久草成人影院| 91麻豆精品激情在线观看国产| 韩国av一区二区三区四区| 亚洲av熟女| 亚洲 欧美 日韩 在线 免费| 老司机午夜福利在线观看视频| 国产精品免费一区二区三区在线| 一本综合久久免费| 十八禁人妻一区二区| 女人高潮潮喷娇喘18禁视频| 欧美久久黑人一区二区| or卡值多少钱| 一边摸一边做爽爽视频免费| 国内精品久久久久久久电影| 一进一出好大好爽视频| 91九色精品人成在线观看| 俺也久久电影网| 亚洲美女黄片视频| 成人18禁高潮啪啪吃奶动态图| 亚洲av电影在线进入| 国语自产精品视频在线第100页| 亚洲一卡2卡3卡4卡5卡精品中文| 国产不卡一卡二| 精品一区二区三区av网在线观看| 亚洲一码二码三码区别大吗| 国产99白浆流出| 特大巨黑吊av在线直播 | 欧美乱色亚洲激情| 在线观看免费日韩欧美大片| 好男人电影高清在线观看| 熟女少妇亚洲综合色aaa.| 天堂动漫精品| 久久精品亚洲精品国产色婷小说| 麻豆成人午夜福利视频| 亚洲精品久久成人aⅴ小说| 亚洲午夜理论影院| 这个男人来自地球电影免费观看| 亚洲精品在线观看二区| 级片在线观看| or卡值多少钱| 亚洲一区二区三区色噜噜| 国产亚洲欧美精品永久| a级毛片a级免费在线| 亚洲色图av天堂| 别揉我奶头~嗯~啊~动态视频| 美女午夜性视频免费| 久久久久久久久中文| 一本久久中文字幕| 97人妻精品一区二区三区麻豆 | 宅男免费午夜| 欧美乱码精品一区二区三区| 国产亚洲av嫩草精品影院| 波多野结衣av一区二区av| 免费观看精品视频网站| 老鸭窝网址在线观看| 好男人电影高清在线观看| 欧美久久黑人一区二区| 两个人视频免费观看高清| 国产精品影院久久| 欧美大码av| 日本a在线网址| 天天躁夜夜躁狠狠躁躁| 亚洲天堂国产精品一区在线| 国产黄色小视频在线观看| 自线自在国产av| 级片在线观看| 国产成人精品久久二区二区91| 久久久久久九九精品二区国产 | 亚洲精品在线美女|