The vehicle rescheduling problem: Model and algorithms
نویسندگان
چکیده
منابع مشابه
The vehicle rescheduling problem: Model and algorithms
When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considersmodeling, ...
متن کاملThe vehicle rescheduling problem
The capacitated vehicle routing problem is to find a routing schedule describing the order in which geographically dispersed customers are visited to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. In many practical applications, a long term routing schedule has to be made for operational purposes, often based on average demand estimates. When...
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملThe Vehicle Routing Problem: Algorithms and Applications
The Vehicle Routing Problem (VRP) is an hard and very well-known combinatorial optimization problem which finds many practical applications in the design and management of distribution systems. The VRP is concerned with the design of the optimal routes used by a fleet of identical vehicles stationed at a central depot to serve a set of customers with known demands. In the basic version of the p...
متن کاملSolving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms
In this paper, we consider the problem of rescheduling human resources in a battalion where new activities are assigned to the battalion by higher headquarters, requiring modification of an existing original schedule. The problem is modeled as a multi-criteria optimization problem with three objectives: (i) maximizing the number of tasks that are performed, (ii) minimizing the number of high-pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2007
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20199