Multi-vehicle routing has become increasingly important with the rapid development in autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In ...

this paper presents a new mathematical model for a combined manpower vehicle routing problem, in which working teams are considered as servers. having teams with different competency affects the service duration and cost that expands the flexibility of scheduling. a fleet of vehicles with different speed and cost of movement is used to transport these teams to visit the customers before the due...

This paper addresses the essential elements and strategies that should be in place for large-scale evacuations under emergency situations, particularly in densely used networks such as in Toronto, Ottawa, Vancouver and Montreal to name a few. Some questions that possess some indispensable information to achieve that goal are proposed. A novel framework that addresses these questions is proposed...

Taniguchi defines City Logistics as “the process of totally optimising the logistics and transport activities by private companies in urban areas while considering the traffic environment, traffic congestion and energy consumption within the framework of a market economy”. The distribution of goods based on road services in urban areas contribute to traffic congestion, generates environmental i...

We present a framework for modeling and heuristic solving of large-scale real-world vehicle routing and scheduling problems (VRPSs). Real-world problems have in common that their size is usually large or very large (including thousands of requests) and that they include a number of side constraints that are not present in the abstract standard models that are usually considered in the Operation...

This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. This function is considered of non-linear complexity (in the length of the route). Practical examples of such ...

We present the problem of planning mobile tours of inspectors on German motorways to enforce the payment of the toll for heavy good trucks. This is a special type of vehicle routing problem with the objective to conduct as good inspections as possible on the complete network. In addition, we developed a personalized crew rostering model, to schedule the crews of the tours. The planning of daily...