1,047 research outputs found
A branch and price approach for routing and refueling station location model
The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest path deviation tolerances of the drivers. We first provide an enhanced compact model based on a combination of existing models in the literature for this relatively new operations research problem. We then extend this problem and introduce the refueling station location problem which adds the routing aspect of the individual drivers. Our proposed branch and price algorithm relaxes the simple path assumption generally adopted in the existing studies and implicitly takes into account deviation tolerances without the pregeneration of the routes. Therefore, the decrease in solution times with respect to existing models is significant and our algorithm scales very efficiently to more realistic network dimensions. © 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved
An Alternative Fuel Refueling Station Location Model considering Detour Traffic Flows on a Highway Road System
With the development of alternative fuel (AF) vehicle technologies, studies on finding the potential location of AF refueling stations in transportation networks have received considerable attention. Due to the strong limited driving range, AF vehicles for long-distance intercity trips may require multiple refueling stops at different locations on the way to their destination, which makes the AF refueling station location problem more challenging. In this paper, we consider that AF vehicles requiring multiple refueling stops at different locations during their long-distance intercity trips are capable of making detours from their preplanned paths and selecting return paths that may be different from original paths for their round trips whenever AF refueling stations are not available along the preplanned paths. These options mostly need to be considered when an AF refueling infrastructure is not fully developed on a highway system. To this end, we first propose an algorithm to generate alternative paths that may provide the multiple AF refueling stops between all origin/destination (OD) vertices. Then, a new mixed-integer programming model is proposed to locate AF refueling stations within a preselected set of candidate sites on a directed transportation network by maximizing the coverage of traffic flows along multiple paths. We first test our mathematical model with the proposed algorithm on a classical 25-vertex network with 25 candidate sites through various scenarios that consider a different number of paths for each OD pair, deviation factors, and limited driving ranges of vehicles. Then, we apply our proposed model to locate liquefied natural gas refueling stations in the state of Pennsylvania considering the construction budget. Our results show that the number of alternative paths and deviation distance available significantly affect the coverage of traffic flows at the stations as well as computational time
Path Planning for Cooperative Routing of Air-Ground Vehicles
We consider a cooperative vehicle routing problem for surveillance and
reconnaissance missions with communication constraints between the vehicles. We
propose a framework which involves a ground vehicle and an aerial vehicle; the
vehicles travel cooperatively satisfying the communication limits, and visit a
set of targets. We present a mixed integer linear programming (MILP)
formulation and develop a branch-and-cut algorithm to solve the path planning
problem for the ground and air vehicles. The effectiveness of the proposed
approach is corroborated through extensive computational experiments on several
randomly generated instances
A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification
The growth of environmental awareness and more robust enforcement of numerous regulations to reduce greenhouse gas (GHG) emissions have directed efforts towards addressing
current environmental challenges. Considering the Vehicle Routing Problem (VRP), one of the effective strategies to control greenhouse gas emissions is to convert the fossil fuel-powered fleet
into Environmentally Friendly Vehicles (EFVs). Given the multitude of constraints and assumptions defined for different types of VRPs, as well as assumptions and operational constraints specific to each
type of EFV, many variants of environmentally friendly VRPs (EF-VRP) have been introduced. In this paper, studies conducted on the subject of EF-VRP are reviewed, considering all the road transport
EFV types and problem variants, and classifying and discussing with a single holistic vision. The aim of this paper is twofold. First, it determines a classification of EF-VRP studies based on different
types of EFVs, i.e., Alternative-Fuel Vehicles (AFVs), Electric Vehicles (EVs) and Hybrid Vehicles (HVs). Second, it presents a comprehensive survey by considering each variant of the classification,
technical constraints and solution methods arising in the literature. The results of this paper show that studies on EF-VRP are relatively novel and there is still room for large improvements in several
areas. So, to determine future insights, for each classification of EF-VRP studies, the paper provides the literature gaps and future research needs
The Bi-objective Long-haul Transportation Problem on a Road Network
In this paper we study a long-haul truck scheduling problem where a path has
to be determined for a vehicle traveling from a specified origin to a specified
destination. We consider refueling decisions along the path, while accounting
for heterogeneous fuel prices in a road network. Furthermore, the path has to
comply with Hours of Service (HoS) regulations. Therefore, a path is defined by
the actual road trajectory traveled by the vehicle, as well as the locations
where the vehicle stops due to refueling, compliance with HoS regulations, or a
combination of the two. This setting is cast in a bi-objective optimization
problem, considering the minimization of fuel cost and the minimization of path
duration. An algorithm is proposed to solve the problem on a road network. The
algorithm builds a set of non-dominated paths with respect to the two
objectives. Given the enormous theoretical size of the road network, the
algorithm follows an interactive path construction mechanism. Specifically, the
algorithm dynamically interacts with a geographic information system to
identify the relevant potential paths and stop locations. Computational tests
are made on real-sized instances where the distance covered ranges from 500 to
1500 km. The algorithm is compared with solutions obtained from a policy
mimicking the current practice of a logistics company. The results show that
the non-dominated solutions produced by the algorithm significantly dominate
the ones generated by the current practice, in terms of fuel costs, while
achieving similar path durations. The average number of non-dominated paths is
2.7, which allows decision makers to ultimately visually inspect the proposed
alternatives
The role of operational research in green freight transportation
Recent years have witnessed an increased awareness of the negative external impacts of freight transportation. The field of Operational Research (OR) has, particularly in the recent years, continued to contribute to alleviating the negative impacts through the use of various optimization models and solution techniques. This paper presents the basic principles behind and an overview of the existing body of recent research on âgreeningâ freight transportation using OR-based planning techniques. The particular focus is on studies that have been described for two heavily used modes for transporting freight across the globe, namely road (including urban and electric vehicles) and maritime transportation, although other modes are also briefly discussed
- âŠ