This work involves a heuristic for solving vehicle routing problems with time windows (VRPTW) general compatibility-matching between customer/patient and server/caretaker constraints to capture the nature of systems such as caretakers’ home visiting or healthcare (HHC) systems. Since any variation VRPTW is more complicated than regular VRP, specific, custom-made needed solve problem. The propos...

The multi-commodity network flow problem (MCNF) consists in routing a set of commodities through capacitated at minimum cost and is relevant for containers liner shipping networks. As commodity transit times are often critical factor, the literature has introduced hard limits on times. In practical contexts, however, these may fail to provide sufficient flexibility since routes with even tiny d...

This paper formulates a vehicle routing problem where constraints have been produced from a real world forestry commissioning dataset. In the problem, vehicles are required to fully load wood from forests and then deliver the wood to sawmills. The constraints include time windows and loading bay constraints at forests and sawmills. The loading bay constraints are examples of inter-route constra...

The School Bus Routing Problem (SBRP), a generalization of the well-known Vehicle Routing Problem, involves the routing, planning, and scheduling of public school bus transportation. The problem can be divided into several subproblems, including bus stop selection, assigning students to buses, and determining the bus routes. This work presents an exact branch-and-price framework for the SBRP, w...

In recent years, considerable effort in the field of operations research has been paid to optimizing airline operations, including the logistics of an airline’s fleet of aircraft. We focus on the problem of aircraft routing, which involves generating and selecting a particular route for each aircraft of a sub-fleet that is already assigned to a set of feasible sequences of flight legs. Similar ...

The generalized vehicle routing problem with time windows (GVRPTW) is defined on a directed graph G=(V,A) where the vertex set V partitioned into clusters. One cluster contains only depot, located homogeneous fleet of vehicles, each limited capacity. other clusters represent customers. A demand associated cluster. Inside cluster, vertices possible locations customer. window vertex, during which...

It is well known that the final cost of commercial products is mostly due to expenses than to their transport. In this context, the vehicle routing problem appears aiming to optimize the routes of a fleet which is responsible for providing pick-up and delivery services. In face of the necessity in attending requests that come during the fleet operation time, the dynamic vehicle routing problem ...

In recent years, considerable effort in the field of operations research has been paid to optimizing airline operations, including the logistics of an airline’s fleet of aircraft. We focus on the problem of aircraft routing, which involves generating and selecting a particular route for each aircraft of a sub-fleet that is already assigned to a set of feasible sequences of flight legs. Similar ...