Minimal load constrained vehicle routing problems

Authors:
İmdat Kara;Tolga Bektaş
Affiliations:
Endüstri Mühendisliği Bölümü, Başkent Üniversitesi, Ankara, Turkey;Endüstri Mühendisliği Bölümü, Başkent Üniversitesi, Ankara, Turkey
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 4
Cited 0

Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
The vehicle routing problem

The vehicle routing problem
Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Parallel branch and cut for capacitated vehicle routing

Parallel Computing - Special issue: Parallel computing in logistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 planning.