A genetic algorithm for the waitable time-varying multi-depot green vehicle routing problem
In an era where people in the world are concerned about environmental issues, companies
must reduce distribution costs while minimizing the pollution generated during the …
must reduce distribution costs while minimizing the pollution generated during the …
Optimal pricing to manage electric vehicles in coupled power and transportation networks
We study the system-level effects of the introduction of large populations of Electric Vehicles
(EVs) on the power and transportation networks. We assume that each EV owner solves a …
(EVs) on the power and transportation networks. We assume that each EV owner solves a …
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In
this paper, we study how to answer queries of finding the best departure time that minimizes …
this paper, we study how to answer queries of finding the best departure time that minimizes …
On the complexity of time-dependent shortest paths
We investigate the complexity of shortest paths in time-dependent graphs, in which the costs
of edges vary as a function of time, and as a result the shortest path between two nodes s …
of edges vary as a function of time, and as a result the shortest path between two nodes s …
Algorithms for itinerary planning in multimodal transportation networks
KG Zografos… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
The itinerary planning problem in an urban public transport system constitutes a common
routing and scheduling decision faced by travelers. The objective of this paper is to present …
routing and scheduling decision faced by travelers. The objective of this paper is to present …
[PDF][PDF] Shortest paths in FIFO time-dependent networks: Theory and algorithms
BC Dean - Rapport technique, Massachusetts Institute of …, 2004 - Citeseer
We present a concise study of the time-dependent shortest path problem, its theoretical
properties, and its solution algorithms. Time-dependent networks, in which the travel time …
properties, and its solution algorithms. Time-dependent networks, in which the travel time …
Dynamic resource management of heterogeneous mobile platforms via imitation learning
The complexity of heterogeneous mobile platforms is growing at a rate faster than our ability
to manage them optimally at runtime. For example, state-of-the-art systems-on-chip (SoCs) …
to manage them optimally at runtime. For example, state-of-the-art systems-on-chip (SoCs) …
Solving the bicriterion routing and scheduling problem for hazardous materials distribution
KN Androutsopoulos, KG Zografos - Transportation Research Part C …, 2010 - Elsevier
Hazardous materials routing and scheduling decisions involve the determination of the
minimum cost and/or risk routes for servicing the demand of a given set of customers. This …
minimum cost and/or risk routes for servicing the demand of a given set of customers. This …
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory
For thousands of years, people have been innovating new technologies to make their travel
faster, the latest of which is GPS technology that is used by millions of drivers every day. The …
faster, the latest of which is GPS technology that is used by millions of drivers every day. The …
A multiobjective path-planning algorithm with time windows for asset routing in a dynamic weather-impacted environment
This paper presents a mixed-initiative tool for multiobjective planning and asset routing
(TMPLAR) in dynamic and uncertain environments. TMPLAR is built upon multiobjective …
(TMPLAR) in dynamic and uncertain environments. TMPLAR is built upon multiobjective …