首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   132篇
  免费   36篇
公路运输   21篇
综合类   5篇
水路运输   16篇
铁路运输   2篇
综合运输   124篇
  2022年   1篇
  2021年   2篇
  2020年   1篇
  2019年   2篇
  2018年   2篇
  2017年   2篇
  2016年   28篇
  2015年   9篇
  2014年   12篇
  2013年   41篇
  2012年   4篇
  2011年   10篇
  2010年   7篇
  2009年   7篇
  2008年   9篇
  2007年   4篇
  2006年   4篇
  2005年   5篇
  2004年   5篇
  2002年   2篇
  2001年   4篇
  2000年   1篇
  1998年   1篇
  1997年   1篇
  1995年   1篇
  1992年   1篇
  1988年   1篇
  1975年   1篇
排序方式: 共有168条查询结果,搜索用时 15 毫秒
1.
This paper focuses on the evaluation processes by which decisions regarding transportation alternatives can be assisted. A multidimensional approach usually called multiple criteria decision making is required to represent the complexity of transportation policy and systems.

The multiple criteria decision making techniques can be divided into two groups. The first is based on a ranking scheme approach and the second on a mathematical programming approach.

A multiple objective mathematical programming procedure known as Goal Programming is presented. The authors examined the use of that procedure in real transportation problems.

The results suggest that multiple objective mathematical programming techniques in general do not appear to be appropriate in transportation policy analysis involving mutually exclusive alternatives. Their use can be limited to special cases in the private sector.  相似文献   
2.
A multi‐objective, time‐staged network‐design problem is formulated. Through transformation, the problem is decomposed into a set of single‐period, single‐objective problems. Lexicographic ordering is instrumental in effecting this transformation; it also allows a backward‐recursion algorithm to be applied using strong pruning criteria. Furthermore, monotonicity properties enable us to solve the problem using the familiar tree‐search algorithms. The solution method has several desirable properties — as shown by an example and a case study of Tripoli Province, Libya. First, the algorithm ensures continuity of project implementation over the multi time‐periods and provides optimality in later computational stages irrespective of the decision at an interim stage. Second, the algorithm tends to provide accessibility to unconnected regions in the study area at low user‐cost without employing weights to the two objective functions of accessibility and user‐cost efficiency. Such a property is deemed advantageous for suggesting transportation investments based purely on purchasing the greatest benefit for each dollar, with political neutrality strictly maintained.  相似文献   
3.
In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer‐walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run‐time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision‐making has been confirmed by the positive feedback that was obtained from survey questionnaires.  相似文献   
4.
Under certain assumptions, values of travel time (VOT) can be divided into two parts: one associated with travel (i.e., the value of reducing travel time disutility) and the other associated with activities (the shadow price of time). The empirical results of combining RP and SP data showed that the VOT of travel was greater than that of activity. The results also showed that SP experiments that did not take or only took part of activities into consideration would underestimate VOT.  相似文献   
5.
Santa Clara County, California experienced a sharp growth in demand‐responsive paratransit ridership for individuals with disabilities, as a result of the passage of the 1990 Americans With Disabilities Act (ADA). This paper describes an automated paratransit system for the ADA‐type paratransit operation implemented in Santa Clara County. It automated paratransit reservation, scheduling, and routing functions. The key components of this system were a digital geographic database (DGD) and an automated trip scheduling system (ATSS). Empirical evidence after one year of operation indicates numerous benefits of this automation. There were significant reductions in the paratransit operating costs and an increase in the percent shared rides. The savings in operating costs far exceeded the annualized capital cost of automation. A user survey indicates that these improvements were achieved without degradation to service quality such as vehicle on‐time performance, invehicle travel times, vehicle response to open return, and ride comfort.  相似文献   
6.
ABSTRACT

This article reports on the development of a trip reconstruction software tool for use in GPS-based personal travel surveys. Specifically, the tool enables the automatic processing of GPS traces of individual survey respondents in order to identify the road links traveled and modes used by each respondent for individual trips. Identifying the links is based on a conventional GIS-based map-matching algorithm and identifying the modes is a rule-based algorithm using attributes of four modes (walk, bicycle, bus and passenger-car). The tool was evaluated using GPS travel data collected for the study and a multi-modal transportation network model of downtown Toronto. The results show that the tool correctly detected about 79% of all links traveled and 92% of all trip modes.  相似文献   
7.
This research is aimed at developing a model that maximizes system profit when determining the aircraft routes and flight frequencies in a network. The model employs network flow techniques to effectively collect or deliver passenger flows from all origins to all destinations using non‐stop and multi‐stop flights in multi‐fleet operations. The model was formulated as a multi‐commodity network flow problem. A Lagrangian‐based algorithm was developed to solve the problem. To test the model in practice, a case study is presented.  相似文献   
8.
A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This proof has found several interesting applications. However, many existing RFID yoking schemes are vulnerable to replay attacks. To overcome the weaknesses, Cho et al. proposed a new RFID yoking proof protocol and a new grouping protocol. Unfortunately, Cho et al.’s schemes are still vulnerable to replay attacks. In this paper, in addition to demonstrating weaknesses, we further discuss the rationale behind these weaknesses to provide a guide line for designing secure RFID yoking schemes. Based on the guide line, we propose a new RFID yoking scheme and a new RFID grouping scheme. Performance evaluation shows that our scheme outperforms its counterparts.  相似文献   
9.
10.
The transport demand in most major cities around the world can only be met with a high‐quality public transport system. The requirements on bus, rail, underground and tram systems are manifold with reliability and efficiency as the key factors. The service operating hours and the size of the network are often extended in order to serve the needs better. Further, most metropolitan areas are trying to provide more incentives for citizens to leave the car at home and use the local transit systems instead. The reasons are well known. Not only does a public transport system only make economical sense if it is well used, but most urban areas with a high car‐dependency face at least three major problems; safety, congestion, and pollution (noise and air pollution, land separation, etc.). It is generally recognised that to decrease car usage and to increase public transport usage a stick & carrot approach is needed. The London congestion‐charging scheme is an example since all revenues collected by the scheme are put into the improvement of bus and underground services.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号