共查询到20条相似文献，搜索用时 15 毫秒
1.
Previous route choice studies treated uncertainties as randomness; however, it is argued that other uncertainties exist beyond random effects. As a general modeling framework for route choice under uncertainties, this paper presents a model of route choice that incorporates hyperpath and network generalized extreme-value-based link choice models. Accounting for the travel time uncertainty, numerical studies of specified models within the proposed framework are conducted. The modeling framework may be helpful in various research contexts dealing with both randomness and other non-probabilistic uncertainties that cannot be exactly perceived. 相似文献
2.
3.
THE U.S. AIRFREIGHT INDUSTRY, by Nawal K. Taneja. Lexington Books, Lexington, Mass., 1979. 244 pp. TRAFFIC, OPERATIONAL RESEARCH, FUTUROLOGY, by Arne Jensen. North Holland Publishing Company, Amsterdam, 1980. 321 pp. ($39.00) PROBLEMS OF THE CARLESS, by R. E. Paaswell and W. W. Recker. Praeger Publishers, New York, 1978. 190 pp. TRANSPORTATION AND THE ELDERLY, by Martin Wachs. University of California Press, Berkeley, 1980. PUBLIC TRANSPORTATION: PLANNING, OPERATIONS AND MANAGEMENT, edited by George E. Gray and Lester A Hoel. Prentice Hall, Englewood Cliffs, New Jersey, 1979. 749 pp. ETHYL ALCOHOL PRODUCTION AND USE AS A MOTOR FUEL, edited by J. K. Paul. Noyes Data Corporation, New Jersy, 1979. 354 pp ($48.00). URBAN PLANNING AND PUBLIC TRANSPORT, edited by Roy Cresswell. The Construction Press, London, 1980. 172 pp. (£15.00) 相似文献
4.
Flavio Baita Walter Ukovich Raffaele Pesenti Daniela Favaretto 《Transportation Research Part A: Policy and Practice》1998,32(8):585-598
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. 相似文献
5.
Strict limits on the maximum sulphur content in fuel used by ships have recently been imposed in some Emission Control Areas (ECAs). In order to comply with these regulations many ship operators will switch to more expensive low-sulphur fuel when sailing inside ECAs. Since they are concerned about minimizing their costs, it is likely that speed and routing decisions will change because of this. In this paper, we develop an optimization model to be applied by ship operators for determining sailing paths and speeds that minimize operating costs for a ship along a given sequence of ports. We perform a computational study on a number of realistic shipping routes in order to evaluate possible impacts on sailing paths and speeds, and hence fuel consumption and costs, from the ECA regulations. Moreover, the aim is to examine the implications for the society with regards to environmental effects. Comparisons of cases show that a likely effect of the regulations is that ship operators will often choose to sail longer distances to avoid sailing time within ECAs. Another effect is that they will sail at lower speeds within and higher speeds outside the ECAs in order to use less of the more expensive fuel. On some shipping routes, this might give a considerable increase in the total amount of fuel consumed and the CO2 emissions. 相似文献
6.
Electric vehicles (EVs) are promising alternative to conventional vehicles, due to their low fuel cost and low emissions. As a subset of EVs, plug-in hybrid electric vehicles (PHEVs) backup batteries with combustion engines, and thus have a longer traveling range than battery electric vehicles (BEVs). However, the energy cost of a PHEV is higher than a BEV because the gasoline price is higher than the electricity price. Hence, choosing a route with more charging opportunities may result in less fuel cost than the shortest route. Different with the traditional shortest-path and shortest-time routing methods, we propose a new routing choice with the lowest fuel cost for PHEV drivers. Existing algorithms for gasoline vehicles cannot be applied because they never considered the regenerative braking which may result in negative energy consumption on some road segments. Existing algorithms for BEVs are not competent too because PHEVs have two power sources. Thus, even if along the same route, different options of power source will lead to different energy consumption. This paper proposes a cost-optimal algorithm (COA) to deal with the challenges. The proposed algorithm is evaluated using real-world maps and data. The results show that there is a trade-off between traveling cost and time consumed when driving PHEVs. It is also observed that the average detour rate caused by COA is less than 14%. Significantly, the algorithm averagely saves more than 48% energy cost compared to the shortest-time routing. 相似文献
8.
Maritime transportation, the primary mode for intercontinental movement of crude oil, accounts for 1.7 billion tons annually – bulk of which are carried via a fleet of large crude oil tankers. Although spectacular episodes such as Exxon Valdez underline the significant risk and tremendous cost associated with marine shipments of hazardous materials, maritime literature has focused only on the cost-effective scheduling of these tankers. It is important that oil transport companies consider risk, since the insurance premiums is contingent on the expected claim. Hence through this work, we present a mixed-integer optimization program – with operating cost and transport risk objectives, which could be used to prepare routes and schedules for a heterogeneous fleet of crude oil tankers. The bi-objective model was tested on a number of problem instances of realistic size, which were further analyzed to conclude that the cheapest route may not necessarily yield the lowest insurance premiums, and that larger vessels should be used if risk is more important as it enables better exploitation of the risk structure. 相似文献
9.
This paper proposes a new heuristic algorithm for the Capacitated Location-Routing Problem (CLRP), called Granular Variable Tabu Neighborhood Search (GVTNS). This heuristic includes a Granular Tabu Search within a Variable Neighborhood Search algorithm. The proposed algorithm is experimentally compared on the benchmark instances from the literature with several of the most effective heuristics proposed for the solution of the CLRP, by taking into account the CPU time and the quality of the solutions obtained. The computational results show that GVTNS is able to obtain good average solutions in short CPU times, and to improve five best known solutions from the literature. The main contribution of this paper is to show a successful new heuristic for the CLRP, combining two known heuristic approaches to improve the global performance of the proposed algorithm for what concerns both the quality of the solutions and the computing times required to find them. 相似文献
10.
The inconsistence between system optimality and user optimality represents one of the key difficulties on network traffic congestion control. The advanced connected vehicle systems, enabling smart vehicles to possess/exchange real-time information and conduct portable computation, provide new opportunities to address this challenge. Motivated by this view, this study proposes a coordinated online in-vehicle routing mechanism with intentional information provision perturbation (CRM-IP), which seeks to shape individual vehicles online routing decisions so that user optimality and system optimality are balanced, by exploiting bounded rationality of the users. The proposed CRM-IP is modeled as a pure strategy atomic routing game, and implemented by a sequentially updating distributed algorithm. The mathematical analysis is conducted to quantify the absolute gain of system optimality corresponding to the loss of user optimality resulting from a given level of the information perturbation in the worst case so that the efficiency of the information perturbation can be evaluated. Furthermore, numerical experiments conducted based on City of Sioux Falls network investigate the average effects of the CRM-IP on system optimality and user optimality under various network traffic conditions, comparing to the CRM developed by Du et al. (in press). The results indicate that the improvement of system optimality and the reduction of individual vehicles’ travel time from the CRM is more significant when the network traffic is under an mild congestion state, such as under the levels of service (LOS’s) C, D, and E, rather than under extremely sparse or congested states, such as under LOS’s A and B, or F. Moreover, higher level of information perturbation benefits system optimality more, but the marginal effect decreases after the perturbation reaching certain level, such as in this case study. In addition, a portion of vehicles may sacrifice user optimality due to the information perturbation, but the extent of the sacrifice is not significant, even though it increases with the information perturbation level. Hence, a small information perturbation is recommended to achieve an efficient network traffic control through the CRM-IP. Overall, this study proposes the CRM-IP as an efficient routing mechanism, which has a great potential to guide the routing decisions of individual vehicles so that their collective behavior improve network performance in both system optimality and user optimality. 相似文献
11.
This paper proposes a mathematical model for the train routing and timetabling problem that allows a train to occasionally switch to the opposite track when it is not occupied, which we define it as switchable scheduling rule. The layouts of stations are taken into account in the proposed mathematical model to avoid head-on and rear-end collisions in stations. In this paper, train timetable could be scheduled by three different scheduling rules, i.e., no switchable scheduling rule (No-SSR) which allows trains switching track neither at stations and segments, incomplete switchable scheduling rule (In-SSR) which allows trains switching track at stations but not at segments, and complete switchable scheduling rule (Co-SSR) which allows trains switching track both at stations and segments. Numerical experiments are carried out on a small-scale railway corridor and a large-scale railway corridor based on Beijing–Shanghai high-speed railway (HSR) corridor respectively. The results of case studies indicate that Co-SSR outperforms the other two scheduling rules. It is also found that the proposed model can improve train operational efficiency. 相似文献
12.
Multi-echelon distribution strategy is primarily to alleviate the environmental (e.g., energy consumption and emissions) consequence of logistics operations. Differing from the long-term strategic problems (e.g., the two-echelon vehicle routing problem (2E-VRP), the two-echelon location routing problem (2E-LRP) and the truck and trailer routing problem (TTRP)) that make location decisions in depots or satellites, the paper introduces a short-term tactical problem named the two-echelon time-constrained vehicle routing problem in linehaul-delivery systems (2E-TVRP) considering carbon dioxide (CO2) emissions. The linehaul level and the delivery level are linked through city distribution centers (CDCs). The 2E-TVRP, which takes CO2 emissions per ton-kilometer as the objective, has inter-CDC linehaul on the 1st level and delivery from CDCs to satellites on the 2nd level. The Clarke and Wright savings heuristic algorithm (CW) improved by a local search phase is put forward. The case study shows the applicability of the model to real-life problems. The results suggest that the vehicle scheduling provided by the 2E-TVRP is promising to reduce the CO2 emissions per ton-kilometer of the linehaul-delivery system. Adjusting the central depot location or developing the loaded-semitrailer demand among O-D pairs to eliminate empty-running of tractors will contribute to reduce the CO2 emission factor. 相似文献
13.
Increasing concerns on supply chain sustainability have given birth to the concept of closed-loop supply chain. Closed-loop supply chains include the return processes besides forward flows to recover the value from the customers or end-users. Vendor Managed Inventory (VMI) systems ensure collaborative relationships between a vendor and a set of customers. In such systems, the vendor takes on the responsibility of product deliveries and inventory management at customers. Product deliveries also include reverse flows of returnable transport items. The execution of the VMI policy requires vendor to deal with a Closed-loop Inventory Routing Problem (CIRP) consisting of its own forward and backward routing decisions, and inventory decisions of customers. In CIRP literature, traditional assumptions of disregarding reverse logistic operations, knowing beforehand distribution costs between nodes and customers demand, and managing single product restrict the usage of the proposed models in current food logistics systems. From this point of view, the aim of this research is to enhance the traditional models for the CIRP to make them more useful for the decision makers in closed-loop supply chains. Therefore, we propose a probabilistic mixed-integer linear programming model for the CIRP that accounts for forward and reverse logistics operations, explicit fuel consumption, demand uncertainty and multiple products. A case study on the distribution operations of a soft drink company shows the applicability of the model to a real-life problem. The results suggest that the proposed model can achieve significant savings in total cost and thus offers better support to decision makers. 相似文献
14.
In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with traditional fuel. The vehicle may change propulsion mode at any point of time. The unitary travel cost is much lower for distances covered in the electric mode. An electric battery has a limited capacity and may be recharged at a recharging station (RS). A limited number of RS are available. Once a battery has been completely discharged, the vehicle automatically shifts to traditional fuel propulsion mode. Furthermore, a maximum route duration is imposed according to contracts regulations established with the driver. In this paper, a Mixed Integer Linear Programming formulation is presented and a Large Neighborhood Search based Matheuristic is proposed. The algorithm starts from a feasible solution and consists into destroying, at each iteration, a small number of routes, letting unvaried the other ones, and reconstructing a new feasible solution running the model on only the subset of customers involved in the destroyed routes. This procedure allows to completely explore a large neighborhood within very short computational time. Computational tests that show the performance of the matheuristic are presented. The method has also been tested on a simplified version of the HVRP already presented in the literature, the Green Vehicle Routing Problem (GVRP), and competitive results have been obtained. 相似文献
15.
The routing, scheduling and fleet deployment is an important integrated planning problem faced by liner shipping companies which also lift load from the spot market. This paper is concerned with coordinating the decisions of the assignment of ships to contractual and spot voyages, and the determination of ship routes and schedules in order to maximize profit. We propose a new model for representing voyages as nodes of a directed graph which is used to build a mixed integer programming formulation. Besides contractual and spot nodes, another type of node is put forward to represent a combination of a contractual voyage with one or more spot voyages. In addition, the concept of dominated nodes is introduced in order to discard them and reduce the effort of the search for an optimal solution. A set of test problems has been generated taking into account real world assumptions. The test problems are solved by an optimization software and computational results are reported. The results show the potential of the approach to solve test problems of moderate size. 相似文献
16.
Allocating efficient routes to taxiing aircraft, known as the Ground Movement problem, is increasingly important as air traffic levels continue to increase. If taxiways cannot be reliably traversed quickly, aircraft can miss valuable assigned slots at the runway or can waste fuel waiting for other aircraft to clear. Efficient algorithms for this problem have been proposed, but little work has considered the uncertainties inherent in the domain. This paper proposes an adaptive Mamdani fuzzy rule based system to estimate taxi times and their uncertainties. Furthermore, the existing Quickest Path Problem with Time Windows (QPPTW) algorithm is adapted to use fuzzy taxi time estimates. Experiments with simulated taxi movements at Manchester Airport, the third-busiest in the UK, show the new approach produces routes that are more robust, reducing delays due to uncertain taxi times by 10–20% over the original QPPTW. 相似文献
17.
This study proposes a coordinated online in-vehicle routing mechanism for smart vehicles with real-time information exchange and portable computation capabilities. The proposed coordinated routing mechanism incorporates a discrete choice model to account for drivers’ behavior, and is implemented by a simultaneously-updating distributed algorithm. This study shows the existence of an equilibrium coordinated routing decision for the mixed-strategy routing game and the convergence of the distributed algorithm to the equilibrium routing decision, assuming individual smart vehicles are selfish players seeking to minimize their own travel time. Numerical experiments conducted based on Sioux Falls city network indicate that the proposed distributed algorithm converges quickly under different smart vehicle penetrations, thus it possesses a great potential for online applications. Moreover, the proposed coordinated routing mechanism outperforms traditional independent selfish-routing mechanism; it reduces travel time for both overall system and individual vehicles, which represents the core idea of Intelligent Transportation Systems (ITS). 相似文献
18.
Floating car based travel times for city logistics 总被引：4，自引：0，他引：4
Jan Fabian Ehmke Stephan Meisel Dirk Christian Mattfeld 《Transportation Research Part C: Emerging Technologies》2012,21(1):338-352
City logistics routing requires time-dependent travel times for each network link. We rely on the concept of Floating Car Data (FCD) to develop and provide such travel times. Different levels of aggregation in the determination of time-dependent travel times from a database of historical FCD are presented and evaluated with regard to routing quality. Furthermore, a Data Mining approach is introduced, allowing for a substantial reduction of the volume of input data required for city logistics routing. The different approaches are investigated and evaluated by a huge amount of FCD collected for the urban area of Stuttgart, Germany. The results show that the Data Mining approach enables efficient provision of time-dependent travel times without a significant loss of routing quality for city logistics applications. 相似文献
19.
Marco Diana 《运输规划与技术》2013,36(4):315-331
When considering innovative forms of public transport for specific groups, such as demand responsive services, the challenge is to find a good balance between operational efficiency and 'user friendliness' of the scheduling algorithm even when specialized skills are not available. Regret insertion-based processes have shown their effectiveness in addressing this specific concern. We introduce a new class of hybrid regret measures to understand better why the behaviour of this kind of heuristic is superior to that of other insertion rules. Our analyses show the importance of keeping a good balance between short- and long-term strategies during the solution process. We also use this methodology to investigate the relationship between the number of vehicles needed and total distance covered - the key point of any cost analysis striving for greater efficiency. Against expectations, in most cases decreasing fleet size leads to savings in vehicle mileage, since the heuristic solution is still far from optimality. 相似文献
20.
The consideration of pollution in routing decisions gives rise to a new routing framework where measures of the environmental implications are traded off with business performance measures. To address this type of routing decisions, we formulate and solve a bi-objective time, load and path-dependent vehicle routing problem with time windows (BTL-VRPTW). The proposed formulation incorporates a travel time model representing realistically time varying traffic conditions. A key feature of the problem under consideration is the need to address simultaneously routing and path finding decisions. To cope with the computational burden arising from this property of the problem we propose a network reduction approach. Computational tests on the effect of the network reduction approach on determining non-dominated solutions are reported. A generic solution framework is proposed to address the BTL-VRPTW. The proposed framework combines any technique that creates capacity-feasible routes with a routing and scheduling method that aims to convert the identified routes to problem solutions. We show that transforming a set of routes to BTL-VRPTW solutions is equivalent to solving a bi-objective time dependent shortest path problem on a specially structured graph. We propose a backward label setting technique to solve the emerging problem that takes advantage of the special structure of the graph. The proposed generic solution framework is implemented by integrating the routing and scheduling method into an Ant Colony System algorithm. The accuracy of the proposed algorithm was assessed on the basis of its capability to determine minimum travel time and fuel consumption solutions. Although the computational results are encouraging, there is ample room for future research in algorithmic advances on addressing the proposed problem. 相似文献