Open Access
Solving Min-Max Multi-Depot Vehicle Routing Problem ⁄
John Gunnar Carlsson,Dongdong Ge,Arjun Subramaniam,Amy Wu +3 more
- 01 Jan 2007
TL;DR: The notion of minimizing the maximal length of a tour in MDVRP is explored and a heuristic method based on region partitioning, which is potentially useful for general network applications is introduced.
read more
Abstract: The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the total length of all the tours, and existing literature handles this problem with a variety of assumptions and constraints. In this paper, we explore the notion of minimizing the maximal length of a tour in MDVRP (“min-max MDVRP”). We also introduce a heuristic method based on region partitioning, which is potentially useful for general network applications. A comparison of the computational implementations for three heuristics is included. Although this model is advantageous for real-world applications, to the best of our knowledge no prior
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A literature review on the vehicle routing problem with multiple depots
Jairo R. Montoya-Torres,Julián López Franco,Santiago Nieto Isaza,Heriberto Felizzola Jiménez,Nilson Herazo-Padilla +4 more
TL;DR: A state-of-the-art survey on the vehicle routing problem with multiple depots (MDVRP) is presented, considered papers published between 1988 and 2014, in which several variants of the model are studied.
465
Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
TL;DR: This paper designs provably correct and spatially distributed algorithms that allow a team of agents to compute a convex and equitable partition of a conveX environment and illustrates a systematic approach to devise spatially distributing control policies for a large variety of multiagent coordination problems.
Workload Equity in Vehicle Routing Problems: A Survey and Analysis
TL;DR: An analysis of classical and alternative equity functions for biobjective VRP models is provided and a set of axiomatic properties that an ideal equity measure should satisfy is identified.
122
Dividing a Territory Among Several Vehicles
TL;DR: This work considers an uncapacitated stochastic vehicle routing problem in which vehicle depot locations are fixed, and client locations in a service region are unknown but are assumed to be independent and identically distributed samples from a given probability density function.
81
The close–open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles
Ali Azadeh,Hamed Farrokhi-Asl +1 more
- 04 Mar 2019
TL;DR: In this paper, the authors consider the distribution of finished goods from depots to predetermined customers and collection of goods and wastes are practical and challengeable optimization and logistics problems; therefore, appropriate...
79
References
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
The Truck Dispatching Problem
George B. Dantzig,J. H. Ramser +1 more
TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
3.7K
•Posted Content
Complexity Of Vehicle Routing And Scheduling Problems
Jan Karel Lenstra,A. H. G. Rinnooy Kan +1 more
- 01 Jan 1979
TL;DR: The complexity of a class of vehicle routing and scheduling problems is investigated and known NP-hardness results are reviewed and compiled to compile the worst-case performance of approximation algorithms.
1.1K
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Martin Desrochers,Jacques Desrosiers,Marius M. Solomon +2 more
- 01 Jun 1990
TL;DR: In this paper, the authors present an LP relaxation of the set partitioning formulation of the VRPTW problem, which is solved by column generation, where feasible columns are added as needed by solving a shortest path problem with time windows and capacity constraints using dynamic programming.
994
Randomized Algorithms
Rajeev Motwani,Prabhakar Raghavan +1 more
- 05 Mar 2013
TL;DR: For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. as discussed by the authors introduces the basic concepts in the design and analysis of randomized algorithms and provides a comprehensive and representative selection of the algorithms that might be used in each of these areas.
785