Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

合集下载

运筹学英汉词汇ABC

运筹学英汉词汇(0,1) normalized ――0-1规范化Aactivity ――工序additivity――可加性adjacency matrix――邻接矩阵adjacent――邻接aligned game――结盟对策analytic functional equation――分析函数方程approximation method――近似法arc ――弧artificial constraint technique ――人工约束法artificial variable――人工变量augmenting path――增广路avoid cycle method ――避圈法Bbackward algorithm――后向算法balanced transportation problem――产销平衡运输问题basic feasible solution ――基本可行解basic matrix――基阵basic solution ――基本解basic variable ――基变量basic ――基basis iteration ――换基迭代Bayes decision――贝叶斯决策big M method ――大M 法binary integer programming ――0-1整数规划binary operation――二元运算binary relation――二元关系binary tree――二元树binomial distribution――二项分布bipartite graph――二部图birth and death process――生灭过程Bland rule ――布兰德法则branch node――分支点branch――树枝bridge――桥busy period――忙期Ccapacity of system――系统容量capacity――容量Cartesian product――笛卡儿积chain――链characteristic function――特征函数chord――弦circuit――回路coalition structure――联盟结构coalition――联盟combination me――组合法complement of a graph――补图complement of a set――补集complementary of characteristic function――特征函数的互补性complementary slackness condition ――互补松弛条件complementary slackness property――互补松弛性complete bipartite graph――完全二部图complete graph――完全图completely undeterministic decision――完全不确定型决策complexity――计算复杂性congruence method――同余法connected component――连通分支connected graph――连通图connected graph――连通图constraint condition――约束条件constraint function ――约束函数constraint matrix――约束矩阵constraint method――约束法constraint ――约束continuous game――连续对策convex combination――凸组合convex polyhedron ――凸多面体convex set――凸集core――核心corner-point ――顶点（角点）cost coefficient――费用系数cost function――费用函数cost――费用criterion ; test number――检验数critical activity ――关键工序critical path method ――关键路径法（CMP ）critical path scheduling ――关键路径cross job ――交叉作业curse of dimensionality――维数灾customer resource――顾客源customer――顾客cut magnitude ――截量cut set ――截集cut vertex――割点cutting plane method ――割平面法cycle ――回路cycling ――循环Ddecision fork――决策结点decision maker决――策者decision process of unfixed step number――不定期决策过程decision process――决策过程decision space――决策空间decision variable――决策变量decision决－－策decomposition algorithm――分解算法degenerate basic feasible solution ――退化基本可行解degree――度demand――需求deterministic inventory model――确定贮存模型deterministic type decision――确定型决策diagram method ――图解法dictionary ordered method ――字典序法differential game――微分对策digraph――有向图directed graph――有向图directed tree――有向树disconnected graph――非连通图distance――距离domain――定义域dominate――优超domination of strategies――策略的优超关系domination――优超关系dominion――优超域dual graph――对偶图Dual problem――对偶问题dual simplex algorithm ――对偶单纯形算法dual simplex method――对偶单纯形法dummy activity――虚工序dynamic game――动态对策dynamic programming――动态规划Eearliest finish time――最早可能完工时间earliest start time――最早可能开工时间economic ordering quantity formula――经济定购批量公式edge ――边effective set――有效集efficient solution――有效解efficient variable――有效变量elementary circuit――初级回路elementary path――初级通路elementary ――初等的element――元素empty set――空集entering basic variable ――进基变量equally liability method――等可能性方法equilibrium point――平衡点equipment replacement problem――设备更新问题equipment replacing problem――设备更新问题equivalence relation――等价关系equivalence――等价Erlang distribution――爱尔朗分布Euler circuit――欧拉回路Euler formula――欧拉公式Euler graph――欧拉图Euler path――欧拉通路event――事项expected value criterion――期望值准则expected value of queue length――平均排队长expected value of sojourn time――平均逗留时间expected value of team length――平均队长expected value of waiting time――平均等待时间exponential distribution――指数分布external stability――外部稳定性Ffeasible basis ――可行基feasible flow――可行流feasible point――可行点feasible region ――可行域feasible set in decision space――决策空间上的可行集feasible solution――可行解final fork――结局结点final solution――最终解finite set――有限集合flow――流following activity ――紧后工序forest――森林forward algorithm――前向算法free variable ――自由变量function iterative method――函数迭代法functional basic equation――基本函数方程function――函数fundamental circuit――基本回路fundamental cut-set――基本割集fundamental system of cut-sets――基本割集系统fundamental system of cut-sets――基本回路系统Ggame phenomenon――对策现象game theory――对策论game――对策generator――生成元geometric distribution――几何分布goal programming――目标规划graph theory――图论graph――图HHamilton circuit――哈密顿回路Hamilton graph――哈密顿图Hamilton path――哈密顿通路Hasse diagram――哈斯图hitchock method ――表上作业法hybrid method――混合法Iideal point――理想点idle period――闲期implicit enumeration method――隐枚举法in equilibrium――平衡incidence matrix――关联矩阵incident――关联indegree――入度indifference curve――无差异曲线indifference surface――无差异曲面induced subgraph――导出子图infinite set――无限集合initial basic feasible solution ――初始基本可行解initial basis ――初始基input process――输入过程Integer programming ――整数规划inventory policy―v存贮策略inventory problem―v货物存储问题inverse order method――逆序解法inverse transition method――逆转换法isolated vertex――孤立点isomorphism――同构Kkernel――核knapsack problem ――背包问题Llabeling method ――标号法latest finish time――最迟必须完工时间leaf――树叶least core――最小核心least element――最小元least spanning tree――最小生成树leaving basic variable ――出基变量lexicographic order――字典序lexicographic rule――字典序lexicographically positive――按字典序正linear multiobjective programming――线性多目标规划Linear Programming Model――线性规划模型Linear Programming――线性规划local noninferior solution――局部非劣解loop method――闭回路loop――圈loop――自环（环）loss system――损失制Mmarginal rate of substitution――边际替代率Marquart decision process――马尔可夫决策过程matching problem――匹配问题matching――匹配mathematical programming――数学规划matrix form ――矩阵形式matrix game――矩阵对策maximum element――最大元maximum flow――最大流maximum matching――最大匹配middle square method――平方取中法minimal regret value method――最小后悔值法minimum-cost flow――最小费用流mixed expansion――混合扩充mixed integer programming ――混合整数规划mixed Integer programming――混合整数规划mixed Integer ――混合整数规划mixed situation――混合局势mixed strategy set――混合策略集mixed strategy――混合策略mixed system――混合制most likely estimate――最可能时间multigraph――多重图multiobjective programming――多目标规划multiobjective simplex algorithm――多目标单纯形算法multiple optimal solutions ――多个最优解multistage decision problem――多阶段决策问题multistep decision process――多阶段决策过程Nn- person cooperative game ――n人合作对策n- person noncooperative game――n人非合作对策n probability distribution of customer arrive――顾客到达的n 概率分布natural state――自然状态nature state probability――自然状态概率negative deviational variables――负偏差变量negative exponential distribution――负指数分布network――网络newsboy problem――报童问题no solutions ――无解node――节点non-aligned game――不结盟对策nonbasic variable ――非基变量nondegenerate basic feasible solution――非退化基本可行解nondominated solution――非优超解noninferior set――非劣集noninferior solution――非劣解nonnegative constrains ――非负约束non-zero-sum game――非零和对策normal distribution――正态分布northwest corner method ――西北角法n-person game――多人对策nucleolus――核仁null graph――零图Oobjective function ――目标函数objective( indicator) function――指标函数one estimate approach――三时估计法operational index――运行指标operation――运算optimal basis ――最优基optimal criterion ――最优准则optimal solution ――最优解optimal strategy――最优策略optimal value function――最优值函数optimistic coefficient method――乐观系数法optimistic estimate――最乐观时间optimistic method――乐观法optimum binary tree――最优二元树optimum service rate――最优服务率optional plan――可供选择的方案order method――顺序解法ordered forest――有序森林ordered tree――有序树outdegree――出度outweigh――胜过Ppacking problem ――装箱问题parallel job――平行作业partition problem――分解问题partition――划分path――路path――通路pay-off function――支付函数payoff matrix――支付矩阵payoff――支付pendant edge――悬挂边pendant vertex――悬挂点pessimistic estimate――最悲观时间pessimistic method――悲观法pivot number ――主元plan branch――方案分支plane graph――平面图plant location problem――工厂选址问题player――局中人Poisson distribution――泊松分布Poisson process――泊松流policy――策略polynomial algorithm――多项式算法positive deviational variables――正偏差变量posterior――后验分析potential method ――位势法preceding activity ――紧前工序prediction posterior analysis――预验分析prefix code――前级码price coefficient vector ――价格系数向量primal problem――原问题principal of duality ――对偶原理principle of optimality――最优性原理prior analysis――先验分析prisoner’s dilemma――囚徒困境probability branch――概率分支production scheduling problem――生产计划program evaluation and review technique――计划评审技术(PERT) proof――证明proper noninferior solution――真非劣解pseudo-random number――伪随机数pure integer programming ――纯整数规划pure strategy――纯策略Qqueue discipline――排队规则queue length――排队长queuing theory――排队论Rrandom number――随机数random strategy――随机策略reachability matrix――可达矩阵reachability――可达性regular graph――正则图regular point――正则点regular solution――正则解regular tree――正则树relation――关系replenish――补充resource vector ――资源向量revised simplex method――修正单纯型法risk type decision――风险型决策rooted tree――根树root――树根Ssaddle point――鞍点saturated arc ――饱和弧scheduling (sequencing) problem――排序问题screening method――舍取法sensitivity analysis ――灵敏度分析server――服务台set of admissible decisions(policies) ――允许决策集合set of admissible states――允许状态集合set theory――集合论set――集合shadow price ――影子价格shortest path problem――最短路线问题shortest path――最短路径simple circuit――简单回路simple graph――简单图simple path――简单通路Simplex method of goal programming――目标规划单纯形法Simplex method ――单纯形法Simplex tableau――单纯形表single slack time ――单时差situation――局势situation――局势slack variable ――松弛变量sojourn time――逗留时间spanning graph――支撑子图spanning tree――支撑树spanning tree――生成树stable set――稳定集stage indicator――阶段指标stage variable――阶段变量stage――阶段standard form――标准型state fork――状态结点state of system――系统状态state transition equation――状态转移方程state transition――状态转移state variable――状态变量state――状态static game――静态对策station equilibrium state――统计平衡状态stationary input――平稳输入steady state――稳态stochastic decision process――随机性决策过程stochastic inventory method――随机贮存模型stochastic simulation――随机模拟strategic equivalence――策略等价strategic variable, decision variable ――决策变量strategy (policy) ――策略strategy set――策略集strong duality property ――强对偶性strong ε-core――强ε-核心strongly connected component――强连通分支strongly connected graph――强连通图structure variable ――结构变量subgraph――子图sub-policy――子策略subset――子集subtree――子树surplus variable ――剩余变量surrogate worth trade-off method――代替价值交换法symmetry property ――对称性system reliability problem――系统可靠性问题Tteam length――队长tear cycle method――破圈法technique coefficient vector ――技术系数矩阵test number of cell ――空格检验数the branch-and-bound technique ――分支定界法the fixed-charge problem ――固定费用问题three estimate approach一―时估计法total slack time――总时差traffic intensity――服务强度transportation problem ――运输问题traveling salesman problem――旅行售货员问题tree――树trivial graph――平凡图two person finite zero-sum game二人有限零和对策two-person game――二人对策two-phase simplex method ――两阶段单纯形法Uunbalanced transportation problem ――产销不平衡运输问题unbounded ――无界undirected graph――无向图uniform distribution――均匀分布unilaterally connected component――单向连通分支unilaterally connected graph――单向连通图union of sets――并集utility function――效用函数Vvertex――顶点voting game――投票对策Wwaiting system――等待制waiting time――等待时间weak duality property ――弱对偶性weak noninferior set――弱非劣集weak noninferior solution――弱非劣解weakly connected component――弱连通分支weakly connected graph――弱连通图weighed graph ――赋权图weighted graph――带权图weighting method――加权法win expectation――收益期望值Zzero flow――零流zero-sum game――零和对策zero-sum two person infinite game――二人无限零和对策。

列生成算法介绍课件

In this case,
otherwise
i.e., the solution process partially explores the integrality gap.
31
Integrality Property ...
In most cases, the Integrality Property is a undesirable property!
• Dantzig-Wolfe decomposition
vs
Lagrangian Relaxation
• Equivalencies
• Alternative Formulations to the Cutting Stock Problem • IP Column Generation • Branch-and- ... • Acceleration Techniques • Concluding Remarks
2
A Classical Paper : The Cutting Stock Problem
P.C. Gilmore & R.E. Gomory
A Linear Programming Approach to the Cutting Stock Problem.
Oper. Res. 9, 849-859.
Pre-Processors
To get Primal & Dual Solutions
40
IP Column Generation : Acceleration Techniques ...
Link all the Structures
Be Innovative !
Multiple Columns : selected subset close to expected optimal solution

A branch-and-price algorithm

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulkportsTomášRobenek a ,⇑,Nitish Umang a ,Michel Bierlaire a ,Stefan Ropke baTransport and Mobility Laboratory (TRANSP-OR),School of Architecture,Civil and Environmental Engineering (ENAC),École Polytechnique Fédérale de Lausanne (EPFL),CH-1015Lausanne,Switzerland bDepartment of Transport,Technical University of Denmark,Bygningstorvet 116Vest,DK-2800Kgs.Lyngby,Denmarka r t i c l e i n f o Article history:Available online 27August 2013Keywords:Maritime logisticsLarge scale optimization Branch and price Integrated planning Bulk portsMixed integer programminga b s t r a c tIn this research,two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied.We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem.More importantly we highlight the differences in operations between bulk ports and container terminals which highlights the need to devise speciﬁc solu-tions for bulk ports.The objective is to minimize the total service time of vessels berthing at the port.We propose an exact solution algorithm based on a branch and price framework to solve the integrated prob-lem.In the proposed model,the master problem is formulated as a set-partitioning problem,and sub-problems to identify columns with negative reduced costs are solved using mixed integer programming.To obtain sub-optimal solutions quickly,a metaheuristic approach based on critical-shak-ing neighborhood search is presented.The proposed algorithms are tested and validated through numer-ical experiments based on instances inspired from real bulk port data.The results indicate that the algorithms can be successfully used to solve instances containing up to 40vessels within reasonable com-putational time.Ó2013Elsevier B.V.All rights reserved.1.IntroductionMaritime transportation is a major channel of international trade.In the last decade,the shipping tonnage for dry bulk and li-quid bulk cargo has risen by 52%and 48%respectively.The total volume of dry bulk cargoes loaded in 2008stood at 5.4billion tons,accounting for 66.3%of total world goods loaded UNCTAD (2009).The proper planning and management of port operations in view of the ever growing demand represents a big challenge.A bulk port terminal is a zone of the port where sea-freight docks on a berth and is stored in a buffer area called yard for loading,unloading or transshipment of cargo.In general,the bulk terminal managers are faced with the challenge of maximizing efﬁciency both along the quay side and the yard.From the past research,it is well estab-lished that operations research methods and techniques can be successfully used to optimize port operations and enhance termi-nal efﬁciency.However while signiﬁcant contributions have been made in the ﬁeld of large scale optimization for container termi-nals,relatively little attention has been directed to bulk port operations.Bulk terminal operations planning can be divided into two deci-sion levels depending on the time frame of decisions:tactical level and operational level.Tactical level decisions involve medium to short term decisions regarding resource allocation such as port equipment and labor,berth and yard management,and storage policies.In practice,these decisions could be based on ‘‘rules of thumb’’in which the experience of the port managers plays an important role,or alternatively more scientiﬁc approaches based on operations research methods could be in use.The operational level involves making daily and real time decisions such as crane scheduling,yard equipment deployment and last minute changes in response to disruptions in the existing schedule.This paper fo-cuses on the tactical level decision planning for the integrated berth and yard management in the context of bulk ports.We focus in particular on two crucial optimization problems in the context of bulk port terminals:The Berth Allocation Problem (BAP)and the yard assignment problem.The tactical berth allocation problem refers to the problem of assigning a set of vessels to a given berthing layout within a given time horizon.There could be several objectives such as the minimi-zation of the service times of vessels,the minimization of the port stay time,the minimization of the number of rejected vessels,and the minimization of the deviation between actual and planned berthing schedules.There are several spatial and temporal constraints involved in the BAP,which lead to a multitude of BAP0377-2217/$-see front matter Ó2013Elsevier B.V.All rights reserved./10.1016/j.ejor.2013.08.015⇑Corresponding author.Tel.:+41216932432.E-mail addresses:tomas.robenek@epﬂ.ch (T.Robenek),nitish.umang@epﬂ.ch (N.Umang),michel.bierlaire@epﬂ.ch (M.Bierlaire),sr@transport.dtu.dk (S.Ropke).formulations.The temporal attributes include the vessel arrival process,the start of service,the handling times of vessels,while the spatial attributes relate to the berth layout,the draft restric-tions and others.In a container terminal,all cargo is packed into containers,and thus there is no need for any specialized equip-ment to handle any particular type of cargo.In contrast,in bulk ports,depending on the vessel requirements and cargo properties, a wide variety of equipment is used for discharging or loading operations.Thus,the cargo type on the vessel needs to be explicitly taken into consideration while modeling the berth allocation prob-lem in bulk ports.The tactical yard assignment problem refers to decisions that concern the storage location and the routing of materials.This affects the travel distance between the assigned berth to the vessel and storage location of the cargo type of the ves-sel on the yard,and furthermore determines the storage efﬁciency of the yard.Thus,the problems of berth allocation and yard man-agement are interrelated.The start and end times of vessel opera-tions determine the workload distribution and the deployment of yard equipment such as loading shovels and wheel loaders in the yard side.Moreover,berthing locations of vessels determine the storage locations of speciﬁc cargo types to speciﬁc yard locations, which minimize the total travel distance between the assigned berthing positions to the vessels and the yard locations storing the cargo type for the vessel.Similarly,the yard assignment of spe-ciﬁc cargo types has an impact on the best berthing assignment for vessels berthing at the port.In this study,we present an integrated model for the dynamic,integrated berth allocation problem and yard assignment in the context of bulk ports.Few scholars have investigated this problem in the context of container terminals, and there is no published literature for bulk ports.We present an exact solution algorithm based on branch-and-price and a meta-heuristic approach based on critical-shaking neighborhood search to solve the combined large scale problem.Numerical experiments based on real-life-inspired port data indicate that the proposed algorithms can be successfully used to solve even large instances.2.Literature reviewFrom the past OR literature on container terminal operations,it is well established that integrated planning of operations can allow port terminals to reduce congestion,lower delay costs and enhance efﬁciency.Signiﬁcant contribution has been made in theﬁeld of large scale optimization and integrated planning of operations in container terminals.Bulk ports on the other hand have received al-most no attention in the operations research literature.The inte-grated berth allocation and quay crane assignment or scheduling problem has been studied in the past by Park and Kim(2003), Meisel and Bierwirth(2006),Imai,Chen,Nishimura,and Papadimitriou(2008),Meisel and Bierwirth(2009),and more recently by Giallombardo,Moccia,Salani,and Vacca(2010)and Vacca(2011)for container prehensive literature surveys on container terminal operations can be found in Steenken, Voss,and Stahlbock(2004),Stahlbock and Voss(2008),and Bierwirth and Meisel(2010).The dynamic,hybrid berth allocation problem in the context of bulk ports is studied by Umang,Bierlaire,and Vacca(2013). The berth allocation problem in container terminals has been widely studied in the past.Imai,Nagaiwa,and Chan(1997),Imai, Nishimura,and Papadimitriou(2001,2003,2008),Monaco and Sammarra(2007),Buhrkal,Zuglian,Ropke,Larsen,and Lusby (2011),Zhou and Kang(2008),Han,Lu,and Xi(2010),Cordeau, Laporte,Legato,and Moccia(2005),Mauri,Oliveira,and Lorena (2008)propose methods to solve the discrete berth allocation problem.The continuous berth allocation problem is studied by Li,Cai,and Lee(1998),Guan,Xiao,Cheung,and Li(2002),Park and Kim(2003),Guan and Cheung(2004),Park and Kim (2002),Kim and Moon(2003),Lim(1998),Tong,Lau,and Lim (1999),Imai,Sun,Nishimura,and Papadimitriou(2005)and Chang,Yan,Chen,and Jiang(2008).The berth allocation problem with hybrid layout is addressed by Moorthy and Teo(2006),Dai, Lin,Moorthy,and Teo(2008),Nishimura,Imai,and Papadimitri-ou(2001)and Cheong,Tan,Liu,and Lin(2010),and position-dependent handling times are considered by Cordeau et al. (2005)and Imai,Nishimura,Hattori,and Papadimitriou(2007) for indented berths.Yard management in container terminals involves several tacti-cal and operational level decision problems.Scheduling and deployment of yard cranes is addressed by Cheung,Li,and Lin (2002),Zhang,Wan,Liu,and Linn(2002),Ng and Mak(2005),Ng (2005)and Jung and Kim(2006).Storage and space allocation, stacking and re-marshalling strategies have been studied by Kim and Kim(1999),Kim,Lee,and Hwang(2003),Lee,Chew,Tan, and Han(2006)and few others.Nishimura,Imai,and Papadimitri-ou(2009)investigate the storage plan for transshipment hubs,and propose an optimization model to minimize the sum of the waiting time of feeders and the handling times for transshipment contain-ersﬂow.Transfer operations that consist of routing and scheduling of internal trucks,straddle carriers and AGV’s have been studied by Liu,Jula,Vukadinovic,and Ioannou(2004),Vis,de Koster,and Savelsbergh(2005),and Cheng,Sen,Natarajan,Teo,and Tan (2005)among others.Works on integrated problems related to yard management in container terminals include Bish,Leong,Li, Ng,and Simchi-Levi(2001)and Kozan and Preston(2006)who propose the integration of yard allocation and container transfers, whereas Chen,Lei,and Zhong(2007)and Lau and Zhao(2007) study the integrated scheduling of handling equipment in a con-tainer terminal.In the following,we discuss in more detail some articles relevant to our study.Moorthy and Teo(2006)discuss the concepts of berth template and yard template in the context of transshipment hubs in con-tainer shipping.They study the delicate trade-off between the level of service as indicated by the vessel waiting times and the opera-tional cost for moving containers between the yard and quay in a container terminal.A robust berth allocation plan is developed using the sequence pair approach,with the objective to minimize the total expected delays and connectivity cost that is related to the distance between the berthing positions of vessels belonging to the same transshipment group.Cordeau,Gaudioso,Laporte,and Moccia(2007)study the Ser-vice Allocation Problem(SAP),a tactical problem arising in the yard management of Gioia Tauro Terminal.The SAP is a yard manage-ment problem that deals with dedicating speciﬁc areas of the yard and the quay to the services or route plans of shipping companies which are planned in order to match the demand for freight trans-portation.The objective of the SAP is the minimization of container rehandling operations in the yard and it is formulated as a General-ized Quadratic Assignment Problem(GQAP,see e.g.Cordeau,Gaud-ioso,Laporte,&Moccia(2006)and Hahn,Kim,Guignard,Smith,& Zhu(2008)).An evolutionary heuristic is developed to solve larger instances obtained from the real port data.Zhen,Chew,and Lee(2011)propose a mixed integer model to simultaneously solve the tactical berth template and yard template planning in transshipment hubs.The objective is to minimize the sum of service cost derived from the violation of the vessels ex-pected turnaround time intervals and the operation cost related to the route length of transshipment containerﬂows in the yard.A heuristic algorithm is developed to solve large scale instances within reasonable time and numerical experiments are conducted on instances from real world data to validate the efﬁciency of the proposed algorithm.400T.Robenek et al./European Journal of Operational Research235(2014)399–411More recently,Lee and Jin(2013)study the feeder vessel man-agement problem in a container transshipment hub.The integrated problem consists of three tactical decision problems of berth tem-plate,schedule template and yard template design.The problem is formulated as a mixed integer program and solved using a memet-ic heuristic based on genetic algorithm and tabu search.The effec-tiveness of the proposed algorithm is validated by conducting numerical experiments on instances based on real port data.To the best of our knowledge,operations research problems have received almost no attention thus far in the context of bulk port terminals.In the context of container terminals,the major fo-cus in theﬁeld of large scale optimization has been on studying the integrated berth allocation and quay crane scheduling or assign-ment problem,while very few scholars have attempted to solve the combined problem of berth allocation and yard assignment as a single large scale optimization problem.This is also theﬁrst paper to present an exact solution algorithm(based on branch-and-price)to solve the integrated problem in context of seaside port operations planning.Moreover we discuss and emphasize the speciﬁc features in bulk port operations that necessitate the need to devise speciﬁc solutions for bulk terminals.3.Problem statementIn this section we elaborate on the background for the inte-grated berth allocation and yard assignment problem in the con-text of bulk ports.A schematic representation of a bulk port terminal is shown in Fig.1.We consider a set of vessels N,to be cargo types are provided as input parameters to the model.In the present work,we extend the berth allocation problem to account for the assignment of yard locations to speciﬁc cargo types and vessels berthing at the port which also become decision variables in the integrated framework.Evidently the integrated problem is much more complex and extensive than the berth allocation prob-lem studied in Umang et al.(2013).The integrated problem is solved for a given time frame,and the objective is to minimize the service times of the vessels berthing at the port.A major difference between bulk port and container terminal operations is the need to explicitly account for the cargo type on the vessel in bulk ports.Depending on the vessel requirements and cargo types,a wide variety of specialized equipment such as conveyors and pipelines are used for discharging or loading opera-tions.For example,liquid bulk is generally discharged using pipe-lines which are installed at only certain sections along the quay. Similarly,a vessel may require the conveyor facility to load cargo from a nearby factory outlet to the vessel.In contrast in a container terminal,all cargo is packed into containers,and thus there is no need for any specialized equipment to handle any particular type of cargo.Furthermore in bulk ports,depending on the cargo prop-erties,there may be additional restrictions on the storage of spe-ciﬁc cargo types in the yard which forbids two or more cargo types to be stored in adjacent yard locations to avoid intermixing.In our model we assume aﬁxed crane deployment during the processing time of the vessel.Note that this assumption is consis-tent with our observations during our visit to the bulk port under study.It was observed that for certain cargo types,only conveyors and pipelines are used for the loading/discharging operations andFig.1.Schematic representation of a bulk port terminal.T.Robenek et al./European Journal of Operational Research235(2014)399–411401in our model,we do not explicitly include constraints on the sched-uling or assignment of cranes,since the number of cranes operat-ing on a given vessel can be determined by data preprocessing depending on the cargo type and the length of the vessel.It is further assumed that each vessel has a single cargo type that can be discharged(loaded)and transferred to(from)multiple yard locations.The assumption of single cargo type on each ber-thing vessel is consistent with the data sample that we received from the port.Moreover to model multiple cargo types on the same vessel,the internal structure of each vessel needs to modeled more rigorously which is beyond the scope of this study,nor is typically considered in any studies related to berth allocation planning.The assumption that a given cargo type can be stored at several yard locations is true in practice.The cargo is stored at several yard loca-tions to load(discharge)a single vessel,and moreover there are sit-uations when more than one vessel with the same cargo type are being handled at different locations along the quay,in which case the same cargo type is stored at multiple locations on the yard as close to the berthed vessels as possible.In the computation of the handling times,it is assumed that all sections occupied by the berthed vessel are being operated on simultaneously.The amount of cargo handled at each section is proportional to the length of the berthed section,and the handling time of the vessel is the time taken to load or discharge the section whose operationﬁnishes last.We deﬁne the unit handling time of a vessel as the time taken to load(discharge)a unit quantity of car-go on(from)the vessel.The unit handling time of a vessel has a ﬁxed component dependent on the number of quay cranes operat-ing on the vessel,and a variable component which is dependent on the distance between the berthing location of the vessel and the storage location of the corresponding cargo type on the yard.Since a given cargo type can be discharged(loaded)and transferred to (from)multiple yard locations,the distance between the berthing location of the vessel and the storage location of the cargo type is the weighted average distance between the vessel and all the cargo locations that are assigned to the vessel.In this calculation, the weights are assumed equal to the cargo quantities that are transferred to(from)each yard location from(to)the vessel.Another assumption in the model is that in the given planning horizon,a given yard location is either assigned to a single cargo type,or alternatively the yard location is not assigned to any cargo type.This assumption is realistic because in periods of low conges-tion at the port,there may be several yard locations that are not as-signed to any cargo type.Even in periods of congestion,as a standard practice at the port,two different cargo types are never stored at the same yard location.The assumption that the assign-ment of a cargo type to a speciﬁc storage location on the yard does not alter during the planning horizon makes sense because in our model,the two problems of berth allocation and yard assignment are solved simultaneously for a given time frame.This implies that the integrated model tries to determine the optimal assignment of cargo types to yard locations for which the handling times of the vessels berthing in that planning horizon are minimized.In prac-tice when the model is implemented in a rolling planning horizon, there is a considerable gap of at least a few days between two plan-ning runs.In that case the assignment of cargo types on the yard will change depending on the cargo types on the vessels berthing in the next planning window.Based on the preceding discussion,the unit handling time h wikfor vessel i with cargo type w occupying section k along the quay in-cludes the time taken to transfer the unit quantity of cargo be-tween the cargo location on the yard and section k,and the time taken to load(or unload)the cargo from the quay side to the vessel.These can be denoted by b wikand a w ik respectively.Thus we have,h wik¼a w ikþb w ik,where a w ik¼T=n w ik and b w ik¼V w r i k.Here T is the amount of time taken by a single crane to load or discharge a unit quantity of cargo,and n wikis the number of cranes operating in sec-tion k on vessel i for cargo type w.b wikis the time taken to transfer a unit quantity of cargo between the cargo location w on the yard and the section k for vessel i,which is assumed to be a linear func-tion of the weighted average distance r ikbetween the section k and all cargo locations assigned to the vessel i.The parameter V w de-pends on the rate of transfer of cargo type w.Thus for example, if a vessel is using the conveyor facility to load rock aggregates from the rock factory directly into the vessel,the parameter V w is equal to the cargo transfer rate for the conveyor facility,and if there are no additional cranes operating on the vessel,the param-eter a w ik which is provided as an input parameter to the model is equal to zero.In practice,theﬁxed specialized equipment facilities such as conveyors and pipelines are dedicated to handling certain cargo types.For example,liquid bulk is transferred using pipelines, and rock aggregates are transferred using conveyor facility.Thus the specialized facilities are themselves modeled as cargo types in the proposed model.The objective of the integrated optimiza-tion model that we solve is to minimize the sum of the service times of all vessels,which includes the handling or processing times and the berthing delays for all vessels berthing at the port.4.Model formulationIn this section,we present a mixed integer programming for-mulation for the integrated berth allocation and yard assignment problem in bulk ports.4.1.NotationInput parameters.In the formulation of the integrated model, the following input data is assumed available:N set of vesselsM set of sectionsP set of cargo locationsW set of cargo typesH set of time stepsW i cargo type to be loaded or discharged from vessel iPðpÞset of cargo locations neighboring cargo location p ðwÞset of cargo types that cannot be stored adjacent to cargo type wA i expected arrival time of vessel iD i draft of vessel iL i length of vessel iQ i quantity of cargo for vessel id k draft of section k‘k length of section kb k starting coordinate of section ka wikdeterministic component of handling time for cargotype w of vessel i berthed at section kV w constant dependent on the rate of transfer of cargo type wr pkdistance between cargo location p and section kR w maximum amount of cargo type w that can be handled in a single time stepL total length of quayB large positive constantF maximum number of cargo locations that can beassigned to a single vesselq i‘k fraction of cargo handled at section k when section‘is theﬁrst section occupied by vessel id i‘k1if vessel i starting at section‘touches section k0otherwise:&402T.Robenek et al./European Journal of Operational Research235(2014)399–411Decision variables .The following decision variables are used in the model:m i integer P 0,represents the starting time of handling ofvessel i 2Nc i integer P 0,represents the total handling time of vessel i 2Nh wik handling time for unit quantity of cargo type w for vessel i berthed at section kb w ik variable component of handling time of vessel i with cargo type w berthed at section k along the quayq ipamount of cargo handled by vessel i at cargo location p g inumber of cargo locations assigned to vessel ie i kweighted average distance between section k occupied by vessel i and all cargo locations assigned to the vessel s i kbinary,equals 1if section k 2M is the starting section of vessel i 2N ,0otherwisex ik binary,equals 1if vessel i 2N occupies section k 2M ,0otherwisey ijbinary,equals 1if vessel i 2N is berthed to the left of vessel j 2M without any overlapping in space,0otherwisez ijbinary,equals 1if handling of vessel i 2N ﬁnishes before the start of handling of vessel j 2N ,0otherwisel pwbinary,equals 1if cargo type w is stored at cargo location p ,0otherwise/ip binary,equals 1if cargo location p is assigned to vessel i ,0otherwiseh itbinary,equals 1if vessel i is being handled at time t ,0otherwisex ip tbinary,equals 1if vessel i is being handled at location p at time t ,0otherwise4.2.Mathematical modelThe integrated model for the berth allocation and yard assign-ment problem in bulk ports can be formulated as follows:minXi 2Nðm i ÀA i þc i Þð1Þs :t :m i ÀA i P 08i 2Nð2ÞX k 2Ms j k b k þB ð1Ày ij ÞP X k 2Ms i k b k ÀÁþL i8i ;j 2N ;i –j ð3Þm j þB ð1Àz ij ÞP m i þc i 8i 2N ;8j 2N ;i –j ð4Þy ij þy ji þz ij þz ji P 18i 2N ;8j 2N ;i –jð5ÞXk 2Ms i k ¼18i 2Nð6ÞX k 2Ms i k b k ÀÁþL i 6L 8i 2N ð7ÞX ‘2M d i ‘k s i ‘ÀÁ¼x ik8i 2N ;8k 2Mð8Þðd k ÀD i Þx ik P 08i 2N ;8k 2Mð9Þc i P h wik q i ‘k Q i ÀB 1Às i ‘ÀÁ8i 2N ;8l 2M ;8k 2M ;8w 2W ið10Þh wik ¼a w ik þb wik 8w 2W i ;8k 2Mð11Þb w ik¼V w e i k 8i 2N ;8w 2W i ;8k 2Mð12Þe i k ¼X p 2Pr p k q ip ÀÁ=Q i 8i 2N ;8k 2M ð13ÞQ i ¼X p 2Pq ip8i 2N ð14Þq ip 6/ip Q i 8i 2N ;8p 2Pð15Þ/ip 6q ip8i 2N ;8p 2Pð16Þq ip 6X w 2W i X t 2HR w x ip t þB 1Àl pwÀÁ 8i 2N ;8p 2P ð17ÞXp 2p/ip 6F8i 2Nð18Þl p w þl pw618w 2W ;8 w 2w Þ;8p 2P ;8 p 2ðp Þð19ÞX i 2Nx ipt 618p 2P ;8t 2Hð20ÞXw 2Wl p w 618p 2P ð21Þ/ip 6l p w8i 2N ;8w 2W i ;8p 2Pð22Þx ip t P /ip þh it À18i 2N ;8p 2P ;8t 2H ð23Þx ip t 6/ip 8i 2N ;8p 2P ;8t 2H ð24Þx ip t 6h it8i 2N ;8p 2P ;8t 2H ð25ÞXt 2Hh it ¼c i8i 2Nð26Þt þB ð1Àh it ÞP m i þ18i 2N ;8t 2H ð27Þt 6m i þc i þB ð1Àh it Þ8i 2N ;8t 2H ð28Þs i k ;x ik 2f 0;1g 8i 2N ;8k 2M ð29Þy ij ;z ij 2f 0;1g 8i ;j 2Nð30Þl p w2f 0;1g 8p 2P ;8w 2W ð31Þx ip t 2f 0;1g8i 2N ;8p 2P ;8t 2H ð32Þ/ip 2f 0;1g 8i 2N ;8p 2P ð33Þh it 2f 0;1g 8i 2N ;8t 2Hð34ÞThe objective function (1)minimizes the total service time of all vessels,which is the sum of total delays and total handling time of vessels berthing at the port.Constraints (2)are the dynamic arrival constraints that ensure that vessels can be serviced only after their arrival.Constraints (3)–(5)are the non-overlapping restrictions for any two vessels berthing at the port.These ensure that while two vessels may be overlapping in space or in time,they cannot be simultaneously overlapping in both space and time.Note that the constraints (3)and (4)have been linearized by using a large posi-tive constant B .Constraints (6)–(8)ensure that each vessel occu-pies only as many number of sections as determined by its length and the starting section occupied by the vessel.Constraints (9)ensure that the draft of the vessel does not exceed the draft of any occupied section.Constraints (10)are used to determine the total handling time for any given vessel which is equal to the time taken to process the section occupied by the vessel whose operation ﬁnishes last.The variable component of the handling time for a given vessel i and given occupied section k is determined by the constraint (12),and is a function of the weighted average distance between section k and all cargo locations assigned to vessel i .The average distance is weighted over the cargo quantities transferred between each cargo location p assigned to vessel i and section k occupied by the vessel,and is determined by constraint (13).Constraints (11)determine the unit handling time of vessel i at a given section k ,which is the sum of the ﬁxed component dependent on the number of cranes operating on that section and the variable component of the handling time as discussed earlier.Constraints (14)–(16)state that the total cargo quantity to be loaded (discharged)is equal to the sum of the cargo quantities transferred from (to)all the cargo locations assigned to the vessel.Constraints (17)are capacity con-straints to ensure that the amount of cargo transferred in a unit time does not exceed the maximum amount of cargo that can be handled as given by parameter R w for cargo type w .Note that in case of specialized equipment facilities,the parameter R w may refer to the conveyor speed or the ﬂow rate through the pipeline;in other cases it may refer to the maximum rate of transfer ofT.Robenek et al./European Journal of Operational Research 235(2014)399–411403。

江苏省徐州市2023-2024学年高一上学期1月期末抽测试题英语含答案

2023～2024学年度第一学期期末抽测高一年级英语试题（答案在最后）说明：1.本试卷共10页，满分150分，考试时间120分钟。

2.在答题纸的密封线内填写学校、班级、姓名、考号等，密封线内不要答题。

3.请将所有答案均按照题号填涂或填写在答题卡/纸相应的答题处，否则不得分。

第一部分听力（共两节，满分30分）第一节（共5小题；每小题1.5分，满分7.5分）听下面5段对话。

每段对话后有一个小题，从题中所给的A、B、C三个选项中选出最佳选项。

听完每段对话后，你都有10秒钟的时间来回答有关小题和阅读下一小题。

每段对话仅读一遍。

1.How long will the girl stay with her parents?A.For one week.B.For two weeks.C.For three weeks.2.What does the man want?A.Chocolate cakes.B.Lemon cakes.C.Cream cakes.3.What is the man buying?A.Shoes.B.Socks.C.Pants.4.What does the woman want the man to do?A.Take a photo of her.B.Pay for her trousers.C.Fix his shirt.5.Where does the conversation probably take place?A.In a tower.B.In an office.C.In a classroom第二节（共15小题；每小题1.5分，满分22.5分）听下面5段对话或独白。

每段对话或独白后有几个小题，从题中所给的A、B、C三个选项中选出最佳选项。

听每段对话或独白前，你将有时间阅读各个小题，每小题5秒钟；听完后，各小题将给出5秒钟的作答时间。

每段对话或独白读两遍。

听第6段材料，回答第6、7题。

国际商法双语版 ch3 CISG

The contract for the sale of a camera or clothing to a foreign tourist? No, CISG doesn‟t cover consumer goods sold for personal, family or household use
Issue: is CISG applicable? Decision: No. the French Law on Protecting Consumer’s Rights and Interests is applicable
Example: consumer goods
Facts: Seller – a computer retailer in France, receives an order for a computer from buyer, a resident of China. The order is for a powerful, expensive computer of the sort commonly bought for use in business firms. When a dispute arises, Issue: is covered by CISG or law on protecting consumer?
Introduction to CISG
CISG? Transactions covered in CISG
CISG?
CISG = The United Nations Convention on Contracts for the International Sale of Goods
CISG?
Are they defined as International

CATTI笔译三级实务词

Deflation通货紧缩Economy of scale;scaled economy经济规模Slack(sluggish,sagging,inactive)market市场疲软Brisk(flourishing,active)market市场火旺Market access市场准入Buyer’s/seller’s market买方/卖方市场Quote a price;give a quotation报价Hot money from abroad国际游资Absorb idle fund吸收游资Invite tenders(bids)/submit a tender/win(get)the tender招标/投标/中标The system of public bidding for projects招标投标制Trade surplus/deficit贸易顺差/逆差Trade(trading)partner贸易伙伴Customs barrier;tariff wall关税壁垒Win-win result for both A and B;benefit both sides双赢Multi-win/multiple-win result多赢Annual business volume(turnover)年营业额Invite investment招商Popular investment spot;hot destination for investment;investment hot spot投资热点Investment infixed assets固定资本投资Infrastructure基础设施Make the economy more market-oriented使经济进一步市场化The globalization trend in economic development经济发展全球化的趋势Economic globalization经济全球化The joint stock system股份制The joint stock cooperative system股份合作制Who holds the controlling shares?谁控股？Debt-to-equity swap债转股Economic depression(slump,recession)/economic take-off/economic boom经济萎缩/起飞/兴旺Curb inflation/hyperinflation遏制通货膨胀/恶性通货膨胀City Council市议会Trust fund信托基金BRICs“金砖四国”（巴西，俄罗斯，印度，中国）第一/第二/第三产业the primary/secondary/tertiary industry(the service sector)国内生产总值GDP（Gross Domestic Product）举办2010年世博会host the2010World Exposition(Expo)消费者物价指数CPI(Consumer Price Index)技术/劳动/资本/知识密集型产业technology-intensive/labor-intensive/capital-intensive/knowledge-intensive industries经济体制改革economic restructuring经济市场化/私有化the marketization/privatization of the economy恶性循环vicious cycle/circle良性循环beneficent/virtuous cycle鼓励兼并，规范破产encourage mergers and standardize bankruptcy procedures公司分立与解散separation an dissolution of a company国家控股公司state-controlled share company控股公司holding company创业园，孵化器high-tech business incubator;pioneer park企业孵化器enterprise incubator新的经济增长点new point of economic growth外向型经济/城市export-oriented economy/a foreign-oriented city,international city涉外经济foreign-oriented/foreign-related business长江三角洲the Yangtze River delta经济技术开发区economic and technological development zone采取市场多元化战略adopt the strategy of a multi-outlet market刺激内需stimulate domestic demand保持良好的增长势头maintain the healthy(good)momentum of growth可持续发展sustainable development防止经济过热prevent an overheated economy(overheating of the economy)防止国有资产流失prevent the loss of state assets减轻就业压力ease the pressure of unemployment(the employment pressure)防止泡沫经济avoid a bubble economy(too many bubbles in the economy)政企分开separate administrative functions from enterprise management;separate administration from management实行董事会领导下的总经理负责制practice the system of the general-manager responsibility under the leadership of the board of directors(BOD)总裁president首席执行官CEO(chief executive officer)管理层收购MBO（Management Buying Out）收购、合并acquisition and merger技术更新/改造technological updating/renovation亏损企业money-losing(debt-ridden,loss-making,unprofitable)enterprises;enterprises that operate at a loss扭亏为盈turn losses into profits减员增效increase efficiency by reducing(downsizing,cutting)the staff;downsize for efficiency 增强竞争力enhance(increase sharpen)the competitiveness(the competitive ability)私人企业private enterprises(companies,firms,businesses)外资企业foreign-invested(foreign-funded,foreign-financed,foreign-owned)enterprises外商独资企业wholly(solely)foreign-owned enterprises中外合资企业100强the top100sino-foreign(Chinese-foreign)joint ventures跨国公司a transnational corporation(a transnational,a multinational corporation,a multinational)母公司/子公司/分公司/办事处the parent company/subsidiary/branch/representative office吸引外资attract foreign capital;lure overseas funds全面投产（开工）go into(enter)full operation;become fully operational获薄利earn(make)narrow profits获厚利earn(make,reap)substantial profits总产值创历史最高纪录Total output value bit a record high(an all-time high)扣除通货膨胀因素后的人均实际年收入the annual per-capita income in real terms(allowing for inflation)人均住房per-capita housing商品房空置的想象the vacancy problem in commercial housing按揭贷款mortgage loan按揭购房buy an apartment on a mortgage期房forward delivery housing物业管理estate management,property management住房公积金housing provident fund;public accumulation fund for housing;public housing reserve fund经济适用房affordable apartment;economical housing廉租房low-rent housing/apartments增值的valued added技术密集型特长technology-intensive;technologically intensive海外侨胞overseas compatriot创业活动entrepreneurial activity信息技术产业IT（information technology）industries/sectors贸易逆差trade deficit机电产业electro-mechanical products与时俱进keep pace with the times互利共赢mutual benefit and win-winBanknote/a five-pound note/a ten-dollar bill钞票/一张五镑的钞票/一张十美元钞票The exchange rate between the US dollar and the British pound美元与英镑之间的兑换率The period of(an)economic boom/depression经济繁荣/萧条（不景气）时期Good/brisk/bad/slack business繁荣、活跃/疲软、萧条的商务Deposit money in the bank把钱存在银行内Draw money from the bank/from one’s account从银行/从自己的存款中取钱Current/savings/check account活期/储蓄/支票账户Traveler’s checks/cheques旅行支票The principal and the interest本金与利息Credit card信用卡Commercial bank商业银行Issue stocks and bonds发行股票、债券Financing;fund-raising融资Financing channel融资渠道Financial crisis(turmoil)金融危机The depreciation(devaluation)pressure on the US dollar美元贬值的压力Devaluation of currency/the US dollar货币/美元的贬值Appreciation of the Japanese yen日元的升值The Japanese yen appreciated steadily against the US dollar日元对美元稳步升值Stagnant debts and bad debts;non-performing funds呆账与坏账Euro/Euroland欧元/欧元区The Dow Jones industrial average道琼斯工业平均指数The NASDAQ(National Association of Securities Dealers Automated Quotation system)Index 纳斯达克指数The Hang Seng Index（香港）恒生指数The Nikkei Index日经指数中国的黄金储备/外汇储备Ｃhina’s gold reserve/foreign exchange reserve通货膨胀已得到控制The inflation has been brought under control人民币对美元汇率升值the appreciation of the RMB exchange rate against the USD最终将实现人民币自由兑换The free convertibility of the Renminbi will eventually be instituted./The RMB will finally become a convertible currency与美元联系汇率制the system of pegging the currency to the U.S.dollar依法收税levy taxes according to law加强税收tighten tax collection增值税value-added tax(VAT)个人所得税individual income tax个人收入应税申报制度the system of the declaration of individual incomes for tax payment出口退税export tax rebate;refunding export taxes;refunding taxes to exporters保护性关税protective tariffs反倾销anti-dumping补贴与反补贴措施subsidies and countervailing measures流动资金circulating funds(floating capital)上海证券交易所the Shanghai Securities Exchange股市指数the stock market(exchange)index股票热降温了。

高考英语大题满分专题练习：专题8 六选四 (原卷版)

专题8 六选四（原卷版）距离高考还有一段时间，不少有经验的老师都会提醒考生，愈是临近高考，能否咬紧牙关、学会自我调节，态度是否主动积极，安排是否科学合理，能不能保持良好的心态、以饱满的情绪迎接挑战，其效果往往大不一样。

以下是本人从事10多年教学经验总结出的以下学习资料，希望可以帮助大家提高答题的正确率，希望对你有所帮助，有志者事竟成！养成良好的答题习惯，是决定高考英语成败的决定性因素之一。

做题前，要认真阅读题目要求、题干和选项，并对答案内容作出合理预测;答题时，切忌跟着感觉走，最好按照题目序号来做，不会的或存在疑问的，要做好标记，要善于发现，找到题目的题眼所在，规范答题，书写工整;答题完毕时，要认真检查，查漏补缺，纠正错误。

总之，在最后的复习阶段，学生们不要加大练习量。

在这个时候，学生要尽快找到适合自己的答题方式，最重要的是以平常心去面对考试。

英语最后的复习要树立信心，考试的时候遇到难题要想“别人也难”，遇到容易的则要想“细心审题”。

越到最后，考生越要回归基础，单词最好再梳理一遍，这样有利于提高阅读理解的效率。

另附高考复习方法和考前30天冲刺复习方法。

[考点分析]分值：8分，语法难度较任务型阅读有所降低，但理解难度提高。

考查方式：给出一篇缺少四个句子的短文和6个选项。

要求考生根据文章内容，选出正确的句子填入相应空白处。

有两个多余选项。

每个选项2分。

考纲解读：主要考查学生对文章的整体内容和结构以及上下文逻辑意义的理解和掌握。

选材特点：短文长度一般为300词左右，题材为记叙文、说明文和议论文为主。

设空类型：1.主旨句：标题类、主题句类；2.过渡性句子:文章结构；3.细节注释性句子：上下文逻辑意义。

解题步骤：1. 通读全文，尤其是文章的开始部分，明确文章的基本话题和主要内容。

2. 阅读选项，根据选项中句子的句意或者句子后面的标点符号来判断该句在文章中的可能位置。

3. 仔细阅读空前空后，寻找并划出关键词。

广东省揭阳市2023-2024学年高二下学期7月期末英语试题

广东省揭阳市2023-2024学年高二下学期7月期末英语试题一、阅读理解Gently trimming your hedge (修剪树篱) every 2 weeks will thicken it up and give it a beautiful look, but heavy trimmers, wires and stepladders make hedge trimming a job that some people hate. Gtech HT50 Cordless Hedge Trimmer makes it a pleasure.Great ConvenienceWith 60 minutes of runtime, move freely around your garden without being bothered by wires and messy petrol. Running off an 18V motor, the HT50 Cordless Hedge Trimmer supplies the power directly when needed. The lightweight but super strong drive system is designed for quiet running. In addition, the precision laser cut blades (刀片) move through branches up to 25 millimetres thick, leaving a clean cut vital to promote a healthy hedge.Long ReachThe HT50 Cordless Hedge Trimmer has an adjustable head so that you have full control over the cut of your hedges. The head adjusts downwards so you can cut the top of your hedges easily, and upwards so that you can cut thorny (多刺的) hedges without hurting your arms. Keep your hedges neat by cutting flat along the tops of hedges up to 10 feet tall using the 55-centimetre-long blade.Perfectly BalancedWeighing only 2.94 kilograms, the HT50 is well balanced, giving you a more enjoyable gardening experience. Get an HT50 Cordless Hedge Trimmer (£224.98) for just £149.98 if you order before May 9th, 2024, with a Branch Cutter attached free of charge. Call our 24-hour freephone and sales lines or visit our website for more information.1．What is the feature of the HT50 Cordless Hedge Trimmer?A．It needs no power support.B．It helps maintain weak leaves.C．It has no time limit for a single run.D．It has no noise disturbance while working.2．How much can be saved if you buy two trimmer before May 9th, 2024?A．£75.00.B．£149.98.C．£150.00.D．£299.96.3．What is the text?A．An advertisement.B．A biography.C．A short story.D．A report.“You'll be blind by the time you're twenty-five,” a doctor at Children's Hospital predicted. “Your blood sugars are much too high.” It consumed me. No mater where I was or what I was doing, it was overhead like a dark cloud, waiting for just the right opportunity to break open and destroy my world.I liked painting. Losing myself in painting filled me with peace. Painting provided me with the only place where I could escape from those threatening words.When I was 2l years old, my right eye went blind. Precisely three months after I was 25, I had a massive hemorrhage (大出血) in my left eye because of an accident. For the next twenty years, vision came and went. I went through many eye operations in an attempt to keep my vision. But after one final operation, I lost the battle and all remaining vision.And I buried all dreams of painting.Desperate, I enrolled in (注册) a sixteen-week program for the blind and visually impaired (视力受损). I learned personal adjustment and the use of a computer with adaptive software. A whole new world opened up to me through this program as a turning point.“Jaws and Window-Eyes are leading software for the blind.” my instructor told me. “You can use the Internet, e-mail and Microsoft with all its tools and features.”It's amazing! Hope went up for the first time in years. “By learning how to use hot keys to control the mouse, you can use Microsoft Access, Excel and PowerPoint,” my instructor added.For the next several years, I learned that when one door closes, another door opens. There are plenty of choices available for the blind and visually impaired through the gift of technology. Not only do I have a speaking computer, but I have a speaking watch, alarm clock and calculator. 4．What does the underlined word “it” in Paragraph 1 refer to?A．The right opportunity.B．Losing my sight in the future.C．Consuming too much sugar.D．The children's hospital.5．What happened when the author was 25 years old?A．He gave up painting.B．He went blind badly.C．He injured his left eye.D．He picked up a new hobby.6．What brought a turning point to the author?A．A special program.B．A meaningful performance.C．An inspiring speech.D．An important interview.7．What does the author intend to tell us?A．No pain, no gain.B．Every man has his price.C．Everyone is born equal.D．Stay positive in the face of life's difficulties.Desperately ill and seeking a miracle, David Bennett Sr. took the last bet on Jan. 7. when be became the first human to be successfully transplanted with the heart of a pig. “It creates the beat; it creates the pressure; it is his heart,” declared Bartley Griffith, director of the surgical team that performed the operation at the University of Maryland Medical Center.Bennett, 57, held on through 60 tomorrows, far longer than any previous patient who’d received a heart from another species. His remarkable run offered new hope that such procedures, known as xenotransplantation (异种移植), could help relieve the shortage of replacement organs, saving thousands of lives each year.The earliest attempts at xenotransplantation of organs, involving kidneys from rabbits, goats, and other animals, occurred in the early 20th century, decades before the first successful human-to-human transplants. Rejection, which occurs when the recipient’s body system recognizes the donor organ as a foreign object and attacks it, followed within hours or days. Results improved after some special drugs arrived in the 1960s, but most recipients still died after a few weeks. The record for a heart xenotransplant was set in 1983, when an infant named Baby Fae survived for 20 days with an organ from a baboon (狒狒).In recent years, however, advances in gene editing have opened a new possibility: re-edit some genes in animals to provide user-friendly spare parts. Pigs could be ideal for this purpose, because they’re easy to raise and reach adult human size in months. Some biotech companies. including Revivicor, are investing heavily in the field. The donor pig was offered by Revivicor from a line of animals in which 10 genes had been re-edited to improve the heart’s condition. Beyond that, the pig was raised in isolation and tested regularly for viruses that could infecthumans or damage the organ itself.This medical breakthrough provided an alternative for the 20% of patients on the heart transplant waiting list who die while waiting or become too sick to be a good candidate. 8．What does the underlined word “run” in paragraph 2 refer to?A．Donating his heart to a patient.B．Performing the heart operation.C．Living for 60 days after the operation.D．Receiving a new heart from a pig.9．Which aspect of xenotransplantation does paragraph 3 mainly focus on?A．Its history.B．Its procedure.C．Its consequence.D．Its significance. 10．What makes pigs ideal for providing spare parts in xenotransplantation?A．Their growth rate and health condition.B．Their life pattern and resistance to viruses.C．Their easiness of keeping and rapid growth.D．Their investment value and natural qualities.11．Why was Bennett’s operation regarded as a breakthrough?A．It introduced new medications to prevent organ rejection.B．It proved the potential for using organs from various animals.C．It guaranteed a sufficient supply of donor pigs for transplants.D．It offered a prospect of replacement organs through gene editing.A Dutch company has developed technology to follow the movements and activities of cows. The high-tech system, powered by AI and motion sensors, is called “The Intelligent Dairy Farmer’s Assistant.” The company, Connecterra, launched the system in the United States in December after several years of testing and operations in Europe.A device is put around the neck of the cow to record its movements. This information is then processed by a computer that uses AI to learn about the animal’s behavior over time. The system can tell farmers what the cow is doing in real time. This information can help predict when cattle get sick, become less productive or are ready for mating.Richard Watson owns the Seven Oaks Dairy in Waynesboro, Georgia. He was one of thefirst American farmers to use the high-tech system.“It can pick up whether the cow is eating, whether it is walking, whether it is drinking, whether it is laying down, standing up.”Watson said the system is a big help because it is impossible for farmers to keep up with the activities of each cow individually. He added that having a computer identify which of his 2,000 cattle need attention could help improve farm productivity by up to 10 percent. He estimates this difference could greatly increase his profits.“Just a 10 percent or five percent increase, or improvement in productivity, means hundreds of thousands of dollars to us, aside from the fact that we just want happier and healthier and more welfare in our animals, anyway.”The founder and head of Connecterra is Yasir Khokhar. He says the idea for the system came while he was living on a dairy farm south of Amsterdam.“It turns out the technology farmers use is really outdated in many aspects,” Khokhar told the Associated Press. He added that most of the technology that does exist is difficult to use. He says modern agriculture greatly needs new technology like this.The company says information about the cows can be collected and seen on a cellphone or other mobile device. A text message can also inform farmers of concerns involving the animals. 12．How does “the Intelligent Dairy Farmer’s Assistant” help farmers?A．By giving alarms to farmers.B．By focusing farmers’ attention on cattle.C．By sending real-time information about cows to farmers.D．By telling farmers which cow is less productive or ready to mate.13．What’s Watson’s attitude towards the high-tech system?A．Indifferent.B．Neutral.C．Passive.D．Confident. 14．Why did Khokhar come up with the idea of the high tech system?A．Because he once lived on a diary farm.B．Because some agricultural technologies were out of date.C．Because he wanted to increase the income of farmers.D．Because some farming systems turned out to be a failure.15．What does the passage mainly talks about?A．Modern agriculture in America.B．Ways of raising cows more efficiently.C．A Dutch company known as a high- tech system.D．“Smart Farm” technology tracking behavior of cows.Are you someone who easily gets tired and doesn’t feel like doing anything? Do you label this kind of behavior as mere laziness? 16Feel disconnected from everything.People experiencing exhaustion most commonly don’t feel like themselves anymore, don’t feel engaged by anything and constantly struggle with the sense of helplessness and inability to take back control of their lives.Used to be motivated and passionate.A clear difference between someone who’s worn out and someone who’s lazy is that the tired people used to have things they were passionate about. 17 And even hate doing anything because of how much they overworked themselves.Become moody and annoyed.Do you suddenly find yourself easily angry? 18 If you start to have trouble controlling your emotions, especially when it never used to be a problem for you, this might be the reason why.19One of the warning signs is that you start neglecting your self-care and socially keep away from others. You stop making an effort to dress up yourself or look good and you tend to spend most of your time by yourself doing nothing.Changes happen gradually.Studies show that exhaustion develops in five major stages, according to degrees of severity. The honeymoon phase, the onset of stress, chronic stress, exhaustion and habitual exhaustion. By the time you reach the final stage, exhaustion will make you suffer from depression and anxiety.20A．Ignore your self-care.B．Focus on warning signs.C．Do you often feel emotionally out of control?D．So it’s important to raise awareness about exhaustion.E．But the lazy people don’t ever devote themselves to things.F．However, they may now be struggling to find interest in anything.G．Here are five signs to show you’re experiencing exhaustion rather than laziness.二、完形填空I was then in my early twenties. Even though I was armed with a degree in Education, finding a 21 teaching job was not easy. I had to try some temporary ones.This year, when a golden opportunity 22 to teach 5th grade students in a local school.I 23 it and took things seriously. I 24 myself with lesson plans, taught with enthusiasm, and stayed 25 with the students. I had no hesitation in 26 the kids when they got the answer right, and encouraged them if they didn’t.One day when the kids were 27 , a girl approached and handed me a 28 before she went home. On it was a lovely drawing full of childlike wonder, 29 by the words, “You are the best teacher I have ever had!” It really amazed me that one of my kind comments had 30 that girl’s heart greatly. I took that note home and 31 put it in a folder, looking on it as a 32 because it was very important. Anytime I was feeling down I would look at it and it proved to be a 33 .That experience showed me the 34 of just a single kind word. It encouraged me to continue to try my best each day to 35 love and kindness through my words and actions. Wish the same for others.21．A．first-rate B．well-paid C．labor-saving D．full-time 22．A．escaped B．demanded C．arose D．arranged 23．A．jumped at B．thought about C．waited for D．dreamt of 24．A．occupied B．amused C．concerned D．contented 25．A．familiar B．positive C．strict D．consistent 26．A．evaluating B．supporting C．instructing D．congratulating 27．A．graded B．dismissed C．tested D．taught28．A．note B．gift C．parcel D．book 29．A．judged B．indicated C．emphasized D．accompanied 30．A．hardened B．touched C．broken D．gladdened 31．A．simply B．casually C．carefully D．eagerly 32．A．reminder B．treasure C．proof D．secret 33．A．comfort B．fortune C．fantasy D．privilege 34．A．target B．application C．power D．principle 35．A．clarify B．find C．feel D．spread三、语法填空阅读下面短文，在空白处填入1个适当的单词或括号内单词的正确形式。

雅思作文-100句第6次课76-90句翻译

76. 免费上大学使得家景不好的学生有同等的上学机会正确的句子: Free university education makes it possible for students from less well-offbackgrounds to have equal access to tertiary education.我的句子： Free tuition fees encourages 主谓不一致 students from poor families to have theequal opportunity to access to education. (have equal opportunities to receive an education ) 形式主语：It is possible for students from less well-off backgrounds to have equal access to tertiary education due to free university education.Have equal access to 对..有平等机会Access 不可数n 前面不用加定冠词或不定冠词。

等同availableHave easy access to 更容易Access (v)接触到…信息动词形式用的较少上大学: Higher education / university education / college educationFree tuition 不可数美式 /free tuition fees 英式可数 / Free university education 免费上大学 from less well-off backgrounds 省略 who are 家境不好或 disadvantaged / deprived 穷 well-off backgrounds 家境好Free col ege oduedtion allots the student who cannot of forded have equally trance to study.The student 表示特指没有必要用students情态动词Can 后接动词原形 do 改为affordHave equally chance 此处equally 是副词不修饰名词应改为equal 且本句语意不对，应改为 to study at university改：Free college education allows students who cannot afford tuition fees to have an equal chance to study at university. Mb i IL ir =-主谓不一致Students 前不用加theGet equal access to 不准确一般用 have改：Free university education allows students from disadvantaged backgrounds to have equal access to education.uirn td&aJm tan ill 匡 lor iluderits. ffomi b^kgroiind e-qudl tducaliori-定语从句没有谓语应加areMake it possible for sb to have an education/ receive an equal education改：Free university education can make it possible for students who are from disadvantaged to have anequal education.Rifr!- LJ 'M L iryfdu irn ,a i i I. r ，s mf* ■ r fri'Hmdr ' I 上m 1以『％七为M H m i* i pi i r? .耳m _ _ 一 _77.很多人觉得自己有必要赶时尚。

大学英语四级完形填空30篇(附答案)-打印版

大学英语四级完形填空第一篇Most people have no idea of the hard work and worry that goes into the collecting of those fascinating birds and animals that they pay to see in the zoo.One of the questions that is always asked of me is (1) I became an animal collector in the first (2).The answer is that I have always been interested in animals and zoos.According to my parents, the first word I was able to say with any (3) was not the conventional “mamma”or “daddy”, (4) the word “zoo”, which I would (5) over and over again with a shrill (6) until someone, in groups to (7) me up, would take me to the zoo.When I (8) a little older, we lived in Greece and I had a great (9) of pets, ranging from owls to seahorses, and I spent all my spare time (10) the countryside in search of fresh specimens to (11) to my collection of pets.(12) on I went for a year to the City Zoo, as a student (13) , to get experience of the large animals, such as lions, bears, bison and ostriches, (14) were not easy to keep at home.When I left, I (15) had enough money of my own to be able to (16) my first trip and I have been going (17) ever since then.Though a collector's job is not an easy one and is full of (18), it is certainly a job which will appeal (19) all those who love animals and (20) .1.A.how B.where C.when D.whether2.A.region B.field C.place D.case3.A.clarity B.emotion C.sentiment D.affection4.A.except B.but C.except for D.but for5.A.recite B.recognize C.read D.repeat6.A.volume B.noise C.voice D.pitch7.A.close B.shut C.stop fort8.A.grew B.was growing C.grow D.grown9.A.many B.amount C.number D.supply10.A.living B.cultivating C.reclaiming D.exploring11.A.increase B.include C.add D.enrichter B.further C.then D.subsequently13.A.attendant B.keeper C.member D.aide14.A.who B.they C.of which D.which15.A.luckily B.gladly C.nearly D.successfully16.A.pay B.provide C.allow D.finance17.A.normally B.regularly ually D.often18.A.expectations B.sorrows C.excitement D.disappointments19.A.for B.with C.to D.from20.A.excursion B.travel C.journey D.Trip第一篇解析:1.【答案】A 根据下一句及随后的内容, 作者讲的是怎样成为动物爱好者的(从小就喜欢动物), 应当选择A.how。

1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。

abstract
In this paper, we extend the multiple traveling repairman problem by considering a limitation on the total distance that a vehicle can travel; the resulting problem is called the multiple traveling repairmen problem with distance constraints (MTRPD). In the MTRPD, a ﬂeet of identical vehicles is dispatched to serve a set of customers. Each vehicle that starts from and ends at the depot is not allowed to travel a distance longer than a predetermined limit and each customer must be visited exactly once. The objective is to minimize the total waiting time of all customers after the vehicles leave the depot. To optimally solve the MTRPD, we propose a new exact branch-and-price-and-cut algorithm, where the column generation pricing subproblem is a resource-constrained elementary shortest-path problem with cumulative costs. An ad hoc label-setting algorithm armed with bidirectional search strategy is developed to solve the pricing subproblem. Computational results show the effectiveness of the proposed method. The optimal solutions to 179 out of 180 test instances are reported in this paper. Our computational results serve as benchmarks for future researchers on the problem.
article info
Article history: Received 13 October 2012 Accepted 12 September 2013 Available online 21 September 2013
Keywords: Branch-and-price Branch-and-price-and-cut Traveling repairmen problem Distance constraint
a Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong b School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China
Discrete Optimization
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
Zhixing Luo a, Hu Qin b,⇑, Andrew Lim a
⇑ Corresponding author. Tel.: +852 64117909, +86 13349921096; fax: +86 27
87556437. E-mail addresses: luozx.hkphd@ (Z. Luo), tigerqin1980@,
tigerqin@ (H. Qin), lim.andrew@.hk (A. Lim).
0377-2217/$ - see front matter Ó 2013 Elsevier B.V. All rights reserved. /10.1016/j.ejor.2013.09.014
Ó 2013 Elsevier B.V. All rights reserved.
1. Introduction
The traveling repairman problem (TRP) has been extensively studied by a large number of researchers (e.g., Afrati, Cosmadakis, Papadimitrious, Papageorgiou, & Papakostantinou (1986), García, Jodrá, & Tejel (2002), and Salehipour, Sörensen, Goos, & Bräysy (2011)); this problem is also termed the minimum latency problem (Arora & Karakostas, 2003; Archer, Levin, & Williamson, 2008; Blum et al., 1994), the traveling deliveryman problem (Fischetti, Laporte, & Martello, 1993; Méndez-Díaz, Zabala, & Lucena, 2008; Minieka, 1989) and the cumulative traveling salesman problem (Bianco, Mingozzi, & Ricciardelli, 1993). The TRP is deﬁned on a complete graph G = (V, E), where V = {0, 1, . . . , n, n + 1} is the vertex set and E = {(i, j): i, j 2 V, i – j, i – n + 1, j – 0} is the edge set. Vertices 0 and n + 1 represent the exit from and the entrance to the depot, respectively. We denote the vertices representing the set of n customers by VC = {1, . . . , n}. The repairman (henceforth referred to as vehicle) is assumed to travel at a constant speed. Each edge (i, j) has a non-negative length di,j and requires a non-negative traversing time ti,j, which is symmetric, i.e., ti,j = tj,i, and satisﬁes the triangle
European Journal of Operational Research 234 (2014) 49–60
Contents lists available at ScienceDirect
European Jouห้องสมุดไป่ตู้nal of Operational Research
journal homepage: /locate/ejor
This paper studies an extension of the MTRP by involving a distance constraint that the route length (or duration) of each vehicle cannot exceed a predetermined limit L. This type of constraint usually stems from regulations on working hours for workers or arises in the home delivery of perishable products. We call the resulting problem the multiple traveling repairman problem with distance constraints (MTRPD) whose objective is to ﬁnd K routes such that each vertex is visited exactly once, the distance constraint is respected and the total waiting time of all customers is minimized. Examples of other vehicle routing models that incorporate the distance constraint can be found in Laporte, Nobert, and Desrochers (1985), Li, Simchi-Levi, and Desrochers (1992), and Erera, Morales, and Savelsbergh (2010).