为什么客运大巴屡屡被砸?

对于客运大巴运营者来说,黄金周、春节等客运的高峰时期,往往是其一年中在票价上得以"舒展筋骨"赚得瓢满钵满的时间.在高额利润的驱动下,形形色色的挂靠车、承包车甚至由私家车客串的"黑车"与公车一齐争客.争抢当时,旅客行李被抢上一台车,而人被推上另一台车的情形并不少见.     

上汽大通澳洲市场演绎品牌精髓

近日,上汽大通与澳洲高球宝贝丹尼尔·蒙哥马利签约,全程赞助其今年在全球各地举行的高尔夫巡回赛。随着中国几场重要的高尔夫比赛的开幕,上汽大通赞助的澳洲高尔夫球宝贝丹尼尔,正在享受她的中国之行。丹尼尔的出赛在吸引了澳洲用户目光的同时,于中国和澳洲的商用车用户中也引发了"上汽大通热"。事实证明,丹尼尔显然已成为了上汽大通品牌"技术、信赖、进取"精神的最佳代言。上汽大通在澳洲市场的大幕刚刚拉开,对丹尼尔的赞助支持也是其品牌开局的一部分。     

路桥的旗帜

中国是一个英雄辈出的国度,也是一个以英雄为旗帜的国度。1998年洪水袭击中国,百万将士以血肉之躯,迎接惊涛骇浪,是英雄的壮举;2008年汶川地震,生死系于一线,百万志愿者,以流血的双手扒出深埋于地下的生命,是英雄的博爱……     

为什么旅游市场运力矛盾重重?

随着市场的发展和深化,以大、中型团队为主的旅行方式逐渐减少,以家庭、朋友为团体的小规模特色旅游正成为一种新的形式和风尚.旅游市场的趋势为小型车发展提供了极大的商机.据相关部门近期对25家旅行社的调查,仅成都地区月需4-7座越野车、轿车1028台,8-12座商务车456台,13-20座小型商务客车189台.     

嘉实多推出世界终极球员

4月30日,世界终极球员模型在伦敦首次亮相,由嘉实多与科特迪瓦现任主帅斯文·约兰·埃里克森共同揭开其神秘面纱。这个模型拥有卡尔斯·普约尔的标志性长发、如哈维一般的琥珀色眼睛、如里奥内尔·梅西一般的灵活左脚、如蒂埃里·亨利一般的精准的右脚、如克斯蒂亚诺·罗纳尔多一般的极具爆发力的双腿、如彼得·克劳奇一般的惊人高度,堪称顶级球员的完美化身。     

2012壳牌劲霸再许“卡车梦”

在未来的品牌发展中,壳牌将凭借优异的产品和先进的技术,捍卫市场领先地位,继续为驾驶员提供一流的润滑油系列产品以及养护方案,并借由"寻找最劲霸卡车司机"活动,将默默耕耘的卡车司机群体推到台前,圆一个风采万种的"卡车梦"。在未来的品牌发展中,壳牌将凭借优异的产品和先进的技术,捍卫市场领先地位,继续为驾驶员提供一流的润滑油系列产品以及养护方案,并借由"寻找最劲霸卡车司机"活动,将默默耕耘的卡车司机群体推到台前,圆一个风采万种的"卡车梦"。     

钱塘江边的“桥痴”——寻访钱塘江大桥纪念馆文史科长钟光明

钱塘江大桥北岸,沿西侧引桥上行50米,钱塘江大桥的纪念馆就到了。从右手边插出的小路往里走,一栋二层小楼在几株郁郁葱葱的大树的掩护下若隐若现,树上知了忙着和小蚊子聊天,吱吱地叫。纪念馆就设在小楼的一层。记者来访时,钱塘江一年一度的观潮季还未到来。大概是听到门口的脚步声,一名身着干净白色衬衣精神     

代驾:如何让“正规军”战胜“游击队”

2011年5月9日晚,知名音乐人高晓松因酒后驾车发生交通事故。事故发生前,其朋友曾为他叫"酒后代驾"服务,高晓松在等待半小时后因未见驾驶员到来而自己开车,并在随后不久引发交通事故。在公众和媒体紧盯"醉驾入刑事案"时,高晓松成为第一个以身试法的名人。有数据表明,"酒后代驾"服务的需求发展迅猛。网上代驾业务的网站点击率呈明显上升势头,"5.1"之后的一个星期更是攀升40%以上。从过去的无人问津,到现在的一车难求,各地市场节节攀升。"酒后代驾"成为人们解决酒后用车出行的理性选择。代驾业务的迅速激增,背后的驱动力更多是基于酒驾入刑的威慑,但对整     

鹰之重生

老鹰是世界上寿命最长的鸟类。它的年龄最高可达70岁,但它在40岁时必须做出艰难却重要的决定:等死;或者经过一个十分痛苦的重生过程。因为它的爪子开始老化,无法有效地抓住猎物;它的喙变得又长又弯,不再像昔日那么灵活;它翅膀上的羽毛已经又浓又厚,使得飞翔十分吃力。有很多老鹰没有选择重生,因得不到食物而饿死。     

共赏阴极电泳车金旅展示"中国精品"

3月11日,上海2008 BAAV世界客车博览亚洲展会的金旅展台上,金旅大型客车整车车身阴极电泳线新闻发布会在这里拉开帷幕,经过整车阴极电泳打造的大客车全承载车身骨架也在这时被揭开其神秘的面纱.此项产品的发布标志着中国大型客车制造业的涂装工艺水平将提高到中档轿车的水平,达到国际客车生产一流的水平.     

Transport problems as perceived by inner city firms

The role of transport policy in assisting inner city firms is still unclear. This paper raises several important policy questions and reviews the findings of past research, which suggest that transport problems are a major irritant to inner city firms but are unlikely to cause them to leave the area, and that the ability of transport improvements to attract new firms is uncertain.It describes and presents the results of a recent study designed to determine the effect of transport problems on manufacturing and service industries, whether such problems are more serious in the inner city, and which solutions would be most appropriate. The study involved a series of detailed case studies of inner and outer city firms in Leeds and London. It identified as the most serious problems, congestion, public-transport problems, parking shortages and on-site delays for commercial vehicles. Similar problems arose in all areas, but were more severe in inner than in outer areas, and in London than in Leeds.The most common effect was lost time, but reduced efficiency, lost business, staff dissatisfaction and recruitment problems also occurred. Management had difficulty costing the effects of such problems, and often overlooked those incurred by others. The problems were, for the most part, local or site-specific, and are likely to be amenable to low-cost solutions. However, congestion and parking problems in inner London appear to merit area-wide treatment.A series of recommendations is provided for policy-makers.Further details of the study reported here are contained in a series of working papers which are available from the Institute for Transport Studies, University of Leeds.     

Ranking the substantive problems in the Dutch Cost–Benefit Analysis practice

This paper investigates the perceptions of key participants in the Dutch Cost–Benefit Analysis (CBA) practice regarding substantive problems when appraising spatial-infrastructure projects with CBA. Two research methods were applied. Firstly, 86 key participants in the Dutch CBA practice were interviewed in-depth in order to obtain an overview and a ranking of perceived substantive problems with CBA in the Netherlands. Secondly, the people interviewed were also asked to fill in a written questionnaire in which they were asked to rank the substantive problems once again, in order to improve the validity of the ranking; 74 of the participants completed this questionnaire. The most important conclusions of this paper are, firstly, that key participants in the Dutch CBA practice consider ‘problems with the estimation of the non-monetized project effects’ as the most important substantive problem cluster and ‘problems with monetizing project effects’ as the second most important substantive problem cluster. Secondly, key participants in the Dutch CBA practice consider the ‘problem analysis’ in a CBA to be a very important substantive problem. Thirdly, there is, in a broad sense, consensus among the different groups in the Dutch CBA practice concerning their perception of the seriousness of problem clusters and the way they rank the problem clusters. Fourthly, a large part of the substantive problems mentioned by the key participants in the Dutch CBA practice are non-specific CBA problems.     

Dynamic routing-and-inventory problems: a review

The paper presents a review of the available literature on a class of problems denoted as dynamic routing-and-inventory (DRAl) problems. They are characterized by the simultaneous relevance of routing and of inventory issues in a dynamic environment, within the framework of distribution logistics. A classification scheme is first proposed for these problems. Then the results obtained in this area are summarized. Finally, the papers available in the literature are clustered and discussed according to the proposed scheme.     

Application of genetic algorithm for scheduling and schedule coordination problems

The problems on scheduling and schedule co‐ordination usually have conflicting objectives related to user's cost and operator's cost. Users want to spend less time to wait, transfer and travel by public buses. Operators are interested in profit making by lesser vehicle operating cost and having a minimum number of buses. As far as level of service is concerned users are interested in lesser crowing while operators are concerned with maximizing profit and thus to have higher load factors. In schedule co‐ordination problems transfer time plays an important role. Users are interested in coordinating services with in acceptable waiting time whereas operators prefer to have lesser services and want to meet higher demands, which invariably increases waiting time. These problems have multiple conflicting objectives and constraints. It is difficult to determine optimum solution for such problems with the help of conventional approaches. It is found that Genetic Algorithm performs well for such multi objective problems.     

Rail freight transportation: A review of recent optimization models for train routing and empty car distribution

This paper describes two types of rail transportation problems in detail. These are train routing and makeup, and empty car distribution problems. Some of the recent optimization models which address these problems are reviewed and the areas for potential improvements in rail transportation literature are identified. The type of interactions which exist between routing, makeup, and empty car distribution decisions are highlighted and potential areas for future research are identified.     

Optimal shipment decisions for an airfreight forwarder: Formulation and solution methods

We study the freight forwarder’s shipment planning problem in an airfreight forwarding network where a set of cargo shipments have to be transported to given destinations. We provide mixed integer programming formulations that use piecewise-linear cargo rates and account for volume and weight constraints, flight departure/arrival times, as well as shipment-ready times.After exploring the solution of such models using CPLEX, we devise two solution methodologies to handle large problem sizes. The first is based on Lagrangian relaxation, where the problems decompose into a set of knapsack problems and a set of network flow problems. The second is a local branching heuristic that combines branching ideas and local search. The two approaches show promising results in providing good quality heuristic solutions within reasonable computational times, for difficult and large shipment consolidation problems.     

合资铁路重组背景下省级铁路平台可持续发展对策

在铁路行业高度垄断,铁路运营普遍效益欠佳和地方政府财力有限的现实环境下,特别是国铁集团近年来大力推行“一省一公司”合资铁路重组整合的改革,对省级铁路平台的发展带来了新的巨大的问题挑战,本文结合当前在全国大力推行的合资铁路重组改革的背景,分析了省级铁路平台在改革中将面临的重大问题,包括既有投融资能力难以支撑大规模规划项目建设、已建铁路运营大规模亏损、铁路行业建设运营高度垄断严重以及铁路土地综合开发进展迟缓等一系列问题,并针对以上问题提出相关的对策建议。     

南宁市农村道路交通安全问题及对策分析

文章结合南宁市农村地区交通安全现状，分析了当前农村道路交通安全工作中存在的主要问题，提出了解决问题的对策与思路。     

超高过渡段简支连续梁桥施工存在的问题及对策

文章结合具体工程实例,阐述了超高过渡段简支连续梁桥施工存在的主要问题,分析了问题产生的原因,并提出了相应的解决对策。     

A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios

These days, transportation and logistic problems in large cities are demanding smarter transportation services that provide flexibility and adaptability. A possible solution to this arising problem is to compute the best routes for each new scenario. In this problem, known in the literature as the dial-a-ride problem, a number of passengers are transported between pickup and delivery locations trying to minimize the routing costs while respecting a set of prespecified constraints. This problem has been solved in the literature with several approaches from small to medium sized problems. However, few efforts have dealt with large scale problems very common in massive scenarios (big cities or highly-populated regions). In this study, a new distributed algorithm based on the partition of the requests space and the combination of the routes is presented and tested on a set of 24 different scenarios of a large-scale problem (up to 16,000 requests or 32,000 locations) in the city of San Francisco. The results show that, not only the distributed algorithm is able to solve large problem instances that the corresponding sequential algorithm is unable to solve in a reasonable time, but also to have an average improvement of 9% in the smaller problems. The results have been validated by means of statistical procedures proving that the distributed algorithm can be an effective way to solve high dimensional dial-a-ride problems.