This paper considers the problem of routing and rebalancing a shared fleet of autonomous (i.e., self-driving) vehicles providing on-demand mobility within a capacitated transportation network, where congestion might disrupt throughput. We model the problem within a network flow framework and show that under relatively mild assumptions the rebalancing vehicles, if properly coordinated, do not le...

To avoid congestion of the vehicle in traffic networks is one of the most important problems to establish effective movements of vehicles. In this paper, we propose a new routing strategy using a memory effect. Conventional routing strategies use probabilistic rules to route the vehicles on the traffic networks. On the other hand, our proposed method uses a deterministic rule, or the memory eff...

Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network defined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination...

1556-6072/09/$25.00©2009IEEE IEEE VEHICULAR TECHNOLOGY MAGAZINE | MARCH 2009 We introduce a routing solution called landmark overlays for urban vehicular routing environments (LOUVRE), an approach that efficiently builds a landmark overlay network on top of an urban topology. We define urban junctions as overlay nodes and create an overlay link if and only if the traffic density of the underlyi...

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

Motivated by heterogeneous service suppliers in crowd shipping routing problems, vehicles’ similarity assumption is questioned the well-known logistical Vehicle Routing Problems (VRP) considering different start/end locations, capacities, as well shifts Time Window variant (VRPTW). In order to tackle this problem, a new agent-based metaheuristic architecture proposed capture uniqueness of vehic...

Pavan Kumar Pagadala, Research Scholar Computer Science and Engineering Anna University, Tamilnadu,India [email protected] Dr. N.M Saravana Kumar, Professor & HOD Computer Science and Engineering Vivekanadha College of Engineering for Women, Tiruchengode, Tamilnadu, India [email protected] -------------------------------------------------------------------ABSTRACT---------...