3,914 research outputs found
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services
The operation of a demand responsive transport service usually involves the management of dynamic requests. The underlying algorithms are mainly adaptations of procedures carefully designed to solve static versions of the problem, in which all the requests are known in advance. However there is no guarantee that the effectiveness of an algorithm stays unchanged when it is manipulated to work in a dynamic environment. On the other hand, the way the input is revealed to the algorithm has a decisive role on the schedule quality. We analyze three characteristics of the information flow (percentage of real-time requests, interval between call-in and requested pickup time and length of the computational cycle time), assessing their influence on the effectiveness of the scheduling proces
Workload Equity in Vehicle Routing Problems: A Survey and Analysis
Over the past two decades, equity aspects have been considered in a growing
number of models and methods for vehicle routing problems (VRPs). Equity
concerns most often relate to fairly allocating workloads and to balancing the
utilization of resources, and many practical applications have been reported in
the literature. However, there has been only limited discussion about how
workload equity should be modeled in VRPs, and various measures for optimizing
such objectives have been proposed and implemented without a critical
evaluation of their respective merits and consequences.
This article addresses this gap with an analysis of classical and alternative
equity functions for biobjective VRP models. In our survey, we review and
categorize the existing literature on equitable VRPs. In the analysis, we
identify a set of axiomatic properties that an ideal equity measure should
satisfy, collect six common measures, and point out important connections
between their properties and those of the resulting Pareto-optimal solutions.
To gauge the extent of these implications, we also conduct a numerical study on
small biobjective VRP instances solvable to optimality. Our study reveals two
undesirable consequences when optimizing equity with nonmonotonic functions:
Pareto-optimal solutions can consist of non-TSP-optimal tours, and even if all
tours are TSP optimal, Pareto-optimal solutions can be workload inconsistent,
i.e. composed of tours whose workloads are all equal to or longer than those of
other Pareto-optimal solutions. We show that the extent of these phenomena
should not be underestimated. The results of our biobjective analysis are valid
also for weighted sum, constraint-based, or single-objective models. Based on
this analysis, we conclude that monotonic equity functions are more appropriate
for certain types of VRP models, and suggest promising avenues for further
research.Comment: Accepted Manuscrip
Model and algorithm for solving real time dial-a-ride problem
This research studies a static and real-time dial-a-ride problem with time varying travel times, soft time windows, and multiple depots. First, a static DARP model is formulated as a mixed integer programming and in order to validate the model, several random small network problems are solved using commercial optimization package, CPLEX.
Three heuristic algorithms based on sequential insertion, parallel insertion, and clustering first-routing second are proposed to solve static DARP within a reasonable time for implementation in a real-world situation. Also, the results of three heuristic methods are compared with the results obtained from exact solution by CPLEX to validate and evaluate three heuristic algorithms. Computational results show that three heuristic algorithms are superior compared to the exact algorithm in terms of the calculation time as the problem size (in terms of the number of demands) increases. Also among the three heuristic algorithms, the heuristic algorithm based on sequential insertion is more efficient than other heuristic algorithms that are based on parallel insertion and clustering first-routing second.
For the case study, Maryland Transit Administration (MTA)'s real operation of Dial-a-ride service is introduced and compared with the results of developed heuristic. The objective function values from heuristic based on clustering first- routing second are better than those from MTA's operation for all cases when waiting cost, delay cost, and excess ride cost are not included in the objective function values.
Also, the algorithm for real-time DARP considering dynamic events such as customer no shows, accidents, cancellations, and new requests is developed based on static DARP. The algorithm is tested in a simulation framework. In the simulation test, we compared the results of cases according to degree of gap between expected link speeds and real link speeds. Also for competitive analysis, the results of dynamic case are compared with the results of static case, where all requests are known in advance. The simulation test shows that the heuristic method could save cost as the uncertainty in new requests increases
reliability analysis of centralized versus decentralized zoning strategies for paratransit services
Abstract ADA paratransit services are a very large and ever-growing industry providing door-to-door transportation services for people with disability and elderly customers. Paratransit system, however, just like all other public transportation systems, suffers from travel time variability due to various factors and as a result gives its customers unreliable services. Although service reliability is a very important aspect in transportation study, it has not received much attention in the paratransit research community. A quantitative study evaluating the paratransit service reliability under different zoning strategies is yet to be found. This research filled this gap. Statistical models were proposed to represent travel time variability. Simulation experiments based on real demand data from Houston, Los Angeles and Boston were performed to quantitatively compare the reliability performance of centralized and decentralized operating strategies under different travel time variability levels. Results showed that the decentralized strategy, compared to the centralized no-zoning strategy, substantially improves the reliability of paratransit in terms of on-time performance. This research provides a framework for paratransit agencies to evaluate the service reliability of different organizational strategies through the simulation method
The Dynamic Multi-objective Multi-vehicle Covering Tour Problem
This work introduces a new routing problem called the Dynamic Multi-Objective Multi-vehicle Covering Tour Problem (DMOMCTP). The DMOMCTPs is a combinatorial optimization problem that represents the problem of routing multiple vehicles to survey an area in which unpredictable target nodes may appear during execution. The formulation includes multiple objectives that include minimizing the cost of the combined tour cost, minimizing the longest tour cost, minimizing the distance to nodes to be covered and maximizing the distance to hazardous nodes. This study adapts several existing algorithms to the problem with several operator and solution encoding variations. The efficacy of this set of solvers is measured against six problem instances created from existing Traveling Salesman Problem instances which represent several real countries. The results indicate that repair operators, variable length solution encodings and variable-length operators obtain a better approximation of the true Pareto front
On the inefficiency of ride-sourcing services towards urban congestion
The advent of shared-economy and smartphones made on-demand transportation
services possible, which created additional opportunities, but also more
complexity to urban mobility. Companies that offer these services are called
Transportation Network Companies (TNCs) due to their internet-based nature.
Although ride-sourcing is the most notorious service TNCs provide, little is
known about to what degree its operations can interfere in traffic conditions,
while replacing other transportation modes, or when a large number of idle
vehicles is cruising for passengers. We experimentally analyze the efficiency
of TNCs using taxi trip data from a Chinese megacity and a agent-based
simulation with a trip-based MFD model for determining the speed. We
investigate the effect of expanding fleet sizes for TNCs, passengers'
inclination towards sharing rides, and strategies to alleviate urban
congestion. We show that the lack of coordination of objectives between TNCs
and society can create 37% longer travel times and significant congestion.
Moreover, allowing shared rides is not capable of decreasing total distance
traveled due to higher empty kilometers traveled. Elegant parking management
strategies can prevent idle vehicles from cruising without assigned passengers
and lower to 7% the impacts of the absence of coordination.Comment: Submitted to Transportation Research Part
An Adaptive Overcurrent Coordination Scheme to Improve Relay Sensitivity and Overcome Drawbacks due to Distributed Generation in Smart Grids
Distributed Generation (DG) brought new challenges for protection engineers since standard relay settings of traditional system may no longer function properly under increasing presence of DG. The extreme case is coordination loss between primary and backup relays. The directional overcurrent relay (DOCR) which is the most implemented protective device in the electrical network also suffers performance degradation in presence of DG.
Therefore, this paper proposes the mitigation of DG impact on DOCR coordination employing adaptive protection scheme (APS) using differential evolution algorithm (DE) while improving overall sensitivity of relays .
The impacts of DG prior and after the application of APS are presented based on interconnected 6 bus and IEEE 14 bus system. As a consequence, general sensitivity improvement and mitigation scheme is proposed
Evaluation of Anticipatory Decision-Making in Ride-Sharing Services
In recent years, innovative ride-sharing services have gained significant attention. Such services require dynamic decisions on the acceptance of arriving trip requests and vehicle routing to ensure the fulfillment of requests. Decision support for acceptance and routing must be made under uncertainty of future requests. In this paper, we highlight that state-of-the-art approaches focus on anticipatory decision-making for either acceptance or routing decisions. Our aim is to evaluate the potential of different levels of anticipation in ride-sharing services. Up to now, it is unclear how the value of information differs between none, partial, or fully anticipatory decision-making processes. To this end, we define and solve variants of the underlying dial-a-ride problem, which differ in the information available about future requests. Using a large neighborhood search, our experimental results demonstrate that ride-sharing services can highly benefit from anticipatory decision-making, while the favorable level of anticipation depends on particular characteristics of the service, esp. the demand-to-service ratio
- âŠ