In this paper, the Capacitated Vehicle Routing Problem is extended to the case where each vehicle is restricted to an additional minimal starting or returning load constraint. We refer to this extension as the Minimal Load Constrained Vehicle Routing Problem. We present integer programming formulations for single and multidepot cases. An illustrative example is also provided to show how a decision maker can use the proposed formulation as an aid in distribution plannin
The essence of the problems considered consists in developing routes for a group of heterogeneous ve...
The aim of the Capacitated Vehicle Routing Problem (CVRP) is to find a set of minimum total cost rou...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...
The major contribution of this paper is to introduce load compatibility constraints in the mathemati...
The solution of a vehicle routing problem calls for the determination of a set of routes, each perfo...
The classical Capacitated Vehicle Routing Problem [2] calls for the determination of the optimal set...
Location-routing, inventory-routing, multi-echelon routing, routing problems with loading constraint...
Most of the approaches developed for vehicle routing problems require only that the total weight or...
peer reviewedIn this paper, we introduce and study the capacitated vehicle routing problem with sequ...
none2We consider difficult combinatorial optimization problems arising in transportation logistics w...
In this paper, we consider the vehicle routing problem with cargo safety and multi-drop restrictions...
In this paper, we consider a variant of the transportation problem where any demand may be dropped o...
AbstractIn this paper we review the exact algorithms based on the branch and bound approach proposed...
This paper proposes a new cost function based on distance and load of the vehicle for the Capacitate...
Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional pack...
The essence of the problems considered consists in developing routes for a group of heterogeneous ve...
The aim of the Capacitated Vehicle Routing Problem (CVRP) is to find a set of minimum total cost rou...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...
The major contribution of this paper is to introduce load compatibility constraints in the mathemati...
The solution of a vehicle routing problem calls for the determination of a set of routes, each perfo...
The classical Capacitated Vehicle Routing Problem [2] calls for the determination of the optimal set...
Location-routing, inventory-routing, multi-echelon routing, routing problems with loading constraint...
Most of the approaches developed for vehicle routing problems require only that the total weight or...
peer reviewedIn this paper, we introduce and study the capacitated vehicle routing problem with sequ...
none2We consider difficult combinatorial optimization problems arising in transportation logistics w...
In this paper, we consider the vehicle routing problem with cargo safety and multi-drop restrictions...
In this paper, we consider a variant of the transportation problem where any demand may be dropped o...
AbstractIn this paper we review the exact algorithms based on the branch and bound approach proposed...
This paper proposes a new cost function based on distance and load of the vehicle for the Capacitate...
Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional pack...
The essence of the problems considered consists in developing routes for a group of heterogeneous ve...
The aim of the Capacitated Vehicle Routing Problem (CVRP) is to find a set of minimum total cost rou...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...